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)

Wide-minima Density Hypothesis and the Explore-Exploit Learning Rate Schedule JMLR 2023 Winner Takes It All: Training Performant RL Populations for Combinatorial Optimization NeurIPS 2023 Winning the CityLearn Challenge: Adaptive Optimization with Evolutionary Search under Trajectory-Based Guidance AAAI 2023 You Only Condense Once: Two Rules for Pruning Condensed Datasets NeurIPS 2023 Zero-sum Polymatrix Markov Games: Equilibrium Collapse and Efficient Computation of Nash Equilibria NeurIPS 2023 Zeroth-Order Alternating Gradient Descent Ascent Algorithms for A Class of Nonconvex-Nonconcave Minimax Problems JMLR 2023 Zeroth-Order Optimization with Trajectory-Informed Derivative Estimation ICLR 2023 Zeroth-order Optimization with Weak Dimension Dependency COLT 2023 A Bandit Model for Human-Machine Decision Making with Private Information and Opacity AISTATS 2022 A Bayesian Approach for Stochastic Continuum-armed Bandit with Long-term Constraints AISTATS 2022 abess: A Fast Best-Subset Selection Library in Python and R JMLR 2022 A Best-of-Both-Worlds Algorithm for Bandits with Delayed Feedback NeurIPS 2022 A*+BFHS: A Hybrid Heuristic Search Algorithm AAAI 2022 A Branch and Bound Framework for Stronger Adversarial Attacks of ReLU Networks ICML 2022 Abstract Argumentation Frameworks with Marginal Probabilities IJCAI 2022 A causal bandit approach to learning good atomic interventions in presence of unobserved confounders UAI 2022 Accelerated Federated Learning with Decoupled Adaptive Optimization ICML 2022 Accelerated Gradient Methods for Geodesically Convex Optimization: Tractable Algorithms and Convergence Analysis ICML 2022 Accelerated Multiplicative Weights Update Avoids Saddle Points Almost Always IJCAI 2022 Accelerated Primal-Dual Gradient Method for Smooth and Convex-Concave Saddle-Point Problems with Bilinear Coupling NeurIPS 2022 Accelerated Projected Gradient Algorithms for Sparsity Constrained Optimization Problems NeurIPS 2022 Accelerated SGD for Non-Strongly-Convex Least Squares COLT 2022 Accelerating Adaptive Cubic Regularization of Newton's Method via Random Sampling JMLR 2022 Accelerating Model-Free Policy Optimization Using Model-Based Gradient: A Composite Optimization Perspective L4DC 2022 Accelerating SGD for Highly Ill-Conditioned Huge-Scale Online Matrix Completion NeurIPS 2022