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)

NCAdapt: Dynamic Adaptation with Domain-Specific Neural Cellular Automata for Continual Hippocampus Segmentation WACV 2025 NCAP: Scene Text Image Super-Resolution with Non-CAtegorical Prior WACV 2025 NCL-AR at SemEval-2025 Task 7: A Sieve Filtering Approach to Refute the Misinformation within Harmful Social Media Posts SemEval 2025 NCL-NLP at SemEval-2025 Task 11: Using Prompting engineering framework and Low Rank Adaptation of Large Language Models for Multi-label Emotion Detection SemEval 2025 NCLTeam at SemEval-2025 Task 10: Enhancing Multilingual, multi-class, and Multi-Label Document Classification via Contrastive Learning Augmented Cascaded UNet and Embedding based Approaches SemEval 2025 NCL-UoR at SemEval-2025 Task 3: Detecting Multilingual Hallucination and Related Observable Overgeneration Text Spans with Modified RefChecker and Modified SeflCheckGPT SemEval 2025 N-CORE: N-View Consistency Regularization for Disentangled Representation Learning in Nonverbal Vocalizations EMNLP 2025 NDD: A Decision Diagram for Network Verification NSDI 2025 NEAR: A Training-Free Pre-Estimator of Machine Learning Model Performance ICLR 2025 Near-Exact Privacy Amplification for Matrix Mechanisms ICLR 2025 Near, far: Patch-ordering enhances vision foundation models' scene understanding ICLR 2025 Nearly Optimal Algorithms for Contextual Dueling Bandits from Adversarial Feedback ICML 2025 Nearly Optimal Differentially Private ReLU Regression UAI 2025 Nearly Optimal Sample Complexity for Learning with Label Proportions ICML 2025 Nearly-tight Approximation Guarantees for the Improving Multi-Armed Bandits Problem ALT 2025 Nearly Tight Bounds for Exploration in Streaming Multi-Armed Bandits with Known Optimality Gap AAAI 2025 Nearly Tight Bounds on Approximate Equilibria in Spatial Competition on the Line AAAI 2025 Nearly Zero-Cost Protection Against Mimicry by Personalized Diffusion Models CVPR 2025 NEAR: Neural Electromagnetic Array Response ICML 2025 Near-optimal Active Regression of Single-Index Models ICLR 2025 Near-Optimal Algorithm for Non-Stationary Kernelized Bandits AISTATS 2025 Near Optimal Best Arm Identification for Clustered Bandits ICML 2025 Near-Optimal Decision Trees in a SPLIT Second ICML 2025 Near-Optimal Nonconvex-Strongly-Convex Bilevel Optimization with Fully First-Order Oracles JMLR 2025 Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency ICLR 2025