本文印刷
全画面プリント
統計数学セミナー
過去の記録 ～04/18｜次回の予定｜今後の予定 04/19～
| 担当者 | 吉田朋広、荻原哲平、小池祐太 |
|---|---|
| セミナーURL | http://www.sigmath.es.osaka-u.ac.jp/~kamatani/statseminar/ |
| 目的 | 確率統計学およびその関連領域に関する研究発表, 研究紹介を行う. |
2019年06月18日(火)
11:00-12:10 数理科学研究科棟(駒場) 052号室
Xiaohui Chen 氏 (University of Illinois at Urbana–Champaign)
Gaussian and bootstrap approximations of high-dimensional U-statistics with applications and extensions ※変更の可能性あり
Xiaohui Chen 氏 (University of Illinois at Urbana–Champaign)
Gaussian and bootstrap approximations of high-dimensional U-statistics with applications and extensions ※変更の可能性あり
[ 講演概要 ]
We shall first discuss the Gaussian approximation of high-dimensional and non-degenerate U-statistics of order two under the supremum norm. A two-step Gaussian approximation procedure that does not impose structural assumptions on the data distribution is proposed. Subject to mild moment conditions on the kernel, we establish the explicit rate of convergence that decays polynomially in sample size for a high-dimensional scaling limit, where the dimension can be much larger than the sample size. We also provide computable approximation methods for the quantiles of the maxima of centered U-statistics. Specifically, we provide a unified perspective for the empirical, the randomly reweighted, and the multiplier bootstraps as randomly reweighted quadratic forms, all asymptotically valid and inferentially first-order equivalent in high-dimensions.
The bootstrap methods are applied on statistical applications for high-dimensional non-Gaussian data including: (i) principled and data-dependent tuning parameter selection for regularized estimation of the covariance matrix and its related functionals; (ii) simultaneous inference for the covariance and rank correlation matrices. In particular, for the thresholded covariance matrix estimator with the bootstrap selected tuning parameter, we show that the Gaussian-like convergence rates can be achieved for heavy-tailed data, which are less conservative than those obtained by the Bonferroni technique that
ignores the dependency in the underlying data distribution. In addition, we also show that even for subgaussian distributions, error bounds of the bootstrapped thresholded covariance matrix estimator can be much tighter than those of the minimax estimator with a universal threshold.
Time permitting, we will discuss some extensions to the infinite-dimensional version (i.e., U-processes of increasing complexity) and to the randomized inference via the incomplete U-statistics whose computational cost can be made independent of the order.
We shall first discuss the Gaussian approximation of high-dimensional and non-degenerate U-statistics of order two under the supremum norm. A two-step Gaussian approximation procedure that does not impose structural assumptions on the data distribution is proposed. Subject to mild moment conditions on the kernel, we establish the explicit rate of convergence that decays polynomially in sample size for a high-dimensional scaling limit, where the dimension can be much larger than the sample size. We also provide computable approximation methods for the quantiles of the maxima of centered U-statistics. Specifically, we provide a unified perspective for the empirical, the randomly reweighted, and the multiplier bootstraps as randomly reweighted quadratic forms, all asymptotically valid and inferentially first-order equivalent in high-dimensions.
The bootstrap methods are applied on statistical applications for high-dimensional non-Gaussian data including: (i) principled and data-dependent tuning parameter selection for regularized estimation of the covariance matrix and its related functionals; (ii) simultaneous inference for the covariance and rank correlation matrices. In particular, for the thresholded covariance matrix estimator with the bootstrap selected tuning parameter, we show that the Gaussian-like convergence rates can be achieved for heavy-tailed data, which are less conservative than those obtained by the Bonferroni technique that
ignores the dependency in the underlying data distribution. In addition, we also show that even for subgaussian distributions, error bounds of the bootstrapped thresholded covariance matrix estimator can be much tighter than those of the minimax estimator with a universal threshold.
Time permitting, we will discuss some extensions to the infinite-dimensional version (i.e., U-processes of increasing complexity) and to the randomized inference via the incomplete U-statistics whose computational cost can be made independent of the order.
