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)

Accelerated Quasi-Newton Proximal Extragradient: Faster Rate for Smooth Convex Optimization NeurIPS 2023 Accelerated Riemannian Optimization: Handling Constraints with a Prox to Bound Geometric Penalties COLT 2023 Accelerated Single-Call Methods for Constrained Min-Max Optimization ICLR 2023 Accelerated Stochastic Optimization Methods under Quasar-convexity ICML 2023 Accelerated Zeroth-order Method for Non-Smooth Stochastic Convex Optimization Problem with Infinite Variance NeurIPS 2023 Accelerating Motion Planning via Optimal Transport NeurIPS 2023 Accelerating Voting by Quantum Computation UAI 2023 Acceleration of Frank-Wolfe Algorithms with Open-Loop Step-Sizes AISTATS 2023 Accurate Interpolation for Scattered Data through Hierarchical Residual Refinement NeurIPS 2023 Achieving O(ε^-1.5) Complexity in Hessian/Jacobian-free Stochastic Bilevel Optimization NeurIPS 2023 Achieving Hierarchy-Free Approximation for Bilevel Programs with Equilibrium Constraints ICML 2023 A Combinatorial Algorithm for Approximating the Optimal Transport in the Parallel and MPC Settings NeurIPS 2023 A Computation and Communication Efficient Method for Distributed Nonconvex Problems in the Partial Participation Setting NeurIPS 2023 A Conditional Gradient-based Method for Simple Bilevel Optimization with Convex Lower-level Problem AISTATS 2023 A Constant-Factor Approximation Algorithm for Reconciliation k-Median AISTATS 2023 A Continuous-time Stochastic Gradient Descent Method for Continuous Data JMLR 2023 A Convergent Single-Loop Algorithm for Relaxation of Gromov-Wasserstein in Graph Data ICLR 2023 A Corrected Expected Improvement Acquisition Function Under Noisy Observations ACML 2023 Action Matching: Learning Stochastic Dynamics from Samples ICML 2023 Active Cost-aware Labeling of Streaming Data AISTATS 2023 Active Exploration via Experiment Design in Markov Chains AISTATS 2023 Active Level Set Estimation for Continuous Search Space with Theoretical Guarantee ACML 2023 Adaptation to Misspecified Kernel Regularity in Kernelised Bandits AISTATS 2023 Adaptation to the Range in K-Armed Bandits JMLR 2023 Adapting to game trees in zero-sum imperfect information games ICML 2023