相关论文: Deep factorisation of the stable process

Data often comes in the form of an array or matrix. Matrix factorization techniques attempt to recover missing or corrupted entries by assuming that the matrix can be written as the product of two low-rank matrices. In other words, matrix…

The theory of ``Markov-up'' processes is being developed. This is a new class of stochastic processes with ``partial'' markovian features; it could also be called ``one-sided Markov''. Such a behavior may be found in the real world and in…

We present a new local approximation algorithm for computing Maximum a Posteriori (MAP) and log-partition function for arbitrary exponential family distribution represented by a finite-valued pair-wise Markov random field (MRF), say $G$.…

In this paper, for $\alpha\in (1, 2}$ we show that the $\alpha$-stable continuous-state branching process and the associated process conditioned never to become extinct are positive self-similar Markov processes. Understanding the…

Inference for latent feature models is inherently difficult as the inference space grows exponentially with the size of the input data and number of latent features. In this work, we use Kurihara & Welling (2008)'s maximization-expectation…

Let $X=(X_t, t\geq 0)$ be a self-similar Markov process taking values in $\mathbb{R}$ such that the state 0 is a trap. In this paper, we present a necessary and sufficient condition for the existence of a self-similar recurrent extension of…

An $\mathbb{R}^d$-valued Markov process $X^{(x)}_t=(X^{1,x_1}_t,\dots,X^{d,x_d}_t)$, $t\ge0,x\in\mathbb{R}^d$ is said to be multi-self-similar with index $(\alpha_1,\dots,\alpha_d)\in[0,\infty)^d$ if the identity in law…

Matrix factorization (MF) is a widely used collaborative filtering (CF) algorithm for recommendation systems (RSs), due to its high prediction accuracy, great flexibility and high efficiency in big data processing. However, with the…

The max-stable process is an asymptotically justified model for spatial extremes. In particular, we focus on the hierarchical extreme-value process (HEVP), which is a particular max-stable process that is conducive to Bayesian computing.…

Mixed moving average processes appear in the ergodic decomposition of stationary symmetric \alpha-stable (S\alpha S) processes. They correspond to the dissipative part of "deterministic" flows generating S\alpha S processes (Rosinski,…

In Kuznetsov et al. (2011) a new Monte Carlo simulation technique was introduced for a large family of Levy processes that is based on the Wiener-Hopf decomposition. We pursue this idea further by combining their technique with the recently…

We show that the factor graph and certifiable estimation paradigms, which have thus far been treated as essentially independent in the literature, can be naturally synthesized into a unified framework for certifiable factor graph…

This article is an extended version of previous work of the authors [40, 41] on low-rank matrix estimation in the presence of constraints on the factors into which the matrix is factorized. Low-rank matrix factorization is one of the basic…

Efficiently finding the maximum a posteriori (MAP) configuration of a graphical model is an important problem which is often implemented using message passing algorithms. The optimality of such algorithms is only well established for…

Solving semidefinite programs (SDP) in a short time is the key to managing various mathematical optimization problems. The matrix-completion primal-dual interior-point method (MC-PDIPM) extracts a sparse structure of input SDP by…

We introduce the strong recursive skeletonization factorization (RS-S), a new approximate matrix factorization based on recursive skeletonization for solving discretizations of linear integral equations associated with elliptic partial…

We perform forward error analysis for a large class of recursive matrix multiplication algorithms in the spirit of [D. Bini and G. Lotti, Stability of fast algorithms for matrix multiplication, Numer. Math. 36 (1980), 63--72]. As a…

We consider the Markov renewal equation $F(t) = f(t) + \boldsymbol{\mu}*F(t)$ for vector-valued functions $f,F: \mathbb{R} \to \mathbb{R}^{p}$ and a $p \times p$ matrix $\boldsymbol{\mu}$ of locally finite measures $\mu^{i,j}$ on…

Given a matrix $M$ (not necessarily nonnegative) and a factorization rank $r$, semi-nonnegative matrix factorization (semi-NMF) looks for a matrix $U$ with $r$ columns and a nonnegative matrix $V$ with $r$ rows such that $UV$ is the best…

This work derives a theoretical value for the entropy of a Linear Additive Markov Process (LAMP), an expressive model able to generate sequences with a given autocorrelation structure. While a first-order Markov Chain model generates new…