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)

Fast and Smooth Interpolation on Wasserstein Space AISTATS 2021 Fast Approximate Dynamic Programming for Infinite-Horizon Markov Decision Processes NeurIPS 2021 Fast Approximation of the Sliced-Wasserstein Distance Using Concentration of Random Projections NeurIPS 2021 Fast convergence of stochastic subgradient method under interpolation ICLR 2021 Fast Doubly-Adaptive MCMC to Estimate the Gibbs Partition Function with Weak Mixing Time Bounds NeurIPS 2021 Faster Algorithms and Constant Lower Bounds for the Worst-Case Expected Error NeurIPS 2021 Faster and Better Simple Temporal Problems AAAI 2021 Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent AAAI 2021 Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions IJCAI 2021 Faster Kernel Interpolation for Gaussian Processes AISTATS 2021 Faster lifting for two-variable logic using cell graphs UAI 2021 Faster Matchings via Learned Duals NeurIPS 2021 Faster Multi-Object Segmentation Using Parallel Quadratic Pseudo-Boolean Optimization ICCV 2021 Faster Non-asymptotic Convergence for Double Q-learning NeurIPS 2021 Faster proximal algorithms for matrix optimization using Jacobi-based eigenvalue methods NeurIPS 2021 Fast Learning for Renewal Optimization in Online Task Scheduling JMLR 2021 Fast Pareto Optimization for Subset Selection with Dynamic Cost Constraints IJCAI 2021 Fast PCA in 1-D Wasserstein Spaces via B-splines Representation and Metric Projection AAAI 2021 Fast Policy Extragradient Methods for Competitive Games with Entropy Regularization NeurIPS 2021 Fast Pose Graph Optimization via Krylov-Schur and Cholesky Factorization WACV 2021 Fast Projection Onto Convex Smooth Constraints ICML 2021 Fast Projection onto the Capped Simplex with Applications to Sparse Regression in Bioinformatics NeurIPS 2021 Fast Pure Exploration via Frank-Wolfe NeurIPS 2021 Fast Rate Learning in Stochastic First Price Bidding ACML 2021 Fast rates for prediction with limited expert advice NeurIPS 2021