SearcharxivSearch

arXiv subjects

Kit Chan

Publications and source records attributed to Kit Chan.

2 recordsLinked to original sources

Sieve Estimation of Optimal Transport Maps from Paired Data in Gaussian Spaces

We estimate optimal transport maps on an infinite-dimensional Hilbert space with a Gaussian reference measure, from noisy paired observations. A source draw is seen together with a noisy evaluation of its image, rather than through independent unpaired samples. The estimator is a cylindrical sieve of Cameron--Martin gradient maps, restricted to a compact parameter set; individual sieve elements need not be transport maps. It yields a finite regression contrast even though the noise has infinite Cameron--Martin norm, and reduces estimation to finite-dimensional empirical risk minimization. We establish a nonasymptotic oracle inequality separating approximation error, stochastic error and the local conditioning of the parametrization, together with a minimax lower bound of order $N^{-s/(2s+1)}$ under weighted coordinate regularity of order $s$. Output regularity alone does not deliver cylindrical approximation; for general Sobolev potentials an input-regularity index does, via a conditional Gaussian Poincar\'e argument, and for potentials of bounded chaos degree the degree bound plays that role, an orthogonal Hermite sieve then attaining the same rate with the interaction order replacing unity in the exponent. That rate is minimax on a diagonal Gaussian class and on a nonlinear block class whose interaction survives every fixed orthogonal change of coordinates.

math.ST

Two-Sample Hypothesis Testing for Large Random Graphs of Unequal Size

Two-sample hypothesis testing for large graphs is popular in cognitive science, probabilistic machine learning and artificial intelligence. While numerous methods have been proposed in the literature to address this problem, less attention has been devoted to scenarios involving graphs of unequal size or situations where there are only one or a few samples of graphs. In this article, we propose a Frobenius test statistic tailored for small sample sizes and unequal-sized random graphs to test whether they are generated from the same model or not. Our approach involves an algorithm for generating bootstrapped adjacency matrices from estimated community-wise edge probability matrices, forming the basis of the Frobenius test statistic. We derive the asymptotic distribution of the proposed test statistic and validate its stability and efficiency in detecting minor differences in underlying models through simulations. Furthermore, we explore its application to fMRI data where we are able to distinguish brain activity patterns when subjects are exposed to sentences and pictures for two different stimuli and the control group.

stat.ME