Related papers: The high resolution vector quantization problem wi…
In this paper, the dual Orlicz curvature measure is proposed and its basic properties are provided. A variational formula for the dual Orlicz-quermassintegral is established in order to give a geometric interpretation of the dual Orlicz…
We investigate the upper and lower bounds on the quantization distortions for independent and identically distributed sources in the finite block-length regime. Based on the convex optimization framework of the rate-distortion theory, we…
This is a preliminary version of a book which presents the quantitative homogenization and large-scale regularity theory for elliptic equations in divergence-form. The self-contained presentation gives new and simplified proofs of the core…
We derive a high-resolution formula for the quantization and entropy coding approximation quantities for fractional Brownian motion, respective to the supremum norm and L^p[0,1]-norm distortions. We show that all moments in the quantization…
We present quantitative results for the homogenization of uniformly convex integral functionals with random coefficients under independence assumptions. The main result is an error estimate for the Dirichlet problem which is algebraic (but…
We study a one-dimensional elliptic problem with highly oscillatory random diffusion coefficient. We derive a homogenized solution and a so-called Gaussian corrector. We also prove a "pointwise" large deviation principle (LDP) for the full…
Density level sets can be estimated using plug-in methods, excess mass algorithms or a hybrid of the two previous methodologies. The plug-in algorithms are based on replacing the unknown density by some nonparametric estimator, usually the…
We define and prove characterizations of Hardy-Orlicz spaces of conformal densities.
We investigate performance limits and design of communication in the presence of uniform output quantization with moderate to high resolution. Under independent and identically distributed (i.i.d.) complex Gaussian codebook and nearest…
We study the problem of super-resolution, where we recover the locations and weights of non-negative point sources from a few samples of their convolution with a Gaussian kernel. It has been shown that exact recovery is possible by…
In this article, we investigate the orthonormal Strichartz estimates and the convergence problem of the density function associated with $\partial_{x}^{3}+\partial_{x}^{-1}$. Firstly, when $\gamma_{0}\in\mathfrak{S}^{\beta}(\dot{H}^{s})$…
Composite minimization involves a collection of functions which are aggregated in a nonsmooth manner. It covers, as a particular case, smooth approximation of minimax games, minimization of max-type functions, and simple composite…
In this paper, the Orlicz addition of measures is proposed and an interpretation of the $f$-divergence is provided based on a linear Orlicz addition of two measures. Fundamental inequalities, such as, a dual functional…
This paper deals with the problem of density estimation. We aim at building an estimate of an unknown density as a linear combination of functions of a dictionary. Inspired by Cand\`es and Tao's approach, we propose an $\ell_1$-minimization…
We present an analysis of optimal quantization of probability measures with nonuniform densities on spherical curves. We begin by deriving the centroid condition, followed by a high-resolution asymptotic analysis to establish the…
This paper investigates the problem of variable-length lossy source coding allowing a positive excess distortion probability and an overflow probability of codeword lengths. Novel one-shot achievability and converse bounds of the optimal…
This paper deals with a method for the approximation of a spectral density function among the solutions of a generalized moment problem a` la Byrnes/Georgiou/Lindquist. The approximation is pursued with respect to the Kullback-Leibler…
Lloyd's algorithm is an iterative method that solves the quantization problem, i.e. the approximation of a target probability measure by a discrete one, and is particularly used in digital applications. This algorithm can be interpreted as…
The problem of obtaining optimal projections for performing discriminant analysis with Gaussian class densities is studied. Unlike in most existing approaches to the problem, the focus of the optimisation is on the multinomial likelihood…
In this paper we are concerned with fully automatic and locally adaptive estimation of functions in a "signal + noise"-model where the regression function may additionally be blurred by a linear operator, e.g. by a convolution. To this end,…