Related papers: Sparsity and spectral properties of dual frames
The spectral density of bound pairs in ideal 1D, 2D and Bethe lattices is computed for weak and strong interactions. The computations are performed with Green's functions by an efficient recursion method in real space. For the range of…
The paper shows that under some mild conditions $n$-dimensional spherical wavelets derived from approximate identities build semi-continuous frames. Moreover, for sufficiently dense grids Poisson wavelets on $n$-dimensional spheres…
We present a novel sparse modeling approach to non-rigid shape matching using only the ability to detect repeatable regions. As the input to our algorithm, we are given only two sets of regions in two shapes; no descriptors are provided so…
The spectra of random feature matrices provide essential information on the conditioning of the linear system used in random feature regression problems and are thus connected to the consistency and generalization of random feature models.…
In this paper we present the framework of symmetry in nonparametric regression. This generalises the framework of covariate sparsity, where the regression function depends only on at most $s < d$ of the covariates, which is a special case…
We thoroughly analyse the double-layer potential's role in approaches to spectral sets in the spirit of Delyon--Delyon, Crouzeix and Crouzeix--Palencia. While the potential is well-studied, we aim to clarify on several of its aspects in…
Real-world processes often contain intermediate state that can be modeled as an extremely sparse activation tensor. In this work, we analyze the identifiability of such sparse and local latent intermediate variables, which we call motifs.…
When constructing finite frames for a given application, the most important consideration is the spectrum of the frame operator. Indeed, the minimum and maximum eigenvalues of the frame operator are the optimal frame bounds, and the frame…
We consider a multiple-input-multiple-output radar system and derive a theoretical framework for the recoverability of targets in the azimuth-range domain and the azimuth-range-Doppler domain via sparse approximation algorithms. Using tools…
We answer a number of open problems in frame theory concerning the decomposition of frames into linearly independent and/or spanning sets. We prove that in finite dimensional Hilbert spaces, Parseval frames with norms bounded away from 1…
Noisy matrix completion has attracted significant attention due to its applications in recommendation systems, signal processing and image restoration. Most existing works rely on (weighted) least squares methods under various low-rank…
Loosely speaking, a semi-frame is a generalized frame for which one of the frame bounds is absent. More precisely, given a total sequence in a Hilbert space, we speak of an upper (resp. lower) semi-frame if only the upper (resp. lower)…
The work "Loss Landscape Sightseeing with Multi-Point Optimization" (Skorokhodov and Burtsev, 2019) demonstrated that one can empirically find arbitrary 2D binary patterns inside loss surfaces of popular neural networks. In this paper we…
Measures play an important role in the characterisation of various function spaces. In this paper, the structure of density measures will be investigated. These are elements of the dual of the space of essentially bounded func- tions. The…
Sparsity is a ubiquitous feature of many real world signals such as natural images and neural spiking activities. Conventional compressed sensing utilizes sparsity to recover low dimensional signal structures in high ambient dimensions…
Demixing problems in many areas such as hyperspectral imaging and differential optical absorption spectroscopy (DOAS) often require finding sparse nonnegative linear combinations of dictionary elements that match observed data. We show how…
Spectral unmixing aims at recovering the spectral signatures of materials, called endmembers, mixed in a hyperspectral or multispectral image, along with their abundances. A typical assumption is that the image contains one pure pixel per…
Sparse data models, where data is assumed to be well represented as a linear combination of a few elements from a dictionary, have gained considerable attention in recent years, and their use has led to state-of-the-art results in many…
Sharp conditions for the presence of spectral outliers are well understood for Wigner random matrices with iid entries. In the setting of inhomogeneous symmetric random matrices (i.e., matrices with a non-trivial variance profile), the…
Finite frames, or spanning sets for finite-dimensional Hilbert spaces, are a ubiquitous tool in signal processing. There has been much recent work on understanding the global structure of collections of finite frames with prescribed…