Related papers: A Note on Affine Invariant Cost Functions
We consider the notion of the matrix (tensor) distribution of a measurable function of several variables. On the one hand, it is an invariant of this function with respect to a certain group of transformations of variables; on the other…
Convolution admits a natural formulation as a functional operation on matrices. Motivated by the functional and entrywise calculi, this leads to a framework in which convolution defines a matrix transform that preserves positivity. Within…
Let $(P,\preceq)$ be a lattice and $f$ a complex-valued function on $P$. We define meet and join matrices on two arbitrary subsets $X$ and $Y$ of $P$ by $(X,Y)_f=(f(x_i\wedge y_j))$ and $[X,Y]_f=(f(x_i\vee x_j))$ respectively. Here we…
We consider small factor analysis models with one or two factors. Fixing the number of factors, we prove a finiteness result about the covariance matrix parameter space when the size of the covariance matrix increases. According to this…
Affine invariant points and maps for sets were introduced by Gr\"unbaum to study the symmetry structure of convex sets. We extend these notions to a functional setting. The role of symmetry of the set is now taken by evenness of the…
Multicriteria decision analysis aims at supporting a person facing a decision problem involving conflicting criteria. We consider an additive utility model which provides robust conclusions based on preferences elicited from the decision…
We consider discrete-time switching systems composed of a finite family of affine sub-dynamics. First, we recall existing results and present further analysis on the stability problem, the existence and characterization of compact…
Fractional processes have gained popularity in financial modeling due to the dependence structure of their increments and the roughness of their sample paths. The non-Markovianity of these processes gives, however, rise to conceptual and…
In this article, we consider the factor complexity of a fixed point of a primitive substitution canonically defined by a beta-numeration system. We provide a necessary and sufficient condition on the Renyi expansion of 1 for having an…
Substructural type systems, such as affine (and linear) type systems, are type systems which impose restrictions on copying (and discarding) of variables, and they have found many applications in computer science, including quantum…
Regression in supervised learning often requires the enforcement of constraints to ensure that the trained models are consistent with the underlying structures of the input and output data. This paper presents an iterative procedure to…
Validation is a major challenge in differentiable programming. The state of the art is based on algorithmic differentiation. Consistency of first-order tangent and adjoint programs is defined by a well-known first-order differential…
Affine matrix rank minimization problem is a fundamental problem with a lot of important applications in many fields. It is well known that this problem is combinatorial and NP-hard in general. In this paper, a continuous promoting low rank…
The aim of the paper is to give a full characterization of functions f from I into the real line R (where I is an interval in R that satisfies certain natural conditions) such that for any I-valued positive definite kernel K defined on an…
In this paper we give some conditions for a class of functions related to Bessel functions to be positive definite or strictly positive definite . We present some properties and relationships involving logarithmically completely monotonic…
The integral of a function $f$ defined on a symmetric space $M \simeq G/K$ may be expressed in the form of a determinant (or Pfaffian), when $f$ is $K$-invariant and, in a certain sense, a tensor power of a positive function of a single…
We prove that the invariant Hilbert scheme parametrising the equivariant deformations of the affine multicone over a flag variety is, under certain hypotheses, an affine space. The proof is based on the construction of a wonderful variety…
We prove that the inverse of a positive-definite matrix can be approximated by a weighted-sum of a small number of matrix exponentials. Combining this with a previous result [OSV12], we establish an equivalence between matrix inversion and…
A conjecture is given that, if true, could lead to an algorithm for computing definite sums of rational functions.
We introduce a new set of algorithms to compute Jacobi matrices associated with measures generated by infinite systems of iterated functions. We demonstrate their relevance in the study of theoretical problems, such as the continuity of…