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

推荐订阅源

cs.CL updates on arXiv.org
cs.CL updates on arXiv.org
B
Blog RSS Feed
宝玉的分享
宝玉的分享
腾讯CDC
博客园_首页
T
Tailwind CSS Blog
月光博客
月光博客
博客园 - 司徒正美
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
M
MIT News - Artificial intelligence
A
About on SuperTechFans
云风的 BLOG
云风的 BLOG
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
有赞技术团队
有赞技术团队
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
大猫的无限游戏
大猫的无限游戏
MongoDB | Blog
MongoDB | Blog
博客园 - 聂微东
V
Visual Studio Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More
SecWiki News
SecWiki News
美团技术团队
P
Privacy International News Feed
H
Help Net Security
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
Microsoft Security Blog
Microsoft Security Blog
Know Your Adversary
Know Your Adversary
Y
Y Combinator Blog
D
DataBreaches.Net
Project Zero
Project Zero
T
The Blog of Author Tim Ferriss
Cyberwarzone
Cyberwarzone
C
Cybersecurity and Infrastructure Security Agency CISA
C
Cisco Blogs
S
Schneier on Security
G
GRAHAM CLULEY
博客园 - 三生石上(FineUI控件)
Cisco Talos Blog
Cisco Talos Blog
小众软件
小众软件
Forbes - Security
Forbes - Security
D
Docker
T
Tenable Blog
S
Secure Thoughts
雷峰网
雷峰网
S
Security @ Cisco Blogs
T
The Exploit Database - CXSecurity.com
The Cloudflare Blog
博客园 - 【当耐特】
Spread Privacy
Spread Privacy
阮一峰的网络日志
阮一峰的网络日志

stat updates on arXiv.org

