2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)最新文献_第8页

Deep Reinforcement One-Shot Learning for Change Point Detection 变化点检测的深度强化单次学习

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635928

A. Puzanov, Kobi Cohen

引用次数: 6

2D Linear Detector Based on Generalized Belief Propagation Algorithm 基于广义信念传播算法的二维线性检测器

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8636002

C. Matcha, S. Garani

{"title":"2D Linear Detector Based on Generalized Belief Propagation Algorithm","authors":"C. Matcha, S. Garani","doi":"10.1109/ALLERTON.2018.8636002","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8636002","url":null,"abstract":"Various ideas have been borrowed from 1D inter symbol interference (ISI) detectors towards approximation of near maximum likelihood (ML) detection over 2D ISI channels. Generalized belief propagation (GBP) algorithm is a graph based algorithm different from these algorithms and is observed to give the best bit error rate (BER) performance by minimizing KL-distance metric. GBP algorithm passes messages between regions instead of messages between nodes in an iterative fashion. However, GBP algorithm has a very high computational complexity and is not suitable for practical deployment. In this paper, we propose a GBP based signal detection algorithm using a quadratic approximation of the KL-distance metric. This allows us to minimize the cost function by solving a set of linear equations i.e., obtain a one shot solution instead of the iterative message passing in the GBP algorithm. We also provide an intuition into the nature of the hard decisions given by the algorithm. The idea opens up various approximations of the GBP algorithm using different convex approximations of the cost function with the desired nature of obtaining the solution. We show the efficacy of the proposed algorithm by detecting 5×5 pages of binary data over a chosen channel with 3×3 ISI span. The quadratic approximation is observed to give 1.5 dB inferior performance in signal-to-noise ratio (SNR) as compared to the GBP algorithm.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"50 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127235972","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}

引用次数: 0

How Many Sensors to Localize the Source? The Double Metric Dimension of Random Networks 定位信号源需要多少个传感器?随机网络的双度量维

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635897

Brunella Spinelli, L. E. Celis, Patrick Thiran

引用次数: 14

Coded Energy-Efficient Beam-Alignment for Millimeter-Wave Networks 毫米波网络编码高能效波束对准

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635944

Muddassar Hussain, Nicolò Michelusi

引用次数: 4

A Code-Based Distributed Gradient Descent Method 基于代码的分布式梯度下降方法

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635869

Elie Atallah, N. Rahnavard

{"title":"A Code-Based Distributed Gradient Descent Method","authors":"Elie Atallah, N. Rahnavard","doi":"10.1109/ALLERTON.2018.8635869","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8635869","url":null,"abstract":"Distributed gradient descent is an optimization algorithm that is used to solve a minimization problem distributed over a network through minimizing local functions that sum up to form the overall objective function. These local functions fi contribute to local gradients adding up incrementally to form the overall gradient. Recently, the gradient coding paradigm was introduced for networks with a centralized fusion center to resolve the problem of straggler nodes. Through introducing some kind of redundancy on each node, such coding schemes are utilized to form new coded local functions gi from the original local functions fi. In this work, we consider a distributed network with a defined network topology and no fusion center. At each node, linear combinations of the local coded gradients $nablaoverline{g}_{i}$ can be constructed to form the overall gradient. Our iterative method, referred to as Code-Based Distributed Gradient Descent (CDGD), updates each node's local estimate by applying an adequate weighing scheme. This scheme adapts the coded local gradient descent step along with local estimates from neighboring nodes. We provide the convergence analysis for CDGD and we analytically show that we enhance the convergence rate by a scaling factor over conventional incremental methods without any predefined tuning. Furthermore, we demonstrate through numerical results significant performance and enhancements for convergence rates.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134604560","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

Dynamic Economic Dispatch and Price Evolution under Ramping Constraints and Uncertain Demand 斜坡约束和不确定需求下的动态经济调度与价格演化

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635638

Abhishek K. Gupta, Balsam Dakhil, R. Jain

引用次数: 0

Fundamental Limits of Covert Bit Insertion in Packets 数据包中隐蔽位插入的基本限制

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635975

Ramin Soltani, D. Goeckel, D. Towsley, A. Houmansadr

{"title":"Fundamental Limits of Covert Bit Insertion in Packets","authors":"Ramin Soltani, D. Goeckel, D. Towsley, A. Houmansadr","doi":"10.1109/ALLERTON.2018.8635975","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8635975","url":null,"abstract":"Covert communication is necessary when revealing the mere existence of a message leaks sensitive information to an attacker. Consider a network link where an authorized transmitter Jack sends packets to an authorized receiver Steve, and the packets visit Alice, Willie, and Bob, respectively, before they reach Steve. Covert transmitter Alice wishes to alter the packet stream in some way to send information to covert receiver Bob without watchful and capable adversary Willie being able to detect the presence of the message. In our previous works, we addressed two techniques for such covert transmission from Alice to Bob: packet insertion and packet timing. In this paper, we consider covert communication via bit insertion in packets with available space (e.g., with size less than the maximum transmission unit). We consider three scenarios: 1) packet sizes are independent and identically distributed (i.i.d.) with a probability mass function (pmf) whose support is a set of one bit spaced values; 2) packet sizes are i.i.d. with a pmf whose support is arbitrary; 3) packet sizes may be dependent. For the first and second assumptions, we show that Alice can covertly insert $O(sqrt{n})$ bits of information in a flow of n packets; conversely, if she inserts $omega(sqrt{n})$ bits of information, Willie can detect her with arbitrarily small error probability. For the third assumption, we prove Alice can covertly insert on average $O(c(n)/sqrt{n})$ bits in a sequence of n packets, where $c(n)$ is the average number of conditional pmf of packet sizes given the history, with a support of at least size two.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131346427","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

Analysis and Detection of Cyber-physical Attacks in Distributed Sensor Networks 分布式传感器网络中的网络物理攻击分析与检测

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635989

Aquib Mustafa, H. Modares

引用次数: 5

ASY-SONATA: Achieving Linear Convergence in Distributed Asynchronous Multiagent Optimization ASY-SONATA:实现分布式异步多代理优化的线性收敛

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8636055

Ye Tian, Ying Sun, G. Scutari

{"title":"ASY-SONATA: Achieving Linear Convergence in Distributed Asynchronous Multiagent Optimization","authors":"Ye Tian, Ying Sun, G. Scutari","doi":"10.1109/ALLERTON.2018.8636055","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8636055","url":null,"abstract":"This papers studies multi-agent (convex and nonconvex) optimization over static digraphs. We propose a general distributed asynchronous algorithmic framework whereby i) agents can update their local variables as well as communicate with their neighbors at any time, without any form of coordination; and ii) they can perform their local computations using (possibly) delayed, out-of-sync information from their neighbors. Delays need not be known to the agents or obey any specific profile, and can also be time-varying (but bounded). The algorithm builds on a tracking mechanism that is robust against asynchrony (in the above sense), whose goal is to estimate locally the sum of agents’ gradients. When applied to strongly convex functions, we prove that it converges at an R-linear (geometric) rate as long as the step-size is sufficiently small. A sublinear convergence rate is proved, when nonconvex problems and/or diminishing, uncoordinated step-sizes are employed. To the best of our knowledge, this is the first distributed algorithm with provable geometric convergence rate in such a general asynchonous setting.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115537161","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}

引用次数: 25

Communication Link Elimination in Static LQG Teams 静态LQG队伍中的通信链路消除

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635873

Jiacheng Tang, Abhishek K. Gupta

引用次数: 0