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)

Thompson Sampling for 1-Dimensional Exponential Family Bandits NeurIPS 2013 Thompson Sampling in Switching Environments with Bayesian Online Change Detection AISTATS 2013 Top-k Selection based on Adaptive Sampling of Noisy Preferences ICML 2013 Total Variation Regularization for Functions with Values in a Manifold ICCV 2013 Toward Guaranteed Illumination Models for Non-convex Objects ICCV 2013 Towards Efficient and Exact MAP-Inference for Large Scale Discrete Computer Vision Problems via Combinatorial Optimization CVPR 2013 Trading Computation for Communication: Distributed Stochastic Dual Coordinate Ascent NeurIPS 2013 Tree Shape Priors with Connectivity Constraints Using Convex Relaxation on General Graphs ICCV 2013 Truncated Power Method for Sparse Eigenvalue Problems JMLR 2013 Two-Target Algorithms for Infinite-Armed Bandits with Bernoulli Rewards NeurIPS 2013 Uncalibrated Photometric Stereo for Unknown Isotropic Reflectances CVPR 2013 Unifying Nuclear Norm and Bilinear Factorization Approaches for Low-Rank Matrix Decomposition ICCV 2013 Universal Consistency of Localized Versions of Regularized Kernel Methods JMLR 2013 Universality of the Local Marginal Polytope CVPR 2013 Unnatural L0 Sparse Representation for Natural Image Deblurring CVPR 2013 Unsupervised Link Selection in Networks AISTATS 2013 Variance Reduction for Stochastic Gradient Optimization NeurIPS 2013 When are Overcomplete Topic Models Identifiable? Uniqueness of Tensor Tucker Decompositions with Structured Sparsity NeurIPS 2013 When in Doubt, SWAP: High-Dimensional Sparse Recovery from Correlated Measurements NeurIPS 2013 Wide-Baseline Hair Capture Using Strand-Based Refinement CVPR 2013 Accelerated Training for Matrix-norm Regularization: A Boosting Approach NeurIPS 2012 A Characterization of Scoring Rules for Linear Properties COLT 2012 A Conjugate Property between Loss Functions and Uncertainty Sets in Classification Problems COLT 2012 A Convex-Concave Relaxation Procedure Based Subgraph Matching Algorithm ACML 2012 A Convex Formulation for Learning Scale-Free Networks via Submodular Relaxation NeurIPS 2012