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)

Nyström Approximation for Large-Scale Determinantal Processes AISTATS 2013 ODE parameter inference using adaptive gradient matching with Gaussian processes AISTATS 2013 O(logT) Projections for Stochastic Optimization of Smooth and Strongly Convex Functions ICML 2013 On a Link Between Kernel Mean Maps and Fraunhofer Diffraction, with an Application to Super-Resolution Beyond the Diffraction Limit CVPR 2013 On Decomposing the Proximal Map NeurIPS 2013 One-Bit Compressed Sensing: Provable Support and Vector Recovery ICML 2013 One-Pass AUC Optimization ICML 2013 On Flat versus Hierarchical Classification in Large-Scale Taxonomies NeurIPS 2013 Online Learning for Time Series Prediction COLT 2013 Online learning in episodic Markovian decision processes by relative entropy policy search NeurIPS 2013 Online Learning in Markov Decision Processes with Adversarially Chosen Transition Probability Distributions NeurIPS 2013 Online Learning of Dynamic Parameters in Social Networks NeurIPS 2013 Online Learning of Nonparametric Mixture Models via Sequential Variational Approximation NeurIPS 2013 Online Learning under Delayed Feedback ICML 2013 Online Learning with Costly Features and Labels NeurIPS 2013 Online Learning with Predictable Sequences COLT 2013 Online Learning with Switching Costs and Other Adaptive Adversaries NeurIPS 2013 Online PCA for Contaminated Data NeurIPS 2013 Online Robust Dictionary Learning CVPR 2013 Online Robust PCA via Stochastic Optimization NeurIPS 2013 Online Similarity Prediction of Networked Data from Known and Unknown Graphs COLT 2013 Online Variational Approximations to non-Exponential Family Change Point Models: With Application to Radar Tracking NeurIPS 2013 On model selection consistency of penalized M-estimators: a geometric theory NeurIPS 2013 On Sampling from the Gibbs Distribution with Random Maximum A-Posteriori Perturbations NeurIPS 2013 On the Asymptotic Optimality of Maximum Margin Bayesian Networks AISTATS 2013