arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.08513cs.LGcs.DSmath.STstat.TH
收藏

学习多维直方图的快速样本近优算法

Fast and Sample Near-Optimal Algorithms for Learning Multidimensional Histograms

USC(南加利福尼亚大学);MIT(麻省理工学院)

Ilias Diakonikolas, Jerry Li, Ludwig Schmidt

摘要:

我们研究了多维直方图的鲁棒学习问题。$d$维函数$h: D \rightarrow \mathbb{R}$称为$k$直方图,如果存在域$D \subseteq \mathbb{R}^d$到$k$轴对齐矩形的分区,使得$h$在每个这样的矩形内是恒定的.令$f: D \rightarrow \mathbb{R}$是$d$维概率密度函数,并假设$f$在$L_1$ -距离上与未知$k$ -直方图(具有未知分区)是$\mathrm{OPT}$ -接近的.我们的目标是输出一个假设,即$O(\mathrm{OPT}) + ε$接近$f$,在$L_1$ -距离。我们给这个学习问题,使用$n = \tilde{O}_d(k/ε^2)$样本和运行时间$\tilde{O}_d(n)$的算法。对于任何固定的维度,我们的算法具有最佳的样本复杂度,对数因子,并在近线性时间运行。在我们的工作之前,$d=1$案例的时间复杂性已经被很好地理解,但是即使对于$d=2$,我们的理解仍然存在重大差距。

英文摘要:

We study the problem of robustly learning multi-dimensional histograms. A $d$-dimensional function $h: D \rightarrow \mathbb{R}$ is called a $k$-histogram if there exists a partition of the domain $D \subseteq \mathbb{R}^d$ into $k$ axis-aligned rectangles such that $h$ is constant within each such rectangle. Let $f: D \rightarrow \mathbb{R}$ be a $d$-dimensional probability density function and suppose that $f$ is $\mathrm{OPT}$-close, in $L_1$-distance, to an unknown $k$-histogram (with unknown partition). Our goal is to output a hypothesis that is $O(\mathrm{OPT}) + ε$ close to $f$, in $L_1$-distance. We give an algorithm for this learning problem that uses $n = \tilde{O}_d(k/ε^2)$ samples and runs in time $\tilde{O}_d(n)$. For any fixed dimension, our algorithm has optimal sample complexity, up to logarithmic factors, and runs in near-linear time. Prior to our work, the time complexity of the $d=1$ case was well-understood, but significant gaps in our understanding remained even for $d=2$.

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

↑