Search arXivSearch

arXiv · math/0606550

A Conversation with Yuan Shih Chow

Abstract

Yuan Shih Chow was born in Hubei province in China, on September 1, 1924. The eldest child of a local militia and political leader, he grew up in war and turmoil. His hometown was on the front line during most of the Japanese invasion and occupation of China. When he was 16, Y. S. Chow journeyed, mostly on foot, to Chongqing (Chung-King), the wartime Chinese capital, to finish his high school education. When the Communist party gained power in China, Y. S. Chow had already followed his university job to Taiwan. In Taiwan, he taught mathematics as an assistant at National Taiwan University until he came to the United States in 1954. At the University of Illinois, he studied under J. L. Doob and received his Ph.D. in 1958. He served as a staff mathematician and adjunct faculty at the IBM Watson Research Laboratory and Columbia University from 1959 to 1962. He was a member of the Statistics Department at Purdue University from 1962 to 1968. From 1968 until his retirement in 1993, Y. S. Chow served as Professor of Mathematical Statistics at Columbia University. At different times, he was a visiting professor at the University of California at Berkeley, University of Heidelberg (Germany) and the National Central University, Taiwan. He served as Director of the Institute of Mathematics of Academia Sinica, Taiwan, and Director of the Center of Applied Statistics at Nankai University, Tianjin, China. He was instrumental in establishing the Institute of Statistics of Academia Sinica in Taiwan. He is currently Professor Emeritus at Columbia University. Y. S. Chow is a fellow of the Institute of Mathematical Statistics, a member of the International Statistical Institute and a member of Taiwan's Academia Sinica. He has numerous publications, including Great Expectations: The Theory of Optimal Stopping (1971), in collaboration with Herbert Robbins and David Siegmund, and Probability Theory (1978), in collaboration with Henry Teicher. Y. S. Chow has a strong interest in mathematics education. He taught high school mathematics for one year in 1947 and wrote a book on high school algebra in collaboration with J. H. Teng and M. L. Chu. In 1992, Y. S. Chow, together with I. S. Chang and W. C. Ho, established the Chinese Institute of Probability and Statistics in Taiwan. This conversation took place in the fall of 2003 in Dobbs Ferry, New York.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhiliang Ying, Cun-Hui Zhang. 2006-06-22. A Conversation with Yuan Shih Chow. https://doi.org/10.1214/088342304000000224

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Sample complexity and weak limits of nonsmooth multimarginal Schrödinger system with application to optimal transport barycenter

Multimarginal optimal transport (MOT) has emerged as a useful framework for many applied problems. However, compared to the well-studied classical two-marginal optimal transport theory, analysis of MOT is far more challenging and remains much less developed. In this paper, we study the statistical estimation and inference problems for the entropic MOT (EMOT), whose optimal solution is characterized by the multimarginal Schrödinger system. Assuming only boundedness of the cost function, we derive sharp sample complexity for estimating several key quantities pertaining to EMOT (cost functional and Schrödinger coupling) from point clouds that are randomly sampled from the input marginal distributions. Moreover, with substantially weaker smoothness assumption on the cost function than the existing literature, we derive distributional limits and bootstrap validity of various key EMOT objects. As an application, we propose the multimarginal Schrödinger barycenter as a new and natural way to regularize the exact Wasserstein barycenter and demonstrate its statistical optimality.

math.ST

Nonparametric spectral density estimation using interactive mechanisms under local differential privacy

We study the problem of estimating the spectral density of a centered stationary Gaussian time series under local differential privacy constraints. Specifically, we propose new interactive privacy mechanisms for three tasks: recovering a single covariance coefficient, recovering the spectral density at a fixed frequency, and global recovery. Our approach achieves faster rates through a two-stage process: we first apply the Laplace mechanism to the truncated value, and then use the resulting privatized sample to learn about the dependence mechanism in the time series. For spectral densities belonging to Hölder and Sobolev smoothness classes, we demonstrate that our algorithms improve upon the non-interactive mechanism of Kroll (2024) for small privacy parameter $α$, since the pointwise rates depend on $nα^2$ instead of $nα^4$. Moreover, we show that the rate $(nα^4)^{-1}$ is optimal for estimating a covariance coefficient with non-interactive mechanisms. However, the $L_2$ rate of our interactive estimator is slower than the pointwise rate. We show how to use these procedures to provide a bona fide locally differentially private estimator of the entire covariance matrix. A simulation study validates our findings.

math.ST

Estimating eigenvectors and eigenspaces of covariance matrices: Optimal Bounds and Conditions for Consistency

Let $X = [ ξ_1, \,\, ξ_2,...\,\, ,ξ_d]^\top$ be a zero-mean random vector of large dimension $d$ ($d \rightarrow \infty$) with (hidden) covariance matrix $M = (m_{ij})_{1 \leq i, j \leq d},$ where $m_{ij} = m_{ji} = \textbf{Cov}(ξ_i, ξ_j).$ Let $X_1, X_2, \dots, X_n$ be $n$ iid samples of $X$. Consider the sample covariance matrix $$\textstyle \tilde{M} := \frac{1}{n} \sum_{i=1}^{n} X_i X_i^\top.$$ In practice, one frequently uses the eigenvectors and eigenspaces of $\tilde M$ as estimators for those of $M$. A central task is to provide an error analysis for these estimators. In this paper, we provide an optimal error analysis, obtaining upper and lower bounds of matching order of magnitude, for a wide range of parameters $d$ and $n$, under mild assumptions on $M$. As corollaries, we obtain new necessary and sufficient conditions for the consistency of the estimators. In these conditions, we only require the number of samples $n$ to depend linearly on the effective rank of $M$, which can be much smaller than the dimension $d$.

math.ST