We consider the statistical problem of recovering a hidden "ground truth" binary labeling for the vertices of a graph up to low Hamming error from noisy edge and vertex measurements. We present new algorithms and a sharp finite-sample analysis for this problem on trees and sparse graphs with poor expansion properties such as hypergrids and ring lattices. Our method generalizes and improves over that of Globerson et al. (2015), who introduced the problem for two-dimensional grid lattices.
For trees we provide a simple, efficient, algorithm that infers the ground truth with optimal Hamming error has optimal sample complexity and implies recovery results for all connected graphs. Here, the presence of side information is critical to obtain a non-trivial recovery rate. We then show how to adapt this algorithm to tree decompositions of edge-subgraphs of certain graph families such as lattices, resulting in optimal recovery error rates that can be obtained efficiently
The thrust of our analysis is to 1) use the tree decomposition along with edge measurements to produce a small class of viable vertex labelings and 2) apply an analysis influenced by statistical learning theory to show that we can infer the ground truth from this class using vertex measurements. We show the power of our method in several examples including hypergrids, ring lattices, and the Newman-Watts model for small world graphs. For two-dimensional grids, our results improve over Globerson et al. (2015) by obtaining optimal recovery in the constant-height regime.
On Learning Continuous Pairwise Markov Random Fields
Massachusetts Institute of Technology(麻省理工学院)
我们考虑从i.i.d样本中学习具有连续值变量的稀疏成对马尔可夫随机场(MRF)。我们调整了Vuffray等人的算法。(2019)在这种情况下,并提供有限样本分析,揭示样本复杂性随变量数量的变化规律,如离散和高斯设置。我们的方法是适用于一个大类的成对MRF连续变量,也有理想的渐近性质,包括在温和的条件下的一致性和正态性。此外,我们确定Vuffray等人(2019)中采用的优化标准的群体版本可以解释为局部最大似然估计(MLE)。作为我们分析的一部分,我们引入了稀疏线性回归a` la Lasso的稳健变化,这可能本身就很有趣。
Skolkovo Institute of Science and Technology (Skoltech)(斯科尔科沃科学技术研究院(Skoltech));Institute for Information Transmission Problems of RAS(俄罗斯科学院信息传输问题研究所);Moscow Institute of Physics and Technology(莫斯科物理技术学院);Central Research Institute for Epidemiology(中央流行病学研究所)
Discovering a sparse set of pairwise discriminating features in high dimensional data
John A. Paulson School of Engineering and Applied Sciences(约翰·A·保尔森工程与应用科学学院);Harvard University(哈佛大学);Department of Stem Cell and Regenerative Biology(干细胞与再生生物学系);Department of Molecular and Cellular Biology(分子与细胞生物学系)
University of Electronic Science and Technology of China(电子科技大学);Microsoft Research(微软研究院);ShanghaiTech University(上海科技大学);Shanghai Jiao Tong University(上海交通大学)
Does higher interpretability imply better utility? A Pairwise Analysis on Sparse Autoencoders
School of Computing and Data Science, The University of Hong Kong(计算与数据科学学院,香港大学);School of Data Science, The Chinese University of Hong Kong, Shenzhen(数据科学学院,香港中文大学(深圳))
Hybrid-Field Sparse Channel Representation and Recovery for XL-RIS-Assisted mmWave MIMO Systems
Beijing University of Posts and Telecommunications(北京邮电大学);Peng Cheng Laboratory(鹏城实验室);ZGC Institute of Ubiquitous-X Innovation and Applications(中关村泛在X创新与应用研究院)