Grant: Discovery Grants Program - Individual
The University of British Columbia
$29,000.00
Statistical Estimation under Nonlinear Algebraic Constraints
FY 2024-25
Summary
Machine learning and artificial intelligence are all around us: new algorithms drive cars, detect melanoma, perform automated surgeries, and are used for scientific discovery. Now, more than ever, there is an urgent need for rigorous understanding and performance guarantees so that we can rely on these new technologies. Many inference questions in machine learning are nonlinear, and the long tradition of linear models in statistics may no longer be applicable. For example, latent variable models correspond to various notions of low-rank structure in tensors; more generally, latent variable graphical models correspond to more complicated tensor decompositions in the discrete case, and other highly nonlinear structure in the continuous case. Additionally, non-parametric models, such as strongly positively dependent random variables, are defined via nonlinear polynomial inequalities. Inference for such models often suffers from high computational and sample size complexity. Designing methods for inference and obtaining convergence guarantees requires a thorough understanding of the underlying nonlinear structure. My research program is on statistical inference, model selection, and testing for models given by nonlinear algebraic constraints. Each of my long-term projects involves problems that are grounded in different fields: statistics, optimization, nonlinear algebra, and combinatorics.
This research program consists of three main projects.
(1) Total positivity is a powerful notion important in both statistics (where it implies a strong form of positive dependence of random variables) and optimization (where it facilitates dual certificate construction - in problems like super-resolution imaging, for example). Total positivity is defined via polynomial inequalities and raises a multitude of open problems across diverse fields, from statistical inference to discrete geometry.
(2) Structured tensor decompositions lie at the core of many statistical and scientific problems (such as discrete latent variable models and blind source separation), however, they pose many computational and theoretical challenges. I intend to design algorithms for fast structured decompositions, to study geometric properties of spaces of tensors with certain structure, and to explore new types of tensor decompositions.
(3) Causal inference in the presence of hidden variables captures real-world interaction of observed quantities, however it poses a variety of open problems. Here I propose to work on model description and equivalence, as well as model selection problems. In both the discrete and Gaussian cases, the models are semialgebraic sets. Solving the above problems will call for algebraic and combinatorial techniques.
To execute this interdisciplinary research program I plan to work with students and young researchers with various skills and interests. Our work together will give each of them a strong foundation for a career in academia or industry.
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-2020-04607
Name nom
Robeva, Elina
Department département
Mathematics
Organization id
2
Institution établissement
The University of British Columbia
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2024
Competition year année de concours
2020
Award amount
29000
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
1200
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Advancement of knowledge
Area of application fr
Avancement des connaissances
Research subject code
3001
Research subject group en
Statistics and probability
Research subject group fr
Statistique et probabilité
Research subject en
Statistical theory
Research subject fr
Théorie de statistique
Field of research list names en
Not available
Field of research list names fr
Non disponible
Socioeconomic objective list names en
Not available
Socioeconomic objective list names fr
Non disponible
Application title
Statistical Estimation under Nonlinear Algebraic Constraints
Keywords
algebraic statistics; tensor decompositions; tensor rank; orthogonal tensor decompositionels; tensor network states; directed graphical models; markov equivalence; density estimation; multivariate total positivity; triangulations and subdivisions
Application summary
Machine learning and artificial intelligence are all around us: new algorithms drive cars, detect melanoma, perform automated surgeries, and are used for scientific discovery. Now, more than ever, there is an urgent need for rigorous understanding and performance guarantees so that we can rely on these new technologies. Many inference questions in machine learning are nonlinear, and the long tradition of linear models in statistics may no longer be applicable. For example, latent variable models correspond to various notions of low-rank structure in tensors; more generally, latent variable graphical models correspond to more complicated tensor decompositions in the discrete case, and other highly nonlinear structure in the continuous case. Additionally, non-parametric models, such as strongly positively dependent random variables, are defined via nonlinear polynomial inequalities. Inference for such models often suffers from high computational and sample size complexity. Designing methods for inference and obtaining convergence guarantees requires a thorough understanding of the underlying nonlinear structure. My research program is on statistical inference, model selection, and testing for models given by nonlinear algebraic constraints. Each of my long-term projects involves problems that are grounded in different fields: statistics, optimization, nonlinear algebra, and combinatorics.
This research program consists of three main projects.
(1) Total positivity is a powerful notion important in both statistics (where it implies a strong form of positive dependence of random variables) and optimization (where it facilitates dual certificate construction - in problems like super-resolution imaging, for example). Total positivity is defined via polynomial inequalities and raises a multitude of open problems across diverse fields, from statistical inference to discrete geometry.
(2) Structured tensor decompositions lie at the core of many statistical and scientific problems (such as discrete latent variable models and blind source separation), however, they pose many computational and theoretical challenges. I intend to design algorithms for fast structured decompositions, to study geometric properties of spaces of tensors with certain structure, and to explore new types of tensor decompositions.
(3) Causal inference in the presence of hidden variables captures real-world interaction of observed quantities, however it poses a variety of open problems. Here I propose to work on model description and equivalence, as well as model selection problems. In both the discrete and Gaussian cases, the models are semialgebraic sets. Solving the above problems will call for algebraic and combinatorial techniques.
To execute this interdisciplinary research program I plan to work with students and young researchers with various skills and interests. Our work together will give each of them a strong foundation for a career in academia or industry.