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

推荐订阅源

D
DataBreaches.Net
N
Netflix TechBlog - Medium
P
Proofpoint News Feed
D
Docker
J
Java Code Geeks
L
LangChain Blog
Microsoft Security Blog
Microsoft Security Blog
The GitHub Blog
The GitHub Blog
I
InfoQ
Stack Overflow Blog
Stack Overflow Blog
云风的 BLOG
云风的 BLOG
Engineering at Meta
Engineering at Meta
MongoDB | Blog
MongoDB | Blog
月光博客
月光博客
T
Tailwind CSS Blog
M
MIT News - Artificial intelligence
Blog — PlanetScale
Blog — PlanetScale
Google DeepMind News
Google DeepMind News
腾讯CDC
罗磊的独立博客
U
Unit 42
爱范儿
爱范儿
Vercel News
Vercel News
MyScale Blog
MyScale Blog

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
De Finetti + Sanov = Bayes: Exchangeable Prediction under...
[Submitted on 16 Sep 2025 (v1), last revised 28 Jul 2026 (this v · 2025-09-17 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:We study exchangeable prediction when empirical-moment constraints define each active finite horizon N. The relevant law is the de Finetti mixture conditioned on E_N = {Phat_N in E_{eps_N}}. By permutation invariance, the target may be any fixed block of m coordinates within the active horizon, regardless of whether those coordinates are labeled past, held out, or future relative to any finite cut. Conditionally on the directing measure mu, the Gibbs-conditioning principle sends the law of such a block to the m-fold product of the I-projection P*_mu = argmin_{Q in E} D(Q || mu). On a finite alphabet we give an elementary master inequality for general polyhedral moment windows. After mixing over the constraint posterior Pi_{N,E}, and under weak convergence plus posterior-averaged component control, the finite-dimensional marginals converge to a consistent exchangeable law whose random directing measure is the I-projection P*_mu, with mu drawn from the weak limit Pi_E. Sequential prediction under this limiting law is therefore Bayesian prediction from a mixture of componentwise I-projections. The limiting behavior depends on reachability. For a reachable constraint, the projection is asymptotically the identity on the selected subfamily. Under additional regularity, an unreachable constraint makes the constraint posterior concentrate on the rate-minimizing subfamily, while the projections remain nontrivial. In our examples, at least one operation is asymptotically inactive, though both enter the finite-horizon construction. The master bound also reads as an equivalence of ensembles. We reserve "maximum entropy" for a uniform or flat baseline and use "minimum relative entropy" or "I-projection" in general.

Submission history

From: Daniel Zantedeschi [view email]
[v1] Tue, 16 Sep 2025 17:36:41 UTC (24 KB)
[v2] Thu, 16 Jul 2026 13:42:32 UTC (205 KB)
[v3] Tue, 28 Jul 2026 23:34:11 UTC (205 KB)