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)

A Finite Newton Algorithm for Non-degenerate Piecewise Linear Systems AISTATS 2011 A Finite-Time Analysis of Multi-armed Bandits Problems with Kullback-Leibler Divergences COLT 2011 A General Linear Non-Gaussian State-Space Model: Identifiability, Identification, and Applications ACML 2011 Algorithms and hardness results for parallel large margin learning NeurIPS 2011 A Linear Approximation for Graph-based Simultaneous Localization and Mapping RSS 2011 An Application of Tree-Structured Expectation Propagation for Channel Decoding NeurIPS 2011 An Art Gallery Approach to Ensuring that Landmarks are Distinguishable RSS 2011 An Empirical Evaluation of Thompson Sampling NeurIPS 2011 A New Algorithm for Compressed Counting with Applications in Shannon Entropy Estimation in Dynamic Data COLT 2011 An Exact Algorithm for F-Measure Maximization NeurIPS 2011 An Instantiation-Based Theorem Prover for First-Order Programming AISTATS 2011 A Non-Parametric Approach to Dynamic Programming NeurIPS 2011 A novel greedy algorithm for Nyström approximation AISTATS 2011 Approximate Model Selection for Large Scale LSSVM ACML 2011 Approximating Semidefinite Programs in Sublinear Time NeurIPS 2011 -Armed Bandits JMLR 2011 A simple multi-armed bandit algorithm with optimal variation-bounded regret COLT 2011 A Simpler Approach to Matrix Completion JMLR 2011 Automatic Calibration of Multiple Coplanar Sensors RSS 2011 Better Algorithms for Benign Bandits JMLR 2011 Better Mini-Batch Algorithms via Accelerated Gradient Methods NeurIPS 2011 Beyond Spectral Clustering - Tight Relaxations of Balanced Graph Cuts NeurIPS 2011 Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization COLT 2011 Budgeted Optimization with Concurrent Stochastic-Duration Experiments NeurIPS 2011 CAKE: Convex Adaptive Kernel Density Estimation AISTATS 2011