English
Related papers

Related papers: Sampling, Metric Entropy and Dimensionality Reduct…

200 papers

We consider multi-variate signals spanned by the integer shifts of a set of generating functions with distinct frequency profiles and the problem of reconstructing them from samples taken on a random periodic set. We show that such a…

Functional Analysis · Mathematics 2023-10-13 Jorge Antezana , Diana Carbajal , José Luis Romero

We study invariant measures for random countable (finite or infinite) conformal iterated function systems (IFS) with arbitrary overlaps. We do not assume any type of separation condition. We prove, under a mild assumption of finite entropy,…

Dynamical Systems · Mathematics 2015-03-24 Eugen Mihailescu , Mariusz Urbanski

Infinite-dimensional, holomorphic functions have been studied in detail over the last several decades, due to their relevance to parametric differential equations and computational uncertainty quantification. The approximation of such…

Numerical Analysis · Mathematics 2025-02-20 Ben Adcock , Nick Dexter , Sebastian Moraga

We reformulate entanglement wedge reconstruction in the language of operator-algebra quantum error correction with infinite-dimensional physical and code Hilbert spaces. Von Neumann algebras are used to characterize observables in a…

High Energy Physics - Theory · Physics 2023-02-09 Monica Jinwoo Kang , David K. Kolchmeyer

We propose a nonstandard approach to solving the apparent incompatibility between the coalgebra structure of some inhomogeneous quantum groups and their natural complex conjugation. In this work we sketch the general idea and develop the…

High Energy Physics - Theory · Physics 2008-02-03 Gaetano Fiore

This paper investigates model reduction methods for efficiently approximating the solution of parameter-dependent PDEs with a multi-parameter vector $\vec{\mu} \in \mathbb{R}^p$. In cases where the Kolmogorov $N$-width decays fast enough,…

Numerical Analysis · Mathematics 2026-01-21 Joubine Aghili , Hassan Ballout , Yvon Maday , Christophe Prud'homme

In this note we study the problem of sampling and reconstructing signals which are assumed to lie on or close to one of several subspaces of a Hilbert space. Importantly, we here consider a very general setting in which we allow infinitely…

Information Theory · Computer Science 2009-12-02 Thomas Blumensath

Entropic Dynamics (ED) is a framework in which Quantum Mechanics is derived as an application of entropic methods of inference. In ED the dynamics of the probability distribution is driven by entropy subject to constraints that are codified…

Quantum Physics · Physics 2019-09-27 Ariel Caticha

We apply two variations of the principle of Minimum Cross Entropy (the Kullback information measure) to fit parameterized probability density models to observed data densities. For an array beamforming problem with P incident narrowband…

Information Theory · Computer Science 2008-06-24 Cheng-Yuan Liou , Bruce R. Musicus

Folded sampling replaces clipping in analog-to-digital converters by reducing samples modulo a threshold, thereby avoiding saturation artifacts. We study the reconstruction of bandlimited functions from folded samples and show that, for…

Functional Analysis · Mathematics 2026-03-26 José Luis Romero , Irina Shafkulovska

In quantum mechanics (formulated, say, in Schr\"{o}dinger picture) only the knowledge of a complete set of observables $\Lambda_j$ enables us to declare the related physical inner product (i.e., the Hilbert-space metric $\Theta$ such that…

Quantum Physics · Physics 2024-03-15 Miloslav Znojil

We give a level one result for the "symmetry integral", say $I_f(N,h)$, of essentially bounded $f:\N \to \R$; i.e., we get a kind of "square-root cancellation" \thinspace bound for the mean-square (in $N<x\le 2N$) of the "symmetry"…

Number Theory · Mathematics 2010-07-08 Giovanni Coppola

This paper is concerned with function reconstruction from samples. The sampling points used in several approaches are (1) structured points connected with fast algorithms or (2) unstructured points coming from, e.g., an initial random draw…

Numerical Analysis · Mathematics 2023-06-07 Felix Bartel , Lutz Kämmerer , Daniel Potts , Tino Ullrich

We show that the Hellinger-Kantorovich distance can be expressed as the metric infimal convolution of the Hellinger and the Wasserstein distances, as conjectured by Liero, Mielke, and Savar\'e. To prove it, we study with the tools of…

Metric Geometry · Mathematics 2025-03-18 Nicolò De Ponti , Giacomo Enrico Sodini , Luca Tamanini

We show that independent and uniformly distributed sampling points are as good as optimal sampling points for the approximation of functions from the Sobolev space $W_p^s(\Omega)$ on bounded convex domains $\Omega\subset \mathbb{R}^d$ in…

Numerical Analysis · Mathematics 2023-02-02 David Krieg , Mathias Sonnleitner

For a given topological dynamical system $(X,T)$ over a compact set $X$ with a metric $d$, the "variational principle" states that \begin{equation*} \sup_{\mu}h_\mu(T) = h(T) = h_d(T), \end{equation*} where $h_\mu(T)$ is the…

Dynamical Systems · Mathematics 2016-04-12 André Caldas , Mauro Patrão

We study optimal algorithms in adaptive sampling recovery of smooth functions defined on the unit $d$-cube ${\II}^d:= [0,1]^d$. The recovery error is measured in the quasi-norm $\|\cdot\|_q$ of $L_q := L_q(\II^d)$. For $B$ a subset in…

Functional Analysis · Mathematics 2011-03-01 Dinh Dũng

We consider some classes of piecewise expanding maps in finite dimensional spaces having invariant probability measures which are absolutely continuous with respect to Lebesgue measure. We derive an entropy formula for such measures and,…

Dynamical Systems · Mathematics 2018-06-05 Jose F. Alves , Antonio Pumarino

We prove that every hyperbolic measure invariant under a C^{1+\alpha} diffeomorphism of a smooth Riemannian manifold possesses asymptotically ``almost'' local product structure, i.e., its density can be approximated by the product of the…

Dynamical Systems · Mathematics 2016-09-07 Luis Barreira , Yakov Pesin , Jörg Schmeling

Given a probability distribution P, what is the minimum amount of bits needed to store a value x sampled according to P, such that x can later be recovered (except with some small probability)? Or, what is the maximum amount of uniform…

Information Theory · Computer Science 2007-07-13 Thomas Holenstein , Renato Renner
‹ Prev 1 8 9 10 Next ›