Related papers: Decompounding on Compact Symmetric Spaces
Abstract notions of convexity over the vertices of a graph, and corresponding notions of halfspaces, have recently gained attention from the machine learning community. In this work we study monophonic halfspaces, a notion of graph…
We consider the unconstrained optimization problem whose objective function is composed of a smooth and a non-smooth conponents where the smooth component is the expectation a random function. This type of problem arises in some interesting…
Composite minimization is a powerful framework in large-scale convex optimization, based on decoupling of the objective function into terms with structurally different properties and allowing for more flexible algorithmic design. We…
We study, in d-dimensions, the random walker with geometrically shrinking step sizes at each hop. We emphasize the integrated quantities such as expectation values, cumulants and moments rather than a direct study of the probability…
This paper considers convolution equations that arise from problems such as measurement error and non-parametric regression with errors in variables with independence conditions. The equations are examined in spaces of generalized functions…
Cooperative geolocation has attracted significant research interests in recent years. A large number of localization algorithms rely on the availability of statistical knowledge of measurement errors, which is often difficult to obtain in…
Sampling theory in spaces other than the space of band-limited functions has recently received considerable attention. This is in part because the band-limitedness assumption is not very realistic in many applications. In addition,…
This paper deals with convex nonsmooth optimization problems. We introduce a general smooth approximation framework for the original function and apply random (accelerated) coordinate descent methods for minimizing the corresponding smooth…
I present a semiclassical analysis of a spatial-mode demultiplexing (SPADE) measurement scheme for far-field incoherent optical imaging under the effects of diffraction and photon shot noise. Building on previous results that assume two…
We prove effective density of random walks on homogeneous spaces, assuming that the underlying measure is supported on matrices generating a dense subgroup and having algebraic entries. The main novelty is an argument passing from high…
We investigate three aspects of weak* convergence of the $n$-step distributions of random walks on finite volume homogeneous spaces $G/\Gamma$ of semisimple real Lie groups. First, we look into the obvious obstruction to the upgrade from…
We consider optimization problems on manifolds with equality and inequality constraints. A large body of work treats constrained optimization in Euclidean spaces. In this work, we consider extensions of existing algorithms from the…
This paper addresses the problem of estimating the containment and similarity between two sets using only random samples from each set, without relying on sketches of full sets. The study introduces a binomial model for predicting the…
Divergence is not only an important mathematical concept in information theory, but also applied to machine learning problems such as low-dimensional embedding, manifold learning, clustering, classification, and anomaly detection. We…
Decomposition spaces are a class of function spaces constructed out of well-behaved coverings and partitions of unity of a set. The structure of the covering of the set determines the properties of the decomposition space. Besov spaces,…
The subject of this paper is the problem of nonparametric estimation of a continuous distribution function from observations with measurement errors. We study minimax complexity of this problem when unknown distribution has a density…
Let $X$ and $Y$ be two independent identically distributed random variables with density $p(x)$ and $Z=\alpha X+\beta Y$ for some constants $\alpha>0$ and $\beta>0$. We consider the problem of estimating $p(x)$ by means of the samples from…
This paper focuses on minimizing a smooth function combined with a nonsmooth regularization term on a compact Riemannian submanifold embedded in the Euclidean space under a decentralized setting. Typically, there are two types of approaches…
Classical mathematical statistics deals with models that are parametrized by a Euclidean, i.e. finite dimensional, parameter. Quite often such models have been and still are chosen in practical situations for their mathematical simplicity…
We consider random walks in a uniformly elliptic, balanced, i.i.d. random environment in the integer lattice $Z^d$ for $d\geq 2$ and the corresponding problem of stochastic homogenization of non-divergence form difference operators. We…