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

2

6

6

5

16

67

72

80

102

133

171

219

398

425

440

487

649

812

1,162

1,353

1,487

1,474

1,600

1,870

1,441

372

2000

'5

'10

'15

'20

'25

Papers (including subtopics)

Procedure Learning via Regularized Gromov-Wasserstein Optimal Transport WACV 2026 Prompt-OT: An Optimal Transport Regularization Paradigm for Knowledge Preservation in Vision-Language Model Adaptation WACV 2026 Provable Guarantees For Robust Feature Selection in Sparse Linear Models in High-Dimensions UAI 2026 Provably Efficient Multi-Objective Bandit Algorithms Under Preference-Centric Customization AAAI 2026 QuadSync: Quadrifocal Tensor Synchronization via Tucker Decomposition CVPR 2026 Quantitative Convergence Analysis of Projected Stochastic Gradient Descent for Non-Convex Losses via the Goldstein Subdifferential ALT 2026 Quantized Stochastic Primal–Dual Methods for Distributed Optimization under Relaxed Global Geometry UAI 2026 Quantum Lipschitz Bandits AAAI 2026 Quantum Non-Linear Bandit Optimization AAAI 2026 Quiet Planting for k-SAT, Multiple Solutions of Arbitrary Geometry COLT 2026 Random is Faster than Systematic in Multi-Objective Local Search AAAI 2026 Randomization for Faster Exact Optimization of Discounted Markov Decision Processes COLT 2026 Random Reshuffling Dominates Stochastic Gradient Descent COLT 2026 Realistic Internal Dynamics Are Essential for Human-Like Control: An Optimal Feedback Control Perspective L4DC 2026 Reconfiguring Proportional Committees AAAI 2026 Recursive Fréchet Mean Estimation UAI 2026 Refined Risk Bounds for Unbounded Losses via Transductive Priors JMLR 2026 Renormalization Group Guided Tensor Network Structure Search AAAI 2026 Reparameterized Tensor Ring Functional Decomposition for Multi-Dimensional Data Recovery CVPR 2026 Rethinking Pose Refinement in 3D Gaussian Splatting under Pose Prior and Geometric Uncertainty CVPR 2026 Reusing Samples in Variance Reduction ALT 2026 Revisiting Optimal Coding for I-ToF under Practical Sensor Constraints CVPR 2026 Reward Selection with Noisy Observations ALT 2026 Right Branches Matter in Failure-based Variable Ordering Heuristics AAAI 2026 Rigorous Asymptotics for First-Order Algorithms Through the Dynamical Cavity Method COLT 2026