Searcharxiv⌕ Search

arXiv subjects

Dongsun Yoon

Publications and source records attributed to Dongsun Yoon.

3 recordsLinked to original sources

Uniform Discrete Diffusion Models are Minimax Optimal for Estimating Distributions with Small Effective Support Size

Discrete diffusion models have emerged as a practically successful framework for generative modeling on discrete product spaces, yet their statistical generalization properties remain poorly understood. Discrete real-world data such as text or biological sequences often concentrate on a small fraction of the astronomically large ambient space because of semantic or physical constraints, but existing bounds fail to capture this distributional structure and instead scale with the size of the ambient space, giving rise to almost vacuous error bounds. We address this gap for uniform discrete diffusion, one of the two dominant discrete diffusion paradigms alongside masking diffusion, by deriving statistical guarantees governed by the effective support size $s_n(P_0)$, a sample-size-dependent measure of distributional complexity. Given $n$ independent and identically distributed (i.i.d.) samples from an unknown data distribution $P_0$ on $[K]^d$, we show that, with appropriate choices of network size and hyperparameters, the expected total variation (TV) loss scales as $O(\sqrt{s_n(P_0)/n})$, while the expected Kullback--Leibler (KL) divergence is bounded by $O(\frac{1}{n}s_n(P_0)\log(eK^d/s_n(P_0))\log n)$. Furthermore, we show that the TV rate is minimax optimal and that the KL rate is minimax optimal up to a factor of $\log n$. Together, these upper and lower bounds show that uniform discrete diffusion successfully avoids the curse of dimensionality for distributions with small effective support size: the TV error rate depends on the ambient state-space size only through $s_n(P_0)$, while the corresponding KL rate incurs only an additional logarithmic dependence on the ambient state-space size.

stat.ML↗

iLBA: An R package for confidentially disseminating aggregated frequency tables

Statistical agencies frequently release frequency tables derived from microdata, but small frequency cells may lead to disclosure risks. We present \texttt{iLBA}, an open-source \textsf{R} package for confidential dissemination of aggregated frequency tables. The package implements the Information-Loss-Bounded Aggregation (iLBA) algorithm, which combines Small Cell Adjustment (SCA) at the finest level table with an aggregation procedure that introduces controlled ambiguity while bounding information loss. The software enables users to construct masked finest level tables, generate confidential aggregated tables for selected variables, and obtain masked frequencies for single-cell queries. By providing an accessible implementation of the iLBA method, the package facilitates reproducible and efficient disclosure control for tabular data derived from microdata.

stat.CO↗

Adaptive Reference-Guided Estimation of Principal Component Subspace in High Dimensions

We propose a novel estimator for the principal component (PC) subspace tailored to the high-dimension, low-sample size (HDLSS) context. The method, termed Adaptive Reference-Guided (ARG) estimator, is designed for data exhibiting spiked covariance structures and seeks to improve upon the conventional sample PC subspace by leveraging auxiliary information from reference vectors, presumed to carry prior knowledge about the true PC subspace. The estimator is constructed by first identifying vectors asymptotically orthogonal to the true PC subspace within a signal subspace, the subspace spanned by the leading sample PC directions and the references, and then taking the orthogonal complement. The estimator is adaptive, as it automatically selects the subspace asymptotically closest to the true PC subspace inside the signal subspace, without requiring parameter tuning. We show that when the reference vectors carry nontrivial information, the proposed estimator asymptotically reduces all principal angles between the estimated and true PC subspaces compared to the naive sample-based estimator. Interestingly, despite being derived from a completely different rationale, the ARG estimator is theoretically equivalent to an estimator based on James-Stein shrinkage. Our results thus establish a theoretical foundation that unifies these two distinct approaches.

math.ST↗