← Optimization & Theory
Machine Learning › Optimization & Theory ›

Learning Theory

5312 directly classified papers

Papers per year

Papers

Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration COLT 2017
Learning-Theoretic Foundations of Algorithm Configuration for Combinatorial Partitioning Problems COLT 2017
Efficient PAC Learning from the Crowd COLT 2017
Learning with Limited Rounds of Adaptivity: Coin Tossing, Multi-Armed Bandits, and Ranking from Pairwise Comparisons COLT 2017
Corralling a Band of Bandit Algorithms COLT 2017
Preference-based Teaching JMLR 2017
A Closer Look at Memorization in Deep Networks ICML 2017
No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis ICML 2017
Data-Efficient Policy Evaluation Through Behavior Policy Search ICML 2017
The Sample Complexity of Online One-Class Collaborative Filtering ICML 2017
Neural Taylor Approximations: Convergence and Exploration in Rectifier Networks ICML 2017
Learning Infinite Layer Networks Without the Kernel Trick ICML 2017
An Analytical Formula of Population Gradient for two-layered ReLU network and its Applications in Convergence and Critical Point Analysis ICML 2017
Recovery Guarantees for One-hidden-layer Neural Networks ICML 2017
Understanding the Representation and Computation of Multilayer Perceptrons: A Case Study in Speech Recognition ICML 2017
Relative Fisher Information and Natural Gradient for Learning Large Modular Models ICML 2017
Meritocratic Fairness for Cross-Population Selection ICML 2017
Diameter-Based Active Learning ICML 2017
Rational Distortions of Learners’ Linguistic Input CONLL 2017
The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality IJCAI 2017
Learning Feature Engineering for Classification IJCAI 2017
Efficient, Safe, and Probably Approximately Complete Learning of Action Models IJCAI 2017
Online Algorithm Selection IJCAI 2017
Magnitude-Preserving Ranking for Structured Outputs ACML 2017
Learning Hedonic Games IJCAI 2017