arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1004.0557cs.ITmath.IT
收藏

Lindeberg原理在通信和统计学习中的应用

Applications of Lindeberg Principle in Communications and Statistical Learning

Satish Babu Korada, Andrea Montanari

摘要:

我们使用了推广的Lindeberg原则开发的Sourav Chatterjee证明通信,统计学习和随机矩阵理论中的各种问题的普遍性。我们还表明,这些系统可以被视为一个适当定义的稀疏系统的极限情况。当稀疏系统比稠密系统更容易分析时,后一个结果是有用的。我们考虑的问题清单绝不是详尽无遗的。我们相信,这些思想可以用于信息论相关的许多其他问题。

英文摘要:

We use a generalization of the Lindeberg principle developed by Sourav Chatterjee to prove universality properties for various problems in communications, statistical learning and random matrix theory. We also show that these systems can be viewed as the limiting case of a properly defined sparse system. The latter result is useful when the sparse systems are easier to analyze than their dense counterparts. The list of problems we consider is by no means exhaustive. We believe that the ideas can be used in many other problems relevant for information theory.

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

↑