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)

Combinatorial Penalties: Which structures are preserved by convex relaxations? AISTATS 2018 Combinatorial Preconditioners for Proximal Algorithms on Graphs AISTATS 2018 Combinatorial Pure Exploration with Continuous and Separable Reward Functions and Its Applications IJCAI 2018 Combinatorial Semi-Bandits with Knapsacks AISTATS 2018 Communication-Avoiding Optimization Methods for Distributed Massive-Scale Sparse Inverse Covariance Estimation AISTATS 2018 Communication Efficient Parallel Algorithms for Optimization on Manifolds NeurIPS 2018 Community Exploration: From Offline Optimization to Online Learning NeurIPS 2018 Compact Convex Projections JMLR 2018 Compact-MDD: Efficiently Filtering (s)MDD Constraints with Reversible Sparse Bit-sets IJCAI 2018 Comparing Constraints for Taxonomic Organization NAACL 2018 Competing with Automata-based Expert Sequences AISTATS 2018 Competitive Caching with Machine Learned Advice ICML 2018 Competitive Multi-agent Inverse Reinforcement Learning with Sub-optimal Demonstrations ICML 2018 Compiling Combinatorial Prediction Games ICML 2018 Complexity of n-Queens Completion (Extended Abstract) IJCAI 2018 Complexity of Scheduling Charging in the Smart Grid IJCAI 2018 Computational Approaches for Stochastic Shortest Path on Succinct MDPs IJCAI 2018 Computational Aspects of the Preference Cores of Supermodular Two-Scenario Cooperative Games IJCAI 2018 Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn’s Algorithm ICML 2018 Computational Social Choice Meets Databases IJCAI 2018 Computing Higher Order Derivatives of Matrix and Tensor Expressions NeurIPS 2018 Computing Kantorovich-Wasserstein Distances on d-dimensional histograms using (d+1)-partite graphs NeurIPS 2018 Computing the Schulze Method for Large-Scale Preference Data Sets IJCAI 2018 Conditional Gradient Method for Stochastic Submodular Maximization: Closing the Gap AISTATS 2018 Conflict Directed Clause Learning for Maximum Weighted Clique Problem IJCAI 2018