← Optimization & Theory
Machine Learning › Optimization & Theory ›

Learning Theory

5312 directly classified papers

Papers per year

Papers

Lifelong Learning with Non-i.i.d. Tasks NIPS 2015
Entropy-Based Concentration Inequalities for Dependent Variables ICML 2015
Computational Complexity of Linear Large Margin Classification With Ramp Loss AISTATS 2015
Generalization error bounds for learning to rank: Does the length of document lists matter? ICML 2015
Online Optimization : Competing with Dynamic Comparators AISTATS 2015
Learning to Search Better than Your Teacher ICML 2015
Following the Perturbed Leader for Online Structured Learning ICML 2015
Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits AISTATS 2015
Learning Efficient Anomaly Detectors from K-NN Graphs AISTATS 2015
On the High Dimensional Power of a Linear-Time Two Sample Test under Mean-shift Alternatives AISTATS 2015
Open Problem: The landscape of the loss surfaces of multilayer networks COLT 2015
Learnability of Solutions to Conjunctive Queries: The Full Dichotomy COLT 2015
Computational Lower Bounds for Community Detection on Random Graphs COLT 2015
An Almost Optimal PAC Algorithm COLT 2015
Algorithmic Stability and Uniform Generalization NIPS 2015
Online Density Estimation of Bradley-Terry Models COLT 2015
First-order regret bounds for combinatorial semi-bandits COLT 2015
Batched Bandit Problems COLT 2015
Learnability of Influence in Networks NIPS 2015
An Analysis of State-Relevance Weights and Sampling Distributions on L1-Regularized Approximate Linear Programming Approximation Accuracy ICML 2014
Near-optimal Reinforcement Learning in Factored MDPs NIPS 2014
Stochastic Multi-Armed-Bandit Problem with Non-stationary Rewards NIPS 2014
An Analysis of Active Learning with Uniform Feature Noise AISTATS 2014
Best-Arm Identification in Linear Bandits NIPS 2014
Bounded Regret for Finite-Armed Structured Bandits NIPS 2014