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

2

6

6

5

16

67

72

80

102

133

171

219

398

425

440

487

649

812

1,162

1,353

1,487

1,474

1,600

1,870

1,441

372

2000

'5

'10

'15

'20

'25

Papers (including subtopics)

Can matrix coherence be efficiently and accurately estimated? AISTATS 2011 Clustered Multi-Task Learning Via Alternating Structure Optimization NeurIPS 2011 Collective Graphical Models NeurIPS 2011 Committing Bandits NeurIPS 2011 Complexity-Based Approach to Calibration with Checking Rules COLT 2011 Concentration-Based Guarantees for Low-Rank Matrix Reconstruction COLT 2011 Confidence Weighted Mean Reversion Strategy for On-Line Portfolio Selection AISTATS 2011 Contextual Bandit Algorithms with Supervised Learning Guarantees AISTATS 2011 Contextual Bandits with Similarity Information COLT 2011 Contextual Gaussian Process Bandit Optimization NeurIPS 2011 Continuous Rapid Action Value Estimates ACML 2011 Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization NeurIPS 2011 Convergent Bounds on the Euclidean Distance NeurIPS 2011 Convergent Decomposition Solvers for Tree-reweighted Free Energies AISTATS 2011 Convex envelopes of complexity controlling penalties: the case against premature envelopment AISTATS 2011 Cross-Entropy Randomized Motion Planning RSS 2011 Dimensionality Reduction Using the Sparse Linear Model NeurIPS 2011 Distributed Delayed Stochastic Optimization NeurIPS 2011 Divide-and-Conquer Matrix Factorization NeurIPS 2011 Does an Efficient Calibrated Forecasting Strategy Exist? COLT 2011 Double Updating Online Learning JMLR 2011 Efficient Methods for Overlapping Group Lasso NeurIPS 2011 Efficient Offline Communication Policies for Factored Multiagent POMDPs NeurIPS 2011 Efficient Online Learning via Randomized Rounding NeurIPS 2011 Efficient variable selection in support vector machines via the alternating direction method of multipliers AISTATS 2011