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

Learning Theory

5,312 papers

Papers per year

Papers

Limitations in learning an interpreted language with recurrent models EMNLP 2018
Sentiment analysis under temporal shift EMNLP 2018
Improved Regret Bounds for Thompson Sampling in Linear Quadratic Control Problems ICML 2018
State Abstractions for Lifelong Reinforcement Learning ICML 2018
Information Theoretic Guarantees for Empirical Risk Minimization with Applications to Model Selection and Large-Scale Optimization ICML 2018
Make the Minority Great Again: First-Order Regret Bound for Contextual Bandits ICML 2018
Meta-Learning by Adjusting Priors Based on Extended PAC-Bayes Theory ICML 2018
Stronger Generalization Bounds for Deep Nets via a Compression Approach ICML 2018
Learning to Branch ICML 2018
Approximation Guarantees for Adaptive Sampling ICML 2018
Gradient descent with identity initialization efficiently learns positive definite linear transformations by deep residual networks ICML 2018
To Understand Deep Learning We Need to Understand Kernel Learning ICML 2018
Stability and Generalization of Learning Algorithms that Converge to Global Optima ICML 2018
Online Learning with Abstention ICML 2018
On the Power of Over-parametrization in Neural Networks with Quadratic Activation ICML 2018
Gradient Descent Learns One-hidden-layer CNN: Don’t be Afraid of Spurious Local Minima ICML 2018
Entropy-SGD optimizes the prior of a PAC-Bayes bound: Generalization properties of Entropy-SGD and data-dependent priors ICML 2018
The Limits of Maxing, Ranking, and Preference Learning ICML 2018
Global Convergence of Policy Gradient Methods for the Linear Quadratic Regulator ICML 2018
The Generalization Error of Dictionary Learning with Moreau Envelopes ICML 2018
Learning Maximum-A-Posteriori Perturbation Models for Structured Prediction in Polynomial Time ICML 2018
Learning One Convolutional Layer with Overlapping Patches ICML 2018
Gradient Primal-Dual Algorithm Converges to Second-Order Stationary Solution for Nonconvex Distributed Optimization Over Networks ICML 2018
Learning Deep ResNet Blocks Sequentially using Boosting Theory ICML 2018
Using Reward Machines for High-Level Task Specification and Decomposition in Reinforcement Learning ICML 2018