arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1108.1022cs.ITmath.IT
收藏

信息复杂性与估计

Information Complexity and Estimation

Dror Baron

摘要:

我们考虑一个输入$x$所产生的一个未知的平稳遍历源$X$进入信号处理系统$J$,导致在$w=J(x)$。我们通过一个有噪声的通道$y=z(w)$观察$w$;我们的目标是从$y$、$J$和$f_{Y|W}$的知识中估计x。这是通用估计,因为$f_X$是未知的。我们提供了一个公式,描述了信息复杂性和噪声之间的权衡。最初的理论,算法和实验证据支持我们的方法。

英文摘要:

We consider an input $x$ generated by an unknown stationary ergodic source $X$ that enters a signal processing system $J$, resulting in $w=J(x)$. We observe $w$ through a noisy channel, $y=z(w)$; our goal is to estimate x from $y$, $J$, and knowledge of $f_{Y|W}$. This is universal estimation, because $f_X$ is unknown. We provide a formulation that describes a trade-off between information complexity and noise. Initial theoretical, algorithmic, and experimental evidence is presented in support of our approach.

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

↑