Non-Vacuous Certification of Transport MCMC via Oscillation-Controlled Normalizing Flows
- URL: http://arxiv.org/abs/2606.01078v1
- Date: Sun, 31 May 2026 07:46:48 GMT
- Title: Non-Vacuous Certification of Transport MCMC via Oscillation-Controlled Normalizing Flows
- Abstract summary: Transport MCMC trains a normalizing flow to precondition Metropolis--Hastings proposals.<n>We establish the first numerically non-vacuous, rigorous spectral-gap bound for such samplers.
- Score: 3.8549131582427303
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Transport MCMC trains a normalizing flow to precondition Metropolis--Hastings proposals, achieving high empirical efficiency on challenging posteriors; yet no prior work produces a numerically non-vacuous, rigorous spectral-gap bound for such samplers. We establish the first such bounds. For independence MH on the banana family we certify (γ^\ast = 0.828) at (D = 2) (covering in the original space) and (γ^\ast \ge 7.6\times 10^{-4}) at (D = 5) (covering in an analytically unwarped Gaussian space with a grid-certified gradient bound under the stated numerical Lipschitz certification), both rigorous at 95% confidence. The framework rests on three pillars: (i) spectral normalization with reduced scale clips constrains the flow Lipschitz constant from (10^{47}) to (10^4); (ii) a coverage-based empirical oscillation bound replaces the vacuous analytical bound with a data-dependent certificate; and (iii) oscillation-regularised training cuts the empirical oscillation by 60--90% at no cost to density fit, extending practical certificates through (D = 20) ((γ^\ast \ge 1.7\times 10^{-4})). Tests on four further targets (Gaussian mixture, shear-building, Neal's funnel, Bayesian logistic regression) identify three precise barriers: boundary curvature, target stiffness, and tail-coverage mismatch. An affine-vs-spline comparison shows that simpler architectures yield tighter certificates at identical NLL, inverting the usual expressiveness hierarchy.
Related papers
- The ZZ feature map induces a signless Laplacian metric: a closed-form classical surrogate for quantum kernel regression [0.0]
We prove that in the small-bandwidth regime the induced kernel is, to leading order, an anisotropic Gaussian kernel with metric M = I + pi2 Q.<n>The corresponding classical kernel requires no fitted parameters and no quantum simulation.
arXiv Detail & Related papers (2026-08-29T19:59:00Z) - Robust CHSH Self-Testing with Finite-Energy GKP States [42.71287663143178]
We present a full-oscillator analysis of a finite-energy GKP CHSH test.<n>The observed score yields robust Bell-pair self-testing.
arXiv Detail & Related papers (2026-08-11T16:33:28Z) - Modeling Normal Is All You Need: Joint Latent Clustering for Anomaly Detection in Multimodal Cyber-Physical Systems [47.027290803102666]
Normal behaviour is the union of many imbalanced, curved, thin-fringed operating regimes.<n>We model the normal law with a jointly learned latent representation plus explicit Gaussian-mixture mode clustering.<n>We evaluate under a deliberately fair protocol: raw point-wise metrics with no point adjustment, a trivial-detector difficulty split, prevalence-matched F1, and train-normal-only calibration.
arXiv Detail & Related papers (2026-07-07T10:10:00Z) - CertMix: Certified, Data-Efficient Metamaterial Design by Affine Mixing of Aligned Neural-Implicit Weight Spaces [6.016090674751934]
Inverse design of mechanical metamaterials seeks a periodic unit cell whose homogenized elastic properties meet a prescribed target.<n>We introduce CertMix, a data-efficient framework that represents each exemplar unit cell as a small periodic neural implicit field.<n>From as few as 50 exemplars, CertMix attains a scaled property error of $10-4$, roughly two to three orders of magnitude below conditional generative baselines trained on 1000 cells.
arXiv Detail & Related papers (2026-07-05T05:40:01Z) - Self-Certifying Transport MCMC via Dual Spectral-Gap Certificates [3.8549131582427303]
CerT-MCMC is a framework that equips learned-transport Markov chain Monte Carlo with rigorous convergence certificates.<n>We develop two complementary certificates: The covering certificate bounds the weight-ratio oscillation over the full proposal support via finite-sample covering arguments.<n>The quantile-core certificate restricts attention to a high-probability residual core on which the oscillation is controlled by one-dimensional empirical quantiles.
arXiv Detail & Related papers (2026-05-29T01:31:56Z) - Pressure-Testing Deception Probes in LLMs: Scaling, Robustness, and the Geometry of Deceptive Representations [5.218766876318545]
Linear probes trained on LLM activations are increasingly proposed as deception-detection metrics, yet report AUROC exceeding 0.96 on clean benchmarks while collapsing under distributional shift.<n>This paper systematically pressure-tests probe-based metrics across the Gemma 3 model family (1B-27B parameters)<n>We test four hypotheses about deception encoding: (1) single linear direction, (2) multi-dimensional subspace, (3) convex conic hull, (4) entropy proxy.
arXiv Detail & Related papers (2026-05-27T04:51:55Z) - Unitary discretization of the Koopman-von Neumann equation for quantum simulation of fluid and plasma dynamics [45.88028371034407]
KvN framework embeds the Liouville equation into a Hilbert space with norm-preserving, unitary evolution.<n>Weyl-ordered KvN generator is derived as the unique anti-Hermitian operator symmetrization for real velocity fields.
arXiv Detail & Related papers (2026-05-18T23:27:02Z) - Distributional Energy-Based Models for Uncertainty-Aware Structured LLM Reasoning [40.342912574072024]
Large Language Models produce structured outputs such as travel plans or code solutions.<n>Individual reasoning steps may appear correct while the output as a whole violates budgets, fails test cases, or contradicts earlier deductions.<n>We propose a learned quality scorer with deterministic analytical constraint penalties for verifying structured LLM outputs.
arXiv Detail & Related papers (2026-05-15T17:08:27Z) - Statistically-Lossless Quantization of Large Language Models [41.38595517076645]
This paper explores the middle ground of statistically-lossless compression through three complementary notions of losslessness for quantized LLMs.<n>First, task-lossless compression preserves zero-shot benchmark accuracy within natural sampling variance and remains achievable at aggressive bitwidths.<n>Second, we formalize the stricter notion of distribution-lossless compression, requiring the quantized model's next-token distribution to be practically indistinguishable from the original.<n>Third, we prove a gamma-squared variance law showing that symmetric quantization inflates noise variance by gamma squared relative to asymmetric quantization.
arXiv Detail & Related papers (2026-05-04T09:46:47Z) - Differentiable latent structure discovery for interpretable forecasting in clinical time series [38.473526928012724]
We introduce StructGP, a continuous-time multi-task Gaussian process that couples differentiable structure learning to uncover a sparse, ordered directed acyclic graph (DAG) of inter-variable dependencies while preserving principled uncertainty.<n>We propose LP-StructGP, which augments StructGP with latent pathways-shared, temporally shifted trajectories inferred via subject-specific coupling filters and a softmax gating mechanism-to capture cross-patient progression patterns.
arXiv Detail & Related papers (2026-04-30T14:59:50Z) - Variance Is Not Importance: Structural Analysis of Transformer Compressibility Across Model Scales [0.0]
spectral compression, block-level function replacement, rotation-based quantization, activation geometry, and adaptive early exit are studied.<n>We identify five structural properties relevant to compression.
arXiv Detail & Related papers (2026-04-22T15:31:46Z) - Classically Forbidden Signatures of Quantum Coherence in the Mesoscopic Lipkin-Meshkov-Glick Model [0.0]
A collective quantum system of N370 spins exhibits classically forbidden temporal correlations in a spinor Bose-Einstein condensate (BEC)<n>A five-level Lindblad simulation yields K_3 1.32 and dephasing threshold gamma_phi 0.289 s-1 at the BEC target.
arXiv Detail & Related papers (2026-04-19T05:45:56Z) - K-GMRF: Kinetic Gauss-Markov Random Field for First-Principles Covariance Tracking on Lie Groups [8.489406212619164]
We propose K-GMRF, an online, training-free framework for covariance tracking.<n>Our method interprets observations as torques driving a latent angular velocity, propagated via a structure-preserving symplectic integrator.<n>We theoretically prove that this second-order dynamics achieves zero steady-state error under constant rotation.
arXiv Detail & Related papers (2026-03-20T03:16:36Z) - Generative Drifting is Secretly Score Matching: a Spectral and Variational Perspective [33.2175112734242]
Generative Modeling via Drifting has recently achieved state-of-the-art one-step image generation through a kernel-based drift operator.<n>We make the following observation: emphunder a Gaussian kernel, the drift operator is exactly a score difference on smoothed distributions.
arXiv Detail & Related papers (2026-03-10T17:30:35Z) - Structure-Informed Estimation for Pilot-Limited MIMO Channels via Tensor Decomposition [51.56484100374058]
This paper formulates pilot-limited channel estimation as low-rank tensor completion from sparse observations.<n>Experiments on synthetic channels demonstrate 10-20,dB normalized mean-square error (NMSE) improvement over least-squares (LS)<n> evaluations on DeepMIMO ray-tracing channels show 24-44% additional NMSE reduction over pure tensor-based methods.
arXiv Detail & Related papers (2026-02-03T23:38:05Z) - Large Deviation Upper Bounds and Improved MSE Rates of Nonlinear SGD: Heavy-tailed Noise and Power of Symmetry [47.653744900375855]
We provide a framework of optimal convex gradient methods in the presence of heavy-tailed noise.<n>We show an explicit dependence on the choice of step-size-tailed nonlinearity, noise and problem parameters.<n>We provide an MSE $widetmathcalO(t-1)$ that can be made close to the optimal $mathcalO(t-1)$.
arXiv Detail & Related papers (2024-10-21T04:50:57Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.