CORTEXA
← Browse
arxivstat.MLcs.LG2026-07-22

Directional Kernel Mean Difference: A Fast Signed Statistic for Univariate Distribution Comparison

Shijie Zhong, Jiangfeng Fu

We introduce the Directional Kernel Mean Difference (DKMD), a signed statistic for univariate distribution comparison that preserves the direction of distributional shifts. Unlike the squared Maximum Mean Discrepancy (MMD), which discards directional information by squaring the RKHS distance, DKMD integrates the difference of kernel mean embeddings against a fixed odd weighting function. This construction yields three structural properties: antisymmetry, immunity to symmetric distributional differences, and directional monotonicity under stochastic dominance. We derive a data-driven Riemann estimator that ensures asymptotic consistency with the continuous formulation, strictly preserving the theoretical guarantees of the signed statistic in empirical evaluations. To overcome the quadratic computational cost of kernel methods, we develop an $O(N \log N)$ prefix--suffix scanning algorithm that exploits the total order of the real line while requiring only $O(N)$ memory. Experiments on synthetic benchmarks demonstrate that DKMD correctly isolates directional shifts from symmetric perturbations, remains robust to heavy-tailed outliers that can flip the sign of the mean difference, and scales to millions of samples in seconds.

View free PDFSource page

Related papers

arxivstat.MLcs.LG2026-07-09

Statistical Efficiency and Inference of Quantile Distributional Reinforcement Learning

Zijie Cheng, Yang Peng, Zhihua Zhang

In this paper, we study quantile-based distributional reinforcement learning from the perspective of statistical efficiency. We focus on distributional policy evaluation, whose goal is to characterize the return distribution, namely the distribution of discounted cumulative rewar…

View free PDFSource page
arxivstat.MLcs.LG2026-07-08

Distributionally Faithful Imputation via Positive Semi-Definite Kernel Density Estimation

Andrea Basteri, Carlo Ciliberto, Alessandro Rudi

Missing values undermine statistical inference and machine learning pipelines, yet most imputation methods rely on heuristics or restrictive parametric assumptions that ignore the joint data distribution. We recast imputation under missing completely at random (MCAR) as density e…

View free PDFSource page
arxivcs.LGstat.ML2026-07-23

Zero-Flow Two-Sample Tests

Yakun Wang, Leyang Wang, Song Liu, Taiji Suzuki

We propose a new approach to two-sample testing for deciding whether two sets of samples are drawn from the same distribution. The test is built on a statistical discrepancy based on the zero-flow criterion, termed zero-flow discrepancy (ZFD). We prove the validity of ZFD and pro…

View free PDFSource page
arxivstat.MLcs.DScs.LGmath.PRmath.STstat.CO2026-07-14

Accelerated Mixing Time of Randomized Hamiltonian Monte Carlo

Siddharth Mitra, Vishwak Srinivasan, Xiuyuan Wang, Andre Wibisono

We show the Randomized Hamiltonian Monte Carlo (RHMC) algorithm has accelerated mixing time guarantees for sampling from log-concave probability distributions. RHMC proceeds by repeatedly simulating the continuous-time Hamiltonian dynamics for some random integration times, and r…

View free PDFSource page
arxivcs.LGstat.ML2026-07-17

ASK-NN: An Asymmetric Nearest-Neighbor Test that detects Distribution Drifts in Natural Language

Sergey Zakharov, Rodion Oblovatny, Alexey Zaytsev

Hallucinations and artificial text in LLM-generated outputs often appear as distributional deviations between prompt and response hidden-state distributions. Since prompts or retrieved contexts typically serve as reference samples and responses as query samples, with major differ…

View free PDFSource page