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

推荐订阅源

The Hacker News
The Hacker News
Threat Intelligence Blog | Flashpoint
Threat Intelligence Blog | Flashpoint
P
Privacy & Cybersecurity Law Blog
C
Cybersecurity and Infrastructure Security Agency CISA
Simon Willison's Weblog
Simon Willison's Weblog
cs.CL updates on arXiv.org
cs.CL updates on arXiv.org
TaoSecurity Blog
TaoSecurity Blog
C
CERT Recently Published Vulnerability Notes
S
Security @ Cisco Blogs
Google DeepMind News
Google DeepMind News
Security Archives - TechRepublic
Security Archives - TechRepublic
T
Tenable Blog
O
OpenAI News
NISL@THU
NISL@THU
AI
AI
T
Threat Research - Cisco Blogs
Know Your Adversary
Know Your Adversary
V
Vulnerabilities – Threatpost
Schneier on Security
Schneier on Security
W
WeLiveSecurity
P
Privacy International News Feed
Cisco Talos Blog
Cisco Talos Blog
S
Secure Thoughts
D
Docker
博客园 - 三生石上(FineUI控件)
T
Troy Hunt's Blog
T
Threatpost
C
Cyber Attacks, Cyber Crime and Cyber Security
Vercel News
Vercel News
H
Hacker News: Front Page
B
Blog
S
SegmentFault 最新的问题
H
Heimdal Security Blog
T
The Blog of Author Tim Ferriss
cs.AI updates on arXiv.org
cs.AI updates on arXiv.org
G
GRAHAM CLULEY
AWS News Blog
AWS News Blog
N
News and Events Feed by Topic
L
LINUX DO - 热门话题
小众软件
小众软件
爱范儿
爱范儿
T
The Exploit Database - CXSecurity.com
Hacker News: Ask HN
Hacker News: Ask HN
Recent Announcements
Recent Announcements
Recent Commits to openclaw:main
Recent Commits to openclaw:main
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
PCI Perspectives
PCI Perspectives
I
Intezer
云风的 BLOG
云风的 BLOG
P
Proofpoint News Feed

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 Learning Decision-Sufficient Representations for Linear Optimization Parameterized Complexity of Stationarity Testing for Piecewise-Affine Functions and Shallow CNN Losses Prabhakar function and unified fractional kinetic equation in bicomplex space Computing Gamma(p/q) with Beta function values Flows on Graded Manifolds Optimal embedding dimension in the Nash--Tognoli theorem An optimal first-order method for smooth and strongly convex composite optimization and its stationary limit Sharp Bohr-Type inequalities for certain classes of close-to-convex functions Invariants of real affine varieties based on their complexifications Topological symmetric and braid homologies A Formal Graph-Theoretic Framework for Pitch Class Set Analysis Finite groups with high commuting probability for Sylow subgroups Performance Bounds for Rollout Policies in Stochastic Shortest Path Problems Real 2-blocks in quasi-simple groups Maximal subalgebras of the Lie algebra $W_n(\mathbb{K})$ Cohomogeneity-One Ruled Hypersurfaces in $\mathbb{CP}^2$ and $\mathbb{C}H^2$ Global analysis of the Kuramoto flow 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 Generalized Stochastic Approximation of the Log-Likelihood Ratio for Robust Sequential Change-Point Detection 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 Concise and elegant proofs of three formulas for complete Bell polynomials On Reed-Muller subcodes, Grassmannian partitions and sum-free functions 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 A Comprehensive Study of Clique Graphs and Clique Regular Graphs Every signed planar graph is $5$-choosable: A short proof and refinements 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 Democratizing Large-Scale Re-Optimization with LLM-Guided Model Patches On Stability and Decomposition of Sample Quantiles under Heavy-Tailed Distributions Symmetry-Compatible Principle for Optimizer Design: Embeddings, LM Heads, SwiGLU MLPs, and MoE Routers Stochastic Non-Smooth Convex Optimization with Unbounded Gradients Dimension-Free Convergence of Discrete Diffusion Models: Adjoint Equations Induce the Right Space The Geometry of Cooperative Game Solutions: Stratified Egalitarian Shapley Values An Axiomatic Theory of Tie-Breaking: Impossibility, Characterization, and Decomposition PyCSP3-Scheduling: A Scheduling Extension for PyCSP3 Strategic PAC Learnability via Geometric Definability Proximal-Based Generative Modeling for Bayesian Inverse Problems Every Minimal Counterexample to the Erdős-Gyárfás Conjecture is Predominantly Cubic SPHERICAL KV: Angle-Domain Attention and Rate-Distortion Retention for Efficient Long-Context Inference NOVA: Fundamental Limits of Knowledge Discovery Through AI Model-based Bootstrap of Controlled Markov Chains TopoGeoScore: A Self-Supervised Source-Only Geometric Framework for OOD Checkpoint Selection Minimal Filling Architectures of Polynomial Neural Networks: Counterexamples, Frontier Search, and Defects Omni-scale Learning-based Sequential Decision Framework for Order Fulfillment of Tote-handling Robotic Systems Grokking or Glitching? How Low-Precision Drives Slingshot Loss Spikes Towards an Inferentialist Account of Information Through Proof-theoretic Semantics Random test functions, $H^{-1}$ norm equivalence, and stochastic variational physics-informed neural networks QUIVER: Cost-Aware Adaptive Preference Querying in Surrogate-Assisted Evolutionary Multi-Objective Optimization Robust and Fast Training via Per-Sample Clipping Beyond Continuity: Simulation-free Reconstruction of Discrete Branching Dynamics from Single-cell Snapshots Wasserstein Distributionally Robust Regret Optimization for Reinforcement Learning from Human Feedback Deep Learning of Solver-Aware Turbulence Closures from Nudged LES Dynamics Information bottleneck for learning the phase space of dynamics from high-dimensional experimental data QED: An Open-Source Multi-Agent System for Generating Mathematical Proofs on Open Problems Information-Theoretic Measures in AI: A Practical Decision Guide Inference of Online Newton Methods with Nesterov's Accelerated Sketching A Unified Fractional Regularization Framework for Sparse Recovery Mathematical Foundations for Peer-to-Peer Lattice Computation Geometric Layer-wise Approximation Rates for Deep Networks RateQuant: Optimal Mixed-Precision KV Cache Quantization via Rate-Distortion Theory ML-based approach to classification and generation of structured light propagation in turbulent media Zeroth-Order Optimization at the Edge of Stability 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 Order-Optimal Sequential 1-Bit Mean Estimation in General Tail Regimes Training-Free Rate-Distortion-Perception Traversal With Diffusion Conformal Policy Control Linear Regression with Unknown Truncation Beyond Gaussian Features ArcMark: Distortion-Free Multi-Byte LLM Watermark via Optimal Transport Feature Learning Dynamics in Infinite-Depth Neural Networks ATHENA: Agentic Team for Hierarchical Evolutionary Numerical Algorithms Normalizing Flows on Quotient Manifolds via Boundary Quotients What Can Be Recovered Under Sparse Adversarial Corruption? Assumption-Free Theory for Linear Measurements TelecomTS: A Multi-Modal Observability Dataset for Time Series and Language Analysis Program Evaluation with Remotely Sensed Outcomes Efficient Gradient Estimation for Parameterized Quantum Systems with Lie Algebraic Symmetries
A one-parameter family of realizability-interior closures for odd-order kinetic moment systems
[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)