Related papers: Function recovery on manifolds using scattered dat…
We consider sequences of compact Riemannian manifolds with uniform Sobolev bounds on their metric tensors, and prove that their distance functions are uniformly bounded in the H\"{o}lder sense. This is done by establishing a general trace…
Consider a sequence of closed, orientable surfaces of fixed genus $g$ in a Riemannian manifold $M$ with uniform upper bounds on mean curvature and area. We show that on passing to a subsequence and choosing appropriate parametrisations, the…
We consider the recovery of real-valued bandlimited functions from the absolute values of their samples, possibly spaced nonuniformly. We show that such a reconstruction is always possible if the function is sampled at more than twice its…
The problem of low-rank matrix completion has recently generated a lot of interest leading to several results that offer exact solutions to the problem. However, in order to do so, these methods make assumptions that can be quite…
We start by taking the analytical approach to discuss how the minimizer of Yamabe functional provides constant scalar curvature and its relationship with the Sobolev Space $W^{1,2}.$ Then, after demonstrating the importance of the sphere…
In this paper, we study optimal quadrature errors, approximation numbers, and sampling numbers in $L_2(\Bbb S^d)$ for Sobolev spaces ${\rm H}^{\alpha,\beta}(\Bbb S^d)$ with logarithmic perturbation on the unit sphere $\Bbb S^d$ in $\Bbb…
In this paper, we employ fixed point theory and semidefinite programming to compute the performance bounds on convex block-sparsity recovery algorithms. As a prerequisite for optimal sensing matrix design, a computable performance bound…
A variety of information processing tasks in practice involve recovering $n$ objects from single-shot graph-based measurements, particularly those taken over the edges of some measurement graph $\mathcal{G}$. This paper concerns the…
The Euclidean space notion of convex sets (and functions) generalizes to Riemannian manifolds in a natural sense and is called geodesic convexity. Extensively studied computational problems such as convex optimization and sampling in convex…
Given a smooth, complete Riemannian manifold $M$ with bounded Ricci curvature and positive injectivity radius, we derive a sharp Sobolev inequality for the embedding of $W^{1,p}(M)$ into $L^{\frac{np}{n-p}}(M)$, when $1\le p< n$. We will…
We establish the fundamental limits of lossless linear analog compression by considering the recovery of random vectors ${\boldsymbol{\mathsf{x}}}\in{\mathbb R}^m$ from the noiseless linear measurements…
Defect of compactness, relative to an embedding of two Banach spaces E and F, is a difference between a weakly convergent sequence in E and its weak limit taken up to a remainder that vanishes in the norm of F. For Sobolev embeddings in…
In this paper, we analyse the recovery properties of nonconvex regularized $M$-estimators, under the assumption that the true parameter is of soft sparsity. In the statistical aspect, we establish the recovery bound for any stationary point…
We study the performance of a wide class of convex optimization-based estimators for recovering a signal from corrupted one-bit measurements in high-dimensions. Our general result predicts sharply the performance of such estimators in the…
In this work we consider the problem of estimating function-on-scalar regression models when the functions are observed over multi-dimensional or manifold domains and with potentially multivariate output. We establish the minimax rates of…
We consider diffraction at random point scatterers on general discrete point sets in $\R^\nu$, restricted to a finite volume. We allow for random amplitudes and random dislocations of the scatterers. We investigate the speed of convergence…
We establish theoretical recovery guarantees of a family of Riemannian optimization algorithms for low rank matrix recovery, which is about recovering an $m\times n$ rank $r$ matrix from $p < mn$ number of linear measurements. The…
We study the Riemannian optimization methods on the embedded manifold of low rank matrices for the problem of matrix completion, which is about recovering a low rank matrix from its partial entries. Assume $m$ entries of an $n\times n$ rank…
We study the Riemannian Langevin Algorithm for the problem of sampling from a distribution with density $\nu$ with respect to the natural measure on a manifold with metric $g$. We assume that the target density satisfies a log-Sobolev…
We consider the recovery of square-integrable signals from discrete, equidistant samples of their Gabor transform magnitude and show that, in general, signals can not be recovered from such samples. In particular, we show that for any…