Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Toronto

$46,000.00

Modern Statistical Optimization, Robustification and Inference with Applications to Big Data Analytics

EF 2023-24

Résumé
Big data is transforming our world, revolutionizing operations and analytics everywhere, from financial engineering to biomedical sciences. How to efficiently exact useful information from large and noisy datasets is of significant importance, and it has posed at least three grand challenges. The first challenge towards this goal is often computational: the massiveness and complexity of the data call for efficient algorithms to be used in practice. The second challenge arises from the fact that the data collected in real world, big or small, are often contaminated by heavy-tailed errors or outliers, making conventional statistical methods inadequate. Third, an efficient and accurate inference procedure is in demand for big data analytics and valid statistical decision makings. We attempt to addressing these three challenges in this proposal. Our first goal of this proposal is to explore the direction of statistical optimization for nonconvex problems and to understand the hidden convexity in a wide range of continuous and discrete statistical optimization problems. We aim to provide a unified toolbox of algorithms, theories and applications, and we expect to provide new fundamental understanding and tools for optimization in big data. It, upon completed, will have potential and fundamental impact in the area of statistics, machine learning, signal processing, imaging restoration, dictionary learning and artificial intelligence. Our second goal is to comprehensively study nonasymptotic robustification for meaningful data analytics in the presence of low-quality data. The key observation is the bias-robustness tradeoff principal, which we believe is a universal phenomenon in many applications, such as prediction, classification, clustering and inference problems. This goal, upon comprehensively studied, will impact data analytics in practice. We will follow modern software principals in the emphases of compatibility, extendability and maintainability, and develop open-source packages for statisticians and practitioners. Last, we will move forward to modern statistical inference, where we focus on the replicability issues. The scientific question we aim to address is whether the discoveries from a vast statistical search can be replicated in future and independent studies. We will verify the efficacy of our methods by applying them to large-scale imaging genetic datasets, such as the enhancing neuroimaging genetics through meta-analysis and the cohorts for heart and aging research in genomic epidemiology. This goal, upon completed, will impact practitioners in various scientific disciplines, especially in neuroscience and genetics.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
RGPIN-2018-06484
Name nom
Sun, Qiang
Department département
Computer and Mathematical Sciences (Scarborough) - Computer and Mathematical Sciences (Scarborough)
Organization id
31
Institution établissement
University of Toronto
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2023
Competition year année de concours
2018
Award amount
46000
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
1101
Area of application group en
Health, education and social services
Area of application group fr
Santé publique, éducation et services sociaux
Area of application en
Human health (including medically-related psychological research)
Area of application fr
Santé publique (y compris recherche psychologique liée à la médecine)
Research subject code
9999
Research subject group en
Not available
Research subject group fr
Not available
Research subject en
Non disponible
Research subject fr
Non disponible
Application title
Modern Statistical Optimization, Robustification and Inference with Applications to Big Data Analytics
Keyword
classification; clustering; computational complexity; heavy-tailed data; high dimensionality; nonasymptotic robustness; regression; sparsity; statistical optimization
Application summary
Big data is transforming our world, revolutionizing operations and analytics everywhere, from financial engineering to biomedical sciences. How to efficiently exact useful information from large and noisy datasets is of significant importance, and it has posed at least three grand challenges. The first challenge towards this goal is often computational: the massiveness and complexity of the data call for efficient algorithms to be used in practice. The second challenge arises from the fact that the data collected in real world, big or small, are often contaminated by heavy-tailed errors or outliers, making conventional statistical methods inadequate. Third, an efficient and accurate inference procedure is in demand for big data analytics and valid statistical decision makings. We attempt to addressing these three challenges in this proposal. Our first goal of this proposal is to explore the direction of statistical optimization for nonconvex problems and to understand the hidden convexity in a wide range of continuous and discrete statistical optimization problems. We aim to provide a unified toolbox of algorithms, theories and applications, and we expect to provide new fundamental understanding and tools for optimization in big data. It, upon completed, will have potential and fundamental impact in the area of statistics, machine learning, signal processing, imaging restoration, dictionary learning and artificial intelligence. Our second goal is to comprehensively study nonasymptotic robustification for meaningful data analytics in the presence of low-quality data. The key observation is the bias-robustness tradeoff principal, which we believe is a universal phenomenon in many applications, such as prediction, classification, clustering and inference problems. This goal, upon comprehensively studied, will impact data analytics in practice. We will follow modern software principals in the emphases of compatibility, extendability and maintainability, and develop open-source packages for statisticians and practitioners. Last, we will move forward to modern statistical inference, where we focus on the replicability issues. The scientific question we aim to address is whether the discoveries from a vast statistical search can be replicated in future and independent studies. We will verify the efficacy of our methods by applying them to large-scale imaging genetic datasets, such as the enhancing neuroimaging genetics through meta-analysis and the cohorts for heart and aging research in genomic epidemiology. This goal, upon completed, will impact practitioners in various scientific disciplines, especially in neuroscience and genetics.