conftrace_
← Optimization & Theory
Machine Learning › Optimization & Theory ›

Learning Theory

5,312 papers

Papers per year

Papers

Why Adaptively Collected Data Have Negative Bias and How to Correct for It AISTATS 2018
Minimax Reconstruction Risk of Convolutional Sparse Dictionary Learning AISTATS 2018
Fast generalization error bound of deep learning from a kernel perspective AISTATS 2018
Learning linear structural equation models in polynomial time and sample complexity AISTATS 2018
Learning Sparse Polymatrix Games in Polynomial Time and Sample Complexity AISTATS 2018
Plug-in Estimators for Conditional Expectations and Probabilities AISTATS 2018
On the Statistical Efficiency of Compositional Nonparametric Prediction AISTATS 2018
Convergence of Value Aggregation for Imitation Learning AISTATS 2018
Probability–Revealing Samples AISTATS 2018
Learners that Use Little Information ALT 2018
Sparsity, variance and curvature in multi-armed bandits ALT 2018
Bandit Regret Scaling with the Effective Loss Range ALT 2018
A Better Resource Allocation Algorithm with Semi-Bandit Feedback ALT 2018
Decision making with limited feedback ALT 2018
On the Help of Bounded Shot Verifiers, Comparators and Standardisers for Learnability in Inductive Inference ALT 2018
Dimension-free Information Concentration via Exp-Concavity ALT 2018
Instrument-Armed Bandits ALT 2018
Learning under $p$-Tampering Attacks ALT 2018
Sequential prediction with coded side information under logarithmic loss ALT 2018
Variance-Aware Regret Bounds for Undiscounted Reinforcement Learning in MDPs ALT 2018
Minimax Rates and Efficient Algorithms for Noisy Sorting ALT 2018
Butterfly Effects in Frame Semantic Parsing: impact of data processing on model ranking COLING 2018
Narrative Schema Stability in News Text COLING 2018
Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure COLT 2018
Actively Avoiding Nonsense in Generative Models COLT 2018