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

推荐订阅源

V
Visual Studio Blog
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
博客园 - 聂微东
博客园 - 【当耐特】
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
C
Check Point Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More
美团技术团队
WordPress大学
WordPress大学
Last Week in AI
Last Week in AI
Y
Y Combinator Blog
IT之家
IT之家
T
Tailwind CSS Blog
月光博客
月光博客
Vercel News
Vercel News
V
V2EX
Engineering at Meta
Engineering at Meta
B
Blog
Stack Overflow Blog
Stack Overflow Blog
A
About on SuperTechFans
Hugging Face - Blog
Hugging Face - Blog
人人都是产品经理
人人都是产品经理
腾讯CDC
I
InfoQ

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
Convex generalized Fréchet means in a metric tree
[Submitted on 26 Oct 2023 (v1), last revised 25 Aug 2026 (this v · 2023-10-26 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:We are interested in measures of central tendency for a population $\mu$ on a network, which is modeled by a metric tree. The location parameters that we study are generalized Fréchet means defined as minimizers of the objective function $\alpha \mapsto \mathbb E[\ell(d(\alpha,X)) - \ell(d(o,X))]$, where $\ell$ is a convex, strictly increasing loss, $X\sim \mu$ and $o$ is an arbitrary origin.
We leverage the geometry of the tree and the geodesic convexity of the objective to develop a notion of directional derivative in the tree, which helps us locate and characterize the minimizers. We then extend to a metric tree the concept of stickiness defined by Hotz et al. (2013). When $\mu$ is nondegenerate, any Fréchet $\ell$-mean of $\mu$ is either sticky, one-sided partly sticky or two-sided partly sticky, depending on the number of vanishing directional derivatives.
Estimation is performed using a sample analog. We establish laws of large numbers and central limit theorems that reveal distinct asymptotic behaviors of empirical means across these three regimes: collapse onto the population mean in the sticky case, partial collapse accompanied by one-sided fluctuations in the one-sided case, and two-sided fluctuations without collapse in the two-sided case. We further develop two consistent estimators of the stickiness regime, based respectively on pairwise collisions among empirical means and on empirical difference quotients. For the particular case of the Fréchet median, we develop distribution-free non-asymptotic confidence regions for the entire set of minimizers.

Submission history

From: Gabriel Romon [view email]
[v1] Thu, 26 Oct 2023 14:46:03 UTC (109 KB)
[v2] Fri, 27 Oct 2023 15:06:00 UTC (109 KB)
[v3] Tue, 25 Aug 2026 16:31:01 UTC (144 KB)