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)

Improved Bayes Regret Bounds for Multi-Task Hierarchical Bayesian Bandit Algorithms NeurIPS 2024 Improved Communication-Privacy Trade-offs in L_2 Mean Estimation under Streaming Differential Privacy ICML 2024 Improved Differentially Private and Lazy Online Convex Optimization: Lower Regret without Smoothness Requirements ICML 2024 Improved Dimensionality Dependence for Zeroth-Order Optimisation over Cross-Polytopes ICML 2024 Improved Encodings of Acyclicity for Translating Answer Set Programming into Integer Programming IJCAI 2024 Improved Evolutionary Algorithms for Submodular Maximization with Cost Constraints IJCAI 2024 Improved Guarantees for Fully Dynamic k-Center Clustering with Outliers in General Metric Spaces NeurIPS 2024 Improved Metric Distortion via Threshold Approvals AAAI 2024 Improved Parallel Algorithm for Non-Monotone Submodular Maximization under Knapsack Constraint IJCAI 2024 Improved Regret Bounds of (Multinomial) Logistic Bandits via Regret-to-Confidence-Set Conversion AISTATS 2024 Improved Regret for Bandit Convex Optimization with Delayed Feedback NeurIPS 2024 Improved Regret of Linear Ensemble Sampling NeurIPS 2024 Improved Stability and Generalization Guarantees of the Decentralized SGD Algorithm ICML 2024 Improving Adaptive Online Learning Using Refined Discretization ALT 2024 Improving Computational Complexity in Statistical Models with Local Curvature Information ICML 2024 Improving Gradient-Guided Nested Sampling for Posterior Inference ICML 2024 Improving Health Information Access in the World’s Largest Maternal Mobile Health Program via Bandit Algorithms AAAI 2024 Improving Linear System Solvers for Hyperparameter Optimisation in Iterative Gaussian Processes NeurIPS 2024 Improving protein optimization with smoothed fitness landscapes ICLR 2024 Improving Robustness to Multiple Spurious Correlations by Multi-Objective Optimization ICML 2024 Improving SAM Requires Rethinking its Optimization Formulation ICML 2024 Improving Sharpness-Aware Minimization by Lookahead ICML 2024 Improving the Convergence of Dynamic NeRFs via Optimal Transport ICLR 2024 Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity NeurIPS 2024 In-and-Out: Algorithmic Diffusion for Sampling Convex Bodies NeurIPS 2024