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

推荐订阅源

罗磊的独立博客
U
Unit 42
N
Netflix TechBlog - Medium
人人都是产品经理
人人都是产品经理
Hugging Face - Blog
Hugging Face - Blog
腾讯CDC
小众软件
小众软件
V
Visual Studio Blog
T
Tailwind CSS Blog
Engineering at Meta
Engineering at Meta
博客园 - 叶小钗
GbyAI
GbyAI
爱范儿
爱范儿
雷峰网
雷峰网
Microsoft Azure Blog
Microsoft Azure Blog
D
DataBreaches.Net
博客园_首页
D
Docker
A
About on SuperTechFans
G
Google Developers Blog
I
InfoQ
T
The Blog of Author Tim Ferriss
V
V2EX
博客园 - Franky

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
A General-Dimensional Origin-Invariant Cram'er-von Mises ...
[Submitted on 18 May 2026 (v1), last revised 22 Jul 2026 (this v · 2026-05-19 · via math.ST updates on arXiv.org

View PDF HTML (experimental)

Abstract:We introduce a general-dimensional origin-invariant Cramér--von Mises statistic for testing complete spatial randomness (CSR), defined as the average of corner-oriented Cramér--von Mises functionals over all \(2^d\) corners of the unit cube. The statistic admits a closed-form \(O(n^2)\) computing formula and is therefore directly implementable in arbitrary dimension. In dimension one, it reduces to the classical rank-based Cramér--von Mises statistic; in dimension two, it agrees with Zimmerman's origin-invariant statistic. Under the CSR null hypothesis, the finite-dimensional distributions of the normalized empirical process converge jointly to a mean-zero Gaussian process with an explicit cross-corner covariance kernel. We establish the existence of the limiting process, construct a continuous modification, and prove asymptotic equicontinuity using Bernstein chaining. The resulting quadratic limit is characterized through the covariance operator on the corner--location product space and has a Karhunen--Loève representation. An ordered-list construction and restriction law connect the conditional CSR model with the homogeneous Poisson point-process formulation. Monte Carlo null percentiles are reported for dimensions one through five and agree with the exact identity \(\mathbb{E}[n\bar{\omega}_d^2]=2^{-d}-3^{-d}\). The principal foundational results are formally verified in Lean 4 and mathlib4.

Submission history

From: Marco Mandap PhD [view email]
[v1] Mon, 18 May 2026 22:32:52 UTC (31 KB)
[v2] Wed, 22 Jul 2026 01:34:00 UTC (33 KB)