{"title":"Recovering Noisy-Pseudo-Sparse Signals From Linear Measurements via l∞","authors":"Hang Zhang, A. Abdi, F. Fekri","doi":"10.1109/ALLERTON.2019.8919861","DOIUrl":"https://doi.org/10.1109/ALLERTON.2019.8919861","url":null,"abstract":"Compressive sensing (CS) can recover a sparse signal x reliably under an indefinite linear system. However, corruption with noise can severely damage the system performance. For Gaussian deviation, a noise whitening method is often used which leads to the noise folding phenomenon, increasing the noise energy greatly. In this paper, we introduce a different approach and design a new optimization model to recover x with $ell _{infty }$ norm. Moreover, in our setup, the signal (prior to corruption by noise) is only pseudo sparse. We analyze the solution exactness and show that a unique solution close to the true values of pseudo-sparse signals can be obtained in an indefinite system with uniform magnitude noise. We then relax the uniform-magnitude assumption and use Gaussian noise in simulations. We show that, compared to the noise-whitening method, our method can reduce almost 50% of the noise by only sacrificing less than 0.3% of the support-set recovery rate.","PeriodicalId":120479,"journal":{"name":"2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131800499","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":"Reinforcement Learning for Optimal Control of Queueing Systems","authors":"Bai Liu, Qiaomin Xie, E. Modiano","doi":"10.1109/ALLERTON.2019.8919665","DOIUrl":"https://doi.org/10.1109/ALLERTON.2019.8919665","url":null,"abstract":"With the rapid advance of information technology, network systems have become increasingly complex and hence the underlying system dynamics are typically unknown or difficult to characterize. Finding a good network control policy is of significant importance to achieving desirable network performance (e.g., high throughput or low average job delay). Online/sequential learning algorithms are well-suited to learning the optimal control policy from observed data for systems without the information of underlying dynamics. In this work, we consider using model-based reinforcement learning (RL) to learn the optimal control policy of queueing networks so that the average job delay (or equivalently the average queue backlog) is minimized. Existing RL techniques, however, cannot handle the unbounded state spaces of the network control problem. To overcome this difficulty, we propose a new algorithm, called Piecewise Decaying $epsilon$-Greedy Reinforcement Learning (PDGRL), which applies model-based RL methods over a finite subset of the state space. We establish that the average queue backlog under PDGRL with an appropriately constructed subset can be arbitrarily close to the optimal result. We evaluate PDGRL in dynamic server allocation and routing problems. Simulations show that PDGRL minimizes the average queue backlog effectively.","PeriodicalId":120479,"journal":{"name":"2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114545495","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":"Proximal optimization for resource allocation in distributed computing systems with data locality","authors":"Diego Goldsztajn, F. Paganini, Andrés Ferragut","doi":"10.1109/ALLERTON.2019.8919839","DOIUrl":"https://doi.org/10.1109/ALLERTON.2019.8919839","url":null,"abstract":"We consider resource allocation questions for computing infrastructures with multiple server instances. In particular, the joint optimization of active service capacity, load balancing between clusters of servers, and task scheduling at each cluster, under conditions of data locality which imply different service rates for different cluster locations.Building on previous work, we formulate a convex optimization problem, and use Lagrange duality to decompose it between the different decision variables. We include regularization terms from proximal methods to obtain continuous control laws for load balancing and scheduling, and optimize the remaining variables through primal-dual gradient dynamics. We prove convergence of the resulting control laws to the desired optimal points, and demonstrate its behavior by simulations.","PeriodicalId":120479,"journal":{"name":"2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114698086","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":"Attack Analysis for Discrete-time Distributed Multi-Agent Systems","authors":"Aquib Mustafa, H. Modares","doi":"10.1109/ALLERTON.2019.8919789","DOIUrl":"https://doi.org/10.1109/ALLERTON.2019.8919789","url":null,"abstract":"The recent growth of cyber-physical systems provides new opportunities to the attackers to undermine the system performance or even destabilize it. This work presents a system theoretic approach for the analysis of the adverse effects of attacks in discrete-time distributed multi-agent systems. Analyzing cyber-physical attacks from the attacker’s perspective improves the system awareness against attacks and reinforces the necessity of developing novel resilient control protocols. To this end, we first show that an attack on a compromised agent can adversely affect intact agents that are reachable from it. Then, we show that how an attack on a single root node can snowball into a network-wide attack and even destabilize the entire system. Finally, we show that the local neighborhood tracking error for the intact agents goes to zero, despite attack. This makes existing robust control approaches that aim at attenuation of disturbance or attack based on local neighborhood tracking ineffective, and demands designing novel resilient control approaches.","PeriodicalId":120479,"journal":{"name":"2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117188836","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":"Decentralization Issues in Cell-free Massive MIMO Networks with Zero-Forcing Precoding","authors":"F. Riera-Palou, G. Femenias","doi":"10.1109/ALLERTON.2019.8919893","DOIUrl":"https://doi.org/10.1109/ALLERTON.2019.8919893","url":null,"abstract":"Cell-free massive MIMO (CF-M-MIMO) systems represent an evolution of the classical cellular architecture that has dominated the mobile landscape for decades. In CF-M-MIMO, a central processing unit (CPU) controls a multitude of access points (APs) that are irregularly scattered throughout the coverage area effectively becoming a fully distributed implementation of the MMIMO technology. As such, it inherits many of the key properties that have made M-MIMO one of the physical layer pillars of 5G systems while opening the door to new features not available in M-MIMO. Among the latest is the possibility of performing the precoding at the CPU (centralized) or at the APs (distributed) with the former known to offer much better performance at the cost of having to collect all the relevant channel state information (CSI) at the CPU. Realistic deployments of cell-free systems are likely to require more than one CPU when the area to be covered is large, thus a critical issue that needs to be solved is how these multiple CPUs should be interconnected. This paper analyzes and proposes designs for different degrees of interconnectivity among the CPUs for the specific case of centralized zero-forcing precoding. Results show that a modest form of CPU interconnection can boost very significantly the max-min rate performance so prevalent in CF-M-MIMO architectures.","PeriodicalId":120479,"journal":{"name":"2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132980457","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":"Projections onto the Set of Feasible Inputs and the Set of Feasible Solutions","authors":"Claudio Gambella, Jakub Marecek, M. Mevissen","doi":"10.1109/ALLERTON.2019.8919776","DOIUrl":"https://doi.org/10.1109/ALLERTON.2019.8919776","url":null,"abstract":"We study the projection onto the set of feasible inputs and the set of feasible solutions of a polynomial optimisation problem (POP). Our motivation is increasing the robustness of solvers for POP: Without a priori guarantees of feasibility of a particular instance, one should like to perform the projection onto the set of feasible inputs prior to running a solver. Without a certificate of optimality, one should like to project the output of the solver onto the set of feasible solutions subsequently. We study the computational complexity, formulations, and convexifications of the projections. Our results are illustrated on IEEE test cases of Alternating Current Optimal Power Flow (ACOPF) problem.","PeriodicalId":120479,"journal":{"name":"2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126737974","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":"A Tragedy of Autonomy. self-driving cars and urban congestion externalities","authors":"Philip N. Brown","doi":"10.1109/ALLERTON.2019.8919766","DOIUrl":"https://doi.org/10.1109/ALLERTON.2019.8919766","url":null,"abstract":"Much recent work on autonomous vehicles has focused on the ability of autonomous vehicles to form platoons, decreasing average vehicle headways and thereby increasing road capacities. However, it has recently been noted that autonomous vehicles could also effectively reduce passenger throughput despite the benefits of platooning due to a variety of effects, including the presence of unoccupied vehicles and the fact that increased road capacities can inadvertently lead to increases in aggregate congestion through various selfish routing paradoxes. This paper poses a model of urban traffic congestion in which occupants may choose to exit their vehicles at a workplace and then send the vehicle on to park itself-thus leading to an increased presence of unoccupied vehicles in urban centers. We show how this sets the stage for a tragedy of the commons, as it has the potential to amplify the already-present congestion externalities and how this can lead to increased aggregate congestion for a wide range of parameter values.","PeriodicalId":120479,"journal":{"name":"2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126533007","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":"State space homogenization in hybrid dynamical systems with two subsystems","authors":"M. Cistelecan","doi":"10.1109/ALLERTON.2019.8919884","DOIUrl":"https://doi.org/10.1109/ALLERTON.2019.8919884","url":null,"abstract":"The paper proposes a mathematical framework to be used for the homogenization of the Hybrid Dynamical Systems (HDS) state space. This is based on new mathematical paradigms like non-archimedean valued spaces, p-adic rational numbers and rigid algebraic geometry. Although the mathematical concepts are rather complex we believe the value they bring to solving our problem makes it worthwhile. Here we show how a HDS consisting of two sub-systems could be modeled as a Tate curve, [1]. This paper is a continuation of [2]. We extend and detail here the mathematical framework of embedding a HDS into a Tate curve.","PeriodicalId":120479,"journal":{"name":"2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122346993","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}