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)

DPSCREEN: Dynamic Personalized Screening NeurIPS 2017 Dual Iterative Hard Thresholding: From Non-convex Sparse Minimization to Non-smooth Concave Maximization ICML 2017 Dueling Bandits with Weak Regret ICML 2017 DUST: Dual Union of Spatio-Temporal Subspaces for Monocular Multiple Object 3D Reconstruction CVPR 2017 Dykstra's Algorithm, ADMM, and Coordinate Descent: Connections, Insights, and Extensions NeurIPS 2017 Dynamic Importance Sampling for Anytime Bounds of the Partition Function NeurIPS 2017 Dynamic Revenue Sharing NeurIPS 2017 Early stopping for kernel boosting algorithms: A general analysis with localized complexities NeurIPS 2017 Efficiency Through Procrastination: Approximately Optimal Algorithm Configuration with Runtime Guarantees IJCAI 2017 Efficient Algorithm for Sparse Tensor-variate Gaussian Graphical Models via Gradient Descent AISTATS 2017 Efficient Algorithms And Representations For Chance-constrained Mixed Constraint Programming IJCAI 2017 Efficient and Flexible Inference for Stochastic Systems NeurIPS 2017 Efficient Approximation Algorithms for Strings Kernel Based Sequence Classification NeurIPS 2017 Efficient Automatic Perception System Parameter Tuning On Site without Expert Supervision CoRL 2017 Efficient Discontinuous Phrase-Structure Parsing via the Generalized Maximum Spanning Arborescence EMNLP 2017 Efficient Equilibrium Testing under Adhesion and Anisotropy using Empirical Contact Force Models RSS 2017 Efficient Inexact Proximal Gradient Algorithm for Nonconvex Problems IJCAI 2017 Efficient Inference for Untied MLNs IJCAI 2017 Efficient Kernel Selection via Spectral Analysis IJCAI 2017 Efficient Mechanism Design for Online Scheduling (Extended Abstract) IJCAI 2017 Efficient Online Linear Optimization with Approximation Algorithms NeurIPS 2017 Efficient Optimal Search under Expensive Edge Cost Computation IJCAI 2017 Efficient Optimization for Hierarchically-structured Interacting Segments (HINTS) CVPR 2017 Efficient Optimization for Linear Dynamical Systems with Applications to Clustering and Sparse Coding NeurIPS 2017 Efficient Rank Aggregation via Lehmer Codes AISTATS 2017