Can Adaptive Gradient Methods Converge under Heavy-Tailed Noise? A Case Study of AdaGrad Shallow ReLU$^s$ Networks in $L^p$-Type and Sobolev Spaces: Approximation and Path-Norm Controlled Generalization On Stability and Decomposition of Sample Quantiles under Heavy-Tailed Distributions Improved Baselines with Representation Autoencoders Symmetry-Compatible Principle for Optimizer Design: Embeddings, LM Heads, SwiGLU MLPs, and MoE Routers Feature Learning in Linear-Width Two-Layer Networks: Two vs. One Step of Gradient Descent A Two-Parameter Weibull Framework for Diagnosing Transformer Weight Distributions Calibeating for general proper losses: A Bregman divergence approach Dimension-Free Convergence of Discrete Diffusion Models: Adjoint Equations Induce the Right Space Sample-efficient inductive matrix completion with noise and inexact side-information Multi-task Linear Regression without Eigenvalue Lower Bounds: Adaptivity, Robustness, and Safety XAI and Statistical Analysis for Reliable Intrusion Detection in the UAVIDS-2025 Dataset: From Tree to Hybrid and Tabular DNN Ensembles Reasoning Models Don't Just Think Longer, They Move Differently TabPFN-3: Technical Report Reframing preprocessing selection as model-internal calibration in near-infrared spectroscopy: A large-scale benchmark of operator-adaptive PLS and Ridge models Towards a holistic understanding of Selection Bias for Causal Effect Identification Adaptive Kernel Density Estimation with Pre-training Coreset-Induced Conditional Velocity Flow Matching RISED: A Pre-Deployment Evaluation Framework for High-Stakes AI Decision-Support Systems, with Application to Healthcare ISOMORPH: A Supply Chain Digital Twin for Simulation, Dataset Generation, and Forecasting Benchmarks Yield Curves Dynamics Using Variational Autoencoders Under No-arbitrage Model-based Bootstrap of Controlled Markov Chains Online Learning-to-Defer with Varying Experts Self-Supervised Laplace Approximation for Bayesian Uncertainty Quantification Keeping Score: Efficiency Improvements in Neural Likelihood Surrogate Training via Score-Augmented Loss Functions One-Step Generative Modeling via Wasserstein Gradient Flows Exact Stiefel Optimization for Probabilistic PLS: Closed-Form Updates, Error Bounds, and Calibrated Uncertainty A Composite Activation Function for Learning Stable Binary Representations Adaptive Calibration in Non-Stationary Environments Real vs. Semi-Simulated: Rethinking Evaluation for Treatment Effect Estimation Federated Language Models Under Bandwidth Budgets: Distillation Rates and Conformal Coverage On Variance Reduction in Learning Mean Flows When Attention Beats Fourier: Multi-Scale Transformers for PDE Solving on Irregular Domains A Refined Generalization Analysis for Extreme Multi-class Supervised Contrastive Representation Learning Ensemble Distributionally Robust Bayesian Optimisation The Proxy Presumption: From Semantic Embeddings to Valid Social Measures Modulated learning for private and distributed regression with just a single sample per client device Query-efficient model evaluation using cached responses Order-Agnostic Autoregressive Modelling with Missing Data Grokking or Glitching? How Low-Precision Drives Slingshot Loss Spikes Tuning Derivatives for Causal Fairness in Machine Learning Spherical Flows for Sampling Categorical Data Bayesian Rain Field Reconstruction using Commercial Microwave Links and Diffusion Model Priors Unified Framework of Distributional Regret in Multi-Armed Bandits and Reinforcement Learning Jacobian-Velocity Bounds for Deployment Risk Under Covariate Drift Self-Attention as Transport: Limits of Symmetric Spectral Diagnostics Graph Convolutional Support Vector Regression for Robust Spatiotemporal Forecasting of Urban Air Pollution Stochastic Schrödinger Diffusion Models for Pure-State Ensemble Generation Understanding Self-Supervised Learning via Latent Distribution Matching Imbalanced Classification under Capacity Constraints On the Spectral Structure and Objective Equivalence of Orthogonal Multilabel Fisher Discriminants Partially Observed Structural Causal Models Robust and Fast Training via Per-Sample Clipping Efficient Preference Poisoning Attack on Offline RLHF Joint Energy Management and Coordinated AIGC Workload Scheduling for Distributed Data Centers: A Diffusion-Aided Reward Shaping Approach Distributional Causal Mediation via Conditional Generative Modeling A Theory of Saddle Escape in Deep Nonlinear Networks Adaptive Querying with AI Persona Priors Optimal Spatio-Temporal Decoupling for Bayesian Conformal Prediction Wasserstein Distributionally Robust Regret Optimization for Reinforcement Learning from Human Feedback Electricity price forecasting across Norway's five bidding zones in the post-crisis era Adversarial Robustness of NTK Neural Networks Identifiability and Stability of Generative Drifting with Companion-Elliptic Kernel Families A Limit Theory of Foundation Models: A Mathematical Approach to Understanding Emergent Intelligence and Scaling Laws Conditional Score-Based Modeling of Effective Langevin Dynamics Inference of Online Newton Methods with Nesterov's Accelerated Sketching ProEval: Proactive Failure Discovery and Efficient Performance Estimation for Generative AI Evaluation Score-Repellent Monte Carlo: Toward Efficient Non-Markovian Sampler with Constant Memory in General State Spaces Learning to Emulate Chaos: Adversarial Optimal Transport Regularization Geometric Layer-wise Approximation Rates for Deep Networks S2MAM: Semi-supervised Meta Additive Model for Robust Estimation and Variable Selection Beyond Coefficients: Forecast-Necessity Testing for Interpretable Causal Discovery in Nonlinear Time-Series Models Curiosity-Critic: Cumulative Prediction Error Improvement as a Tractable Intrinsic Reward for World Model Training Knowing When to Quit: A Principled Framework for Dynamic Abstention in LLM Reasoning Enhancing AI and Dynamical Subseasonal Forecasts with Probabilistic Bias Correction Zeroth-Order Optimization at the Edge of Stability Generative Augmented Inference Estimating Continuous Treatment Effects with Two-Stage Kernel Ridge Regression 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 Beyond Fixed False Discovery Rates: Post-Hoc Conformal Selection with E-Variables Beyond Augmented-Action Surrogates for Multi-Expert Learning-to-Defer Spatio-temporal probabilistic forecast using MMAF-guided learning Conformal Policy Control The Implicit Curriculum: Learning Dynamics in RL with Verifiable Rewards Probabilistic NDVI Forecasting from Sparse Satellite Time Series and Weather Covariates Constrained Policy Optimization with Cantelli-Bounded Value-at-Risk Factorizable joint shift revisited Feature Learning Dynamics in Infinite-Depth Neural Networks Statistically-Guided Meta-Learning for Cross-Deployment Activity Recognition in Distributed Fiber-Optic Sensing DAPS++: Rethinking Diffusion Inverse Problems with Decoupled Posterior Annealing Branching Flows: Discrete, Continuous, and Manifold Flow Matching with Splits and Deletions Neural ARFIMA model for forecasting BRIC exchange rates with long memory Neural Stochastic Differential Equations on Compact State Spaces: Theory, Methods, and Application to Suicide Risk Modeling BOOST: A Data-Driven Framework for the Automated Joint Selection of Kernel and Acquisition Functions in Bayesian Optimization Random Walk Learning and the Pac-Man Attack Random Matrix Theory for Deep Learning: Beyond Eigenvalues of Linear Models Post-Training Augmentation Invariance Optimizing LLM Inference: Fluid-Guided Online Scheduling with Memory Constraints Dataset-Driven Channel Masks in Transformers for Multivariate Time Series
The Efficiency Frontier: Classical Shadows versus Quantum Footage
Shuowei Ma, Junyu Liu · 2025-09-08 · via stat updates on arXiv.org

Interfacing quantum and classical processors is an important subroutine in full-stack quantum algorithms. The so-called "classical shadow" method efficiently extracts essential classical information from quantum states, enabling the prediction of many properties of a quantum system from only a few measurements. However, for a small number of highly non-local observables, or when classical post-processing power is limited, the classical shadow method is not always the most efficient choice. Here, we address this issue quantitatively by performing a full-stack resource analysis that compares classical shadows with "quantum footage," which refers to direct quantum measurement. Under certain assumptions, our analysis illustrates a boundary of download efficiency between classical shadows and quantum footage. For observables expressed as linear combinations of Pauli matrices, the classical shadow method outperforms direct measurement when the number of observables is large and the Pauli weight is small. For observables in the form of large Hermitian sparse matrices, the classical shadow method shows an advantage when the number of observables, the sparsity of the matrix, and the number of qubits fall within a certain range. The key parameters influencing this behavior include the number of qubits $n$, observables $M$, sparsity $k$, Pauli weight $w$, accuracy requirement $ε$, and failure tolerance $δ$. We also compare the resource consumption of the two methods on different types of quantum computers and identify break-even points where the classical shadow method becomes more efficient, which vary depending on the hardware. This paper opens a new avenue for quantitatively designing optimal strategies for hybrid quantum-classical tomography and provides practical insights for selecting the most suitable quantum measurement approach in real-world applications.