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)

Single-Agent Policy Tree Search With Guarantees NeurIPS 2018 Sketching for Kronecker Product Regression and P-splines AISTATS 2018 Sketching Method for Large Scale Combinatorial Inference NeurIPS 2018 Sliced Wasserstein Distance for Learning Gaussian Mixture Models CVPR 2018 Smooth and Sparse Optimal Transport AISTATS 2018 Smoothed analysis for low-rank solutions to semidefinite programs in quadratic penalty form COLT 2018 Smoothed Analysis of Discrete Tensor Decomposition and Assemblies of Neurons NeurIPS 2018 Smoothed analysis of the low-rank approach for smooth semidefinite programs NeurIPS 2018 Smoothed Online Convex Optimization in High Dimensions via Online Balanced Descent COLT 2018 SobolevFusion: 3D Reconstruction of Scenes Undergoing Free Non-Rigid Motion CVPR 2018 Socially Motivated Partial Cooperation in Multi-agent Local Search IJCAI 2018 Solving Exist-Random Quantified Stochastic Boolean Satisfiability via Clause Selection IJCAI 2018 Solving Large Sequential Games with the Excessive Gap Technique NeurIPS 2018 Solving lp-norm regularization with tensor kernels AISTATS 2018 Solving M-Modes in Loopy Graphs Using Tree Decompositions PGM 2018 Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs (Extended Abstract) IJCAI 2018 Solving Non-smooth Constrained Programs with Lower Complexity than O(1/ε): A Primal-Dual Homotopy Smoothing Approach NeurIPS 2018 Solving Partial Assignment Problems using Random Clique Complexes ICML 2018 Solving Patrolling Problems in the Internet Environment IJCAI 2018 Solving Separable Nonsmooth Problems Using Frank-Wolfe with Uniform Affine Approximations IJCAI 2018 Solving Sudoku with Consistency: A Visual and Interactive Approach IJCAI 2018 Solving (Weighted) Partial MaxSAT by Dynamic Local Search for SAT IJCAI 2018 SoS-RSC: A Sum-of-Squares Polynomial Approach to Robustifying Subspace Clustering Algorithms CVPR 2018 Sparse Estimation in Ising Model via Penalized Monte Carlo Methods JMLR 2018 Sparsified SGD with Memory NeurIPS 2018