Vladimir Kazeev

Vladimir Kazeev

Auto-generated profile, based on publicly available information

Vladimir Kazeev

Faculty of Mathematics, University of Vienna, Vienna, Austria

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 March 2014 in PLOS Computational Biology
Verified
Journal Article
Open access
PDF file
VKVladimir Kazeev
Vladimir Kazeev
MKMustafa Khammash
Mustafa Khammash
MNMichael Nip
Michael Nip
CSChristoph Schwab
Christoph Schwab
The Chemical Master Equation (CME) is a cornerstone of stochastic analysis and simulation of models of biochemical reaction networks. Yet direct solutions of the CME have remained elusive. Although several approaches overcome the infinite dimensional nature of the CME through projections or other means, a common feature of proposed approaches is their susceptibility to the curse of dimensionality, i.e. the exponential growth in memory and computational requirements in the number of problem dimensions. We present a novel approach that has the potential to “lift” this curse of dimensionality. The approach is based on the use of the recently proposed Quantized Tensor Train (QTT) formatted numerical linear algebra for the low parametric, numerical representation of tensors. The QTT decomposition admits both, algorithms for basic tensor arithmetics with complexity scaling linearly in the dimension (number of species) and sub-linearly in the mode size (maximum copy number), and a numerical tensor rounding procedure which is stable and quasi-optimal. We show how the CME can be represented in QTT format, then use the exponentially-converging -discontinuous Galerkin discretization in time to reduce the CME evolution problem to a set of QTT-structured linear equations to be solved at each time step using an algorithm based on Density Matrix Renormalization Group (DMRG) methods from quantum chemistry. Our method automatically adapts the “basis” of the solution at every time step guaranteeing that it is large enough to capture the dynamics of interest but no larger than necessary, as this would increase the computational complexity. Our approach is demonstrated by applying it to three different examples from systems biology: independent birth-death process, an example of enzymatic futile cycle, and a stochastic switch model. The numerical results on these examples demonstrate that the proposed QTT method achieves dramatic speedups and several orders of magnitude storage savings over direct approaches. Stochastic models of chemical networks are necessary to quantitatively describe random fluctuations and other probabilistic phenomena within living cells. The Chemical Master Equation (CME) describes the time evolution of molecular abundance probabilities in these models, and is a basis for many stochastic simulation and analysis methods. Yet the CME is difficult to solve directly except for very simple structures. Indeed current approaches are susceptible to the curse of dimensionality, that is, the exponential growth of memory and computational requirements in the number of problem dimensions. In this paper, we propose a novel approach that has the potential to overcome the curse of dimensionality. It is based on the use of the recently proposed Quantized Tensor Train (QTT) formatted numerical linear algebra for numerical representation of tensors, using algorithms for basic tensor arithmetics with complexity scaling linearly in the number of reacting species considered, and sub-linearly in the maximum allowed copy number per species. We present this approach and demonstrate its effectiveness by applying it to three problems from systems biology. Numerical experiments are reported which show that several orders of magnitude memory savings is typically afforded by the new approach presented here.

1 January 2012 in SIAM Journal on Matrix Analysis and Applications
Verified
Journal Article
Closed access
VKVladimir A. Kazeev
Vladimir A. Kazeev
BKBoris N. Khoromskij
Boris N. Khoromskij
We focus on the construction of explicit low-rank representations of matrices in the tensor train (TT) and quantized tensor train (QTT) formats which have been proposed recently for the low-parametric structured representation of large-scale tensors. The matrices under consideration are discretizations of the Laplace operator in a hypercube (in one and many dimensions) and their inverses (in one dimension). For these matrices we derive explicit and exact QTT representations of low QTT ranks independent of the numbers $d$ and $n^{2}$ of dimensions and entries in each dimension. This implies that for the matrices considered the storage cost is $\mathcal{O}\left(d\,\log n\right)$, i.e., logarithmic with respect to the total number $n^{2d}$ of entries. The same applies to the computational complexity of the QTT-structured operations with these matrices, which now depends on the QTT ranks of the other operands. The general result of the paper is the notation and technique we introduce in order to examine the QTT structure of matrices analytically. They prove to be an efficient tool of studying other tensors related to particular computational problems, which are not considered in this paper.

1 January 2013 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
VKVladimir A. Kazeev
Vladimir A. Kazeev
BKBoris N. Khoromskij
Boris N. Khoromskij
ETEugene E. Tyrtyshnikov
Eugene E. Tyrtyshnikov
We study the tensor structure of two operations: the transformation of a given multidimensional vector into a multilevel Toeplitz matrix and the convolution of two given multidimensional vectors. We show that the low-rank tensor structure of the input is preserved in the output and propose efficient algorithms for these operations in the newly introduced quantized tensor train (QTT) format. Consider a $d$-dimensional $2n \times\cdots\times 2n$-vector $\boldsymbol{x}$. If it is represented elementwise, the number of parameters is $(2n)^{d}$. However, if we assume that $\boldsymbol{x}$ is given in a QTT representation with ranks bounded by $p$, the number of parameters is reduced to $\mathcal{O}\left(dp^{2} \log n\right)$. Under this assumption we show how the multilevel Toeplitz matrix generated by $\boldsymbol{x}$ can be obtained in the QTT format with ranks bounded by $2p$ in $\mathcal{O}\left(dp^{2} \log n\right)$ operations. We also describe how the convolution $\boldsymbol{x}\star\boldsymbol{y}$ of $\boldsymbol{x}$ and a $d$-dimensional $n \times\cdots\times n$-vector $\boldsymbol{y}$ can be computed in the QTT format with ranks bounded by $2t$ in $\mathcal{O}\left(dt^{2} \log n\right)$ operations, provided that the matrix $\boldsymbol{x}\boldsymbol{y}'$ is given in the same format with ranks bounded by $t$. We exploit an algorithm for the inexact matrix-vector multiplication in the QTT format to accelerate the convolution algorithm dramatically. The performance of our approach to convolution is demonstrated with numerical examples, including the computation of the Newton potential of a strong cusp on fine grids with up to $2^{20} \times 2^{20} \times 2^{20}$ points in three dimensions.

1 June 2013 in Linear Algebra and its Applications
Verified
Journal Article
Closed access
VKVladimir Kazeev
Vladimir Kazeev
OROleg Reichmann
Oleg Reichmann
CSChristoph Schwab
Christoph Schwab

8 July 2017 in Numerische Mathematik
Verified
Journal Article
Closed access
PDF file
VKVladimir Kazeev
Vladimir Kazeev
CSChristoph Schwab
Christoph Schwab

14 November 2016 in Advances in Computational Mathematics
Verified
Journal Article
Closed access
PDF file
VKVladimir Kazeev
Vladimir Kazeev
IOIvan Oseledets
Ivan Oseledets
MRMaxim Rakhuba
Maxim Rakhuba
CSChristoph Schwab
Christoph Schwab