Related papers: Sparse super resolution is Lipschitz continuous
Wasserstein metrics are increasingly being used as similarity scores for images treated as discrete measures on a grid, yet their behavior under noise remains poorly understood. In this work, we consider the sensitivity of the signed…
We study the behavior of deterministic methods for solving inverse problems in imaging. These methods are commonly designed to achieve two goals: (1) attaining high perceptual quality, and (2) generating reconstructions that are consistent…
We study the local Lipschitz one subsets of a finite dimensional space, that is, sets for which there exists a continuous function whose local Lipschitz derivative is the characteristic function of said set. We give a characterization of a…
When considering sparse motion capture marker data, one typically struggles to balance its overfitting via a high dimensional blendshape system versus underfitting caused by smoothness constraints. With the current trend towards using more…
To accelerate deep CNN models, this paper proposes a novel spatially adaptive framework that can dynamically generate pixel-wise sparsity according to the input image. The sparse scheme is pixel-wise refined, regional adaptive under a…
Problem definition: A key challenge in supervised learning is data scarcity, which can cause prediction models to overfit to the training data and perform poorly out of sample. A contemporary approach to combat overfitting is offered by…
In this paper, the Lipschitz clustering property of a metric space refers to the existence of Lipschitz retractions between its finite subset spaces. Obstructions to this property can be either topological or geometric features of the…
A fundamental small-noise sensitivity analysis of spike localization in the presence of adversarial perturbations and an arbitrary point spread function (PSF) is presented. The analysis leverages the local Lipschitz property of the inverse…
We introduce sparse random projection, an important dimension-reduction tool from machine learning, for the estimation of discrete-choice models with high-dimensional choice sets. Initially, high-dimensional data are compressed into a…
We consider the inverse problem of recovering the locations and amplitudes of a collection of point sources represented as a discrete measure, given $M+1$ of its noisy low-frequency Fourier coefficients. Super-resolution refers to a stable…
We consider the consensus problem in a decentralized network, focusing on a compact submanifold that acts as a nonconvex constraint set. By leveraging the proximal smoothness of the compact submanifold, which encompasses the local singleton…
The Lipschitz constant of the map between the input and output space represented by a neural network is a natural metric for assessing the robustness of the model. We present a new method to constrain the Lipschitz constant of dense deep…
Super-resolution (SR) is an ill-posed problem, which means that infinitely many high-resolution (HR) images can be degraded to the same low-resolution (LR) image. To study the one-to-many stochastic SR mapping, we implicitly represent the…
We show that no matter what subset of a normed space is given, a typical 1-Lipschitz mapping into a Banach space is non-differentiable at a typical point of the set in a very strong sense: the derivative ratio approximates, on arbitrary…
We analyze stability of conservative solutions of the Cauchy problem on the line for the (integrated) Hunter-Saxton (HS) equation. Generically, the solutions of the HS equation develop singularities with steep gradients while preserving…
We investigate geometric properties of a metric measure space where every function in the Newton--Sobolev space $N^{1,\infty}(Z)$ has a Lipschitz representative. We prove that when the metric space is locally complete and the reference…
An appealing requirement from the well-known diffraction tomography (DT) exists for success reconstruction from few-view and limited-angle data. Inspired by the well-known compressive sensing (CS), the accurate super-resolution…
In this paper, we study the spectral estimation problem of estimating the locations of a fixed number of point sources given multiple snapshots of Fourier measurements in a bounded domain. We aim to provide a mathematical foundation for…
Consider a set of points sampled independently near a smooth compact submanifold of Euclidean space. We provide mathematically rigorous bounds on the number of sample points required to estimate both the dimension and the tangent spaces of…
This paper analyzes the Lipschitz behavior of the feasible set in two parametric settings, associated with linear and convex systems in R^n. To start with, we deal with the parameter space of linear (finite/semi-infinite) systems identified…