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 U-processes and clustering performance NeurIPS 2011 Operator Norm Convergence of Spectral Clustering on Level Sets JMLR 2011 Optimal aggregation of affine estimators COLT 2011 Optimal and Robust Price Experimentation: Learning by Lottery AISTATS 2011 Optimal Distributed Market-Based Planning for Multi-Agent Systems with Shared Resources AISTATS 2011 Optimal learning rates for least squares SVMs using Gaussian kernels NeurIPS 2011 Optimal Reinforcement Learning for Gaussian Systems NeurIPS 2011 Optimistic Optimization of a Deterministic Function without the Knowledge of its Smoothness NeurIPS 2011 Oracle inequalities for computationally budgeted model selection COLT 2011 Orthogonal Matching Pursuit with Replacement NeurIPS 2011 PAC-Bayesian Analysis of Contextual Bandits NeurIPS 2011 Parallel Gibbs Sampling: From Colored Fields to Thin Junction Trees AISTATS 2011 Parameter Screening and Optimisation for ILP using Designed Experiments JMLR 2011 Penalty Decomposition Methods for Rank Minimization NeurIPS 2011 Periodic Finite State Controllers for Efficient POMDP and DEC-POMDP Planning NeurIPS 2011 Polytope samplers for inference in ill-posed inverse problems AISTATS 2011 Practical Variational Inference for Neural Networks NeurIPS 2011 Predicting Dynamic Difficulty NeurIPS 2011 Predicting response time and error rates in visual search NeurIPS 2011 Prediction strategies without loss NeurIPS 2011 Priors over Recurrent Continuous Time Processes NeurIPS 2011 Prismatic Algorithm for Discrete D.C. Programming Problem NeurIPS 2011 Probabilistic amplitude and frequency demodulation NeurIPS 2011 Producing Power-Law Distributions and Damping Word Frequencies with Two-Stage Language Models JMLR 2011 Projection onto A Nonnegative Max-Heap NeurIPS 2011