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)

Bimodal Depth-First Search for Scalable GAC for AllDifferent IJCAI 2025 Black-box Optimization with Unknown Constraints via Overparameterized Deep Neural Networks UAI 2025 Black-Box Reductions for Decentralized Online Convex Optimization in Changing Environments COLT 2025 Blackwell’s Approachability with Approximation Algorithms COLT 2025 Blind Image Deblurring with FFT-ReLU Sparsity Prior WACV 2025 BOIDS: High-Dimensional Bayesian Optimization via Incumbent-Guided Direction Lines and Subspace Embeddings AAAI 2025 Boosting Perturbed Gradient Ascent for Last-Iterate Convergence in Games ICLR 2025 BOPO: Neural Combinatorial Optimization via Best-anchored and Objective-guided Preference Optimization ICML 2025 Both Asymptotic and Non-Asymptotic Convergence of Quasi-Hyperbolic Momentum using Increasing Batch Size ACML 2025 Boundary Decomposition for Finding Nadir Objective Vector in Multi-Objective Discrete Optimization AAAI 2025 Bounded Rationality Equilibrium Learning in Mean Field Games AAAI 2025 Branches: Efficiently Seeking Optimal Sparse Decision Trees via AO* ICML 2025 Breaking Barriers: Combinatorial Algorithms for Non-Monotone Submodular Maximization with Sublinear Adaptivity and $1/e$ Approximation ICML 2025 Breaking the $\log(1/\Delta_2)$ Barrier: Better Batched Best Arm Identification with Adaptive Grids ICLR 2025 Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries ICML 2025 Bridging Multiple Worlds: Multi-marginal Optimal Transport for Causal Partial-identification Problem AISTATS 2025 Bridging the Gap Between Hyperdimensional Computing and Kernel Methods via the Nyström Method AAAI 2025 BSO: Binary Spiking Online Optimization Algorithm ICML 2025 BTBS-LNS: Binarized-Tightening, Branch and Search on Learning LNS Policies for MIP ICLR 2025 Budget Allocation Exploiting Label Correlation between Instances UAI 2025 Building Massive MIMO Baseband Processing on a Single-Node Supercomputer NSDI 2025 Building Rome with Convex Optimization RSS 2025 Calibrating Pseudo-Labeling with Class Distribution for Semi-supervised Text Classification EMNLP 2025 Calibrating Video Watch-time Predictions with Credible Prototype Alignment ICML 2025 CamFreeDiff: Camera-free Image to Panorama Generation with Diffusion Model CVPR 2025