惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

The GitHub Blog
The GitHub Blog
V2EX - 技术
V2EX - 技术
T
Threat Research - Cisco Blogs
Threat Intelligence Blog | Flashpoint
Threat Intelligence Blog | Flashpoint
T
Tor Project blog
Project Zero
Project Zero
cs.CL updates on arXiv.org
cs.CL updates on arXiv.org
C
Cybersecurity and Infrastructure Security Agency CISA
T
Tenable Blog
P
Privacy & Cybersecurity Law Blog
AWS News Blog
AWS News Blog
Scott Helme
Scott Helme
C
Cisco Blogs
Application and Cybersecurity Blog
Application and Cybersecurity Blog
O
OpenAI News
P
Privacy International News Feed
Google Online Security Blog
Google Online Security Blog
SecWiki News
SecWiki News
The Last Watchdog
The Last Watchdog
NISL@THU
NISL@THU
Attack and Defense Labs
Attack and Defense Labs
G
GRAHAM CLULEY
Security Latest
Security Latest
Help Net Security
Help Net Security
C
Cyber Attacks, Cyber Crime and Cyber Security
Hugging Face - Blog
Hugging Face - Blog
月光博客
月光博客
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
A
Arctic Wolf
Security Archives - TechRepublic
Security Archives - TechRepublic
S
Security @ Cisco Blogs
腾讯CDC
S
Secure Thoughts
WordPress大学
WordPress大学
P
Proofpoint News Feed
H
Help Net Security
Simon Willison's Weblog
Simon Willison's Weblog
小众软件
小众软件
M
MIT News - Artificial intelligence
博客园 - 叶小钗
IT之家
IT之家
G
Google Developers Blog
博客园 - 聂微东
Google DeepMind News
Google DeepMind News
Microsoft Security Blog
Microsoft Security Blog
Hacker News - Newest:
Hacker News - Newest: "LLM"
Google DeepMind News
Google DeepMind News
N
News and Events Feed by Topic
N
News and Events Feed by Topic

stat.ML updates on arXiv.org

