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

推荐订阅源

U
Unit 42
博客园 - 司徒正美
V
Visual Studio Blog
博客园 - 【当耐特】
T
Tailwind CSS Blog
美团技术团队
博客园 - 叶小钗
Jina AI
Jina AI
宝玉的分享
宝玉的分享
IT之家
IT之家
Hugging Face - Blog
Hugging Face - Blog
雷峰网
雷峰网
Stack Overflow Blog
Stack Overflow Blog
博客园_首页
人人都是产品经理
人人都是产品经理
T
The Blog of Author Tim Ferriss
P
Proofpoint News Feed
Microsoft Security Blog
Microsoft Security Blog
Y
Y Combinator Blog
GbyAI
GbyAI
大猫的无限游戏
大猫的无限游戏
Martin Fowler
Martin Fowler
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
腾讯CDC

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
Extension of Process Convergence With Application to Chat...
[Submitted on 21 Aug 2024 (v1), last revised 8 Jul 2026 (this ve · 2024-08-21 · via math updates on arXiv.org

Mathematics > Probability

arXiv:2408.11547 (math)

[Submitted on 21 Aug 2024 (v1), last revised 8 Jul 2026 (this version, v3)]

View PDF

Abstract:We give conditions under which weak convergence of a stochastic process indexed in the class of $d$-dimensional hyperrectangles is sufficient to ensure convergence in the larger class of functions of uniformly bounded Hardy-Krause variation. When applied to the empirical process, this can further be extended to derive weak convergence of V-processes indexed in the class of kernel functions which are coordinate-wise of uniformly bounded Hardy-Krause variation. Our proofs use a generalisation of the Koksma-Hlawka inequality for linear operators, allowing us to establish our results without any continuity assumptions on the functions involved. Our theory is complemented by two separate applications: First, we establish asymptotic normality of Chatterjee's rank correlation in the fully general setting. Second, we present new limit theorems for U- and V-processes of strongly mixing data.
Comments: This article was previously entitled `Asymptotic Normality of Chatterjee's Rank Correlation'. Improved theory on extension of process convergence. Includes formula for the limiting variance of Chatterjee's rank correlation
Subjects: Probability (math.PR); Statistics Theory (math.ST)
MSC classes: 62H20, 60F05, 62G20, 62G30
Cite as: arXiv:2408.11547 [math.PR]
  (or arXiv:2408.11547v3 [math.PR] for this version)
  https://doi.org/10.48550/arXiv.2408.11547

arXiv-issued DOI via DataCite

Submission history

From: Marius Kroll [view email]
[v1] Wed, 21 Aug 2024 11:55:34 UTC (94 KB)
[v2] Fri, 16 May 2025 11:02:54 UTC (48 KB)
[v3] Wed, 8 Jul 2026 13:44:19 UTC (85 KB)

Current browse context:

math.PR

Bookmark

BibSonomy Reddit

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Code, Data, Media

Code, Data and Media Associated with this Article

Demos

Demos

Related Papers

Recommenders and Search Tools

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.