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)

Identifying near-optimal decisions in linear-in-parameter bandit models with continuous decision sets UAI 2022 Image Based Reconstruction of Liquids From 2D Surface Detections CVPR 2022 Implicit Bias of Gradient Descent on Reparametrized Models: On Equivalence to Mirror Descent NeurIPS 2022 Implicit Bias of Projected Subgradient Method Gives Provable Robust Recovery of Subspaces of Unknown Codimension ICLR 2022 Improved analysis for a proximal algorithm for sampling COLT 2022 Improved Approximation Algorithms for Individually Fair Clustering AISTATS 2022 Improved Convergence Rates for Sparse Approximation Methods in Kernel-Based Learning ICML 2022 Improved Coresets for Euclidean k-Means NeurIPS 2022 Improved Imaging by Invex Regularizers with Global Optima Guarantees NeurIPS 2022 Improved Maximin Guarantees for Subadditive and Fractionally Subadditive Fair Allocation Problem AAAI 2022 Improved Parallel Algorithm for Minimum Cost Submodular Cover Problem COLT 2022 Improved Pure Exploration in Linear Bandits with No-Regret Learning IJCAI 2022 Improved Rates for Differentially Private Stochastic Convex Optimization with Heavy-Tailed Data ICML 2022 Improved Regret Analysis for Variance-Adaptive Linear Bandits and Horizon-Free Linear Mixture MDPs NeurIPS 2022 Improve Single-Point Zeroth-Order Optimization Using High-Pass and Low-Pass Filters ICML 2022 Improving Dynamic Regret in Distributed Online Mirror Descent Using Primal and Dual Information L4DC 2022 Improving Local Search Algorithms via Probabilistic Configuration Checking AAAI 2022 Improving Mini-batch Optimal Transport via Partial Transportation ICML 2022 Improving sign-random-projection via count sketch UAI 2022 Incentivizing Collaboration in Machine Learning via Synthetic Data Rewards AAAI 2022 Inconsistent Planning: When in Doubt, Toss a Coin! AAAI 2022 Increasing the Scope as You Learn: Adaptive Bayesian Optimization in Nested Subspaces NeurIPS 2022 Individual fairness in feature-based pricing for monopoly markets UAI 2022 Individual Representation in Approval-Based Committee Voting AAAI 2022 Inducing Equilibria via Incentives: Simultaneous Design-and-Play Ensures Global Convergence NeurIPS 2022