Skip to content
conftrace_

Optimization

14,850 papers (55 classified directly here)

Subtopics · a paper can sit in several, so these overlap

Continuous Optimization (4,424) Stochastic Methods (2,991) Combinatorial Optimization (2,615) Online Algorithms (2,404) Optimization (1,521) Game Theory (1,046) Convex Optimization (864) Discrete Optimization (721) Optimal Transport (474) Sparse Optimization (416) Optimal Control (271) Global Optimization (200) Non-Convex Optimization (182) Distributed Learning (164) Approximation Algorithms (162) Multi-Objective Optimization (151) Distributed Optimization (136) Bayesian Optimization (132) Theory (109) Compressed Sensing (102) Algorithms (89) Robust Optimization (86) Submodular Optimization (77) Kernel Methods (75) Evolutionary Algorithm (72) Linear Programming (54) Tensor Decomposition (48) Bilevel Optimization (42) Integer Programming (38) Matrix Completion (33) Algorithm (21) Regularization (11)

Papers per year

1
16
133
440
1,353
1,441
2000
'5
'10
'15
'20
'25

Papers (including subtopics)

Topology Constraints in Graphical Models NeurIPS 2012 Toward a Noncommutative Arithmetic-geometric Mean Inequality: Conjectures, Case-studies, and Consequences COLT 2012 Towards Minimax Policies for Online Linear Optimization with Bandit Feedback COLT 2012 Tractable Objectives for Robust Policy Optimization NeurIPS 2012 Trading Regret for Efficiency: Online Convex Optimization with Long Term Constraints JMLR 2012 Training sparse natural image models with a fast Gibbs sampler of an extended state space NeurIPS 2012 Trajectory-Based Short-Sighted Probabilistic Planning NeurIPS 2012 Unified Algorithms for Online Learning and Competitive Analysis COLT 2012 Universal Measurement Bounds for Structured Sparse Signal Recovery AISTATS 2012 Using More Data to Speed-up Training Time AISTATS 2012 Variable Selection for Gaussian Graphical Models AISTATS 2012 Volume Regularization for Binary Classification NeurIPS 2012 (weak) Calibration is Computationally Hard COLT 2012 What's in the Bag: A Distributed Approach to 3D Shape Duplication with Modular Robots RSS 2012 A Bayesian Approximation Method for Online Ranking JMLR 2011 A blind sparse deconvolution method for neural spike identification NeurIPS 2011 Accelerated Adaptive Markov Chain for Partition Function Computation NeurIPS 2011 A concave regularization technique for sparse mixture models NeurIPS 2011 A conditional game for comparing approximations AISTATS 2011 A Convergence Analysis of Log-Linear Training NeurIPS 2011 Active Diagnosis under Persistent Noise with Unknown Noise Distribution: A Rank-Based Approach AISTATS 2011 A Cure for Variance Inflation in High Dimensional Kernel Principal Component Analysis JMLR 2011 Adaptive Bandits: Towards the best history-dependent strategy AISTATS 2011 Adaptive Hedge NeurIPS 2011 A Fast Algorithm for Recovery of Jointly Sparse Vectors based on the Alternating Direction Methods AISTATS 2011