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)

Dual Principal Component Pursuit: Improved Analysis and Efficient Algorithms NeurIPS 2018 Dyadic collaborative Manipulation through Hybrid Trajectory Optimization CoRL 2018 Dynamic Fair Division Problem with General Valuations IJCAI 2018 Dynamic Oracles for Top-Down and In-Order Shift-Reduce Constituent Parsing EMNLP 2018 Dynamic Query Re-Planning using QOOP OSDI 2018 Dynamic Resource Routing using Real-Time Dynamic Programming IJCAI 2018 Early Stopping for Nonparametric Testing NeurIPS 2018 Efficient Adaptive Online Learning via Frequent Directions IJCAI 2018 Efficient Algorithms for Non-convex Isotonic Regression through Submodular Optimization NeurIPS 2018 Efficient and Correct Test Scheduling for Ensembles of Network Policies NSDI 2018 Efficient Attributed Network Embedding via Recursive Randomized Hashing IJCAI 2018 Efficient Bandit Combinatorial Optimization Algorithm with Zero-suppressed Binary Decision Diagrams AISTATS 2018 Efficient Computation of Approximate Equilibria in Discrete Colonel Blotto Games IJCAI 2018 Efficient Computation of Implicational Universals in Constraint-Based Phonology Through the Hyperplane Separation Theorem EMNLP 2018 Efficient Convex Completion of Coupled Tensors using Coupled Nuclear Norms NeurIPS 2018 Efficient Convex Optimization with Membership Oracles COLT 2018 Efficient coordinate-wise leading eigenvector computation ALT 2018 Efficient First-Order Algorithms for Adaptive Signal Denoising ICML 2018 Efficient High Dimensional Bayesian Optimization with Additivity and Quadrature Fourier Features NeurIPS 2018 Efficient Language Model Adaptation with Noise Contrastive Estimation and Kullback-Leibler Regularization Interspeech 2018 Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity JMLR 2018 Efficient Localized Inference for Large Graphical Models IJCAI 2018 Efficient Mechanisms for Peer Grading and Dueling Bandits ACML 2018 Efficient online algorithms for fast-rate regret bounds under sparsity NeurIPS 2018 Efficient Online Portfolio with Logarithmic Regret NeurIPS 2018