conftrace_

Machine Learning

132,800 papers (10 classified directly here)

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

Learning Types (56,253) Core Methods (51,083) Optimization & Theory (43,292) Application Areas (34,437) Bayesian & Probabilistic (4,733) Learning Paradigms (2,205)

Papers per year

5

22

43

74

52

76

308

315

348

358

533

570

711

1,481

1,361

1,651

2,440

3,865

5,968

9,301

11,133

13,312

14,452

17,500

20,351

21,167

5,403

2000

'5

'10

'15

'20

'25

Papers (including subtopics)

Improved Approximations for Hard Graph Problems using Predictions ICML 2025 Improved Bounds for Online Facility Location with Predictions AAAI 2025 Improved Convergence Rate for Diffusion Probabilistic Models ICLR 2025 Improved Coresets for Vertical Federated Learning: Regularized Linear and Logistic Regressions ICML 2025 Improved dependence on coherence in eigenvector and eigenvalue estimation error bounds AISTATS 2025 Improved Diffusion-based Generative Model with Better Adversarial Robustness ICLR 2025 Improved Expressivity of Hypergraph Neural Networks through High-Dimensional Generalized Weisfeiler-Leman Algorithms ICML 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 Monocular Depth Prediction Using Distance Transform Over Pre-semantic Contours with Self-supervised Neural Networks CVPR 2025 Improved Near-Duplicate Detection for Aggregated and Paywalled News-Feeds NAACL 2025 Improved Noise Schedule for Diffusion Training ICCV 2025 Improved Norwegian Bokmål Translations for FLORES EMNLP 2025 Improved Off-policy Reinforcement Learning in Biological Sequence Design ICML 2025 Improved Online Confidence Bounds for Multinomial Logistic Bandits ICML 2025 Improved Rank Aggregation Under Fairness Constraint IJCAI 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