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)

Lower Bounds for Parallel and Randomized Convex Optimization COLT 2019 Lower Bounds for Smooth Nonconvex Finite-Sum Optimization ICML 2019 Lower Bounds on Adversarial Robustness from Optimal Transport NeurIPS 2019 Low-Rank Approximations of Second-Order Document Representations CoNLL 2019 Low-Rank Bandit Methods for High-Dimensional Dynamic Pricing NeurIPS 2019 Low-Rank HOCA: Efficient High-Order Cross-Modal Attention for Video Captioning EMNLP 2019 Low-Rank Laplacian-Uniform Mixed Model for Robust Face Recognition CVPR 2019 Low-Rank Semidefinite Programming for the MAX2SAT Problem AAAI 2019 Low-Rank Tensor Completion With a New Tensor Nuclear Norm Induced by Invertible Linear Transforms CVPR 2019 MAGSAC: Marginalizing Sample Consensus CVPR 2019 Making Money from What You Know - How to Sell Information? AAAI 2019 Making the Cut: A Bandit-based Approach to Tiered Interviewing NeurIPS 2019 Making the Last Iterate of SGD Information Theoretically Optimal COLT 2019 Massively scalable Sinkhorn distances via the Nyström method NeurIPS 2019 Matching with Constraints IJCAI 2019 Matrix-Free Preconditioning in Online Learning ICML 2019 Matroid Constrained Fair Allocation Problem AAAI 2019 Matroids, Matchings, and Fairness AISTATS 2019 MaxGap Bandit: Adaptive Algorithms for Approximate Ranking NeurIPS 2019 MaxHedge: Maximizing a Maximum Online AISTATS 2019 Maximin-Aware Allocations of Indivisible Goods IJCAI 2019 Maximum Entropy Distributions: Bit Complexity and Stability COLT 2019 Max-value Entropy Search for Multi-Objective Bayesian Optimization NeurIPS 2019 Measurement Maximizing Adaptive Sampling with Risk Bounding Functions AAAI 2019 Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimization AAAI 2019