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)

Learning the Dynamics of Time Delay Systems with Trainable Delays L4DC 2021 Learning the optimal Tikhonov regularizer for inverse problems NeurIPS 2021 Learning the Pareto Front with Hypernetworks ICLR 2021 Learning to delegate for large-scale vehicle routing NeurIPS 2021 Learning to Learn Graph Topologies NeurIPS 2021 Learning-to-learn non-convex piecewise-Lipschitz functions NeurIPS 2021 Learning to Make Decisions via Submodular Regularization ICLR 2021 Learning to Price Against a Moving Target ICML 2021 Learning to Schedule Heuristics in Branch and Bound NeurIPS 2021 Learning to Select Exogenous Events for Marked Temporal Point Process NeurIPS 2021 Learning to Stop with Surprisingly Few Samples COLT 2021 Learning with Comparison Feedback: Online Estimation of Sample Statistics ALT 2021 Learning Within an Instance for Designing High-Revenue Combinatorial Auctions IJCAI 2021 Learning with semi-definite programming: statistical bounds based on fixed point analysis and excess risk curvature JMLR 2021 Learning with User-Level Privacy NeurIPS 2021 Lenient Regret and Good-Action Identification in Gaussian Process Bandits ICML 2021 Lenient Regret for Multi-Armed Bandits AAAI 2021 Leveraging Good Representations in Linear Contextual Bandits ICML 2021 Leveraging Spatial and Temporal Correlations in Sparsified Mean Estimation NeurIPS 2021 LightGuardian: A Full-Visibility, Lightweight, In-band Telemetry System Using Sketchlets NSDI 2021 Light RUMs ICML 2021 Linear Bandits on Uniformly Convex Sets JMLR 2021 Linear Convergent Decentralized Optimization with Compression ICLR 2021 Linear Last-iterate Convergence in Constrained Saddle-point Optimization ICLR 2021 Linear Models are Robust Optimal Under Strategic Behavior AISTATS 2021