Assistant Professor of Statistics, George Mason University
Learning from Integrated Data under Mismatch Corruption
November 15, 2019
The SIAI seminar series will feature speakers from academia, research labs, government agencies and the industry in topics of interest to the SIAI community.
We shall discuss the problem of constructing index codes that maximize a data network's throughput and minimize power consumption. In this setup, multiple users, with some side information, demand certain subsets of data from a central node. This scenario is the basic model of the data sharing network in various cyber-physical systems and connected networks. The goal of the index code is to minimize the required transmission rate while ensuring that the users can recover the demanded data using an encoded broadcast message from the server. Thus, minimizing the power expended for communication while maximizing throughput. We shall discuss a generalized version of the index coding problem, where both the side information and user-demanded data can be coded. The problem of index code construction, for a given set of side information and users’ demands, can be modeled as a matrix completion problem. Traditional machine learning algorithms used for matrix completion do not take advantage of the inherent structure in the index codes to construct efficient index codes. We shall discuss novel techniques proposed by us for low-rank factorization of structured matrices. We shall see that the proposed machine learning methods for structured matrix completion construct efficient index codes compared to the traditional methods known in the literature so far.