mlsanityData to 7 Oct 2026

BurTorch: Revisiting Training from First Principles by Coupling Autodiff, Math Optimization, and Systems

arXiv 2503.13795 ↗First posted 18 Mar 2025cs.LG cs.MScited by 0

Not on the map. Why?

Abstract (arXiv)

In this work, we introduce BurTorch, a compact high-performance framework designed to optimize Deep Learning (DL) training on single-node workstations through an exceptionally efficient CPU-based backpropagation (Rumelhart et al., 1986; Linnainmaa, 1970) implementation. Although modern DL frameworks rely on compilerlike optimizations internally, BurTorch takes a different path. It adopts a minimalist design and demonstrates that, in these circumstances, classical compiled programming languages can play a significant role in DL research. By eliminating the overhead of large frameworks and making efficient implementation choices, BurTorch achieves orders-of-magnitude improvements in performance and memory efficiency when computing nabla f(x) on a CPU. BurTorch features a compact codebase designed to achieve two key goals simultaneously. First, it provides a user experience similar to script-based programming environments. Second, it dramatically minimizes runtime overheads. In large DL frameworks, the primary source of memory overhead for relatively small computation graphs f(x) is due to feature-heavy implementations. We benchmarked BurTorch against widely used DL frameworks in their execution modes: JAX (Bradbury et al., 2018), PyTorch (Paszke et al., 2019), TensorFlow (Abadi et al., 2016); and several standalone libraries: Autograd (Maclaurin et al., 2015), Micrograd (Karpathy, 2020), Apple MLX (Hannun et al., 2023). For small compute graphs, BurTorch outperforms best-practice solutions by up to × 2000 in runtime and reduces memory consumption by up to × 3500. For a miniaturized GPT-3 model (Brown et al., 2020), BurTorch achieves up to a × 20 speedup and reduces memory up to × 80 compared to PyTorch.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 22 of its 67 references that are in the map. First posted on arXiv 18 Mar 2025.

Builds on

22 of 67 references.

References · 22

  1. 2017Attention Is All You Needcited by 59,932
  2. 2020Language Models are Few-Shot Learnerscited by 32,199
  3. 2023Sparks of Artificial General Intelligence: Early experiments with GPT-4cited by 2,579
  4. 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,461
  5. 2016Training Deep Nets with Sublinear Memory Costcited by 825
  6. 2014Caffe: Convolutional Architecture for Fast Feature Embeddingcited by 287
  7. 2019SGD: General Analysis and Improved Ratescited by 206
  8. 2020On Biased Compression for Distributed Learningcited by 140
  9. 2020PAGE: A Simple and Optimal Probabilistic Gradient Estimator for Nonconvex Optimizationcited by 116
  10. 2021MARINA: Faster Non-Convex Distributed Learning with Compressioncited by 77
  11. 2017WRPN: Wide Reduced-Precision Networkscited by 49
  12. 2024MELTing point: Mobile Evaluation of Language Transformerscited by 35
10 more
  1. 2022GACT: Activation Compressed Training for Generic Network Architecturescited by 31
  2. 2020Randomized Automatic Differentiationcited by 23
  3. 2024MicroAdam: Accurate Adaptive Optimization with Low Space Overhead and Provable Convergencecited by 19
  4. 2025Ringmaster ASGD: The First Asynchronous SGD with Optimal Time Complexitycited by 17
  5. 2022Sharper Rates and Flexible Framework for Nonconvex SGD with Client and Data Samplingcited by 9
  6. 2024MindFlayer SGD: Efficient Parallel SGD in the Presence of Heterogeneous and Random Worker Compute Timescited by 5
  7. 2024Error Feedback Reloaded: From Quadratic to Arithmetic Mean of Smoothness Constantscited by 4
  8. 2023Federated Learning is Better with Non-Homomorphic Encryptioncited by 2
  9. 2024Alice's Adventures in a Differentiable Wonderland -- Volume I, A Tour of the Landcited by 1
  10. 2024Unlocking FedNL: Self-Contained Compute-Optimized Implementationcited by 1

Built on by

Not cited yet.