Skip to content
conftrace_

Optimization & Theory

43,292 papers (3 classified directly here)

Subtopics · a paper can sit in several, so these overlap

Optimization (17,731) Learning Theory (6,809) Bayesian Inference (6,267) Theory (5,579) Statistical Learning (4,564) Neural Network Optimization (4,155) Stochastic Processes (2,948) Stochastic Methods (1,283) Loss Functions (1,220) Distributed Learning (1,202) Online Algorithms (1,013) Statistics (822) Generalization (376) Information Theory (370) Sample Complexity (282) Sparse Optimization (241) Game Theory (151) Convex Optimization (132) Optimal Transport (104) Robust Optimization (84) Distributed Optimization (73) Approximation Algorithms (33)

Papers per year

1
52
352
828
3,646
5,854
2000
'5
'10
'15
'20
'25

Papers (including subtopics)

Importance Weighting Can Help Large Language Models Self-Improve AAAI 2025 Imprecise Multi-Armed Bandits: Representing Irreducible Uncertainty as a Zero-Sum Game JMLR 2025 Improved Algorithm for Deep Active Learning under Imbalance via Optimal Separation ICML 2025 Improved and Oracle-Efficient Online ℓ_1-Multicalibration ICML 2025 Improved Approximations for Hard Graph Problems using Predictions ICML 2025 Improved Convergence Rate for Diffusion Probabilistic Models ICLR 2025 Improved dependence on coherence in eigenvector and eigenvalue estimation error bounds AISTATS 2025 Improved Finite-Particle Convergence Rates for Stein Variational Gradient Descent ICLR 2025 Improved Fixed-Parameter Bounds for Min-Sum-Radii and Diameters k-Clustering and Their Fair Variants AAAI 2025 Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization ICML 2025 Improved Learning via k-DTW: A Novel Dissimilarity Measure for Curves ICML 2025 Improved Lower Bounds for First-order Stochastic Non-convex Optimization under Markov Sampling ICML 2025 Improved Margin Generalization Bounds for Voting Classifiers COLT 2025 Improved Noise Schedule for Diffusion Training ICCV 2025 Improved Off-policy Reinforcement Learning in Biological Sequence Design ICML 2025 Improved Online Confidence Bounds for Multinomial Logistic Bandits ICML 2025 Improved Rates of Differentially Private Nonconvex-Strongly-Concave Minimax Optimization AAAI 2025 Improved Regret Analysis in Gaussian Process Bandits: Optimality for Noiseless Reward, RKHS norm, and Non-Stationary Variance ICML 2025 Improved Regret Bounds for Online Fair Division with Bandit Learning AAAI 2025 Improved Sample Complexity for Private Nonsmooth Nonconvex Optimization ICML 2025 Improved Sampling Algorithms for Lévy-Itô Diffusion Models ICLR 2025 Improved Sampling Of Diffusion Models In Fluid Dynamics With Tweedie's Formula ICLR 2025 Improved Sparse Upcycling for Instruction Tuning COLING 2025 Improved Theoretically-Grounded Evolutionary Algorithms for Subset Selection with a Linear Cost Constraint ICML 2025 Improvements to the Generate-and-Complete Approach to Conformant Planning IJCAI 2025