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)

Stochastic Anderson Mixing for Nonconvex Stochastic Optimization NeurIPS 2021 Stochastic Approximation for Online Tensorial Independent Component Analysis COLT 2021 Stochastic Bandits with Graph Feedback in Non-Stationary Environments AAAI 2021 Stochastic bandits with groups of similar arms. NeurIPS 2021 Stochastic Bandits with Linear Constraints AISTATS 2021 Stochastic Bias-Reduced Gradient Methods NeurIPS 2021 Stochastic continuous normalizing flows: training SDEs as ODEs UAI 2021 Stochastic Gradient Descent-Ascent and Consensus Optimization for Smooth Games: Convergence Analysis under Expected Co-coercivity NeurIPS 2021 Stochastic Iterative Graph Matching ICML 2021 Stochastic Multi-Armed Bandits with Unrestricted Delay Distributions ICML 2021 Stochastic Online Linear Regression: the Forward Algorithm to Replace Ridge NeurIPS 2021 Stochastic Online Optimization using Kalman Recursion JMLR 2021 Stochastic optimization under time drift: iterate averaging, step-decay schedules, and high probability guarantees NeurIPS 2021 Stochastic Probing with Increasing Precision IJCAI 2021 Stochastic Shortest Path with Adversarially Changing Costs IJCAI 2021 Stochastic Sign Descent Methods: New Algorithms and Better Theory ICML 2021 Storage Fit Learning with Feature Evolvable Streams AAAI 2021 Strategic Behavior is Bliss: Iterative Voting Improves Social Welfare NeurIPS 2021 Strategic Classification in the Dark ICML 2021 Streaming and Distributed Algorithms for Robust Column Subset Selection ICML 2021 Streaming k-PCA: Efficient guarantees for Oja’s algorithm, beyond rank-one updates COLT 2021 Structured Logconcave Sampling with a Restricted Gaussian Oracle COLT 2021 Structured Reordering for Modeling Latent Alignments in Sequence Transduction NeurIPS 2021 Structure learning in polynomial time: Greedy algorithms, Bregman information, and exponential families NeurIPS 2021 Sublinear Classical and Quantum Algorithms for General Matrix Games AAAI 2021