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 Projective Reconstruction In Arbitrary Dimensions CVPR 2014 On Robustness and Regularization of Structural Support Vector Machines ICML 2014 On Sparse Gaussian Chain Graph Models NeurIPS 2014 On the Bayes-Optimality of F-Measure Maximizers JMLR 2014 On the Complexity of A/B Testing COLT 2014 On the Computational Efficiency of Training Neural Networks NeurIPS 2014 On the Consistency of Output Code Based Learning Algorithms for Multiclass Learning Problems COLT 2014 On the convergence of no-regret learning in selfish routing ICML 2014 On the Convergence Rate of Decomposable Submodular Function Minimization NeurIPS 2014 On the Information Theoretic Limits of Learning Ising Models NeurIPS 2014 On the Number of Linear Regions of Deep Neural Networks NeurIPS 2014 On the Statistical Consistency of Plug-in Classifiers for Non-decomposable Performance Measures NeurIPS 2014 On the Testability of Models with Missing Data AISTATS 2014 ooDACE Toolbox: A Flexible Object-Oriented Kriging Implementation JMLR 2014 Open Problem: A (Missing) Boosting-type Convergence Result for AdaBoost.MH with Factorized Multi-class Classifiers COLT 2014 Open Problem: Efficient Online Sparse Regression COLT 2014 Open Problem: Online Local Learning COLT 2014 Open Problem: Shifting Experts on Easy Data COLT 2014 Open Problem: The Statistical Query Complexity of Learning Sparse Halfspaces COLT 2014 Open Problem: Tightness of maximum likelihood semidefinite relaxations COLT 2014 Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm ICML 2014 Optimal Data Collection For Informative Rankings Expose Well-Connected Graphs JMLR 2014 Optimal decision-making with time-varying evidence reliability NeurIPS 2014 Optimal Decisions from Probabilistic Models: The Intersection-over-Union Case CVPR 2014 Optimality of Graphlet Screening in High Dimensional Variable Selection JMLR 2014