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

推荐订阅源

有赞技术团队
有赞技术团队
H
Hackread – Cybersecurity News, Data Breaches, AI and More
I
InfoQ
J
Java Code Geeks
Microsoft Security Blog
Microsoft Security Blog
G
Google Developers Blog
D
DataBreaches.Net
Recent Announcements
Recent Announcements
Microsoft Azure Blog
Microsoft Azure Blog
B
Blog RSS Feed
Y
Y Combinator Blog
博客园 - 【当耐特】
博客园 - 聂微东
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
大猫的无限游戏
大猫的无限游戏
P
Proofpoint News Feed
量子位
C
Check Point Blog
F
Fortinet All Blogs
罗磊的独立博客
Last Week in AI
Last Week in AI
GbyAI
GbyAI
L
LangChain Blog
博客园 - 司徒正美

math.ST updates on arXiv.org

What is Learnable in Valiant's Theory of the Learnable? Learning Perturbations to Extrapolate Your LLM Byzantine-Robust Distributed Sparse Learning Revisited The Sample Complexity of Multiple Change Point Identification under Bandit Feedback A proximal gradient algorithm for composite log-concave sampling Model-based Bootstrap of Controlled Markov Chains Approximation of Maximally Monotone Operators : A Graph Convergence Perspective Posterior Contraction Rates for Sparse Kolmogorov-Arnold Networks in Anisotropic Besov Spaces MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound A Spectral Framework for Closed-Form Relative Density Estimation Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability Higher-Order Equilibrium Tracking for EM-Compressible Online Estimation Scaling Limits of Long-Context Transformers A Note on Non-Negative $L_1$-Approximating Polynomials Susceptibilities and Patterning: A Primer on Linear Response in Bayesian Learning Linear Response Estimators for Singular Statistical Models Statistical inference with belief functions: A survey Robust stochastic first order methods in heavy-tailed noise via medoid mini-batch gradient sampling Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity Adaptive auditing of AI systems with anytime-valid guarantees Locally Near Optimal Piecewise Linear Regression in High Dimensions via Difference of Max-Affine Functions Risk-Controlled Post-Processing of Decision Policies Covariate Balancing and Riesz Regression Should Be Guided by the Neyman Orthogonal Score in Debiased Machine Learning A Unified Pair-GRPO Family: From Implicit to Explicit Preference Constraints for Stable and General RL Alignment Time-Inhomogeneous Preconditioned Langevin Dynamics A Fine-Grained Understanding of Uniform Convergence for Halfspaces CITE: Anytime-Valid Statistical Inference in LLM Self-Consistency Ratio-based Loss Functions Optimal Confidence Band for Kernel Gradient Flow Estimator A renormalization-group inspired lattice-based framework for piecewise generalized linear models
Kendall and Spearman bounds for Chatterjee's rank correla...
[Submitted on 20 Jun 2026] · 2026-06-23 · via math.ST updates on arXiv.org

View PDF HTML (experimental)

Abstract:We compare Chatterjee's rank correlation $\xi$ with Kendall's $\tau$ and Spearman's $\rho$ under positive-dependence assumptions on bivariate copulas. Our main technical contribution is a sharp order-violation bound for two stochastically ordered distribution functions. This local inequality controls each conditional order-violation probability appearing in Kendall's tau by the cross-rank variance functionals that determine Chatterjee's rank correlation. As a consequence, we prove the sharp Kendall bound $\xi(C)\leq \tau(C)$ for every stochastically increasing copula $C$. The bound is best possible: ordinal sums of product copulas attain equality. We also prove that the weaker left-tail decreasing (LTD) and right-tail increasing (RTI) conditions jointly imply the Spearman bound $\xi(C)\leq \rho(C)$, with equality if and only if $C$ is either the independence or comonotonicity copula. Finally, checkerboard examples show that LTD or RTI alone does not imply $\xi(C)\leq\rho(C)$, that LTD and RTI together do not imply $\xi(C)\leq\tau(C)$, and that both bounds are directional for $\xi$.

Submission history

From: Marcus Rockel [view email]
[v1] Sat, 20 Jun 2026 14:50:31 UTC (57 KB)