相关论文: Embeddability and rate identifiability of Kimura 2…

We consider a well-known exactly solvable model of an open quantum system with pure decoherence. The aim of this paper is twofold. Firstly, decoherence is a property of open quantum systems important for both quantum technologies and the…

In this paper, we propose two new algorithms for transduction with Matrix Completion (MC) problem. The joint MC and prediction tasks are addressed simultaneously to enhance the accuracy, i.e., the label matrix is concatenated to the data…

Matroids are a fundamental object of study in combinatorial optimization. Three closely related and important problems involving matroids are maximizing the size of the union of $k$ independent sets (that is, $k$-fold matroid union),…

We tackle the challenge of feature embedding for the purposes of improving the click-through rate prediction process. We select three models: logistic regression, factorization machines and deep factorization machines, as our baselines and…

We study the problem of determining a matrix whose $k$th multiplicative compound is a prescribed matrix~$M$. The cardinality of the set of matrices whose $k$th multiplicative compound equals~$M$ is characterized in terms of $\rank(M)$. On…

The main result of this paper is the decidability of the membership problem for $2\times 2$ nonsingular integer matrices. Namely, we will construct the first algorithm that for any nonsingular $2\times 2$ integer matrices $M_1,\dots,M_n$…

We show that if the ground set of a matroid can be partitioned into $k\ge 2$ bases, then for any given subset $S$ of the ground set, there is a partition into $k$ bases such that the sizes of the intersections of the bases with $S$ may…

Two model problems of an elastic wedge with an internal and edge crack are analyzed. The problem of an internal crack reduces to an order-4 vector Riemann-Hilbert problem whose matrix kernel entries are meromorphic functions and have…

We consider the problem of learning low-dimensional representations for large-scale Markov chains. We formulate the task of representation learning as that of mapping the state space of the model to a low-dimensional state space, called the…

Node embedding is the task of extracting informative and descriptive features over the nodes of a graph. The importance of node embeddings for graph analytics, as well as learning tasks such as node classification, link prediction and…

Identifiability is a desirable property of a statistical model: it implies that the true model parameters may be estimated to any desired precision, given sufficient computational resources and data. We study identifiability in the context…

A unimodular $2\times 2$ matrix with entries in a commutative $R$ is called extendable (resp.\ simply extendable) if it extends to an invertible $3\times 3$ matrix (resp.\ invertible $3\times 3$ matrix whose $(3,3)$ entry is $0$). We obtain…

We prove identifiability of parameters for a broad class of random graph mixture models. These models are characterized by a partition of the set of graph nodes into latent (unobservable) groups. The connectivities between nodes are…

Consider a random vector with finite second moments. If its precision matrix is an M-matrix, then all partial correlations are non-negative. If that random vector is additionally Gaussian, the corresponding Markov random field (GMRF) is…

In this paper, we study the problem of detecting multiple hidden submatrices in a large Gaussian random matrix when the planted signal is inhomogeneous across entries. Under the null hypothesis, the observed matrix has independent and…

While subspace identification methods (SIMs) are appealing due to their simple parameterization for MIMO systems and robust numerical realizations, a comprehensive statistical analysis of SIMs remains an open problem, especially in the…

Markov matrices of equal-input type constitute a widely used model class. The corresponding equal-input generators span an interesting subalgebra of the real matrices with zero row sums. Here, we summarise some of their amazing properties…

We study a simple embedding technique based on a matrix of personalized PageRank vectors seeded on a random set of nodes. We show that the embedding produced by the element-wise logarithm of this matrix (1) are related to the spectral…

We consider the problem of matrix completion on an $n \times m$ matrix. We introduce the problem of Interpretable Matrix Completion that aims to provide meaningful insights for the low-rank matrix using side information. We show that the…

Hidden Markov chains are widely applied statistical models of stochastic processes, from fundamental physics and chemistry to finance, health, and artificial intelligence. The hidden Markov processes they generate are notoriously…