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

推荐订阅源

奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
大猫的无限游戏
大猫的无限游戏
博客园 - 聂微东
Jina AI
Jina AI
The Cloudflare Blog
V
Visual Studio Blog
博客园_首页
量子位
酷 壳 – CoolShell
酷 壳 – CoolShell
博客园 - 【当耐特】
爱范儿
爱范儿
博客园 - 三生石上(FineUI控件)
小众软件
小众软件
博客园 - 司徒正美
阮一峰的网络日志
阮一峰的网络日志
Last Week in AI
Last Week in AI
V
V2EX
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
博客园 - 叶小钗
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
WordPress大学
WordPress大学
宝玉的分享
宝玉的分享
T
Tailwind CSS Blog
博客园 - Franky

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
Chart-Generated Probability Geometry and Kolmogorov Expec...
[Submitted on 4 May 2026 (v1), last revised 6 Aug 2026 (this ver · 2026-05-04 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:This paper develops a geometric reinterpretation of probability in which a cumulative distribution function is not used merely as a passive coordinate label, but as a generator of metric geometry. An admissible probability chart $G:I\to(0,1)$ pulls the Euclidean distance of the probability interval back to value space. This creates a decisive distinction from ordinary coordinate invariance: if $G$ is replaced by another chart $H$ while the observations and their law are kept fixed, the induced metric-measure structure changes. Probability charts preserve ordinal structure while altering metric notions such as distance, dispersion, boundary proximity, and barycentric centrality. Averaging linearly in the chart coordinate and pulling the result back defines the Fréchet barycenter of $X$ under $d_G$. These functionals coincide with Kolmogorov-Nagumo means, but the chart-generated viewpoint explains their chart dependence geometrically: changing the chart changes the loss being minimized, rather than merely rewriting one fixed centre in new coordinates. A rigidity result shows that, within normalized probability charts, preserving the barycenter for every law forces the chart itself to remain unchanged. Under the intrinsic chart the coordinates are uniform and the barycenter is the median; under an external benchmark chart, tail mismatch is represented by excess boundary occupation. Laws of large numbers, central limit theorems, and a non-asymptotic concentration inequality are established for the transformed functionals. Probability-coordinate moments exist for every law supported on the chart domain and determine the law uniquely, in contrast with classical moment non-existence and indeterminacy on unbounded value spaces.

Submission history

From: Manuela-Simona Cojocea Ms. [view email]
[v1] Mon, 4 May 2026 00:00:12 UTC (29 KB)
[v2] Thu, 6 Aug 2026 18:01:23 UTC (33 KB)