Skip to content
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
16
133
440
1,353
1,441
2000
'5
'10
'15
'20
'25

Papers (including subtopics)

The Non-Overlapping Statistical Approximation to Overlapping Group Lasso JMLR 2024 The Nyström method for convex loss functions JMLR 2024 Theoretical and Empirical Analysis of Cost-Function Merging for Implicit Hitting Set WCSP Solving AAAI 2024 Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover AAAI 2024 Theoretical Guarantees for Variational Inference with Fixed-Variance Mixture of Gaussians ICML 2024 The Predicted-Updates Dynamic Model: Offline, Incremental, and Decremental to Fully Dynamic Transformations COLT 2024 The Price of Adaptivity in Stochastic Convex Optimization COLT 2024 The Real Price of Bandit Information in Multiclass Classification COLT 2024 The Reliability of OKRidge Method in Solving Sparse Ridge Regression Problems NeurIPS 2024 The Role of Learning Algorithms in Collective Action ICML 2024 The Sample-Communication Complexity Trade-off in Federated Q-Learning NeurIPS 2024 The sample complexity of ERMs in stochastic convex optimization AISTATS 2024 The Sample Complexity of Gradient Descent in Stochastic Convex Optimization NeurIPS 2024 The SMART approach to instance-optimal online learning COLT 2024 The Solution Path of SLOPE AISTATS 2024 The Space Complexity of Approximating Logistic Loss NeurIPS 2024 The Star Geometry of Critic-Based Regularizer Learning NeurIPS 2024 The Surprising Effectiveness of SP Voting with Partial Preferences NeurIPS 2024 The Value of Reward Lookahead in Reinforcement Learning NeurIPS 2024 This Too Shall Pass: Removing Stale Observations in Dynamic Bayesian Optimization NeurIPS 2024 Thompson Sampling For Combinatorial Bandits: Polynomial Regret and Mismatched Sampling Paradox NeurIPS 2024 Thompson Sampling for Real-Valued Combinatorial Pure Exploration of Multi-Armed Bandit AAAI 2024 Threshold-Based Responsive Simulated Annealing for Directed Feedback Vertex Set Problem AAAI 2024 Thresholds for Reconstruction of Random Hypergraphs From Graph Projections COLT 2024 TIC-TAC: A Framework For Improved Covariance Estimation In Deep Heteroscedastic Regression ICML 2024