Related papers: Compact embeddings for spaces of forward rate curv…
Embeddings provide compact representations of signals in order to perform efficient inference in a wide variety of tasks. In particular, random projections are common tools to construct Euclidean distance-preserving embeddings, while…
A proposal is made for a mathematically unambiguous treatment of evolution in the presence of closed timelike curves. In constrast to other proposals for handling the naively nonunitary evolution that is often present in such situations,…
Ordinal embedding aims at finding a low dimensional representation of objects from a set of constraints of the form "item $j$ is closer to item $i$ than item $k$". Typically, each object is mapped onto a point vector in a low dimensional…
This paper introduces an approach for detecting differences in the first-order structures of spatial point patterns. The proposed approach leverages the kernel mean embedding in a novel way by introducing its approximate version tailored to…
In this note we prove certain necessary and sufficient conditions for the existence of an embedding of statistical manifolds. In particular, we prove that any compact smooth ($C^1$ resp.) statistical manifold can be embedded into the space…
We present elementary proofs of weighted embedding theorems for radial potential spaces and some generalizations of Ni's and Strauss' inequalities in this setting.
We provide quantitative convergence results for continuous-time dynamical systems in metric spaces that satisfy a continuous-time analog of quasi-Fej\'er monotonicity. More precisely, we provide a (strong) convergence result for such…
This paper develops a functional-analytic framework for approximating the push-forward induced by an analytic map from finitely many samples. Instead of working directly with the map, we study the push-forward on the space of locally…
We generalize the notion of joint measurability to continuous variable systems by extending a recently introduced compression algorithm of quantum measurements to this realm. The extension results in a property that asks for the minimal…
This paper explores recent progress related to constraint maps. Building on the exposition in [14], our goal is to provide a clear and accessible account of some of the more intricate arguments behind the main results in this work. Along…
This paper considers the approximation of spatial convolution with a given radial integral kernel. Previous studies have demonstrated that approximating spatial convolution using a system of partial differential equations (PDEs) can…
By Gromov's compactness theorem for metric spaces, every uniformly compact sequence of metric spaces admits an isometric embedding into a common compact metric space in which a subsequence converges with respect to the Hausdorff distance.…
The goal of ordinal embedding is to represent items as points in a low-dimensional Euclidean space given a set of constraints in the form of distance comparisons like "item $i$ is closer to item $j$ than item $k$". Ordinal constraints like…
A new subspace of Morrey spaces whose elements can be approximated by infinitely differentiable compactly supported functions is introduced. Consequently, we give an explicit description of the closure of the set of such functions in Morrey…
In this paper, by refining approximation theorems for holomorphic sections of adjoint line bundles, it is proved that the regular locus of a weakly pseudoconvex complex space admitting a positive line bundle can be holomorphically embedded…
We study evolution of a closed embedded plane curve with the normal velocity depending on the curvature, the orientation and the position of the curve. We propose a new method of tangential redistribution of points by curvature adjusted…
We study the problem of finding the one-dimensional structure in a given data set. In other words we consider ways to approximate a given measure (data) by curves. We consider an objective functional whose minimizers are a regularization of…
We consider the problem of maximizing a convex function over a closed convex set in a real Hilbert space. For linear functions, we show that a single orthogonal projection suffices to obtain an approximate solution. For continuous convex…
We develop fixed-point algorithms for the approximation of structured matrices with rank penalties. In particular we use these fixed-point algorithms for making approximations by sums of exponentials, or frequency estimation. For the basic…
Using recent developments on locally compact groups, we are able to obtain quantitative results on embeddings into Lebesgue spaces for a large class of HNN extensions.