Doctoral thesis

Scalable algorithms for high-dimensional graphical lasso and function approximation

    04.08.2021

134 p

Thèse de doctorat: Università della Svizzera italiana, 2021

English Fundamental tasks in multivariate and numerical analysis, such as sparse precision matrix estimation via graphical lasso and function approximation, are formulated in ever-increasing dimensions. Consequently, this results in a significant increase in the computational demand that quickly renders standard solution methods intractable. With this motivation, we present two scalable algorithms that mitigate the obstacles faced in high-dimensional settings. First, we build on the current developments of second-order solution methods for the graphical lasso estimator and introduce a performant algorithm that exploits the sparsity and the block structure of the underlying computation. The algorithm is then parallelized, taking advantage of both shared- and distributed-memory architectures. For validation, we present large-scale test results for problems of up to 10 million dimensions (or equivalently, random variables). Second, we propose a highly efficient and generic function approximation framework that leverages dimensional decomposition with adaptive sparse grids. The hallmark of the proposed approach is the decomposition of a high-dimensional function into a nested summation of low-dimensional component functions. We present an efficient parallelization scheme that leverages the intrinsic separability of the formulation. Finally, an economic case study is presented where the framework is deployed on 1,024 nodes at the Swiss National Supercomputing Center.
Language
  • English
Classification
Computer science
License
License undefined
Identifiers
Persistent URL
https://susi.usi.ch/usi/documents/319150
Statistics

Document views: 56 File downloads:
  • 2021INFO008.pdf: 5