Abstract
Abstract: Global discrete optimization is notoriously difficult due to the lack of gradient information and the curse of dimensionality, making exhaustive search infeasible. Tensor cross approximation is an efficient technique to approximate multivariate tensors (and discretized functions) by tensor product decompositions based on a small number of tensor elements, evaluated on adaptively selected fibers of the tensor, that intersect on submatrices of (nearly) maximum volume. The submatrices of maximum volume are empirically known to contain large elements, hence the entries selected for cross interpolation can also be good candidates for the globally maximal element within the tensor. In this paper we consider evolution of epidemics on networks, and infer the contact network from observations of network nodal states over time. By numerical experiments we demonstrate that the contact network can be inferred accurately by finding the global maximum of the likelihood using tensor cross interpolation. The proposed tensor product approach is flexible and can be applied to global discrete optimization for other problems, e.g. discrete hyperparameter tuning.
| Original language | English |
|---|---|
| Pages (from-to) | 1591-1604 |
| Number of pages | 14 |
| Journal | Computational Mathematics and Mathematical Physics |
| Volume | 65 |
| Issue number | 7 |
| DOIs | |
| Publication status | Published - 21 Aug 2025 |
Funding
Supported by the Engineering and Physical Sciences Research Council New Investigator Award EP/T031255/1.
| Funders | Funder number |
|---|---|
| Engineering and Physical Sciences Research Council | EP/T031255/1 |
Keywords
- Bayesian inference
- cross approximation
- epidemiological modelling
- networks
- tensor train
ASJC Scopus subject areas
- Computational Mathematics
Fingerprint
Dive into the research topics of 'Tensor Cross Interpolation for Global Discrete Optimization with Application to Bayesian Network Inference'. Together they form a unique fingerprint.Projects
- 2 Finished
-
Overcoming the curse of dimensionality in dynamic programming by tensor decompositions
Dolgov, S. (PI)
Engineering and Physical Sciences Research Council
10/05/21 → 9/05/23
Project: Research council
-
Tensor decomposition sampling algorithms for Bayesian inverse problems
Dolgov, S. (PI)
Engineering and Physical Sciences Research Council
1/03/21 → 28/02/25
Project: Research council
Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS
