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)

Riemannian Bilevel Optimization JMLR 2025 Riemannian Diffusion Adaptation for Distributed Optimization on Manifolds ICML 2025 Riemannian Direct Trajectory Optimization of Rigid Bodies on Matrix Lie Groups RSS 2025 Risk-Aware Task Migration for Multiplex Unmanned Swarm Networks in Adversarial Environments IJCAI 2025 Robust Algorithms for Recovering Planted r-Colorable Graphs COLT 2025 Robust Barycenter Estimation using Semi-Unbalanced Neural Optimal Transport ICLR 2025 Robust Consensus Anchor Learning for Efficient Multi-view Subspace Clustering ICML 2025 Robust Control of Uncertain Switched Affine Systems via Scenario Optimization L4DC 2025 Robust Inverse Reinforcement Learning Control with Unknown States L4DC 2025 Robust Multi-fidelity Bayesian Optimization with Deep Kernel and Partition AISTATS 2025 Robustness of Quantum Algorithms for Nonconvex Optimization ICLR 2025 Robust Performance Incentivizing Algorithms for Multi-Armed Bandits with Strategic Agents AAAI 2025 Robust Point Matching with Distance Profiles JMLR 2025 Robust random graph matching in Gaussian models via vector approximate message passing COLT 2025 Robust Sparsification via Sensitivity ICML 2025 Robust System Identification: Finite-sample Guarantees and Connection to Regularization ICLR 2025 Rolling in Classical Planning with Conditional Effects and Constraints IJCAI 2025 Root Defense Strategies: Ensuring Safety of LLM at the Decoding Level ACL 2025 Runtime Analysis for Multi-Objective Evolutionary Algorithms in Unbounded Integer Spaces AAAI 2025 Runtime Analysis of Evolutionary NAS for Multiclass Classification ICML 2025 Safely Learning Optimal Auctions: A Testable Learning Framework for Mechanism Design ICML 2025 Safe Online Convex Optimization with Heavy-Tailed Observation Noises AAAI 2025 Safety in the Face of Adversity: Achieving Zero Constraint Violation in Online Learning with Slowly Changing Constraints AISTATS 2025 Sample-aware Adaptive Structured Pruning for Large Language Models AAAI 2025 Sample Complexity of Branch-length Estimation by Maximum Likelihood ICML 2025