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)

Fast Routing under Uncertainty: Adaptive Learning in Congestion Games via Exponential Weights NeurIPS 2021 Fast Sinkhorn Filters: Using Matrix Scaling for Non-Rigid Shape Correspondence With Functional Maps CVPR 2021 Fast Sketching of Polynomial Kernels of Polynomial Degree ICML 2021 Fast Statistical Leverage Score Approximation in Kernel Ridge Regression AISTATS 2021 Fast Stochastic Bregman Gradient Methods: Sharp Analysis and Variance Reduction ICML 2021 Fast Training Method for Stochastic Compositional Optimization Problems NeurIPS 2021 Fast Tucker Rank Reduction for Non-Negative Tensors Using Mean-Field Approximation NeurIPS 2021 Fast WordPiece Tokenization EMNLP 2021 FedDR – Randomized Douglas-Rachford Splitting Algorithms for Nonconvex Federated Composite Optimization NeurIPS 2021 Federated Composite Optimization ICML 2021 Federated Learning with Compression: Unified Analysis and Sharp Guarantees AISTATS 2021 Federated Linear Contextual Bandits NeurIPS 2021 Federated Multi-armed Bandits with Personalization AISTATS 2021 Fenchel-Young Losses with Skewed Entropies for Class-posterior Probability Estimation AISTATS 2021 Few-Shot Data-Driven Algorithms for Low Rank Approximation NeurIPS 2021 FFT-OT: A Fast Algorithm for Optimal Transportation ICCV 2021 Field of Junctions: Extracting Boundary Structure at Low SNR ICCV 2021 Finding and Certifying (Near-)Optimal Strategies in Black-Box Extensive-Form Games AAAI 2021 Finding Bipartite Components in Hypergraphs NeurIPS 2021 Finding Diverse Trees, Paths, and More AAAI 2021 Finding First-Order Nash Equilibria of Zero-Sum Games with the Regularized Nikaido-Isoda Function AISTATS 2021 Finding Relevant Information via a Discrete Fourier Expansion ICML 2021 Finding the Hardest Formulas for Resolution (Extended Abstract) IJCAI 2021 Finite-time System Identification and Adaptive Control in Autoregressive Exogenous Systems L4DC 2021 First-Order Methods for Wasserstein Distributionally Robust MDP ICML 2021