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

推荐订阅源

G
Google Developers Blog
F
Fortinet All Blogs
Microsoft Azure Blog
Microsoft Azure Blog
腾讯CDC
Vercel News
Vercel News
Recent Announcements
Recent Announcements
博客园 - Franky
小众软件
小众软件
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
The Cloudflare Blog
宝玉的分享
宝玉的分享
I
InfoQ
博客园 - 聂微东
Jina AI
Jina AI
J
Java Code Geeks
V
V2EX
U
Unit 42
Stack Overflow Blog
Stack Overflow Blog
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
阮一峰的网络日志
阮一峰的网络日志
L
LangChain Blog
T
The Blog of Author Tim Ferriss
量子位

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
Testing Conditional Stochastic Dominance at Target Points
[Submitted on 18 Mar 2025 (v1), last revised 17 Aug 2026 (this v · 2025-03-19 · via stat updates on arXiv.org

View PDF HTML (experimental)

Abstract:This paper introduces a test for conditional stochastic dominance between two distributions at prespecified values of a conditioning covariate, referred to as target points. The test uses a one-sided Kolmogorov--Smirnov statistic computed from induced order statistics, the outcomes attached to the conditioning observations closest to the target point, and compares it to a critical value that, given the number of neighbors, requires no resampling, kernel smoothing, or parametric assumptions. The same procedure applies whether the outcomes are continuous, discrete, or mixed, and requires only continuity of the conditional distributions in the conditioning variable. We establish asymptotic validity under two frameworks: one in which the number of neighbors is held fixed, where the induced order statistics converge to independent draws from the conditional distributions at the target point; and one in which it grows with the sample size, where we obtain an explicit rate that accommodates both an estimated target point and a data-dependent choice of the number of neighbors. We connect the test to permutation-based inference, provide a refined critical value for discrete outcomes, propose a rule for selecting the tuning parameters, and illustrate the procedure in two empirical applications whose recorded outcomes exhibit mass points. Monte Carlo simulations confirm its strong finite-sample performance.

Submission history

From: Ivan Canay [view email]
[v1] Tue, 18 Mar 2025 21:22:55 UTC (133 KB)
[v2] Sun, 20 Apr 2025 15:15:52 UTC (89 KB)
[v3] Wed, 19 Nov 2025 02:07:39 UTC (89 KB)
[v4] Mon, 17 Aug 2026 22:00:02 UTC (68 KB)