← Optimization & Theory
Machine Learning › Optimization & Theory ›

Learning Theory

5312 directly classified papers

Papers per year

Papers

Bernoulli Rank-1 Bandits for Click Feedback IJCAI 2017
Learning a Ground Truth Ranking Using Noisy Approval Votes IJCAI 2017
Investigating Scalability in Hierarchical Language Identification System INTERSPEECH 2017
Near Minimax Optimal Players for the Finite-Time 3-Expert Prediction Problem NIPS 2017
Learning Overcomplete HMMs NIPS 2017
Spectrally-normalized margin bounds for neural networks NIPS 2017
Maxing and Ranking with Few Assumptions NIPS 2017
Clustering Stable Instances of Euclidean k-means. NIPS 2017
Optimal Sample Complexity of M-wise Data for Top-K Ranking NIPS 2017
Learning Linear Dynamical Systems via Spectral Filtering NIPS 2017
Collaborative PAC Learning NIPS 2017
Parameter-Free Online Learning via Model Selection NIPS 2017
A Sample Complexity Measure with Applications to Learning Optimal Auctions NIPS 2017
On Optimal Generalizability in Parametric Learning NIPS 2017
Information-theoretic analysis of generalization capability of learning algorithms NIPS 2017
Multi-Task Learning for Contextual Bandits NIPS 2017
Random Permutation Online Isotonic Regression NIPS 2017
Convergence of Gradient EM on Multi-component Mixture of Gaussians NIPS 2017
Submultiplicative Glivenko-Cantelli and Uniform Convergence of Revenues NIPS 2017
Differentially Private Empirical Risk Minimization Revisited: Faster and More General NIPS 2017
Multi-View Decision Processes: The Helper-AI Problem NIPS 2017
Optimistic posterior sampling for reinforcement learning: worst-case regret bounds NIPS 2017
Online control of the false discovery rate with decaying memory NIPS 2017
Boltzmann Exploration Done Right NIPS 2017
Is the Bellman residual a bad proxy? NIPS 2017