ARQ: A Mixed-Precision Quantization Framework for Accurate and Certifiably Robust DNNs
Pith reviewed 2026-05-23 18:12 UTC · model grok-4.3
The pith
ARQ uses reinforcement learning to quantize DNNs in mixed precision while preserving both accuracy and certified robustness from randomized smoothing.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
ARQ is a mixed-precision quantization method that preserves the clean accuracy of the smoothed classifiers and maintains their certified robustness. It uses reinforcement learning to find accurate and robust DNN quantization policies while efficiently leveraging randomized smoothing. ARQ quantized networks reach the performance of the original DNN with floating-point weights while using only 1.5% instructions and the highest certified radius, outperforming multiple state-of-the-art quantization techniques across benchmarks and input perturbation levels.
What carries the argument
Reinforcement learning search over mixed-precision quantization policies that is guided by randomized smoothing to preserve certified robustness bounds.
If this is right
- ARQ quantized networks achieve the same performance as the original floating-point DNNs.
- The quantized models require only 1.5% of the original instructions.
- ARQ maintains the highest certified radius among compared quantization methods.
- The framework outperforms multiple state-of-the-art quantization techniques on all tested benchmarks and perturbation levels.
Where Pith is reading between the lines
- The approach could allow robust DNNs to run on hardware with tight compute budgets while retaining formal security guarantees.
- Similar reinforcement learning searches might be adapted to other statistical certification methods beyond randomized smoothing.
- Reducing the computational overhead of the policy search itself would be a direct next step for scaling to larger models.
Load-bearing premise
Reinforcement learning can locate quantization policies that preserve the certified robustness bounds provided by randomized smoothing without introducing new vulnerabilities or excessive search cost.
What would settle it
An experiment in which the reinforcement learning search returns a policy whose certified radius on a standard image classification benchmark is strictly smaller than that of the unquantized floating-point model.
read the original abstract
Mixed precision quantization has become an important technique for optimizing the execution of deep neural networks (DNNs). Certified robustness, which provides provable guarantees about a model's ability to withstand different adversarial perturbations, has rarely been addressed in quantization due to the unacceptably high cost of certifying robustness. This paper introduces ARQ, an innovative mixed-precision quantization method that not only preserves the clean accuracy of the smoothed classifiers, but also maintains their certified robustness. ARQ uses reinforcement learning to find accurate and robust DNN quantization, while efficiently leveraging randomized smoothing, a popular class of statistical DNN verification algorithms. ARQ consistently performs better than multiple state-of-the-art quantization techniques across all the benchmarks and the input perturbation levels. The performance of ARQ quantized networks reaches that of the original DNN with floating-point weights, while using only 1.5% instructions and the highest certified radius. ARQ's code is available at https://github.com/uiuc-arc/ARQ.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper introduces ARQ, a mixed-precision quantization framework for DNNs that uses reinforcement learning to select quantization policies while leveraging randomized smoothing for certified robustness. It claims that the resulting quantized networks match the clean accuracy and certified radius of the original full-precision floating-point models, while requiring only 1.5% of the instructions, and outperform multiple state-of-the-art quantization methods across benchmarks and perturbation levels.
Significance. If the empirical claims hold after full verification, the work would address an important gap by enabling efficient inference for certifiably robust models, combining quantization with statistical verification in a scalable way. The availability of code is a positive factor for reproducibility.
minor comments (1)
- The abstract states performance matches the original DNN 'while using only 1.5% instructions' but provides no definition of the instruction metric or baseline comparison details.
Simulated Author's Rebuttal
We thank the referee for their review. We appreciate the acknowledgment of the significance of combining mixed-precision quantization with certified robustness via randomized smoothing, as well as the positive note on code availability. The 'uncertain' recommendation appears tied to the need for full empirical verification; our experiments and public code at https://github.com/uiuc-arc/ARQ are intended to support such verification.
Circularity Check
No circularity detectable from available text
full rationale
The provided document consists only of the abstract, which offers a high-level description of ARQ as an RL-based mixed-precision quantization approach that leverages randomized smoothing to preserve both clean accuracy and certified robustness. No equations, derivations, parameter-fitting procedures, self-citations, or uniqueness theorems are stated, so none of the enumerated circularity patterns (self-definitional, fitted-input-called-prediction, etc.) can be exhibited by direct quotation and reduction. The claims remain at the level of empirical methodology without any internal derivation chain that reduces to its own inputs by construction.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption Randomized smoothing yields valid certified robustness radii for the quantized models
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.