← Optimization & Theory
Machine Learning › Optimization & Theory ›

Learning Theory

5312 directly classified papers

Papers per year

Papers

A PTAS for Agnostically Learning Halfspaces COLT 2015
Model Selection for Topic Models via Spectral Decomposition AISTATS 2015
Open Problem: Online Sabotaged Shortest Path COLT 2015
Efficient Learning of Linear Separators under Bounded Noise COLT 2015
Competitive Distribution Estimation: Why is Good-Turing Good NIPS 2015
Minimax rates for memory-bounded sparse linear regression COLT 2015
Response-Based Approachability with Applications to Generalized No-Regret Problems JMLR 2015
On the Limitation of Spectral Methods: From the Gaussian Hidden Clique Problem to Rank-One Perturbations of Gaussian Tensors NIPS 2015
Efficient and Parsimonious Agnostic Active Learning NIPS 2015
Learning From Small Samples: An Analysis of Simple Decision Heuristics NIPS 2015
Learning with Symmetric Label Noise: The Importance of Being Unhinged NIPS 2015
Evaluating the statistical significance of biclusters NIPS 2015
No-Regret Learning in Bayesian Games NIPS 2015
Multi-class SVMs: From Tighter Data-Dependent Generalization Bounds to Novel Algorithms NIPS 2015
Learning the Structure and Parameters of Large-Population Graphical Games from Behavioral Data JMLR 2015
Explore no more: Improved high-probability regret bounds for non-stochastic bandits NIPS 2015
Is Approval Voting Optimal Given Approval Votes? NIPS 2015
Learning Theory and Algorithms for Forecasting Non-stationary Time Series NIPS 2015
LASSO with Non-linear Measurements is Equivalent to One With Linear Measurements NIPS 2015
Rethinking LDA: Moment Matching for Discrete ICA NIPS 2015
Interactive Fingerprinting Codes and the Hardness of Preventing False Discovery COLT 2015
Revenue Optimization against Strategic Buyers NIPS 2015
Testing Closeness With Unequal Sized Samples NIPS 2015
Cornering Stationary and Restless Mixing Bandits with Remix-UCB NIPS 2015
Basis refinement strategies for linear value function approximation in MDPs NIPS 2015