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

推荐订阅源

Apple Machine Learning Research
Apple Machine Learning Research
Jina AI
Jina AI
博客园_首页
WordPress大学
WordPress大学
罗磊的独立博客
小众软件
小众软件
Last Week in AI
Last Week in AI
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
Hugging Face - Blog
Hugging Face - Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
爱范儿
爱范儿
The Cloudflare Blog
GbyAI
GbyAI
C
Check Point Blog
腾讯CDC
MyScale Blog
MyScale Blog
有赞技术团队
有赞技术团队
博客园 - 聂微东
IT之家
IT之家
雷峰网
雷峰网
H
Help Net Security
博客园 - 叶小钗
美团技术团队
D
DataBreaches.Net

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
A one-parameter family of realizability-interior closures...
[Submitted on 24 Jun 2026] · 2026-06-25 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:Moment closures at odd truncation order present a fundamental difficulty: the standard Gramian closure saturates the realizability boundary, producing only weak hyperbolicity and failing to preserve Maxwellian equilibrium. We show that every odd-order closure for the one-dimensional kinetic equation admits a decomposition into a boundary term, given by the Schur complement of the Hankel moment matrix, and a positive margin above it. An exact polynomial identity connects this margin to the eigenvalues of the flux Jacobian, reducing hyperbolicity to a root-splitting problem. A dimensional argument proves that no margin depending only on density, velocity, and temperature can produce a hyperbolic system for $M \geq 5$. A one-parameter family $C_{\eta,n}$, $\eta \in [0,1]$, built from normalized Schur-complement ratios, reveals that the Morin-McDonald closure is the arithmetic endpoint. The weighted AM-GM inequality orders the family: the geometric endpoint ($\eta = 0$) is 2-4% more accurate on bimodal benchmarks, while the arithmetic endpoint ($\eta = 1$, Morin-McDonald) is the most robust. All members share the same equilibrium Jacobian, whose spectral radius is 13% ($M = 5$) to 29% ($M = 13$) smaller than Grad's closure, allowing larger CFL time steps. A linearized entropy exists for all $M$, and the BGK source dissipates it near equilibrium; a smooth nonlinear entropy exists for $M = 3$ but provably does not for $M \geq 5$. The closure is validated on bimodal and Mott-Smith benchmarks, achieving errors 10-40x smaller than the Gramian or Grad closures, and demonstrated in free-transport Riemann problems at $M = 5, 7, 9, 11$ and BGK Riemann problems at $M = 5$ and $9$.

Submission history

From: Somdeb Bandopadhyay [view email]
[v1] Wed, 24 Jun 2026 17:05:20 UTC (154 KB)