aiqbench analysis
This research proposes Gaussian averaging as a smooth surrogate technique to stabilize quantized neural networks, effectively bridging the gap between discontinuous activation functions and continuous stability analysis. By deriving closed-form averages for ReLU and sign activations, the study provides a rigorous mathematical framework for handling quantization noise in high-dimensional binary perceptrons without relying on empirical heuristics. The work advances theoretical machine learning by offering explicit bounds that link smoothing mechanisms to inference-side performance improvements.
Local Stability and Gaussian Smoothing of Quantized Neural Networks
arXiv:2607.20153v1 Announce Type: new Abstract: We study Gaussian averaging as a smooth surrogate for quantized neural models. Under bounded local oscillation, we derive a local dimension-dependent bound on |f-g|, linking Gaussian smoothing to the stability analysis of discontinuous networks. We compute closed-form Gaussian averages of the rectified linear unit (ReLU) and sign activation functions, and illustrate the mechanism on a high-dimensional binary perceptron, where layer-preactivation aggregation under an explicit quantization-noise surrogate yields the Gaussian envelope used in inference-side smoothing and training-side smooth surrogate gradients.
Abstract:We study Gaussian averaging as a smooth surrogate for quantized neural models. Under bounded local oscillation, we derive a local dimension-dependent bound on |f-g|, linking Gaussian smoothing to the stability analysis of discontinuous networks. We compute closed-form Gaussian averages of the rectified linear unit (ReLU) and sign activation functions, and illustrate the mechanism on a high-dimensional binary perceptron, where layer-preactivation aggregation under an explicit quantization-noise surrogate yields the Gaussian envelope used in inference-side smoothing and training-side smooth surrogate gradients.
Machine Learning (cs.LG); Systems and Control (eess.SY); Optimization and Control (math.OC)
I.2.6; I.5.1; I.2.8; G.1.2
arXiv:2607.20153 [cs.LG]
(or arXiv:2607.20153v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2607.20153 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
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.
Full text under the publisher's open licence · 185 words
Related coverage
SoftTri: Smooth Triangular Membership Functions for Adaptive Fuzzy Inference Systems
arXiv · Sep 18, 2026

NVIDIA GTC Taipei at COMPUTEX: Live Updates on What’s Next in AI
NVIDIA · May 21, 2026

[AINews] Reality Checks on AI News (Yegge shuts down Gas Town, Databricks’ +60% Astra cost)
Latent Space · Sep 17, 2026

GEM Training: How Meta Doubled the Efficiency of Its LLM-Scale Ads Foundation Model
Meta Engineering · Aug 3, 2026