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 Complexity and Approximation of Binary Evidence in Lifted Inference NeurIPS 2013 On the Complexity of Bandit and Derivative-Free Stochastic Convex Optimization COLT 2013 On the difficulty of training recurrent neural networks ICML 2013 On the Generalization Ability of Online Learning Algorithms for Pairwise Loss Functions ICML 2013 On the importance of initialization and momentum in deep learning ICML 2013 On the Learnability of Shuffle Ideals JMLR 2013 On the Linear Convergence of the Proximal Gradient Method for Trace Norm Regularization NeurIPS 2013 On the Mutual Nearest Neighbors Estimate in Regression JMLR 2013 On the Relationship Between Binary Classification, Bipartite Ranking, and Binary Class Probability Estimation NeurIPS 2013 On the Representational Efficiency of Restricted Boltzmann Machines NeurIPS 2013 On the Sample Complexity of Subspace Learning NeurIPS 2013 On the Statistical Consistency of Algorithms for Binary Classification under Class Imbalance ICML 2013 Open Problem: Adversarial Multiarmed Bandits with Limited Advice COLT 2013 Open Problem: Fast Stochastic Exp-Concave Optimization COLT 2013 Opportunistic Strategies for Generalized No-Regret Problems COLT 2013 Optical Flow via Locally Adaptive Fusion of Complementary Data Costs ICCV 2013 Optimal Discovery with Probabilistic Expert Advice: Finite Time Analysis and Macroscopic Optimality JMLR 2013 Optimal Geometric Fitting under the Truncated L2-Norm CVPR 2013 Optimally Fuzzy Temporal Memory JMLR 2013 Optimal Neural Population Codes for High-dimensional Stimulus Variables NeurIPS 2013 Optimal Probability Estimation with Applications to Prediction and Classification COLT 2013 Optimal rates for stochastic convex optimization under Tsybakov noise condition ICML 2013 Optimistic Concurrency Control for Distributed Unsupervised Learning NeurIPS 2013 Optimistic Knowledge Gradient Policy for Optimal Budget Allocation in Crowdsourcing ICML 2013 Optimization, Learning, and Games with Predictable Sequences NeurIPS 2013