本文提出了一种新的方法来估计现有的互信息的依赖性度量使用直方图密度估计。为直方图寻找合适的区间长度是一个悬而未决的问题。我们提出了一种新的方法来计算直方图的bin长度使用点之间的最大分离函数。所选择的箱长导致直方图方法的一致密度估计。由此获得的密度值用于计算现有依赖性度量的估计。该估计被命名为基于互信息的依赖性指数(Intermediate Information Based Dependence Index,简称为DSI)。还叙述了它的一些重要性质。所提出的方法的性能进行了比较,普遍接受的措施,如距离相关(dcor),最大信息系数(MINE)的准确性和计算复杂性的帮助下,几个人工数据集与不同数量的噪声。所提出的方法是能够检测变量之间的多种类型的关系,而不作任何假设的关系的函数形式。所提出的方法的功率统计说明他们在检测非线性关系的有效性。因此,它能够实现通用性而没有高的假阳性率。在现实生活中的数据集上,我们发现它比其他方法更有效。所提出的方法被发现,以克服一些与装饰和矿山发生的限制。在计算方面,我们发现在时间和内存方面,dcor比dcor和MINE更好,这使得它适用于大型数据集。
英文摘要:
This article proposes a new method to estimate an existing mutual information based dependence measure using histogram density estimates. Finding a suitable bin length for histogram is an open problem. We propose a new way of computing the bin length for histogram using a function of maximum separation between points. The chosen bin length leads to consistent density estimates for histogram method. The values of density thus obtained are used to calculate an estimate of an existing dependence measure. The proposed estimate is named as Mutual Information Based Dependence Index (MIDI). Some important properties of MIDI have also been stated. The performance of the proposed method has been compared to generally accepted measures like Distance Correlation (dcor), Maximal Information Coefficient (MINE) in terms of accuracy and computational complexity with the help of several artificial data sets with different amounts of noise. The proposed method is able to detect many types of relationships between variables, without making any assumption about the functional form of the relationship. The power statistics of proposed method illustrate their effectiveness in detecting non linear relationship. Thus, it is able to achieve generality without a high rate of false positive cases. MIDI is found to work better on a real life data set than competing methods. The proposed method is found to overcome some of the limitations which occur with dcor and MINE. Computationally, MIDI is found to be better than dcor and MINE, in terms of time and memory, making it suitable for large data sets.
PAC-Bayes, MAC-Bayes and Conditional Mutual Information: Fast rate bounds that handle general VC classes
CWI Amsterdam(阿姆斯特丹数学与计算机科学国家研究所);Leiden University(莱顿大学);Google Research(谷歌研究院);Khoury College of Computer Sciences, Northeastern University(东北大学库里计算机科学学院)
Implementation of a High-Throughput Fast-SSC Polar Decoder with Sequence Repetition Node
尽管极化码在最新的5G蜂窝标准中被采用,但它们仍然存在高解码延迟的根本问题。针对这一问题,最近在\cite{sr2020}中提出了一种基于新的序列重复(SR)节点的快速简化连续消除(Fast-SSC)译码器,理论上该译码器所需的时间步长数比现有的Fast-SSC译码器要少。本文重点研究了这种基于SR节点的快速SSC(SRFSC)解码器的硬件实现。对长度为1024、码率为1/2的极化码的实现结果表明,该实现在Altera Stratix IV FPGA上的吞吐量达到了$505$ Mbps,比之前的工作提高了17.9%.