Searcharxiv⌕ Search

arXiv subjects

Richard Nickl

Publications and source records attributed to Richard Nickl.

At least 37 records · Page 2Linked to original sources

Bernstein -- von Mises theorems for statistical inverse problems II: Compound Poisson processes

We study nonparametric Bayesian statistical inference for the parameters governing a pure jump process of the form $$Y_t = \sum_{k=1}^{N(t)} Z_k,~~~ t \ge 0,$$ where $N(t)$ is a standard Poisson process of intensity $λ$, and $Z_k$ are drawn i.i.d.~from jump measure $μ$. A high-dimensional wavelet series prior for the Lévy measure $ν= λμ$ is devised and the posterior distribution arises from observing discrete samples $Y_Δ, Y_{2Δ}, \dots, Y_{nΔ}$ at fixed observation distance $Δ$, giving rise to a nonlinear inverse inference problem. We derive contraction rates in uniform norm for the posterior distribution around the true Lévy density that are optimal up to logarithmic factors over Hölder classes, as sample size $n$ increases. We prove a functional Bernstein-von Mises theorem for the distribution functions of both $μ$ and $ν$, as well as for the intensity $λ$, establishing the fact that the posterior distribution is approximated by an infinite-dimensional Gaussian measure whose covariance structure is shown to attain the information lower bound for this inverse problem. As a consequence posterior based inferences, such as nonparametric credible sets, are asymptotically valid and optimal from a frequentist point of view.

math.ST↗

Nonparametric statistical inference for drift vector fields of multi-dimensional diffusions

The problem of determining a periodic Lipschitz vector field $b=(b_1, \dots, b_d)$ from an observed trajectory of the solution $(X_t: 0 \le t \le T)$ of the multi-dimensional stochastic differential equation \begin{equation*} dX_t = b(X_t)dt + dW_t, \quad t \geq 0, \end{equation*} where $W_t$ is a standard $d$-dimensional Brownian motion, is considered. Convergence rates of a penalised least squares estimator, which equals the maximum a posteriori (MAP) estimate corresponding to a high-dimensional Gaussian product prior, are derived. These results are deduced from corresponding contraction rates for the associated posterior distributions. The rates obtained are optimal up to log-factors in $L^2$-loss in any dimension, and also for supremum norm loss when $d \le 4$. Further, when $d \le 3$, nonparametric Bernstein-von Mises theorems are proved for the posterior distributions of $b$. From this we deduce functional central limit theorems for the implied estimators of the invariant measure $μ_b$. The limiting Gaussian process distributions have a covariance structure that is asymptotically optimal from an information-theoretic point of view.

math.ST↗

Efficient Estimation of Linear Functionals of Principal Components

We study principal component analysis (PCA) for mean zero i.i.d. Gaussian observations $X_1,\dots, X_n$ in a separable Hilbert space $\mathbb{H}$ with unknown covariance operator $Σ.$ The complexity of the problem is characterized by its effective rank ${\bf r}(Σ):= \frac{{\rm tr}(Σ)}{\|Σ\|},$ where ${\rm tr}(Σ)$ denotes the trace of $Σ$ and $\|Σ\|$ denotes its operator norm. We develop a method of bias reduction in the problem of estimation of linear functionals of eigenvectors of $Σ.$ Under the assumption that ${\bf r}(Σ)=o(n),$ we establish the asymptotic normality and asymptotic properties of the risk of the resulting estimators and prove matching minimax lower bounds, showing their semi-parametric optimality.

math.ST↗

Bernstein - von Mises theorems for statistical inverse problems I: Schrödinger equation

