analiza aiqbench
This research proposes using idle inference resources to subsidize training costs by predicting gradients via control variates, effectively converting approximation error into manageable variance rather than bias. While the method shows potential for reducing simulated compute expenses on specific model sizes and training windows, it relies on a theoretical ledger rather than testing dedicated inference-only hardware or full distributed latency scenarios. The study highlights a nuanced trade-off where cost savings are contingent on fleet work being sufficiently cheap to offset the inherent approximation risks in this regime.
Gradient Prediction with Control Variates in the Cheap-Forward Regime
arXiv:2511.05187v2 Announce Type: replace Abstract: We study whether otherwise-idle inference resources could reduce the scarce-GPU cost of training. Our analysis uses a simulated compute ledger in which fleet work is billed at a fraction of a scarce-GPU forward; all experiments run on a regular GPU. Our algorithm predicts gradients with a reduced-precision, inference-style reverse-mode program and combines many predictions with a few exact gradients through a control variate, so approximation error becomes variance rather than bias. On a 124M-parameter language model and selected short training windows, the method can lower simulated ledger cost relative to the tested baselines when fleet work is sufficiently cheap. Experiments spanning 10M-774M parameters show both transfers and failures. We do not test inference-only hardware, end-to-end distributed latency, or a full optimizer-by-batch-size baseline sweep.
Abstract:We study whether otherwise-idle inference resources could reduce the scarce-GPU cost of training. Our analysis uses a simulated compute ledger in which fleet work is billed at a fraction of a scarce-GPU forward; all experiments run on a regular GPU. Our algorithm predicts gradients with a reduced-precision, inference-style reverse-mode program and combines many predictions with a few exact gradients through a control variate, so approximation error becomes variance rather than bias. On a 124M-parameter language model and selected short training windows, the method can lower simulated ledger cost relative to the tested baselines when fleet work is sufficiently cheap. Experiments spanning 10M-774M parameters show both transfers and failures. We do not test inference-only hardware, end-to-end distributed latency, or a full optimizer-by-batch-size baseline sweep.
Machine Learning (cs.LG); Machine Learning (stat.ML)
arXiv:2511.05187 [cs.LG]
(or arXiv:2511.05187v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2511.05187 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 218 cuvinte
Subiecte conexe

Build a Physical AI model factory with NVIDIA Cosmos 3 on SageMaker HyperPod
AWS · 4 sept. 2026
J++ Lens: Jacobian Filtering Enables More Faithful Workspace Lenses
LessWrong · 8 oct. 2026
Look Before You Steer: Geometry Predicts SAE Feature Steerability
arXiv · 22 sept. 2026

Continual learning might make your blocking monitors nearly useless
AI Alignment Forum · 24 sept. 2026