conftrace_
← Optimization & Theory
Machine Learning › Optimization & Theory ›

Learning Theory

5,334 papers

Papers per year

17
66
123
466
307
'05
'10
'15
'20
'25

Papers

Diverse Neural Network Learns True Target Functions AISTATS 2017
Binary and Multi-Bit Coding for Stable Random Projections AISTATS 2017
Spectral Methods for Correlated Topic Models AISTATS 2017
Learning Graphical Games from Behavioral Data: Sufficient and Necessary Conditions AISTATS 2017
New bounds on the price of bandit feedback for mistake-bounded online multiclass learning ALT 2017
Erasing Pattern Languages Distinguishable by a Finite Number of Strings ALT 2017
Boundary Crossing for General Exponential Families ALT 2017
Preference-based Teaching of Unions of Geometric Objects ALT 2017
Collaborative Clustering: Sample Complexity and Efficient Algorithms ALT 2017
The Complexity of Explaining Neural Networks Through (group) Invariants ALT 2017
An efficient query learning algorithm for zero-suppressed binary decision diagrams ALT 2017
Hypotheses testing on infinite random graphs ALT 2017
Learning MSO-definable hypotheses on strings ALT 2017
The Power of Random Counterexamples ALT 2017
Tight Bounds on $\ell_1$ Approximation and Learning of Self-Bounding Functions ALT 2017
Dealing with Range Anxiety in Mean Estimation via Statistical Queries ALT 2017
PAC Learning Depth-3 $\textrm{AC}^0$ Circuits of Bounded Top Fanin ALT 2017
Open Problem: First-Order Regret Bounds for Contextual Bandits COLT 2017
Open Problem: Meeting Times for Learning Random Automata COLT 2017
Corralling a Band of Bandit Algorithms COLT 2017
Learning with Limited Rounds of Adaptivity: Coin Tossing, Multi-Armed Bandits, and Ranking from Pairwise Comparisons COLT 2017
Efficient PAC Learning from the Crowd COLT 2017
Learning-Theoretic Foundations of Algorithm Configuration for Combinatorial Partitioning Problems COLT 2017
The Sample Complexity of Optimizing a Convex Function COLT 2017
Learning Disjunctions of Predicates COLT 2017