Adaptive multi-fidelity optimization with fast learning rates Enhancing AI and Dynamical Subseasonal Forecasts with Probabilistic Bias Correction Sample Complexity Bounds for Stochastic Shortest Path with a Generative Model The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Stylistic-STORM (ST-STORM) : Perceiving the Semantic Nature of Appearance Collective Kernel EFT for Pre-activation ResNets PRIM-cipal components analysis One-Shot Generative Flows: Existence and Obstructions Structural interpretability in SVMs with truncated orthogonal polynomial kernels Amortized Optimal Transport from Sliced Potentials MinShap: A Modified Shapley Value Approach for Feature Selection Unsupervised feature selection using Bayesian Tucker decomposition Multi-User mmWave Beam and Rate Adaptation via Combinatorial Satisficing Bandits Best of both worlds: Stochastic & adversarial best-arm identification Scalable Model-Based Clustering with Sequential Monte Carlo Expert-Guided Class-Conditional Goodness-of-Fit Scores for Interpretable Classification with Informative Missingness: An Application to Seismic Monitoring Lightweight Geometric Adaptation for Training Physics-Informed Neural Networks Gating Enables Curvature: A Geometric Expressivity Gap in Attention Zeroth-Order Optimization at the Edge of Stability Differentially Private Conformal Prediction CLion: Efficient Cautious Lion Optimizer with Enhanced Generalization Generative Augmented Inference Improving Machine Learning Performance with Synthetic Augmentation PAC-MCTS: Bias-Aware Pruning for Robust LLM-Guided Search and Planning Path-Sampled Integrated Gradients Heat and Matérn Kernels on Matchings Doubly Outlier-Robust Online Infinite Hidden Markov Model Momentum Further Constrains Sharpness at the Edge of Stochastic Stability Multistage Conditional Compositional Optimization BOAT: Navigating the Sea of In Silico Predictors for Antibody Design via Multi-Objective Bayesian Optimization Sandpile Economics: Theory, Identification, and Evidence Online learning with noisy side observations Spectral Thompson sampling Covariance-adapting algorithm for semi-bandits with application to sparse rewards Ordinary Least Squares is a Special Case of Transformer Metric-Aware Principal Component Analysis (MAPCA):A Unified Framework for Scale-Invariant Representation Learning Robust Low-Rank Tensor Completion based on M-product with Weighted Correlated Total Variation and Sparse Regularization Joint Representation Learning and Clustering via Gradient-Based Manifold Optimization Universality of Gaussian-Mixture Reverse Kernels in Conditional Diffusion Interpretable and Explainable Surrogate Modeling for Simulations: A State-of-the-Art Survey and Perspectives on Explainable AI for Decision-Making Estimating Continuous Treatment Effects with Two-Stage Kernel Ridge Regression A short proof of near-linear convergence of adaptive gradient descent under fourth-order growth and convexity Some Theoretical Limitations of t-SNE Bias-Corrected Adaptive Conformal Inference for Multi-Horizon Time Series Forecasting Identifiability of Potentially Degenerate Gaussian Mixture Models With Piecewise Affine Mixing Rare Event Analysis via Stochastic Optimal Control Adaptive Learning via Off-Model Training and Importance Sampling for Fully Non-Markovian Optimal Stochastic Control. Complete version Generalization Guarantees on Data-Driven Tuning of Gradient Descent with Langevin Updates Minimizing classical resources in variational measurement-based quantum computation for generative modeling Deep Learning for Sequential Decision Making under Uncertainty: Foundations, Frameworks, and Frontiers ADD for Multi-Bit Image Watermarking Beyond Fixed False Discovery Rates: Post-Hoc Conformal Selection with E-Variables Regional Explanations: Bridging Local and Global Variable Importance ShapShift: Explaining Model Prediction Shifts with Subgroup Conditional Shapley Values Cost-optimal Sequential Testing via Doubly Robust Q-learning Query Lower Bounds for Diffusion Sampling Tail-Aware Information-Theoretic Generalization for RLHF and SGLD Beyond Augmented-Action Surrogates for Multi-Expert Learning-to-Defer Hierarchical Kernel Transformer: Multi-Scale Attention with an Information-Theoretic Approximation Analysis Policy-Aware Design of Large-Scale Factorial Experiments Towards Verified and Targeted Explanations through Formal Methods Portfolio Optimization Proxies under Label Scarcity and Regime Shifts via Bayesian and Deterministic Students under Semi-Supervised Sandwich Training Spectral methods: crucial for machine learning, natural for quantum computers? The Devil Is in Gradient Entanglement: Energy-Aware Gradient Coordinator for Robust Generalized Category Discovery A Tutorial Review of Bayesian Optimization with Gaussian Processes to Accelerate Stationary Point Searches Certified and accurate computation of function space norms of deep neural networks Mini-Batch Covariance, Diffusion Limits, and Oracle Complexity in Stochastic Gradient Descent: A Sampling-Design Perspective Conformal Policy Control Diagnostics for Individual-Level Prediction Instability in Machine Learning for Healthcare Neural Networks With Dense Weights Are Not Universal Approximators Continuous-time reinforcement learning: ellipticity enables model-free value function approximation Scalable spatial point process models for forensic footwear analysis A Review of Diffusion-based Simulation-Based Inference: Foundations and Applications in Non-Ideal Data Scenarios Active Learning with Selective Time-Step Acquisition for PDEs Joint Score-Threshold Optimization for Interpretable Risk Assessment Revisiting Entropy Regularization: Adaptive Coefficient Unlocks Its Potential for LLM Reinforcement Learning Discrete Guidance Matching: Exact Guidance for Discrete Flow Matching PnP-CM: Consistency Models as Plug-and-Play Priors for Inverse Problems Online Distributionally Robust LLM Alignment via Regression to Relative Reward Heavy-Tailed Class-Conditional Priors for Long-Tailed Generative Modeling Random Walk Learning and the Pac-Man Attack Sequential Regression Learning with Randomized Algorithms Diagnosing and Improving Diffusion Models by Estimating the Optimal Loss Value Random Matrix Theory for Deep Learning: Beyond Eigenvalues of Linear Models Scalable Spatiotemporal Inference with Biased Scan Attention Transformer Neural Processes Towards AI-assisted Neutrino Flavor Theory Design Towards Reasonable Concept Bottleneck Models Practical estimation of the optimal classification error with soft labels and calibration Flow-based Generative Modeling of Potential Outcomes and Counterfactuals The Gaussian Latent Machine: Efficient Prior and Posterior Sampling for Inverse Problems Two-Dimensional Deep ReLU CNN Approximation for Korobov Functions: A Constructive Approach FSPO: Few-Shot Optimization of Synthetic Preferences Personalizes to Real Users Identifying Information from Observations with Uncertainty and Novelty A ghost mechanism: An analytical model of abrupt learning in recurrent networks A Multiparty Homomorphic Encryption Approach to Confidential Federated Kaplan Meier Survival Analysis Large Language Models for Market Research: A Data-augmentation Approach Transformer Neural Processes - Kernel Regression FIT-GNN: Faster Inference Time for GNNs that 'FIT' in Memory Using Coarsening Estimating Joint Interventional Distributions from Marginal Interventional Data Nonparametric Sparse Online Learning of the Koopman Operator
Understanding Quantization-Aware Training: Gradients at Quantized Weights Bias to the Low-Loss Basin
Hanyang Li, Jianhao Ma, Ying Cui · 2026-06-08 · via stat.ML updates on arXiv.org

Post-training quantization (PTQ) converts a trained full-precision model into low-bit weights without task-level retraining, while quantization-aware training (QAT) incorporates quantization into the training loop. Although PTQ is efficient and often accurate at moderate bitwidths, it can fail sharply at aggressive bitwidths; QAT is more expensive but can often recover the lost accuracy. We propose a unified geometric framework that explains both PTQ failure and QAT recovery. We model full-precision training as following a low-loss \emph{river} inside a wider \emph{valley}: a normal neighborhood of the river forms a nearly flat \emph{basin}, while leaving this basin incurs a sharp loss increase. When the quantization grid is comparable to the basin width, local PTQ objectives, including rounding and Hessian-based second-order reconstruction, can select a high-loss deployed quantized point outside the basin even when nearby low-loss quantized points exist. In this regime, straight-through-estimator-based QAT has a useful bias: it evaluates gradients at the deployed quantized weights while updating latent full-precision weights, causing the gradient to sense the valley wall and acquire an inward component that steers subsequent quantized iterates back into the basin. We formalize this mechanism through a local landscape model, construct a geometric PTQ failure mode, and prove finite-time QAT recovery under local quantizer-compatibility assumptions. Experiments across vision and language models under multiple neural-network quantization schemes corroborate the predicted basin-crossing failure of PTQ and the corresponding recovery mechanism of QAT.