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)

Stochastic Wasserstein Barycenters ICML 2018 Stochastic Zeroth-order Optimization in High Dimensions AISTATS 2018 Stratification for Constraint-Based Multi-Objective Combinatorial Optimization IJCAI 2018 Streaming kernel regression with provably adaptive mean, variance, and regularization JMLR 2018 Structured Gaussian Processes with Twin Multiple Kernel Learning ACML 2018 Structured Local Minima in Sparse Blind Deconvolution NeurIPS 2018 Structured Optimal Transport AISTATS 2018 Structure From Recurrent Motion: From Rigidity to Recurrency CVPR 2018 Submatrix localization via message passing JMLR 2018 Submodularity on Hypergraphs: From Sets to Sequences AISTATS 2018 Submodular Maximization via Gradient Ascent: The Case of Deep Submodular Functions NeurIPS 2018 Subpolynomial trace reconstruction for random strings \{and arbitrary deletion probability COLT 2018 Subsampling for Ridge Regression via Regularized Volume Sampling AISTATS 2018 Subspace Embedding and Linear Regression with Orlicz Norm ICML 2018 Support Recovery for Orthogonal Matching Pursuit: Upper and Lower bounds NeurIPS 2018 Testing Symmetric Markov Chains From a Single Trajectory COLT 2018 The Computational Complexity of Distinctive Feature Minimization in Phonology NAACL 2018 The Convergence of Sparsified Gradient Methods NeurIPS 2018 The DFS Fused Lasso: Linear-Time Denoising over General Graphs JMLR 2018 The Edge Density Barrier: Computational-Statistical Tradeoffs in Combinatorial Inference ICML 2018 The Everlasting Database: Statistical Validity at a Fair Price NeurIPS 2018 The Externalities of Exploration and How Data Diversity Helps Exploitation COLT 2018 The Generalization Error of Dictionary Learning with Moreau Envelopes ICML 2018 The Intricacies of Three-Valued Extensional Semantics for Higher-Order Logic Programs IJCAI 2018 The Mean-Field Approximation: Information Inequalities, Algorithms, and Complexity COLT 2018