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)

Random Projections and Sampling Algorithms for Clustering of High-Dimensional Polygonal Curves NeurIPS 2019 Random Projections with Asymmetric Quantization NeurIPS 2019 Random Shuffling Beats SGD after Finite Epochs ICML 2019 Random Tessellation Forests NeurIPS 2019 Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry Suffices NeurIPS 2019 Reachability and Coverage Planning for Connected Agents IJCAI 2019 Reachable Space Characterization of Markov Decision Processes with Time Variability RSS 2019 Reallocating Multiple Facilities on the Line IJCAI 2019 Real-Time Planning as Decision-Making under Uncertainty AAAI 2019 Reducing the variance in online optimization by transporting past gradients NeurIPS 2019 Redundancy Techniques for Straggler Mitigation in Distributed Optimization and Learning JMLR 2019 Reflective and Fluorescent Separation Under Narrow-Band Illumination CVPR 2019 Regret Bounds for Thompson Sampling in Episodic Restless Bandit Problems NeurIPS 2019 Regret Minimization for Reinforcement Learning with Vectorial Feedback and Complex Objectives NeurIPS 2019 Regularized Contextual Bandits AISTATS 2019 Regularized Weighted Low Rank Approximation NeurIPS 2019 Rehashing Kernel Evaluation in High Dimensions ICML 2019 Reinforcement Learning under Threats AAAI 2019 Relative Error Bound Analysis for Nuclear Norm Regularized Matrix Completion JMLR 2019 Replica Conditional Sequential Monte Carlo ICML 2019 ResNets Ensemble via the Feynman-Kac Formalism to Improve Natural and Robust Accuracies NeurIPS 2019 Resolution and Domination: An Improved Exact MaxSAT Algorithm IJCAI 2019 RES-PCA: A Scalable Approach to Recovering Low-Rank Matrices CVPR 2019 Restarting Frank-Wolfe AISTATS 2019 Rethinking the Discount Factor in Reinforcement Learning: A Decision Theoretic Approach AAAI 2019