← Optimization & Theory
Machine Learning › Optimization & Theory ›

Learning Theory

5312 directly classified papers

Papers per year

Papers

Erasing Pattern Languages Distinguishable by a Finite Number of Strings ALT 2017
Tight Bounds on $\ell_1$ Approximation and Learning of Self-Bounding Functions ALT 2017
The Power of Random Counterexamples ALT 2017
Learning Graphical Games from Behavioral Data: Sufficient and Necessary Conditions AISTATS 2017
Hypotheses testing on infinite random graphs ALT 2017
Dealing with Range Anxiety in Mean Estimation via Statistical Queries ALT 2017
Learning Identifiable Gaussian Bayesian Networks in Polynomial Time and Sample Complexity NIPS 2017
Information Theoretic Properties of Markov Random Fields, and their Algorithmic Applications NIPS 2017
Online Learning with Transductive Regret NIPS 2017
A Minimax Optimal Algorithm for Crowdsourcing NIPS 2017
Stochastic and Adversarial Online Learning without Hyperparameters NIPS 2017
Learning MSO-definable hypotheses on strings ALT 2017
The Complexity of Explaining Neural Networks Through (group) Invariants ALT 2017
PAC Learning Depth-3 $\textrm{AC}^0$ Circuits of Bounded Top Fanin ALT 2017
Convergence Analysis of Two-layer Neural Networks with ReLU Activation NIPS 2017
On the Complexity of Learning Neural Networks NIPS 2017
On the Fine-Grained Complexity of Empirical Risk Minimization: Kernel Methods and Neural Networks NIPS 2017
Generalization Properties of Learning with Random Features NIPS 2017
Causal Bandits: Learning Good Interventions via Causal Inference NIPS 2016
Blind Attacks on Machine Learners NIPS 2016
Pure Exploration of Multi-armed Bandit Under Matroid Constraints COLT 2016
Tight (Lower) Bounds for the Fixed Budget Best Arm Identification Bandit Problem COLT 2016
The Limits of Learning with Missing Data NIPS 2016
Generalization of ERM in Stochastic Convex Optimization: The Dimension Strikes Back NIPS 2016
Learning Tree Structured Potential Games NIPS 2016