Related papers: Regularization and Interpolation of Positive Matri…
We investigate stochastic interpolation, a recently introduced framework for high dimensional sampling which bears many similarities to diffusion modeling. Stochastic interpolation generates a data sample by first randomly initializing a…
Matrices resulting from the discretization of a kernel function, e.g., in the context of integral equations or sampling probability distributions, can frequently be approximated by interpolation. In order to improve the efficiency, a…
Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…
When approximating a function that depends on a parameter, one encounters many practical examples where linear interpolation or linear approximation with respect to the parameters prove ineffective. This is particularly true for responses…
Let $G$ be a commutative algebraic group embedded in projective space and $\Gamma$ a finitely generated subgroup of $G$. From these data we construct a chain of algebraic subgroups of $G$ which is intimately related to obstructions to…
Shaping the reachable set of a dynamical system is a fundamental challenge in control design, with direct implications for both performance and safety. This paper considers the problem of selecting the optimal input matrix for a linear…
We develop a mathematical theory of entropic regularisation of unbalanced optimal transport problems. Focusing on static formulation and relying on the formalism developed for the unregularised case, we show that unbalanced optimal…
The influence-matrix formalism provides an alternative route to the classical simulation of quantum dynamics. Because influence matrices retain information only about the effective bath seen by local observables, they are expected to be…
Mixup is a powerful data augmentation method that interpolates between two or more examples in the input or feature space and between the corresponding target labels. Many recent mixup methods focus on cutting and pasting two or more…
Exact evaluation of $<{\rm Tr} S^p>$ is here performed for real symmetric matrices $S$ of arbitrary order $n$, up to some integer $p$, where the matrix entries are independent identically distributed random variables, with an arbitrary…
In this work, we investigate an optimization problem over adapted couplings between pairs of real valued random variables, possibly describing random times. We relate those couplings to a specific class of causal transport plans between…
To apportion a complex matrix means to apply a similarity so that all entries of the resulting matrix have the same magnitude. We initiate the study of apportionment, both by unitary matrix similarity and general matrix similarity. There…
Spectra of ordered eigenvalues of finite Random Matrices are interpreted as a time series. Dataadaptive techniques from signal analysis are applied to decompose the spectrum in clearly differentiated trend and fluctuation modes, avoiding…
The nonlinear inverse problem of exponential data fitting is separable since the fitting function is a linear combination of parameterized exponential functions, thus allowing to solve for the linear coefficients separately from the…
Given commuting families of Hermitian matrices {A1, ..., Ak} and {B1, ...., Bk}, conditions for the existence of a completely positive map L, such that L(Aj) = Bj for j = 1, ...,k, are studied. Additional properties such as unital or / and…
The matching of multiple objects (e.g. shapes or images) is a fundamental problem in vision and graphics. In order to robustly handle ambiguities, noise and repetitive patterns in challenging real-world settings, it is essential to take…
This article has two interpenetrating motifs. One is an exposition of some major ideas and techniques behind the use of block matrices, and especially their positivity properties. This is done by focussing on one major problem:…
We obtain general, exact formulas for the overlaps between the eigenvectors of large correlated random matrices, with additive or multiplicative noise. These results have potential applications in many different contexts, from quantum…
The versatility of data-driven approximation by interpolatory methods, originally settled for model approximation purpose, is illustrated in the context of linear controller design and stability analysis of irrational models. To this aim,…
In this paper, we introduce a particular class of matrices. We study the concept of a matrix to be \emph{balanced}. We study some properties of this concept in the context of matrix operations. We examine the behaviour of various matrix…