The inverse problem of determining the unknown potential $f>0$ in the partial differential equation $$\fracΔ{2} u - fu =0 \text{ on } \mathcal O ~~\text{s.t. } u = g \text { on } \partial \mathcal O,$$ where $\mathcal O$ is a bounded $C^\infty$-domain in $\mathbb R^d$ and $g>0$ is a given function prescribing boundary values, is considered. The data consist of the solution $u$ corrupted by additive Gaussian noise. A nonparametric Bayesian prior for the function $f$ is devised and a Bernstein - von Mises theorem is proved which entails that the posterior distribution given the observations is approximated in a suitable function space by an infinite-dimensional Gaussian measure that has a `minimal' covariance structure in an information-theoretic sense. As a consequence the posterior distribution performs valid and optimal frequentist statistical inference on $f$ in the small noise limit.

math.ST↗

Efficient Nonparametric Bayesian Inference For X-Ray Transforms

We consider the statistical inverse problem of recovering a function $f: M \to \mathbb R$, where $M$ is a smooth compact Riemannian manifold with boundary, from measurements of general $X$-ray transforms $I_a(f)$ of $f$, corrupted by additive Gaussian noise. For $M$ equal to the unit disk with `flat' geometry and $a=0$ this reduces to the standard Radon transform, but our general setting allows for anisotropic media $M$ and can further model local `attenuation' effects -- both highly relevant in practical imaging problems such as SPECT tomography. We propose a nonparametric Bayesian inference approach based on standard Gaussian process priors for $f$. The posterior reconstruction of $f$ corresponds to a Tikhonov regulariser with a reproducing kernel Hilbert space norm penalty that does not require the calculation of the singular value decomposition of the forward operator $I_a$. We prove Bernstein-von Mises theorems that entail that posterior-based inferences such as credible sets are valid and optimal from a frequentist point of view for a large family of semi-parametric aspects of $f$. In particular we derive the asymptotic distribution of smooth linear functionals of the Tikhonov regulariser, which is shown to attain the semi-parametric Cramér-Rao information bound. The proofs rely on an invertibility result for the `Fisher information' operator $I_a^*I_a$ between suitable function spaces, a result of independent interest that relies on techniques from microlocal analysis. We illustrate the performance of the proposed method via simulations in various settings.

math.ST↗

Adaptive confidence sets for matrix completion

In the present paper we study the problem of existence of honest and adaptive confidence sets for matrix completion. We consider two statistical models: the trace regression model and the Bernoulli model. In the trace regression model, we show that honest confidence sets that adapt to the unknown rank of the matrix exist even when the error variance is unknown. Contrary to this, we prove that in the Bernoulli model, honest and adaptive confidence sets exist only when the error variance is known a priori. In the course of our proofs we obtain bounds for the minimax rates of certain composite hypothesis testing problems arising in low rank inference.

math.ST↗

Inference on covariance operators via concentration inequalities: k-sample tests, classification, and clustering via Rademacher complexities

We propose a novel approach to the analysis of covariance operators making use of concentration inequalities. First, non-asymptotic confidence sets are constructed for such operators. Then, subsequent applications including a k sample test for equality of covariance, a functional data classifier, and an expectation-maximization style clustering algorithm are derived and tested on both simulated and phoneme data.

stat.ME↗

Nonparametric Bayesian posterior contraction rates for discretely observed scalar diffusions

We consider nonparametric Bayesian inference in a reflected diffusion model $dX_t = b (X_t)dt + σ(X_t) dW_t,$ with discretely sampled observations $X_0, X_Δ, \dots, X_{nΔ}$. We analyse the nonlinear inverse problem corresponding to the `low frequency sampling' regime where $Δ>0$ is fixed and $n \to \infty$. A general theorem is proved that gives conditions for prior distributions $Π$ on the diffusion coefficient $σ$ and the drift function $b$ that ensure minimax optimal contraction rates of the posterior distribution over Hölder-Sobolev smoothness classes. These conditions are verified for natural examples of nonparametric random wavelet series priors. For the proofs we derive new concentration inequalities for empirical processes arising from discretely observed diffusions that are of independent interest.

math.ST↗

Uncertainty Quantification for Matrix Compressed Sensing and Quantum Tomography Problems

We construct minimax optimal non-asymptotic confidence sets for low rank matrix recovery algorithms such as the Matrix Lasso or Dantzig selector. These are employed to devise adaptive sequential sampling procedures that guarantee recovery of the true matrix in Frobenius norm after a data-driven stopping time $\hat n$ for the number of measurements that have to be taken. With high probability, this stopping time is minimax optimal. We detail applications to quantum tomography problems where measurements arise from Pauli observables. We also give a theoretical construction of a confidence set for the density matrix of a quantum state that has optimal diameter in nuclear norm. The non-asymptotic properties of our confidence sets are further investigated in a simulation study.

math.ST↗

On signal detection and confidence sets for low rank inference problems

We consider the signal detection problem in the Gaussian design trace regression model with low rank alternative hypotheses. We derive the precise (Ingster-type) detection boundary for the Frobenius and the nuclear norm. We then apply these results to show that honest confidence sets for the unknown matrix parameter that adapt to all low rank sub-models in nuclear norm do not exist. This shows that recently obtained positive results in (Carpentier, Eisert, Gross and Nickl, 2015) for confidence sets in low rank recovery problems are essentially optimal.

math.ST↗

A sharp adaptive confidence ball for self-similar functions

