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

Learning Theory

5,312 papers

Papers per year

Papers

Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes NIPS 2018
Fast Rates of ERM and Stochastic Approximation: Adaptive to Error Bound Conditions NIPS 2018
Query Complexity of Bayesian Private Learning NIPS 2018
Learning Bounds for Greedy Approximation with Explicit Feature Maps from Multiple Kernels NIPS 2018
Understanding Weight Normalized Deep Neural Networks with Rectified Linear Units NIPS 2018
Support Recovery for Orthogonal Matching Pursuit: Upper and Lower bounds NIPS 2018
The committee machine: Computational to statistical gaps in learning a two-layers neural network NIPS 2018
Policy Regret in Repeated Games NIPS 2018
Benefits of over-parameterization with EM NIPS 2018
$\ell_1$-regression with Heavy-tailed Distributions NIPS 2018
A no-regret generalization of hierarchical softmax to extreme multi-label classification NIPS 2018
Chaining Mutual Information and Tightening Generalization Bounds NIPS 2018
PAC-learning in the presence of adversaries NIPS 2018
Generalisation of structural knowledge in the hippocampal-entorhinal system NIPS 2018
Adaptive Learning with Unknown Information Flows NIPS 2018
Adding One Neuron Can Eliminate All Bad Local Minima NIPS 2018
On Neuronal Capacity NIPS 2018
Testing for Families of Distributions via the Fourier Transform NIPS 2018
Model-Agnostic Private Learning NIPS 2018
Constant Regret, Generalized Mixability, and Mirror Descent NIPS 2018
The Pessimistic Limits and Possibilities of Margin-based Losses in Semi-supervised Learning NIPS 2018
Learning To Learn Around A Common Mean NIPS 2018
Near-Optimal Time and Sample Complexities for Solving Markov Decision Processes with a Generative Model NIPS 2018
Online Learning of Quantum States NIPS 2018
Community Exploration: From Offline Optimization to Online Learning NIPS 2018