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)

Efficient Curvature-Aware Hypergradient Approximation for Bilevel Optimization ICML 2025 Efficient Differentiable Approximation of Generalized Low-rank Regularization IJCAI 2025 Efficient Distributed Optimization under Heavy-Tailed Noise ICML 2025 Efficient First-Order Optimization on the Pareto Set for Multi-Objective Learning under Preference Guidance ICML 2025 Efficient Graph Bandit Learning with Side-Observations and Switching Constraints AAAI 2025 Efficient Interpolation between Extragradient and Proximal Methods for Weak MVIs ICLR 2025 Efficiently Escaping Saddle Points in Bilevel Optimization JMLR 2025 Efficiently Identifying Watermarked Segments in Mixed-Source Texts ACL 2025 Efficiently learning and sampling multimodal distributions with data-based initialization COLT 2025 Efficiently Vectorized MCMC on Modern Accelerators ICML 2025 Efficient Methods for Non-stationary Online Learning JMLR 2025 Efficient Multivariate Robust Mean Estimation Under Mean-Shift Contamination ICML 2025 Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries COLT 2025 Efficient Numerical Integration in Reproducing Kernel Hilbert Spaces via Leverage Scores Sampling JMLR 2025 Efficient Optimization Algorithms for Linear Adversarial Training AISTATS 2025 Efficient Optimization with Orthogonality Constraint: a Randomized Riemannian Submanifold Method ICML 2025 Efficient PAC Learning of Halfspaces with Constant Malicious Noise Rate ALT 2025 Efficient Sparse PCA via Block-Diagonalization ICLR 2025 Efficient Training of Neural Fractional-Order Differential Equation via Adjoint Backpropagation AAAI 2025 Efficient Trajectory Inference in Wasserstein Space Using Consecutive Averaging AISTATS 2025 EFX Feasible Scheduling for Time-dependent Resources IJCAI 2025 e-GAI: e-value-based Generalized $α$-Investing for Online False Discovery Rate Control ICML 2025 Eliminating Majority Illusion Is Easy AAAI 2025 Embracing Large Language Models in Traffic Flow Forecasting ACL 2025 Enabling Optimal Decisions in Rehearsal Learning under CARE Condition ICML 2025