Efficient Training papers, 2023–2026

Key findings

• Efficient Training went from 346 papers in 2023 to 603 in 2026, roughly 1.7x in three years.
• NeurIPS publishes the most Efficient Training work: 499 papers from 2023 to 2026, 28% of the four-venue total.
• The fastest-growing overlap is with Deep learning · large language models: papers tagged with both rose from 6 in 2023 to 50 in 2026.
• Among the 5 topics under Efficiency and Systems, it ranks #3 by 2026 paper count; the fastest grower in the group, Hardware-Aware ML, is up 4.4x versus 1.7x here.

Representative papers

Spread across years and venues so every edition shows up

• NeurIPS 2026Adaptive Residual Quantization for Memory-Efficient Temporal Action Segmentation
• ICML 2026A Geometry-Aware Efficient Algorithm for Compositional Entropic Risk Minimization
• ICLR 2026An Efficient SE(p)-Invariant Transport Metric Driven by Polar Transport Discrepancy-based Representation
• CVPR 2026A Bit is All You Need Efficient Video Capture via
• NeurIPS 20254DGCPro: Efficient Hierarchical 4D Gaussian Compression for Progressive Volumetric Video Streaming
• ICML 2025A Sample Efficient Conditional Independence Test in the Presence of Discretization
• ICLR 2025Breaking Class Barriers: Efficient Dataset Distillation via Inter-Class Feature Compensator
• CVPR 2025Accurate Scene Text Recognition with Efficient Model Scaling and Cloze Self-Distillation
• NeurIPS 2024$\texttt{dattri}$: A Library for Efficient Data Attribution
• ICML 2024A fast algorithm to simulate nonlinear resistive networks
• ICLR 2024Dictionary Contrastive Learning for Efficient Local Supervision without Auxiliary Networks
• CVPR 2024Deep-TROJ: An Inference Stage Trojan Insertion Algorithm through Efficient Weight Replacement Attack
• NeurIPS 2023Alternating Updates for Efficient Transformers
• ICML 2023Auxiliary Modality Learning with Generalized Curriculum Distillation
• ICLR 2023A Model or 603 Exemplars: Towards Memory-Efficient Class-Incremental Learning
• CVPR 2023A Rotation-Translation-Decoupled Solution for Robust and Efficient Visual-Inertial Initialization
• NeurIPS 2026Advanced Routing as Regularization Allocation for Efficient Diffusion Transformer Training
• ICML 2026Active Learning with Foundation Model Priors: Efficient Learning under Class Imbalance
• ICLR 2026AQER: A Scalable and Efficient Data Loader for Digital Quantum Computers
• CVPR 2026Adaptive Bayesian Early-Exit Networks for Efficient Non-Transferable Learning

All Efficient Training papers

492 papers, page 4 of 10

