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)

Clustering Items through Bandit Feedback: Finding the Right Feature out of Many ICML 2025 Clustering with bandit feedback: breaking down the computation/information gap ALT 2025 CODEOFCONDUCT at Multilingual Counterspeech Generation: A Context-Aware Model for Robust Counterspeech Generation in Low-Resource Languages COLING 2025 Coevolutionary Emergent Systems Optimization with Applications to Ultra-High-Dimensional Metasurface Design : OAM Wave Manipulation UAI 2025 COExpander: Adaptive Solution Expansion for Combinatorial Optimization ICML 2025 CoffeeBoost: Gradient Boosting Native Conformal Inference for Bayesian Optimization AAAI 2025 Color Transfer with Modulated Flows AAAI 2025 COM-BOM: Bayesian Exemplar Search for Efficiently Exploring the Accuracy-Calibration Pareto Frontier EMNLP 2025 Commitment to Sparse Strategies in Two-Player Games AAAI 2025 Competing Bandits in Matching Markets via Super Stability ICML 2025 Competitively Consistent Clustering ICML 2025 CompileAgent: Automated Real-World Repo-Level Compilation with Tool-Integrated LLM-based Agent System ACL 2025 Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness ICLR 2025 Compositional Targeted Multi-Label Universal Perturbations CVPR 2025 Computational Equivalence of Spiked Covariance and Spiked Wigner Models via Gram-Schmidt Perturbation COLT 2025 Computational Explorations of Total Variation Distance ICLR 2025 Computational Intractability of Strategizing against Online Learners COLT 2025 Computationally Hard Problems Are Hard for QBF Proof Systems Too AAAI 2025 Computing Circuits Optimization via Model-Based Circuit Genetic Evolution ICLR 2025 Computing High-dimensional Confidence Sets for Arbitrary Distributions COLT 2025 Computing high-dimensional optimal transport by flow neural networks AISTATS 2025 Computing Optimal Regularizers for Online Linear Optimization COLT 2025 Computing Optimal Transport Maps and Wasserstein Barycenters Using Conditional Normalizing Flows ICML 2025 Computing Quasi-Nash Equilibria via Gradient-Response Schemes L4DC 2025 Computing Voting Rules with Improvement Feedback ICML 2025