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)

Fast and Regret Optimal Best Arm Identification: Fundamental Limits and Low-Complexity Algorithms NeurIPS 2023 Fast Approximation of Similarity Graphs with Kernel Density Estimation NeurIPS 2023 Fast as CHITA: Neural Network Pruning with Combinatorial Optimization ICML 2023 Fast Asymptotically Optimal Algorithms for Non-Parametric Stochastic Bandits NeurIPS 2023 Fast Bellman Updates for Wasserstein Distributionally Robust MDPs NeurIPS 2023 Fast Block Coordinate Descent for Non-Convex Group Regularizations AISTATS 2023 Fast Combinatorial Algorithms for Min Max Correlation Clustering ICML 2023 Fast Computation of Branching Process Transition Probabilities via ADMM AISTATS 2023 Fast Conditional Mixing of MCMC Algorithms for Non-log-concave Distributions NeurIPS 2023 Fast Converging Anytime Model Counting AAAI 2023 Fast, Differentiable and Sparse Top-k: a Convex Analysis Perspective ICML 2023 Faster Discrete Convex Function Minimization with Predictions: The M-Convex Case NeurIPS 2023 Faster Exact MPE and Constrained Optimization with Deterministic Finite State Automata IJCAI 2023 Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization ICML 2023 Faster Gradient-Free Methods for Escaping Saddle Points ICLR 2023 Faster Margin Maximization Rates for Generic Optimization Methods NeurIPS 2023 Faster Projection-Free Augmented Lagrangian Methods via Weak Proximal Oracle AISTATS 2023 Faster Query Times for Fully Dynamic k-Center Clustering with Outliers NeurIPS 2023 Fast Exact Leverage Score Sampling from Khatri-Rao Products with Applications to Tensor Decomposition NeurIPS 2023 Fast Feature Selection with Fairness Constraints AISTATS 2023 Fast Fluid Simulation via Dynamic Multi-Scale Gridding AAAI 2023 Fast Nonlinear Vector Quantile Regression ICLR 2023 Fast Objective & Duality Gap Convergence for Non-Convex Strongly-Concave Min-Max Problems with PL Condition JMLR 2023 Fast Online Changepoint Detection via Functional Pruning CUSUM Statistics JMLR 2023 Fast Optimal Transport through Sliced Generalized Wasserstein Geodesics NeurIPS 2023