Papers
A Modular Analysis of Adaptive (Non-)Convex Optimization: Optimism, Composite Objectives, and Variational Bounds
Pooria Joulani, András György, Csaba Szepesvári
PAC Learning Depth-3 AC^0 Circuits of Bounded Top Fanin
Ning Ding, Yanli Ren, Dawu Gu
Learning from Networked Examples
Yuyi Wang, Zheng-Chu Guo, Jan Ramon
Structured Best Arm Identification with Fixed Confidence
Ruitong Huang, Mohammad M. Ajallooeian, Csaba Szepesvári et al.
Adaptive Submodularity with Varying Query Sets: An Application to Active Multi-label Learning
Alan Fern, Robby Goetschalckx, Mandana Hamidi-Haines et al.
Relative Error Embeddings of the Gaussian Kernel Distance
Di Chen, Jeff M. Phillips
Tight Bounds on ℓ_1 Approximation and Learning of Self-Bounding Functions
Vitaly Feldman, Pravesh Kothari, Jan Vondrák
Efficient tracking of a growing number of experts
Jaouad Mourtada, Odalric-Ambrym Maillard
Normal Forms in Semantic Language Identification
Timo Kötzing, Martin Schirneck, Karen Seidel
A Strongly Quasiconvex PAC-Bayesian Bound
Niklas Thiemann, Christian Igel, Olivier Wintenberger et al.
The Power of Random Counterexamples
Dana Angluin, Tyler Dohrn
Learning MSO-definable hypotheses on strings
Martin Grohe, Christof Löding, Martin Ritzert
Scale-Invariant Unconstrained Online Learning
Wojciech Kotłowski
Hypotheses testing on infinite random graphs
Daniil Ryabko
Soft-Bayes: Prod for Mixtures of Experts with Log-Loss
Laurent Orseau, Tor Lattimore, Shane Legg
An efficient query learning algorithm for zero-suppressed binary decision diagrams
Hayato Mizumoto, Shota Todoroki, Diptarama et al.
The Complexity of Explaining Neural Networks Through (group) Invariants
Danielle Ensign, Scott Neville, Arnab Paul et al.
Parameter identification in Markov chain choice models
Arushi Gupta, Daniel Hsu
Collaborative Clustering: Sample Complexity and Efficient Algorithms
Jungseul Ok, Se-Young Yun, Alexandre Proutiere et al.
Lifelong Learning in Costly Feature Spaces
Maria-Florina Balcan, Avrim Blum, Vaishnavh Nagarajan
Graph Verification with a Betweenness Oracle
Mano Vikash Janardhanan
A minimax and asymptotically optimal algorithm for stochastic bandits
Pierre Ménard, Aurélien Garivier
Specifying a positive threshold function via extremal points
Vadim Lozin, Igor Razgon, Viktor Zamaraev et al.