NeuroTrails: Training with Dynamic Sparse Heads as the Key to Effective Ensembling
Not on the map. Why?
Abstract (arXiv)
Model ensembles have long been a cornerstone for improving generalization and robustness in deep learning. However, their effectiveness often comes at the cost of substantial computational overhead. To address this issue, state-of-the-art methods aim to replicate ensemble-class performance without requiring multiple independently trained networks. Unfortunately, these algorithms often still demand considerable compute at inference. In response to these limitations, we introduce NeuroTrails, a sparse multi-head architecture with dynamically evolving topology. This unexplored model-agnostic training paradigm improves ensemble performance while reducing the required resources. We analyze the underlying reason for its effectiveness and observe that the various neural trails induced by dynamic sparsity attain a textitGoldilocks zone of prediction diversity. NeuroTrails displays efficacy with convolutional and transformer-based architectures on computer vision and language tasks. Experiments on ResNet-50/ImageNet, LLaMA-350M/C4, among many others, demonstrate increased accuracy and stronger robustness in zero-shot generalization, while requiring significantly fewer parameters.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 57 of its 85 references that are in the map. First posted on arXiv 23 May 2025.
Builds on
57 of 85 references.
References · 57
- 2017Attention Is All You Needcited by 60,361
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2017On Calibration of Modern Neural Networkscited by 4,960
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,926
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,073
- 2016Wide Residual Networkscited by 3,070
38 more
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,877
- 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,218
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
- 2019Learning Robust Global Representations by Penalizing Local Predictive Powercited by 1,013
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 495
- 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 471
- 2024GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projectioncited by 463
- 2019Deep Ensembles: A Loss Landscape Perspectivecited by 443
- 2020BatchEnsemble: An Alternative Approach to Efficient Ensemble and Lifelong Learningcited by 371
- 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 328
- 2019Sparse Networks from Scratch: Faster Training without Losing Performancecited by 213
- 2020Training independent subnetworks for robust predictioncited by 177
- 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 165
- 2019Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networkscited by 160
- 2015Why M Heads are Better than One: Training a Diverse Ensemble of Deep Networkscited by 139
- 2017Deep Rewiring: Training very sparse deep networkscited by 139
- 2021Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Trainingcited by 110
- 2022The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Trainingcited by 85
- 2021MEST: Accurate and Fast Memory-Economic Sparse Training Framework on the Edgecited by 79
- 2020Gradient Flow in Sparse Neural Networks and How Lottery Tickets Wincited by 77
- 2022The State of Sparse Training in Deep Reinforcement Learningcited by 61
- 2021Federated Dynamic Sparse Training: Computing Less, Communicating Less, Yet Learning Bettercited by 55
- 2021Dynamic Sparse Training for Deep Reinforcement Learningcited by 49
- 2019Sparse evolutionary Deep Learning with over one million artificial neurons on commodity hardwarecited by 48
- 2021Deep Ensembling with No Overhead for either Training or Testing: The All-Round Blessings of Dynamic Sparsitycited by 44
- 2024Mix-LN: Unleashing the Power of Deeper Layers by Combining Pre-LN and Post-LNcited by 37
- 2022RLx2: Training a Sparse Deep Reinforcement Learning Model from Scratchcited by 30
- 2022Dual Lottery Ticket Hypothesiscited by 27
- 2023Joint Training of Deep Ensembles Fails Due to Learner Collusioncited by 23
- 2023Fantastic Weights and How to Find Them: Where to Prune in Dynamic Sparse Trainingcited by 17
- 2021Truly Sparse Neural Networks at Scalecited by 16
- 2022Robust Lottery Tickets for Pre-trained Language Modelscited by 16
- 2022Prune and Tune Ensembles: Low-Cost Ensemble Learning With Sparse Independent Subnetworkscited by 13
- 2023Automatic Noise Filtering with Dynamic Sparse Training in Deep Reinforcement Learningcited by 13
50 most cited of 57 All 57 (JSON)
Built on by
Not cited yet.