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 Fast Leverage Score Sampling and Optimal Learning NeurIPS 2018 On GANs and GMMs NeurIPS 2018 On Generalized Bellman Equations and Temporal-Difference Learning JMLR 2018 On how complexity affects the stability of a predictor AISTATS 2018 On Learning Markov Chains NeurIPS 2018 On Learning Sparsely Used Dictionaries from Incomplete Samples ICML 2018 Online Adaptive Methods, Universality and Acceleration NeurIPS 2018 Online Bootstrap Confidence Intervals for the Stochastic Gradient Descent Estimator JMLR 2018 Online Continuous-Time Tensor Factorization Based on Pairwise Interactive Point Processes IJCAI 2018 Online convex optimization for cumulative constraints NeurIPS 2018 Online Convolutional Sparse Coding with Sample-Dependent Dictionary ICML 2018 Online Deep Learning: Learning Deep Neural Networks on the Fly IJCAI 2018 Online Heterogeneous Transfer Metric Learning IJCAI 2018 Online Improper Learning with an Approximation Oracle NeurIPS 2018 Online Kernel Selection via Incremental Sketched Kernel Alignment IJCAI 2018 Online Learning of Combinatorial Objects via Extended Formulation ALT 2018 Online Learning of Quantum States NeurIPS 2018 Online learning over a finite action set with limited switching COLT 2018 Online Learning Rate Adaptation with Hypergradient Descent ICLR 2018 Online Learning: Sufficient Statistics and the Burkholder Method COLT 2018 Online Learning with Abstention ICML 2018 Online Learning with Non-Convex Losses and Non-Stationary Regret AISTATS 2018 Online Linear Quadratic Control ICML 2018 Online Pricing for Revenue Maximization with Unknown Time Discounting Valuations IJCAI 2018 Online Structured Laplace Approximations for Overcoming Catastrophic Forgetting NeurIPS 2018