151. ICML 2026Swordsman: Entropy-Driven Adaptive Block Partition for Efficient Diffusion Language Models
152. ICML 2026TabPack: Efficient Hyperparameter Ensembles for Tabular Deep Learning
153. ICML 2026TetraJet-v2: Accurate NVFP4 Training for Large Language Models with Oscillation Suppression and Outlier Control
154. ICML 2026ToaSt: Token Channel Selection and Structured Pruning for Efficient ViT
155. ICML 2026Token Sparse Attention: Efficient Long-Context Inference with Interleaved Token Selection
156. ICML 2026TokenDrop: Token-Level Importance-Aware Backward Propagation Skipping for Efficient LLM Fine-Tuning
157. ICML 2026Towards Resource-Efficient LLMs: End-to-End Energy Accounting of Distillation Pipelines
158. ICML 2026Training-Free Hashing-Based Attention via Binary Principal Components
159. ICML 2026Turning Back Without Forgetting: Selective Backward Refinement for Parameter-Efficient Continual Learning
160. ICML 2026Turning Stale Gradients into Stable Gradients: Coherent Coordinate Descent with Implicit Landscape Smoothing for Lightweight Zeroth-Order Optimization
161. ICML 2026UniFast-HGR: Scalable and Efficient Maximal Correlation for Multimodal Models
162. ICML 2026Unifying Dataset Pruning and Distillation for Efficient Large-scale Compression
163. ICML 2026Unifying Stacking and Cascading for Efficient Ensemble Inference
164. ICML 2026Universal One-third Time Scaling in Learning Peaked Distributions
165. ICML 2026Untied Ulysses: Memory-Efficient Context Parallelism via Headwise Chunking
166. ICML 2026Utility Boundary of Dataset Distillation: Scaling and Coverage Laws
167. ICML 2026WAVE: Window-Aware Vocabulary-Efficient Early-Exit for Training-Free LLM Acceleration
168. ICML 2026WBMM: Windowed Batch Matrix Multiplication for Efficient Large Receptive Field Convolution
169. ICML 2026ZipMoE: Efficient On-Device MoE Serving via Lossless Compression and Cache-Affinity Scheduling
170. ICML 2025A Hitchhiker's Guide to Scaling Law Estimation
171. ICML 2025A Memory Efficient Randomized Subspace Optimization Method for Training Large Language Models
172. ICML 2025A Sample Efficient Conditional Independence Test in the Presence of Discretization
173. ICML 2025A Simple Model of Inference Scaling Laws
174. ICML 2025Adapting Precomputed Features for Efficient Graph Condensation
175. ICML 2025An Adaptive Orthogonal Convolution Scheme for Efficient and Flexible CNN Architectures
176. ICML 2025An Efficient Matrix Multiplication Algorithm for Accelerating Inference in Binary and Ternary Neural Networks
177. ICML 2025An Efficient Pruner for Large Language Model with Theoretical Guarantee
178. ICML 2025An Efficient Search-and-Score Algorithm for Ancestral Graphs using Multivariate Information Scores for Complex Non-linear and Categorical Data
179. ICML 2025An Expressive and Self-Adaptive Dynamical System for Efficient Function Learning
180. ICML 2025Beyond Low-rank Decomposition: A Shortcut Approach for Efficient On-Device Learning
181. ICML 2025Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs
182. ICML 2025BlockDialect: Block-wise Fine-grained Mixed Format Quantization for Energy-Efficient LLM Inference
183. ICML 2025BSLoRA: Enhancing the Parameter Efficiency of LoRA with Intra-Layer and Inter-Layer Sharing
184. ICML 2025COKE: Core Kernel for More Efficient Approximation of Kernel Weights in Multiple Kernel Clustering
185. ICML 2025Complete-Tree Space Favors Data-Efficient Link Prediction
186. ICML 2025Compositional Generalization via Forced Rendering of Disentangled Latents
187. ICML 2025Connecting Thompson Sampling and UCB: Towards More Efficient Trade-offs Between Privacy and Regret
188. ICML 2025Cost-efficient Collaboration between On-device and Cloud Language Models
189. ICML 2025DA-KD: Difficulty-Aware Knowledge Distillation for Efficient Large Language Models
190. ICML 2025Determinant Estimation under Memory Constraints and Neural Scaling Laws
191. ICML 2025Distillation Scaling Laws
192. ICML 2025Does Data Scaling Lead to Visual Compositional Generalization?
193. ICML 2025EAGLES: Towards Effective, Efficient, and Economical Federated Graph Learning via Unified Sparsification
194. ICML 2025Earley-Driven Dynamic Pruning for Efficient Structured Decoding
195. ICML 2025Efficient and Separate Authentication Image Steganography Network
196. ICML 2025Efficient ANN-SNN Conversion with Error Compensation Learning
197. ICML 2025Efficient Bisection Projection to Ensure Neural-Network Solution Feasibility for Optimization over General Set
198. ICML 2025Efficient Core-set Selection for Deep Learning Through Squared Loss Minimization
199. ICML 2025Efficient Federated Incomplete Multi-View Clustering
200. ICML 2025Efficient Graph Continual Learning via Lightweight Graph Neural Tangent Kernels-based Dataset Distillation

FAQ

How many Efficient Training papers were published at NeurIPS, ICLR, ICML and CVPR from 2023 to 2026?

1,765 in total: 346 in 2023, 300 in 2024, 516 in 2025, 603 in 2026.

How many Efficient Training papers are at NeurIPS 2026?

NeurIPS 2026 has 177 Efficient Training papers, versus 190 the year before.

How many Efficient Training papers are at ICLR 2026?

ICLR 2026 has 148 Efficient Training papers, versus 126 the year before.

How many Efficient Training papers are at ICML 2026?

ICML 2026 has 169 Efficient Training papers, versus 118 the year before.

How many Efficient Training papers are at CVPR 2026?

CVPR 2026 has 109 Efficient Training papers, versus 82 the year before.

Which conference publishes the most Efficient Training papers?

NeurIPS, with 499 papers from 2023 to 2026.