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)

Efficient and passive learning of networked dynamical systems driven by non-white exogenous inputs AISTATS 2022 Efficient and Stable Fully Dynamic Facility Location NeurIPS 2022 Efficient Budgeted Graph Search IJCAI 2022 Efficient computation of the the volume of a polytope in high-dimensions using Piecewise Deterministic Markov Processes AISTATS 2022 Efficient Convex Optimization Requires Superlinear Memory COLT 2022 Efficient Encoding of Cost Optimal Delete-Free Planning as SAT AAAI 2022 Efficient Frameworks for Generalized Low-Rank Matrix Bandit Problems NeurIPS 2022 Efficient Hyperparameter Tuning for Large Scale Kernel Ridge Regression AISTATS 2022 Efficient Kernelized UCB for Contextual Bandits AISTATS 2022 Efficient learning of sparse and decomposable PDEs using random projection UAI 2022 Efficient Low Rank Convex Bounds for Pairwise Discrete Graphical Models ICML 2022 Efficiently Factorizing Boolean Matrices using Proximal Gradient Descent NeurIPS 2022 Efficient MCMC Sampling with Dimension-Free Convergence Rate using ADMM-type Splitting JMLR 2022 Efficient Methods for Non-stationary Online Learning NeurIPS 2022 Efficient Multi-Agent Communication via Shapley Message Value IJCAI 2022 Efficient Non-Parametric Optimizer Search for Diverse Tasks NeurIPS 2022 Efficient Online Linear Control with Stochastic Convex Costs and Unknown Dynamics COLT 2022 Efficient Optimal Transport Algorithm by Accelerated Gradient Descent AAAI 2022 Efficient Projection-Free Online Convex Optimization with Membership Oracle COLT 2022 Efficient Resource Allocation with Secretive Agents IJCAI 2022 Efficient Riemannian Meta-Optimization by Implicit Differentiation AAAI 2022 Efficient Sampling on Riemannian Manifolds via Langevin MCMC NeurIPS 2022 Efficient Scheduling Policies for Microsecond-Scale Tasks NSDI 2022 Efficient Submodular Optimization under Noise: Local Search is Robust NeurIPS 2022 Efficient Vertex-Oriented Polytopic Projection for Web-Scale Applications AAAI 2022