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)

Analytical Study of Momentum-Based Acceleration Methods in Paradigmatic High-Dimensional Non-Convex Problems NeurIPS 2021 Analyzing the Generalization Capability of SGLD Using Properties of Gaussian Channels NeurIPS 2021 An analysis of Ermakov-Zolotukhin quadrature using kernels NeurIPS 2021 Anderson acceleration of coordinate descent AISTATS 2021 A Near-Optimal Algorithm for Stochastic Bilevel Optimization via Double-Momentum NeurIPS 2021 An Efficient Algorithm for Cooperative Semi-Bandits ALT 2021 An Efficient Pessimistic-Optimistic Algorithm for Stochastic Linear Bandits with General Constraints NeurIPS 2021 An Even More Optimal Stochastic Optimization Algorithm: Minibatching and Interpolation Learning NeurIPS 2021 A New Formalism, Method and Open Issues for Zero-Shot Coordination ICML 2021 A New Upper Bound Based on Vertex Partitioning for the Maximum K-plex Problem IJCAI 2021 An exact solver for the Weston-Watkins SVM subproblem ICML 2021 An Improved Analysis and Rates for Variance Reduction under Without-replacement Sampling Orders NeurIPS 2021 An Improved Upper Bound for SAT AAAI 2021 An Inertial Newton Algorithm for Deep Learning JMLR 2021 An Integer Linear Programming Framework for Mining Constraints from Data ICML 2021 An LP-Based Approach for Goal Recognition as Planning AAAI 2021 A No-go Theorem for Robust Acceleration in the Hyperbolic Plane NeurIPS 2021 A Non-commutative Extension of Lee-Seung's Algorithm for Positive Semidefinite Factorizations NeurIPS 2021 An Online Method for A Class of Distributionally Robust Optimization with Non-convex Objectives NeurIPS 2021 An Online Riemannian PCA for Stochastic Canonical Correlation Analysis NeurIPS 2021 An online semi-definite programming with a generalised log-determinant regularizer and its applications ACML 2021 An Optimal Reduction of TV-Denoising to Adaptive Online Learning AISTATS 2021 An Optimistic Acceleration of AMSGrad for Nonconvex Optimization ACML 2021 A Note on Sparse Generalized Eigenvalue Problem NeurIPS 2021 A novel notion of barycenter for probability distributions based on optimal weak mass transport NeurIPS 2021