Grant: Discovery Grants Program - Individual
University of British Columbia
$19,000.00
Extracting low-dimensional signals from high-dimensional data
FY 2019-20
Summary
The main thrust of my work is to develop the theoretical underpinnings of high-dimensional inference with intrinsically low-dimensional signals. There are beautiful open questions whose answers could be of much use to the data science community. A key to understanding these questions is to understand the geometry of structured signals in high dimensional space, and how these act under random projections. Much of my work concerns signal estimation despite a lack of certainty in the data. This can be characterized by high-noise, extreme quantization, or a signal whose ambient dimension exceeds the size of the data itself. In particular, compressive sensing and matrix completion fall into this latter category. In compressive sensing, one assumes that the signal is randomly sampled and the question is how few samples are necessary to reconstruct. In matrix completion one assumes that one is given a subsampling of entries of a matrix and asked to fill in the missing entries. In both cases, it is important to utilize an underlying low-dimensional signal structure in signal reconstruction. The following specific projects are of special interest.*** 1. Understanding the measurement pattern in matrix completion and compressive sensing: The theory of matrix completion by largely assumes random sampling of entries and similar assumptions are made in compressive sensing. While it is vital to make simplifying probabilistic models to allow powerful theory, there are two apparent drawbacks of this approach: 1) In real data, it is often clear that there is a pattern in the sampling which does not reflect the random model and 2) the sampling pattern itself gives information; this information is not taken advantage of by methods based on a uniform random model. I aim to address these two points with my future research. ***2. Discretization in the measurements: A general idea in the analysis of Big Data is that very rough measurements can be leveraged together to make powerful inferences, provided there are a sufficient number of them, and the signal has sufficiently small dimension. This idea is made quite precise in one-bit compressive sensing, a model of extreme quantization, in which only the sign of each measurement is retained. The lack of smoothness of the sampling leads to new theoretical and computational challenges.***3. Useful characterizations of dimension: What is the appropriate notion of the dimension or complexity of a signal which is being subsampled? And given an arbitrary signal set, can this dimension be estimated in a computationally efficient manner? This is one of the most important questions of statistical signal processing with a long history of approaches. I aim to give a modern twist on this challenge by combining classical ideas of Le Cam and Kolmogorov with modern models stemming from the compressed sensing literature.**
Program
Discovery Grants Program - Individual
Recipient
Location
British Columbia, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
RGPIN-2015-03737
Name nom
Plan, Yaniv
Department département
Mathematics
Organization id
2
Institution établissement
University of British Columbia
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2019
Competition year année de concours
2015
Award amount
19000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR LA DÉCOUVERTE
Committee code
1508
Committee name en
Mathematics and Statistics
Committee name fr
Mathématiques et statistique
Area of application code
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
3008
Research subject group en
Statistics and probability
Research subject group fr
Statistique et probabilité
Research subject en
Applied probability
Research subject fr
Probabilité appliquée
Installment
inst:5 - 5
Partie
5
Nb partie
5
Application title
Extracting low-dimensional signals from high-dimensional data
Keyword
NSERC
Application summary
The main thrust of my work is to develop the theoretical underpinnings of high-dimensional inference with intrinsically low-dimensional signals. There are beautiful open questions whose answers could be of much use to the data science community. A key to understanding these questions is to understand the geometry of structured signals in high dimensional space, and how these act under random projections. Much of my work concerns signal estimation despite a lack of certainty in the data. This can be characterized by high-noise, extreme quantization, or a signal whose ambient dimension exceeds the size of the data itself. In particular, compressive sensing and matrix completion fall into this latter category. In compressive sensing, one assumes that the signal is randomly sampled and the question is how few samples are necessary to reconstruct. In matrix completion one assumes that one is given a subsampling of entries of a matrix and asked to fill in the missing entries. In both cases, it is important to utilize an underlying low-dimensional signal structure in signal reconstruction. The following specific projects are of special interest.*** 1. Understanding the measurement pattern in matrix completion and compressive sensing: The theory of matrix completion by largely assumes random sampling of entries and similar assumptions are made in compressive sensing. While it is vital to make simplifying probabilistic models to allow powerful theory, there are two apparent drawbacks of this approach: 1) In real data, it is often clear that there is a pattern in the sampling which does not reflect the random model and 2) the sampling pattern itself gives information; this information is not taken advantage of by methods based on a uniform random model. I aim to address these two points with my future research. ***2. Discretization in the measurements: A general idea in the analysis of Big Data is that very rough measurements can be leveraged together to make powerful inferences, provided there are a sufficient number of them, and the signal has sufficiently small dimension. This idea is made quite precise in one-bit compressive sensing, a model of extreme quantization, in which only the sign of each measurement is retained. The lack of smoothness of the sampling leads to new theoretical and computational challenges.***3. Useful characterizations of dimension: What is the appropriate notion of the dimension or complexity of a signal which is being subsampled? And given an arbitrary signal set, can this dimension be estimated in a computationally efficient manner? This is one of the most important questions of statistical signal processing with a long history of approaches. I aim to give a modern twist on this challenge by combining classical ideas of Le Cam and Kolmogorov with modern models stemming from the compressed sensing literature.**