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)

Additive Error Guarantees for Weighted Low Rank Approximation ICML 2021 A Deflation Based Fast and Robust Preconditioner for Bundle Adjustment WACV 2021 A Deterministic Streaming Sketch for Ridge Regression AISTATS 2021 A Dimension-free Computational Upper-bound for Smooth Optimal Transport Estimation COLT 2021 A Distributed Method for Fitting Laplacian Regularized Stratified Models JMLR 2021 ADOM: Accelerated Decentralized Optimization Method for Time-Varying Networks ICML 2021 A Domain-Shrinking based Bayesian Optimization Algorithm with Order-Optimal Regret Performance NeurIPS 2021 Adversarial Combinatorial Bandits with General Non-linear Reward Functions ICML 2021 Adversarial Dueling Bandits ICML 2021 Adversarial Linear Contextual Bandits with Graph-Structured Side Observations AAAI 2021 Adversarially robust learning for security-constrained optimal power flow NeurIPS 2021 Adversarial Online Learning with Changing Action Sets: Efficient Algorithms with Approximate Regret Bounds ALT 2021 Adversarial Regularization as Stackelberg Game: An Unrolled Optimization Approach EMNLP 2021 Adversarial Robustness of Streaming Algorithms through Importance Sampling NeurIPS 2021 A Faster Decentralized Algorithm for Nonconvex Minimax Problems NeurIPS 2021 A Faster Maximum Cardinality Matching Algorithm with Applications in Machine Learning NeurIPS 2021 A Fast Exact Algorithm for the Resource Constrained Shortest Path Problem AAAI 2021 A Fast Globally Linearly Convergent Algorithm for the Computation of Wasserstein Barycenters JMLR 2021 A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching AAAI 2021 Affine Invariant Analysis of Frank-Wolfe on Strongly Convex Sets ICML 2021 A first-order primal-dual method with adaptivity to local smoothness NeurIPS 2021 A Game-Theoretic Account of Responsibility Allocation IJCAI 2021 A General Framework for Empirical Bayes Estimation in Discrete Linear Exponential Family JMLR 2021 A Geometric Structure of Acceleration and Its Role in Making Gradients Small Fast NeurIPS 2021 A Gradient Based Strategy for Hamiltonian Monte Carlo Hyperparameter Optimization ICML 2021