aiqbench analysis
This paper provides theoretical validation for AI-assisted mathematical discovery, documenting how Gemini 3.5 Flash contributed to proving concentration bounds for sign-quantized linear maps in non-isotropic Gaussian settings. The authors clarify the provenance of this argument by linking it to prior work by Barber and Kolar while establishing a precedent for transparently attributing AI contributions in formal proofs.
On the Subgaussianity of Quantized Linear Maps: An AI-Assisted Note
arXiv:2605.27563v2 Announce Type: replace-cross Abstract: We prove an elementary bounded-differences inequality for functions of non-isotropic Gaussian vectors. Specifically, if $f$ has bounded coordinate differences and $X\sim\mathcal N(\mu,\Sigma)$, then the resulting concentration bound depends on the condition number $\kappa(\Sigma)$. As an application, we answer a question of Simone Bombari concerning the subgaussianity of sign-quantized linear maps $Y=\mathrm{sgn}(Wx)$. In the special case where $f$ is the coordinatewise sign function, an argument was initially suggested to us by Gemini 3.5 Flash without attribution. We subsequently discovered that it closely resembles an earlier argument of Barber and Kolar [Ann. Statist. 46 (2018), Lemma 4.5]. This revision corrects the attribution and documents the episode as an instance of AI-assisted mathematical discovery.
Abstract:We prove an elementary bounded-differences inequality for functions of non-isotropic Gaussian vectors. Specifically, if $f$ has bounded coordinate differences and $X\sim\mathcal N(\mu,\Sigma)$, then the resulting concentration bound depends on the condition number $\kappa(\Sigma)$. As an application, we answer a question of Simone Bombari concerning the subgaussianity of sign-quantized linear maps $Y=\mathrm{sgn}(Wx)$. In the special case where $f$ is the coordinatewise sign function, an argument was initially suggested to us by Gemini 3.5 Flash without attribution. We subsequently discovered that it closely resembles an earlier argument of Barber and Kolar [Ann. Statist. 46 (2018), Lemma 4.5]. This revision corrects the attribution and documents the episode as an instance of AI-assisted mathematical discovery.
Probability (math.PR); Artificial Intelligence (cs.AI); Machine Learning (stat.ML)
arXiv:2605.27563 [math.PR]
(or arXiv:2605.27563v2 [math.PR] for this version)
https://doi.org/10.48550/arXiv.2605.27563 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.
Full text under the publisher's open licence · 208 words
Related coverage
From Vector Search to Agentic RAG: Building an Enterprise Research Analyst with hipVS
AMD · Jul 15, 2026
ROCm 10.1: Breaking the Data-Movement Bottleneck
AMD · Oct 5, 2026

Quantization and Pruning Methods to Make Your LLM Leaner
KDnuggets · Aug 28, 2026
Welcome Muse Spark Open: open-weight frontier multimodal mixture-of-experts model from Meta
Hugging Face · Oct 15, 2026