2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)最新文献_第4页

An empirical comparison of sampling techniques for matrix column subset selection 抽样技术的经验比较，为矩阵列子集的选择

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447127

Yining Wang, Aarti Singh

引用次数: 8

Finite-time analysis of the distributed detection problem 分布式检测问题的有限时间分析

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447059

Shahin Shahrampour, A. Rakhlin, A. Jadbabaie

引用次数: 8

On the rate of learning in distributed hypothesis testing 关于分布假设检验中的学习速率

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7446979

Anusha Lalitha, T. Javidi

{"title":"On the rate of learning in distributed hypothesis testing","authors":"Anusha Lalitha, T. Javidi","doi":"10.1109/ALLERTON.2015.7446979","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7446979","url":null,"abstract":"This paper considers a problem of distributed hypothesis testing and cooperative learning. Individual nodes in a network receive noisy local (private) observations whose distribution is parameterized by a discrete parameter (hypotheses). The conditional distributions are known locally at the nodes, but the true parameter/hypothesis is not known. We consider a social (“non-Bayesian”) learning rule from previous literature, in which nodes first perform a Bayesian update of their belief (distribution estimate) of the parameter based on their local observation, communicate these updates to their neighbors, and then perform a “non-Bayesian” linear consensus using the log-beliefs of their neighbors. For this learning rule, we know that under mild assumptions, the belief of any node in any incorrect parameter converges to zero exponentially fast, and the exponential rate of learning is a characterized by the network structure and the divergences between the observations' distributions. Tight bounds on the probability of deviating from this nominal rate in aperiodic networks is derived. The bounds are shown to hold for all conditional distributions which satisfy a mild bounded moment condition.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116136979","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Sparse covariance estimation based on sparse-graph codes 基于稀疏图代码的稀疏协方差估计

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/allerton.2015.7447061

Ramtin Pedarsani, Kangwook Lee, K. Ramchandran

{"title":"Sparse covariance estimation based on sparse-graph codes","authors":"Ramtin Pedarsani, Kangwook Lee, K. Ramchandran","doi":"10.1109/allerton.2015.7447061","DOIUrl":"https://doi.org/10.1109/allerton.2015.7447061","url":null,"abstract":"We consider the problem of recovering a sparse covariance matrix Σ∈ℝn×n from m quadratic measurements yi = aiTΣai+wi, 1 ≤ i ≤ m, where ai ∈ ℓn is a measurement vector and wi is additive noise. We assume that ℝ has K non-zero off-diagonal entries. We first consider the simplified noiseless problem where wi = 0 for all i. We introduce two low complexity algorithms, the first a “message-passing” algorithm and the second a “forward” algorithm, that are based on a sparse-graph coding framework. We show that under some simplifying assumptions, the message passing algorithm can recover an arbitrarily-large fraction of the K non-zero components with cK measurements, where c is a small constant that can be precisely characterized. As one instance, the message passing algorithm can recover, with high probability, a fraction 1 - 10-4 of the non-zero components, using only m = 6K quadratic measurements, which is a small constant factor from the fundamental limit, with an optimal O(K) decoding complexity. We further show that the forward algorithm can recover all the K non-zero entries with high probability with m = Θ(K) measurements and O(K log(K)) decoding complexity. However, the forward algorithm suffers from significantly larger constants in terms of the number of required measurements, and is indeed less practical despite providing stronger theoretical guarantees. We then consider the noisy setting, and show that both proposed algorithms can be robustified to noise with m = Θ(K log2(n)) measurements. Finally, we provide extensive simulation results that support our theoretical claims.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115295019","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 7

Are generalized cut-set bounds tight for the deterministic interference channel? 确定性干扰信道的广义割集边界紧吗?

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447176

Mehrdad Kiamari, A. Avestimehr

引用次数: 6

Statistical and computational guarantees for the Baum-Welch algorithm 鲍姆-韦尔奇算法的统计和计算保证

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447067

Fanny Yang, Sivaraman Balakrishnan, M. Wainwright

引用次数: 34

Optimal multi-vehicle adaptive search with entropy objectives 具有熵目标的最优多车自适应搜索

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447085

Huanyu Ding, D. Castañón

引用次数: 1

Is the direction of greater Granger causal influence the same as the direction of information flow? 格兰杰因果影响较大的方向是否与信息流的方向相同?

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447069

Praveen Venkatesh, P. Grover

{"title":"Is the direction of greater Granger causal influence the same as the direction of information flow?","authors":"Praveen Venkatesh, P. Grover","doi":"10.1109/ALLERTON.2015.7447069","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447069","url":null,"abstract":"Granger causality is an established statistical measure of the “causal influence” that one stochastic process X has on another process Y. Along with its more recent generalization - Directed Information - Granger Causality has been used extensively in neuroscience, and in complex interconnected systems in general, to infer statistical causal influences. More recently, many works compare the Granger causality metrics along forward and reverse links (from X to Y and from Y to X), and interpret the direction of greater causal influence as the “direction of information flow”. In this paper, we question whether the direction yielded by comparing Granger Causality or Directed Information along forward and reverse links is always the same as the direction of information flow. We explore this question using two simple theoretical experiments, in which the true direction of information flow (the “ground truth”) is known by design. The experiments are based on a communication system with a feedback channel, and employ a strategy inspired by the work of Schalkwijk and Kailath. We show that in these experiments, the direction of information flow can be opposite to the direction of greater Granger causal influence or Directed Information. We also provide information-theoretic intuition for why such counterexamples are not surprising, and why Granger causality-based information-flow inferences will only get more tenuous in larger networks. We conclude that one must not use comparison/difference of Granger causality to infer the direction of information flow.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133970165","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 10

On the representability of integer polymatroids: Applications in linear code construction 整数多拟阵的可表示性:在线性码构造中的应用

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447046

Amir Salimi, M. Médard, Shuguang Cui

引用次数: 7

Information-theoretic private interactive mechanism 信息论私有交互机制

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447104

Bahman Moraffah, L. Sankar

{"title":"Information-theoretic private interactive mechanism","authors":"Bahman Moraffah, L. Sankar","doi":"10.1109/ALLERTON.2015.7447104","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447104","url":null,"abstract":"An information-theoretic mechanism for privacy-guaranteed interactions is introduced between two memoryless correlated sources where each source is characterized by a pair of public and private variables. The interactions are modeled as a collection of K/2 pairs of random mappings, one pair for each of the K rounds of interactions. The K/2 random mapping pairs are chosen jointly to minimize the information leakage (privacy measure) over K rounds of the private variable of each source at the other source while ensuring that a desired measure of utility (distortion) of the revealed public variable is satisfied. Arguing that an average case information-theoretic privacy metric can be appropriate for streaming data settings, this paper shows that in general, interaction reduces privacy leakage by drawing some parallels between this problem and the classic interactive source coding problem. Specifically, for the log-loss distortion metric it is shown that the resulting interaction problem is an analog of an interactive information bottleneck problem for which a one-shot interactive mechanism is, in general, not optimal. For the resulting problem with a non-convex constraint space, an algorithm that extends the one-way agglomerative information bottleneck algorithm to the interactive setting is introduced.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115792496","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 11