Related papers: Deep factorisation of the stable process II; poten…
In this article almost semi-continuous processes with stationary independent increments on a finite irreducible Markov chain are considered. For these processes the components of matrix factorization identity are concretely defined. On the…
We propose algorithms for approximate filtering and smoothing in high-dimensional Factorial hidden Markov models. The approximation involves discarding, in a principled way, likelihood factors according to a notion of locality in a factor…
We propose a new inertia-revealing factorization for sparse symmetric matrices. The factorization scheme and the method for extracting the inertia from it were proposed in the 1960s for dense, banded, or tridiagonal matrices, but they have…
In this paper we study the Wiener-Hopf factorization for a class of L\'evy processes with double-sided jumps, characterized by the fact that the density of the L\'evy measure is given by an infinite series of exponential functions with…
We consider the inverse source problems with multi-frequency sparse near field measurements. In contrast to the existing near field operator based on the integral over the space variable, a multi-frequency near field operator is introduced…
We study the inversion analog of the well-known Gauss algorithm for multiplying complex matrices. A simple version is $(A + iB)^{-1} = (A + BA^{-1}B)^{-1} - i A^{-1}B(A+BA^{-1} B)^{-1}$ when $A$ is invertible, which may be traced back to…
This paper analyzes the factorizability and geometry of transition matrices of multivariate Markov chains. Specifically, we demonstrate that the induced chains on factors of a product space can be regarded as information projections with…
We introduce regular series expansion for weakly- and moderately-correlated fermionic systems, based on Fluctuating Local Field approach. The method relies on the explicit account of leading fluctuating mode(s) and is therefore suitable for…
We study the inverse problem of estimating a field $u$ from data comprising a finite set of nonlinear functionals of $u$, subject to additive noise; we denote this observed data by $y$. Our interest is in the reconstruction of piecewise…
We develop a Markov process viewpoint for discrete circular distributions motivated by directional-statistics settings where angles are observed on a finite grid and evolve over time. On the $m$-point discrete circle, the cycle graph, we…
We give faster algorithms for weak expander decompositions and approximate max flow on undirected graphs. First, we show that it is possible to "warm start" the cut-matching game when computing weak expander decompositions, avoiding the…
A demanding challenge in Bayesian inversion is to efficiently characterize the posterior distribution. This task is problematic especially in high-dimensional non-Gaussian problems, where the structure of the posterior can be very chaotic…
For the 2D matrix Langevin dynamics that corresponds to the continuous-time limit of the product of some $2 \times 2$ random matrices, the finite-time Lyapunov exponent can be written as an additive functional of the associated Riccati…
This paper is concerned with the inverse acoustic scattering problem with phaseless total-field data at a fixed frequency. An approximate factorization method is developed to numerically reconstruct both the location and shape of the…
We present a novel method to estimate the stability of the Marchenko equation for finite data-sets. We show that we can derive a recursion relationship for the Fourier expansion coefficients of the kernel which is solved by the Marchenko…
In this work, we introduce a novel gradient descent-based approach for optimizing control systems, leveraging a new representation of stable closed-loop dynamics as a function of two matrices i.e. the step size or direction matrix and value…
Linearly implicit Runge-Kutta methods with approximate matrix factorization can solve efficiently large systems of differential equations that have a stiff linear part, e.g. reaction-diffusion systems. However, the use of approximate…
We present and implement an algorithm for computing the invariant circle and the corresponding stable manifolds for 2-dimensional maps. The algorithm is based on the parameterization method, and it is backed up by an a-posteriori theorem…
We present a novel method to obtain type IIB flux vacua with flat directions at tree level. We perform appropriate choices of flux quanta that induce relations between the flux superpotential and its derivatives. This method is implemented…
Structured prediction requires manipulating a large number of combinatorial structures, e.g., dependency trees or alignments, either as latent or output variables. Recently, the SparseMAP method has been proposed as a differentiable, sparse…