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

推荐订阅源

The Cloudflare Blog
L
LangChain Blog
WordPress大学
WordPress大学
V
V2EX
M
MIT News - Artificial intelligence
H
Hackread – Cybersecurity News, Data Breaches, AI and More
Stack Overflow Blog
Stack Overflow Blog
J
Java Code Geeks
F
Fortinet All Blogs
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
腾讯CDC
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
D
Docker
Recent Announcements
Recent Announcements
GbyAI
GbyAI
博客园 - 叶小钗
小众软件
小众软件
Hugging Face - Blog
Hugging Face - Blog
T
The Blog of Author Tim Ferriss
人人都是产品经理
人人都是产品经理
Engineering at Meta
Engineering at Meta
Y
Y Combinator Blog
雷峰网
雷峰网
The GitHub Blog
The GitHub Blog

stat updates on arXiv.org

Simultaneous Monitoring of Shape and Surface Color via 4D Point Clouds: A Registration-free Approach A Refined Generalization Analysis for Extreme Multi-class Supervised Contrastive Representation Learning Ensemble Distributionally Robust Bayesian Optimisation The Proxy Presumption: From Semantic Embeddings to Valid Social Measures Modulated learning for private and distributed regression with just a single sample per client device Query-efficient model evaluation using cached responses Functional-prior-based approaches to Bayesian PDE-constrained inversion using physics-informed neural networks Optimal Experiments for Partial Causal Effect Identification Order-Agnostic Autoregressive Modelling with Missing Data Grokking or Glitching? How Low-Precision Drives Slingshot Loss Spikes Tuning Derivatives for Causal Fairness in Machine Learning Spherical Flows for Sampling Categorical Data Bayesian Rain Field Reconstruction using Commercial Microwave Links and Diffusion Model Priors GRALIS: A Unified Canonical Framework for Linear Attribution Methods via Riesz Representation Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Unified Framework of Distributional Regret in Multi-Armed Bandits and Reinforcement Learning Jacobian-Velocity Bounds for Deployment Risk Under Covariate Drift Self-Attention as Transport: Limits of Symmetric Spectral Diagnostics Perturbation is All You Need for Extrapolating Language Models Adapt or Forget: Provable Tradeoffs Between Adam and SGD in Nonstationary Optimization Realizable Bayes-Consistency for General Metric Losses Graph Convolutional Support Vector Regression for Robust Spatiotemporal Forecasting of Urban Air Pollution Segmenting Human-LLM Co-authored Text via Change Point Detection Stochastic Schrödinger Diffusion Models for Pure-State Ensemble Generation Understanding Self-Supervised Learning via Latent Distribution Matching The Geometric Mechanics of Contrastive Representation Learning: Alignment Potentials, Entropic Dispersion, and Cross-modal Divergence Imbalanced Classification under Capacity Constraints On the Spectral Structure and Objective Equivalence of Orthogonal Multilabel Fisher Discriminants Partially Observed Structural Causal Models First-Order Efficiency for Probabilistic Value Estimation via A Statistical Viewpoint
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 stat 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.