Convergence for Discrete Parameter Update Schemes
Not on the map. Why?
Abstract (arXiv)
Modern deep learning models require immense computational resources, motivating research into low-precision training. Quantised training addresses this by representing training components in low-bit integers, but typically relies on discretising real-valued updates. We introduce an alternative approach where the update rule itself is discrete, avoiding the quantisation of continuous updates by design. We establish convergence guarantees for a general class of such discrete schemes, and present a multinomial update rule as a concrete example, supported by empirical evaluation. This perspective opens new avenues for efficient training, particularly for models with inherently discrete structure.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 9 of its 11 references that are in the map. First posted on arXiv 3 Dec 2025.
Builds on
9 of 11 references.
References · 9
- 2016Optimization Methods for Large-Scale Machine Learningcited by 1,140
- 2016Quantized Neural Networks: Training Neural Networks with Low Precision Weights and Activationscited by 413
- 2019Efficient and Accurate Estimation of Lipschitz Constants for Deep Neural Networkscited by 290
- 2020Binary Neural Networks: A Surveycited by 184
- 2018A Survey on Methods and Theories of Quantized Neural Networkscited by 75
- 2017Training Quantized Nets: A Deeper Understandingcited by 74
- 2024Scaling FP8 training to trillion-token LLMscited by 63
- 2025FP4 All the Way: Fully Quantized Training of LLMscited by 37
- 2021Reverse Derivative Ascent: A Categorical Approach to Learning Boolean Circuitscited by 10
Built on by
Not cited yet.