arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2410.01656math.STcs.DScs.LGstat.COstat.MLstat.TH
收藏

高效统计与未知截断,多项式时间算法,超越高斯分布

Efficient Statistics With Unknown Truncation, Polynomial Time Algorithms, Beyond Gaussians

Yale University(耶鲁大学)

Jane H. Lee, Anay Mehrotra, Manolis Zampetakis

AI总结:

本文研究了在未知截断集S下估计分布参数的问题,提出多项式时间算法,解决了高斯分布及更广泛分布的参数估计问题,并展示了在简单集如半空间时的算法设计。

摘要:

我们研究了在样本仅在某些未知集合S⊆R^d内时估计分布参数的问题。Kontonis等人(FOCS'19)给出了一个时间复杂度为d^{poly(1/ε)}的算法,用于估计高斯分布的参数。最近,Diakonikolas等人(COLT'24)证明了即使S属于某些良好行为的类别,这种指数依赖于1/ε的复杂性也是必要的。这些工作留下的开放问题在本文中得到解决:能否估计任意高斯分布或更广泛的分布参数?能否设计时间复杂度为poly(d/ε)的算法,当S是简单集合如半空间时?我们通过以下结果取得了进展:1. 针对第一个问题,我们给出了一个时间复杂度为d^{poly(ℓ/ε)}的算法,适用于满足某些结构假设的指数族分布和任何可由度ℓ多项式近似的未知集合S。该结果有两个重要应用:1a) 首个从未知截断S中估计任意高斯分布的算法;1b) 首个具有未知截断和高斯特征的线性回归算法。2. 为解决第二个问题,我们提供了一个运行时间为poly(d/ε)的算法,适用于当S是半空间或轴对齐矩形时的指数族分布集合。在此过程中,我们开发了可能有独立兴趣的工具,包括将具有正样本和无标签样本的PAC学习减少到具有正样本和负样本的PAC学习,该方法对某些协变量偏移具有鲁棒性。

英文摘要:

We study the estimation of distributional parameters when samples are shown only if they fall in some unknown set $S \subseteq \mathbb{R}^d$. Kontonis, Tzamos, and Zampetakis (FOCS'19) gave a $d^{\mathrm{poly}(1/\varepsilon)}$ time algorithm for finding $\varepsilon$-accurate parameters for the special case of Gaussian distributions with diagonal covariance matrix. Recently, Diakonikolas, Kane, Pittas, and Zarifis (COLT'24) showed that this exponential dependence on $1/\varepsilon$ is necessary even when $S$ belongs to some well-behaved classes. These works leave the following open problems which we address in this work: Can we estimate the parameters of any Gaussian or even extend beyond Gaussians? Can we design $\mathrm{poly}(d/\varepsilon)$ time algorithms when $S$ is a simple set such as a halfspace? We make progress on both of these questions by providing the following results: 1. Toward the first question, we give a $d^{\mathrm{poly}(\ell/\varepsilon)}$ time algorithm for any exponential family that satisfies some structural assumptions and any unknown set $S$ that is $\varepsilon$-approximable by degree-$\ell$ polynomials. This result has two important applications: 1a) The first algorithm for estimating arbitrary Gaussian distributions from samples truncated to an unknown $S$; and 1b) The first algorithm for linear regression with unknown truncation and Gaussian features. 2. To address the second question, we provide an algorithm with runtime $\mathrm{poly}(d/\varepsilon)$ that works for a set of exponential families (containing all Gaussians) when $S$ is a halfspace or an axis-aligned rectangle. Along the way, we develop tools that may be of independent interest, including, a reduction from PAC learning with positive and unlabeled samples to PAC learning with positive and negative samples that is robust to certain covariate shifts.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