In the nonparametric Gaussian sequence space model an $\ell^2$-confidence ball $C_n$ is constructed that adapts to unknown smoothness and Sobolev-norm of the infinite-dimensional parameter to be estimated. The confidence ball has exact and honest asymptotic coverage over appropriately defined `self-similar' parameter spaces. It is shown by information-theoretic methods that this `self-similarity' condition is weakest possible.

math.ST↗

High-frequency Donsker theorems for Lévy measures

Donsker-type functional limit theorems are proved for empirical processes arising from discretely sampled increments of a univariate Lévy process. In the asymptotic regime the sampling frequencies increase to infinity and the limiting object is a Gaussian process that can be obtained from the composition of a Brownian motion with a covariance operator determined by the Lévy measure. The results are applied to derive the asymptotic distribution of natural estimators for the distribution function of the Lévy jump measure. As an application we deduce Kolmogorov-Smirnov type tests and confidence bands.

math.ST↗

On the Bernstein-von Mises phenomenon for nonparametric Bayes procedures

We continue the investigation of Bernstein-von Mises theorems for nonparametric Bayes procedures from [Ann. Statist. 41 (2013) 1999-2028]. We introduce multiscale spaces on which nonparametric priors and posteriors are naturally defined, and prove Bernstein-von Mises theorems for a variety of priors in the setting of Gaussian nonparametric regression and in the i.i.d. sampling model. From these results we deduce several applications where posterior-based inference coincides with efficient frequentist procedures, including Donsker- and Kolmogorov-Smirnov theorems for the random posterior cumulative distribution functions. We also show that multiscale posterior credible bands for the regression or density function are optimal frequentist confidence bands.

math.ST↗

Confidence sets in sparse regression

The problem of constructing confidence sets in the high-dimensional linear model with $n$ response variables and $p$ parameters, possibly $p\ge n$, is considered. Full honest adaptive inference is possible if the rate of sparse estimation does not exceed $n^{-1/4}$, otherwise sparse adaptive confidence sets exist only over strict subsets of the parameter spaces for which sparse estimators exist. Necessary and sufficient conditions for the existence of confidence sets that adapt to a fixed sparsity level of the parameter vector are given in terms of minimal $\ell^2$-separation conditions on the parameter space. The design conditions cover common coherence assumptions used in models for sparsity, including (possibly correlated) sub-Gaussian designs.

math.ST↗

Nonparametric Bernstein-von Mises theorems in Gaussian white noise

Bernstein-von Mises theorems for nonparametric Bayes priors in the Gaussian white noise model are proved. It is demonstrated how such results justify Bayes methods as efficient frequentist inference procedures in a variety of concrete nonparametric problems. Particularly Bayesian credible sets are constructed that have asymptotically exact $1-α$ frequentist coverage level and whose $L^2$-diameter shrinks at the minimax rate of convergence (within logarithmic factors) over Hölder balls. Other applications include general classes of linear and nonlinear functionals and credible bands for auto-convolutions. The assumptions cover nonconjugate product priors defined on general orthonormal bases of $L^2$ satisfying weak conditions.

math.ST↗

A Donsker Theorem for Lévy Measures

Given $n$ equidistant realisations of a Lévy process $(L_t,\,t\ge 0)$, a natural estimator $\hat N_n$ for the distribution function $N$ of the Lévy measure is constructed. Under a polynomial decay restriction on the characteristic function $ϕ$, a Donsker-type theorem is proved, that is, a functional central limit theorem for the process $\sqrt n (\hat N_n -N)$ in the space of bounded functions away from zero. The limit distribution is a generalised Brownian bridge process with bounded and continuous sample paths whose covariance structure depends on the Fourier-integral operator ${\cal F}^{-1}[1/ϕ(-\cdot)]$. The class of Lévy processes covered includes several relevant examples such as compound Poisson, Gamma and self-decomposable processes. Main ideas in the proof include establishing pseudo-locality of the Fourier-integral operator and recent techniques from smoothed empirical processes.

math.ST↗

Adaptive confidence sets in L^2

The problem of constructing confidence sets that are adaptive in L^2-loss over a continuous scale of Sobolev classes of probability densities is considered. Adaptation holds, where possible, with respect to both the radius of the Sobolev ball and its smoothness degree, and over maximal parameter spaces for which adaptation is possible. Two key regimes of parameter constellations are identified: one where full adaptation is possible, and one where adaptation requires critical regions be removed. Techniques used to derive these results include a general nonparametric minimax test for infinite-dimensional null- and alternative hypotheses, and new lower bounds for L^2-adaptive confidence sets.

math.ST↗