{"title":"Communication Complexity of Two-party Nonparametric Global Density Estimation","authors":"Jingbo Liu","doi":"10.1109/CISS53076.2022.9751150","DOIUrl":"https://doi.org/10.1109/CISS53076.2022.9751150","url":null,"abstract":"Consider the problem of nonparametric estimation of an unknown <tex>$beta$</tex> -Hölder smooth density function <tex>$p_{XY}$</tex> with compact support, where <tex>$X$</tex> and <tex>$Y$</tex> are both <tex>$d$</tex> dimensional. An infinite sequence of i.i.d. samples <tex>$(X_{i}, Y_{i})$</tex> are generated according to this distribution, and two terminals observe <tex>$(X_{i})$</tex> and <tex>$(Y_{i})$</tex>, respectively. They are allowed to exchange <tex>$k$</tex> bits either in oneway or interactively in order for Bob to estimate the unknown density. We show that the minimax mean integrated square risk is order <tex>$(frac{k}{log k})^{-frac{beta}{d+beta}}$</tex> for one-way protocols, and between <tex>$(frac{k}{log k})^{-frac{beta}{d+beta}}$</tex> and <tex>$k^{-frac{beta}{d+beta}}$</tex> for interactive protocols. These rates are different from the case of pointwise density estimation which we recently determined in another work. The interactive lower bound in this work used, among other things, a recent result of Ordentlich and Polyanskiy regarding the optimality of binary inputs in certain optimizations related to the strong data processing constant.","PeriodicalId":305918,"journal":{"name":"2022 56th Annual Conference on Information Sciences and Systems (CISS)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121605382","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":"Multi-user Beam Alignment in Presence of Multi-path","authors":"Nariman Torkzaban, M. Khojastepour, J. Baras","doi":"10.1109/CISS53076.2022.9751191","DOIUrl":"https://doi.org/10.1109/CISS53076.2022.9751191","url":null,"abstract":"To overcome the high pathloss and the intense shadowing in millimeterwave (mmWave) communications, effective beamforming schemes are required which incorporate narrow beams with high beamforming gains. The mm Wave channel consists of a few spatial clusters each associated with an angle of departure (AoD). The narrow beams must be aligned with the channel AoDs to increase the beamforming gain. This is achieved through a procedure called beam alignment (BA). Most of the BA schemes in the literature consider channels with a single dominant path while in practice the channel has a few resolvable paths with different AoDs, hence, such BA schemes may not work correctly in the presence of multi-path or at the least do not exploit such multi path to achieve diversity or increase robustness. In this paper, we propose an efficient BA schemes in presence of multi-path. The proposed BA scheme transmits probing packets using a set of scanning beams and receives the feedback for all the scanning beams at the end of probing phase from each user. We formulate the BA scheme as minimizing the expected value of the average transmission beamwidth under different policies. The policy is defined as a function from the set of received feedback to the set of transmission beams (TB). In order to maximize the number of possible feedback sequences, we prove that the set of scanning beams (SB) has an special form, namely, Tulip Design. Consequently, we rewrite the minimization problem with a set of linear constraints and reduced number of variables which is solved by using an efficient greedy algorithm.","PeriodicalId":305918,"journal":{"name":"2022 56th Annual Conference on Information Sciences and Systems (CISS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124976065","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":"Communication Efficient Federated Learning via Ordered ADMM in a Fully Decentralized Setting","authors":"Yicheng Chen, Rick S. Blum, Brian M. Sadler","doi":"10.1109/CISS53076.2022.9751166","DOIUrl":"https://doi.org/10.1109/CISS53076.2022.9751166","url":null,"abstract":"The challenge of communication-efficient distributed optimization has attracted attention in recent years. In this paper, a communication efficient algorithm, called ordering-based alternating direction method of multipliers (OADMM) is devised in a general fully decentralized network setting where a worker can only exchange messages with neighbors. Compared to the classical ADMM, a key feature of OADMM is that transmissions are ordered among workers at each iteration such that a worker with the most informative data broadcasts its local variable to neighbors first, and neighbors who have not transmitted yet can update their local variables based on that received transmission. In OADMM, we prohibit workers from transmitting if their current local variables are not sufficiently different from their previously transmitted value. A variant of OADMM, called SOADMM, is proposed where transmissions are ordered but transmissions are never stopped for each node at each iteration. Numerical results demonstrate that given a targeted accuracy, OADMM can significantly reduce the number of communications compared to existing algorithms including ADMM. We also show numerically that SOADMM can accelerate convergence, resulting in communication savings compared to the classical ADMM.","PeriodicalId":305918,"journal":{"name":"2022 56th Annual Conference on Information Sciences and Systems (CISS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121885831","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":"The Price of Distributed: Rate Loss in the CEO Problem","authors":"Arda Atalik, Alper Kose, M. Gastpar","doi":"10.1109/CISS53076.2022.9751153","DOIUrl":"https://doi.org/10.1109/CISS53076.2022.9751153","url":null,"abstract":"In the distributed remote (CEO) source coding problem, many separate encoders observe independently noisy copies of an underlying source. The rate loss is the difference between the rate required in this distributed setting and the rate that would be required in a setting where the encoders can fully cooperate. In this sense, the rate loss characterizes the price of distributed processing. We survey and extend the known results on the rate loss in various settings, with a particular emphasis on the case where the noise in the observations is Gaussian, but the underlying source is general.","PeriodicalId":305918,"journal":{"name":"2022 56th Annual Conference on Information Sciences and Systems (CISS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133798467","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}
Siyao Zhou, Sadaf Salehkalaibar, Jingjing Qian, Jun Chen, Wuxian Shi, Yiqun Ge, W. Tong
{"title":"On Distributed Lossy Coding of Symmetrically Correlated Gaussian Sources","authors":"Siyao Zhou, Sadaf Salehkalaibar, Jingjing Qian, Jun Chen, Wuxian Shi, Yiqun Ge, W. Tong","doi":"10.1109/CISS53076.2022.9751178","DOIUrl":"https://doi.org/10.1109/CISS53076.2022.9751178","url":null,"abstract":"In this paper, we consider a distributed lossy compression network with $L$ encoders and a decoder. Each encoder observes a source and sends a compressed version to the decoder. The decoder produces a joint reconstruction of target signals with the mean squared error distortion below a given threshold. It is assumed that the observed sources can be expressed as the sum of target signals and corruptive noises which are independently generated from two symmetric multivariate Gaussian distributions. We are interested in the minimum compression rate of this network versus the distortion threshold, which is known as the rate-distortion function. We derive a lower bound on the rate-distortion function by explicitly solving a max-min problem. Our lower bound matches the well-known Berger-Tung upper bound for some values of the distortion threshold. The asymptotic expressions of the upper and lower bounds are derived in the large $L$ limit and are shown to coincide under specific constraints.","PeriodicalId":305918,"journal":{"name":"2022 56th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130569472","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":"VaxEquity: A Data-Driven Risk Assessment and Optimization Framework for Equitable Vaccine Distribution","authors":"Navpreet Kaur, Jason Hughes, Juntao Chen","doi":"10.1109/CISS53076.2022.9751173","DOIUrl":"https://doi.org/10.1109/CISS53076.2022.9751173","url":null,"abstract":"With the continuous rise of the COVID-19 cases worldwide, it is imperative to ensure that all those vulnerable countries lacking vaccine resources can receive sufficient support to contain the risks. COVAX is such an initiative operated by the WHO to supply vaccines to the most needed countries. One critical problem faced by the COVAX is how to distribute the limited amount of vaccines to these countries in the most efficient and equitable manner. This paper aims to address this challenge by first proposing a data-driven risk assessment and prediction model and then developing a decision-making framework to support the strategic vaccine distribution. The machine learning-based risk prediction model characterizes how the risk is influenced by the underlying essential factors, e.g., the vaccination level among the population in each COVAX country. This predictive model is then leveraged to design the optimal vaccine distribution strategy that simultaneously minimizes the resulting risks while maximizing the vaccination coverage in these countries targeted by COVAX. Finally, we corroborate the proposed framework using case studies with real-world data.","PeriodicalId":305918,"journal":{"name":"2022 56th Annual Conference on Information Sciences and Systems (CISS)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132732672","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":"Hardware-Efficient Deconvolution-Based GAN for Edge Computing","authors":"A. Alhussain, Mingjie Lin","doi":"10.1109/CISS53076.2022.9751185","DOIUrl":"https://doi.org/10.1109/CISS53076.2022.9751185","url":null,"abstract":"Generative Adversarial Networks (GAN) are cutting-edge algorithms for generating new data samples based on the learned data distribution. However, its performance comes at a significant cost in terms of computation and memory requirements. In this paper, we proposed an HW/SW co-design approach for training quantized deconvolution GAN (QDCGAN) implemented on FPGA using a scalable streaming dataflow architecture capable of achieving higher throughput versus resource utilization trade-off. The developed accelerator is based on an efficient deconvolution engine that offers high parallelism with respect to scaling factors for GAN-based edge computing. Furthermore, various precisions, datasets, and network scalability were analyzed for low-power inference on resource-constrained platforms. Lastly, an end-to-end open-source framework is provided for training, implementation, state-space exploration, and scaling the inference using Vivado high-level synthesis for Xilinx SoC-FPGAs, and a comparison testbed with Jetson Nano.","PeriodicalId":305918,"journal":{"name":"2022 56th Annual Conference on Information Sciences and Systems (CISS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125124998","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":"Dynamical Dorfman Testing with Quarantine","authors":"Mustafa Doger, S. Ulukus","doi":"10.1109/CISS53076.2022.9751175","DOIUrl":"https://doi.org/10.1109/CISS53076.2022.9751175","url":null,"abstract":"We consider dynamical group testing problem with a community structure. With a discrete-time SIR (susceptible, infectious, recovered) model, we use Dorfman's two-step group testing approach to identify infections, and step in whenever necessary to inhibit infection spread via quarantines. We analyze the trade-off between quarantine and test costs as well as disease spread. For the special dynamical i.i.d. model, we show that the optimal first stage Dorfman group size differs in dynamic and static cases. We compare the performance of the proposed dynamic two-stage Dorfman testing with state-of-the-art non-adaptive group testing method in dynamic settings.","PeriodicalId":305918,"journal":{"name":"2022 56th Annual Conference on Information Sciences and Systems (CISS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123465274","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}
Kelly Levick, Reinhard Heckel, Ilan Shomorony University of Illinois Urbana-Champaign, T. U. Munich
{"title":"Achieving the Capacity of a DNA Storage Channel with Linear Coding Schemes","authors":"Kelly Levick, Reinhard Heckel, Ilan Shomorony University of Illinois Urbana-Champaign, T. U. Munich","doi":"10.1109/CISS53076.2022.9751151","DOIUrl":"https://doi.org/10.1109/CISS53076.2022.9751151","url":null,"abstract":"Due to the redundant nature of DNA synthesis and sequencing technologies, a basic model for a DNA storage system is a multi-draw “shuffling-sampling” channel. In this model, a random number of noisy copies of each sequence is observed at the channel output. Recent works have characterized the capacity of such a DNA storage channel under different noise and sequencing models, relying on sophisticated typicality-based approaches for the achievability. Here, we consider a multi-draw DNA storage channel in the setting of noise corruption by a binary erasure channel. We show that, in this setting, the capacity is achieved by linear coding schemes. This leads to a considerably simpler derivation of the capacity expression of a multi-draw DNA storage channel than existing results in the literature.","PeriodicalId":305918,"journal":{"name":"2022 56th Annual Conference on Information Sciences and Systems (CISS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128485232","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}
A. Sack, Wenzhao Jiang, Michael Perlmutter, Palina Salanevich, D. Needell
{"title":"On Audio Enhancement via Online Non-Negative Matrix Factorization","authors":"A. Sack, Wenzhao Jiang, Michael Perlmutter, Palina Salanevich, D. Needell","doi":"10.1109/CISS53076.2022.9751157","DOIUrl":"https://doi.org/10.1109/CISS53076.2022.9751157","url":null,"abstract":"We propose a method for noise reduction, the task of producing a clean audio signal from a recording corrupted by ad-ditive noise. Many common approaches to this problem are based upon applying non-negative matrix factorization to spectrogram measurements. These methods use a noiseless recording, which is believed to be similar in structure to the signal of interest, and a pure-noise recording to learn dictionaries for the true signal and the noise. One may then construct an approximation of the true signal by projecting the corrupted recording onto the clean dictionary. In this work, we build upon these methods by proposing the use of online non-negative matrix factorization for this problem. This method is more memory efficient than traditional non-negative matrix factorization and also has potential applications to real-time denoising.","PeriodicalId":305918,"journal":{"name":"2022 56th Annual Conference on Information Sciences and Systems (CISS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126881471","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}