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)

Facility Location for Congesting Commuters and Generalizing the Cost-Distance Problem AAAI 2026 Factorization-in-Loop:Proximal Fill-in Minimization for Sparse Matrix Reordering AAAI 2026 Fair Allocation of Indivisible Goods with Variable Groups AAAI 2026 Fair and Efficient Balanced Allocation for Indivisible Goods AAAI 2026 Fairness and Stability for Shared Resource Allocation Problems AAAI 2026 Fairness-Aware Design for Contextual Experiments: Guaranteeing Reliability and Equity in Heterogeneous Subgroups AAAI 2026 Fairness in Repeated Matching: A Maximin Perspective AAAI 2026 Fairness in the Multi-Secretary Problem AAAI 2026 Fair Societies: Algorithms for House Allocations AAAI 2026 Fast and Large-Scale Unbalanced Optimal Transport via its Semi-Dual and Adaptive Gradient Methods COLT 2026 Faster Certified Symmetry Breaking Using Orders with Auxiliary Variables AAAI 2026 Faster Game Solving via Asymmetry of Step Sizes AAAI 2026 Faster Newton Methods for Convex and Nonconvex Optimization in Gradient Complexity COLT 2026 Faster Symmetry Breaking Constraints for Abstract Structures AAAI 2026 Fast Markov Random Field Optimisation for Topologically Noisy 3D Shape Matching CVPR 2026 Fast, Parallel, Query-Efficient Binary Classification COLT 2026 FastRef: Fast Prototype Refinement for Few-shot Industrial Anomaly Detection CVPR 2026 Fast Score-Based Sampling via Log-Concave Reductions COLT 2026 Finding Diverse Solutions Parameterized by Cliquewidth AAAI 2026 Finding One Local Optimum Is Easy—but What About Two? AAAI 2026 Finite Neural Networks as Mixtures of Gaussian Processes: From Provable Error Bounds to Prior Selection JMLR 2026 Finite-Time Decoupled Convergence in Nonlinear Two-Time-Scale Stochastic Approximation JMLR 2026 First-Order Softmax Weighted Switching Gradient Method for Distributed Stochastic Minimax Optimization with Stochastic Constraints UAI 2026 Fixed-Parameter Tractability of Private Synthetic Data Generation COLT 2026 FLARE: Fine-Grained Length-Aware Routing for Resource-Efficient Heterogeneous LLM Serving ACL 2026