M. Ahmadi, Suda Bharadwaj, Takashi Tanaka, U. Topcu
{"title":"Stochastic Games with Sensing Costs","authors":"M. Ahmadi, Suda Bharadwaj, Takashi Tanaka, U. Topcu","doi":"10.1109/ALLERTON.2018.8636069","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8636069","url":null,"abstract":"In real-world games involving autonomous agents making decisions under uncertainty [1], the agents are often subject to sensing and communication limitations. In these cases, it is desirable to win the game, while also minimizing an agent’s sensing budget. In particular, in two-player uncertain adversarial environments, where one player enters the opponent’s territory, we seek a wining strategy with minimum sensing. In this paper, we consider finite two-player stochastic games, wherein in addition to the conventional cost over states and actions of each player, we include the sensing budget in terms of transfer entropy. We find a set of pure and mixed strategies for such a game via dynamic programming. The application of dynamic programming leads to a set of coupled nonlinear equations that we solve using the modified Arimoto-Blahut algorithm. The efficacy of the proposed method is illustrated by a stochastic unmanned aerial vehicle (UAV) pursuit-evasion game example using the tool AMASE.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"44 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":"128893843","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}
{"title":"Accurate Rate-Aware Flow-level Traffic Splitting","authors":"N. Wu, Shih-Hao Tseng, A. Tang","doi":"10.1109/ALLERTON.2018.8635940","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8635940","url":null,"abstract":"This paper aims to accurately realize given traffic split ratios in switches with small performance degradation. For given traffic split ratios calculated mathematically by TE algorithms in the control plane, the load distribution mechanisms in the data plane implement such splits without breaking flows. Treating all flows equally, the state-of-the-art approaches deployed in switches do not provide enough accuracy especially when facing non-uniform flow size distribution. We instead propose a dynamic load distribution scheme based on the collected load sharing statistics. It finds the most accurate traffic splits with minimum route changes. We implement our solution in Open vSwitch (OVS). Trace-driven and end-to-end experiments demonstrate that 1) our approach effectively adjusts load distribution in real time to mitigate the inaccuracy of splits caused by the variation of flow size distribution, 2) it outperforms the existing approaches with respect to both higher accuracy and lower level of route changes, and 3) it requires path changes for less flows when routing strategies are reconfigured, hence leads to better flow experience such as higher goodput.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"1 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":"131311738","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}
{"title":"Localized random projections with applications to coherent array imaging","authors":"R. S. Srinivasa, M. Davenport, J. Romberg","doi":"10.1109/ALLERTON.2018.8635868","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8635868","url":null,"abstract":"We consider the standard active array imaging problem and propose a novel trade-off that enables the imaging of range limited target scenes with far fewer measurements than conventional techniques by exploiting the bandwidth of the known excitation signal. Unlike standard compressed sensing, we do not assume that the scene is sparse, only that it is range limited. We abstract the proposed method as a novel matrix sketching problem that utilizes a few localized random projections in the row space of a matrix to capture the full row space. We provide mathematical guarantees on the number of such projections required. We present imaging simulation results that support our theoretical results.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"252 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":"115205114","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}
{"title":"Model-Based Encryption: Privacy of States in Networked Control Systems","authors":"Nirupam Gupta, N. Chopra","doi":"10.1109/ALLERTON.2018.8635912","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8635912","url":null,"abstract":"In this paper, we investigate model-based encryption scheme for privacy of states against eavesdroppers with unbounded computation power in one-channel feedback networked control system (NCSs). In the one-channel feedback NCS, the states of the plant are measured by remote sensors and the controller is co-located with the actuators. To emphasize the mechanics of the proposed approach, the model-based encryption scheme is referred to as masking with system kernel (MSK). In contrast to encryption approaches based on modern cryptography, MSK does not require generation and distribution of secret keys amongst sensors and the controller. It is demonstrated that MSK guarantees privacy of states against eavesdroppers with unbounded computation power if the system parameters of the considered one-channel feedback NCS are selected in an appropriate manner.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"52 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":"115372529","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}
{"title":"Some Results on the Computation of Feedback Capacity of Gaussian Channels with Memory","authors":"A. Pedram, Takashi Tanaka","doi":"10.1109/ALLERTON.2018.8636014","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8636014","url":null,"abstract":"We study the problem of computing the capacity of channels with feedback for the class of Gaussian channels with linear state-space models (possibly with hidden states) under the presence of quadratic input constraints. We first show that the input-output directed information is maximized by a Gaussian feedback policy. A few special cases are considered where such an optimization can be performed in a computationally tractable manner. In such cases, we show that the supremum of directed information admits a single-letter expression involving the convex log-determinant program as the block length tends to infinity.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"67 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":"127459121","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}
{"title":"Rate Distortion Via Restricted Boltzmann Machines","authors":"Qing Li, Yang Chen","doi":"10.1109/ALLERTON.2018.8635888","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8635888","url":null,"abstract":"Rate distortion is the theoretical foundation of lossy source compression. It addresses the problem of determining the minimal number of bits per symbol that should be communicated so that the source can be approximately reconstructed at the receiver without exceeding a given distortion. Restricted Boltzmann Machines (RBMs)are computational models that have recently been attracting much interest because they can represent any binary sequence distribution.The connections between the above two subjects are that rate distortion is a function of the RBM log partition function, and an RBM can be used to learn the optimal posterior as in the Blahut-Arimoto algorithm. The connection suggests a new tool to learn the optimal posterior and to calculate the N-th order rate distortion function.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"1 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":"129996608","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}
{"title":"Array LDPC Code-based Compressive Sensing","authors":"M. Lotfi, M. Vidyasagar","doi":"10.1109/ALLERTON.2018.8635990","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8635990","url":null,"abstract":"In this paper, we focus on the problem of compressive sensing using binary measurement matrices, and basis pursuit as the recovery algorithm. We obtain new lower bounds on the number of samples to achieve robust sparse recovery using binary matrices and derive sufficient conditions for a binary matrix with fixed column-weight to satisfy the robust null space property. Next we prove that any column-regular binary matrix with girth 6 has nearly optimal number of measurements. Then we show that the parity check matrices of array LDPC codes are nearly optimal in the sense of having girth six and almost satisfying the lower bound on the number of samples. Array code parity check matrices demonstrate an example of binary matrices that achieve guaranteed recovery via robust null-space property and in practice for $n leq 10^{6}$ provide faster recovery compared to the Gaussian counterpart. This is an extended abstract without proofs. The full paper with additional details can be found in [1].","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"1 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":"129119376","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}
{"title":"Policy Design for Active Sequential Hypothesis Testing using Deep Learning","authors":"D. Kartik, Ekraam Sabir, U. Mitra, P. Natarajan","doi":"10.1109/ALLERTON.2018.8636086","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8636086","url":null,"abstract":"Information theory has been very successful in obtaining performance limits for various problems such as communication, compression and hypothesis testing. Likewise, stochastic control theory provides a characterization of optimal policies for Partially Observable Markov Decision Processes (POMDPs) using dynamic programming. However, finding optimal policies for these problems is computationally hard in general and thus, heuristic solutions are employed in practice. Deep learning can be used as a tool for designing better heuristics in such problems. In this paper, the problem of active sequential hypothesis testing is considered. The goal is to design a policy that can reliably infer the true hypothesis using as few samples as possible by adaptively selecting appropriate queries. This problem can be modeled as a POMDP and bounds on its value function exist in literature. However, optimal policies have not been identified and various heuristics are used. In this paper, two new heuristics are proposed: one based on deep reinforcement learning and another based on a KL-divergence zero-sum game. These heuristics are compared with state-of-the-art solutions and it is demonstrated using numerical experiments that the proposed heuristics can achieve significantly better performance than existing methods in some scenarios.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"1 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":"131086081","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}
{"title":"On Differentially Private Gaussian Hypothesis Testing","authors":"Kwassi H. Degue, J. L. Ny","doi":"10.1109/ALLERTON.2018.8635911","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8635911","url":null,"abstract":"Data analysis for emerging systems such as syndromic surveillance or intelligent transportation systems requires testing statistical models based on privacy-sensitive data collected from individuals, e.g., medical records or location traces. In this paper, we design a differentially private hypothesis test based on the generalized likelihood ratio method to decide if data modeled as a sequence of independent and identically distributed Gaussian random variables has a given mean value. Analytic formulas for decision thresholds and for the test’s receiver operating characteristic curve show explicitly the performance impact of the privacy constraint. We then apply the algorithm to the design of a differentially private anomaly (or fault) detector and study its performance for the analysis of a syndromic surveillance dataset from the Centers for Disease Control and Prevention in the United States.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"70 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":"126972905","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}
{"title":"Recycled ADMM: Improve Privacy and Accuracy with Less Computation in Distributed Algorithms","authors":"Xueru Zhang, Mohammad Mahdi Khalili, M. Liu","doi":"10.1109/ALLERTON.2018.8635916","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8635916","url":null,"abstract":"Alternating direction method of multiplier (ADMM) is a powerful method to solve decentralized convex optimization problems. In distributed settings, each node performs computation with its local data and the local results are exchanged among neighboring nodes in an iterative fashion. During this iterative process the leakage of data privacy arises and can accumulate significantly over many iterations, making it difficult to balance the privacy-utility tradeoff. In this study we propose Recycled ADMM (R-ADMM), where a linear approximation is applied to every even iteration, its solution directly calculated using only results from the previous, odd iteration. It turns out that under such a scheme, half of the updates incur no privacy loss and require much less computation compared to the conventional ADMM. We obtain a sufficient condition for the convergence of R-ADMM and provide the privacy analysis based on objective perturbation.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"22 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":"126042033","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}