Skip to content
conftrace_

Optimization & Theory

43,292 papers (3 classified directly here)

Subtopics · a paper can sit in several, so these overlap

Optimization (17,731) Learning Theory (6,809) Bayesian Inference (6,267) Theory (5,579) Statistical Learning (4,564) Neural Network Optimization (4,155) Stochastic Processes (2,948) Stochastic Methods (1,283) Loss Functions (1,220) Distributed Learning (1,202) Online Algorithms (1,013) Statistics (822) Generalization (376) Information Theory (370) Sample Complexity (282) Sparse Optimization (241) Game Theory (151) Convex Optimization (132) Optimal Transport (104) Robust Optimization (84) Distributed Optimization (73) Approximation Algorithms (33)

Papers per year

1
52
352
828
3,646
5,854
2000
'5
'10
'15
'20
'25

Papers (including subtopics)

On the Information Bottleneck Theory of Deep Learning ICLR 2018 On the insufficiency of existing momentum schemes for Stochastic Optimization ICLR 2018 On the Limitations of First-Order Approximation in GAN Dynamics ICML 2018 On the Local Hessian in Back-propagation NeurIPS 2018 On the Local Minima of the Empirical Risk NeurIPS 2018 On the Logical Properties of the Description Logic DL^N (Extended abstract) IJCAI 2018 On the Optimization of Deep Networks: Implicit Acceleration by Overparameterization ICML 2018 On the Power of Over-parametrization in Neural Networks with Quadratic Activation ICML 2018 On the Practical Computational Power of Finite Precision RNNs for Language Recognition ACL 2018 On the regularization of Wasserstein GANs ICLR 2018 On the Relative Expressiveness of Bayesian and Neural Networks PGM 2018 On the Spectrum of Random Features Maps of High Dimensional Data ICML 2018 On the Stability of Feature Selection Algorithms JMLR 2018 On the State of the Art of Evaluation in Neural Language Models ICLR 2018 On the Statistical Efficiency of Compositional Nonparametric Prediction AISTATS 2018 On the Theory of Variance Reduction for Stochastic Gradient Monte Carlo ICML 2018 On Tight Bounds for the Lasso JMLR 2018 On Truly Block Eigensolvers via Riemannian Optimization AISTATS 2018 Open Category Detection with PAC Guarantees ICML 2018 Open problem: Improper learning of mixtures of Gaussians COLT 2018 Open Problems in Speech Recognition Interspeech 2018 Open Problem: The Dependence of Sample Complexity Lower Bounds on Planning Horizon COLT 2018 Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization NeurIPS 2018 Optimal Algorithms for Non-Smooth Distributed Optimization in Networks NeurIPS 2018 Optimal approximation of continuous functions by very deep ReLU networks COLT 2018