This paper is concerned with density estimation of directional data on the sphere. We introduce a procedure based on thresholding on a new type of spherical wavelets called {\it needlets}. We establish a minimax result and prove its optimality. We are motivated by astrophysical applications, in particular in connection with the analysis of ultra high energy cosmic rays.
The problem of estimating a probability density function f on the (d-1)-dimensional unit sphere S^{d-1} from directional data using the needlet frame is considered. It is shown that the decay of needlet coefficients supported near a point of a function f depends only on local Hölder continuity properties of f at x. This is then used to show that the thresholded needlet estimator introduced in Baldi, Kerkyacharian, Marinucci and Picard adapts to the local regularity properties of f. Moreover an adaptive confidence interval for f based on the thresholded needlet estimator is proposed, which is a…
This work is concerned with the study of asymptotic properties of nonparametric density estimates in the framework of circular data. The estimation procedure here applied is based on wavelet thresholding methods: the wavelets used are the so-called Mexican needlets, which describe a nearly-tight frame on the circle. We study the asymptotic behaviour of the $L^{2}$-risk function for these estimates, in particular its adaptivity, proving that its rate of convergence is nearly optimal.
In the random coefficients binary choice model, a binary variable equals 1 iff an index $X^\topβ$ is positive.The vectors $X$ and $β$ are independent and belong to the sphere $\mathbb{S}^{d-1}$ in $\mathbb{R}^{d}$.We prove lower bounds on the minimax risk for estimation of the density $f\_β$ over Besov bodies where the loss is a power of the $L^p(\mathbb{S}^{d-1})$ norm for $1\le p\le \infty$. We show that a hard thresholding estimator based on a needlet expansion with data-driven thresholds achieves these lower bounds up to logarithmic factors.
We focus on the nonparametric density estimation problem with directional data. We propose a new rule for bandwidth selection for kernel density estimation. Our procedure is automatic, fully data-driven and adaptive to the smoothness degree of the density. We obtain an oracle inequality and optimal rates of convergence for the L2 error. Our theoretical results are illustrated with simulations.
Let $X_1,...,X_n$ be a random sample from some unknown probability density $f$ defined on a compact homogeneous manifold $\mathbf M$ of dimension $d \ge 1$. Consider a 'needlet frame' $\{ϕ_{j η}\}$ describing a localised projection onto the space of eigenfunctions of the Laplace operator on $\mathbf M$ with corresponding eigenvalues less than $2^{2j}$, as constructed in \cite{GP10}. We prove non-asymptotic concentration inequalities for the uniform deviations of the linear needlet density estimator $f_n(j)$ obtained from an empirical estimate of the needlet projection $\sum_ηϕ_{j η} \int f ϕ_{…
Efficient Inference after Directionally Stable Adaptive Experiments
University College London(伦敦大学学院);Gatsby Computational Neuroscience Unit, University College London(伦敦大学学院计算神经科学单元);Cornell University(康奈尔大学);Netflix;Google DeepMind(谷歌DeepMind);Rutgers University(罗格斯大学)
We revisit, in an original and challenging perspective, the problem of testing the null hypothesis that the mode of a directional signal is equal to a given value. Motivated by a real data example where the signal is weak, we consider this problem under asymptotic scenarios for which the signal strength goes to zero at an arbitrary rate~$η_n$. Both under the null and the alternative, we focus on rotationally symmetric distributions. We show that, while they are asymptotically equivalent under fixed signal strength, the classical Wald and Watson tests exhibit very different (null and non-null) …
We consider spherical data $X_i$ noised by a random rotation $\varepsilon_i\in$ SO(3) so that only the sample $Z_i=\varepsilon_iX_i$, $i=1,\dots, N$ is observed. We define a nonparametric test procedure to distinguish $H_0:$ ''the density $f$ of $X_i$ is the uniform density $f_0$ on the sphere'' and $H_1:$ ''$\|f-f_0\|_2^2\geq \Cψ_N$ and $f$ is in a Sobolev space with smoothness $s$''. For a noise density $f_\varepsilon$ with smoothness index $ν$, we show that an adaptive procedure (i.e. $s$ is not assumed to be known) cannot have a faster rate of separation than $ψ_N^{ad}(s)=(N/\sqrt{\log\log…
The aim of this paper is to study the nonparametric regression estimators on the sphere built by the needlet block thresholding. The block thresholding procedure proposed here follows the method introduced by Hall, Kerkyacharian and Picard in [Hall, Kerkyacharian, Picard, (1998), (1999)], modified to exploit the properties of the spherical standard needlets. Therefore, we will investigate on their convergence rates, attaining their adaptive properties over the Besov balls. This work is strongly motivated by issues arising in Cosmology and Astrophysics, concerning in particular the analysis of …
This work is concerned with the study of the adaptivity properties of nonparametric regression estimators over the $d$-dimensional sphere within the global thresholding framework. The estimators are constructed by means of a form of spherical wavelets, the so-called needlets, which enjoy strong concentration properties in both harmonic and real domains. The author establishes the convergence rates of the $L^p$-risks of these estimators, focussing on their minimax properties and proving their optimality over a scale of nonparametric regularity function spaces, namely, the Besov spaces.
The construction of adaptive nonparametric procedures by means of wavelet thresholding techniques is now a classical topic in modern mathematical statistics. In this paper, we extend this framework to the analysis of nonparametric regression on sections of spin fiber bundles defined on the sphere. This can be viewed as a regression problem where the function to be estimated takes as its values algebraic curves (for instance, ellipses) rather than scalars, as usual. The problem is motivated by many important astrophysical applications, concerning for instance the analysis of the weak gravitatio…
Parallel Network Reconstruction with Multi-directional Regularization
Department of Applied and Computational Mathematics and Statistics, University of Notre Dame(应用与计算数学与统计学系,圣约翰大学);Department of Statistics & Data Science, Xiamen University(统计与数据科学系,厦门大学)
Precision matrix is of significant importance in a wide range of applications in multivariate analysis. This paper considers adaptive minimax estimation of sparse precision matrices in the high dimensional setting. Optimal rates of convergence are established for a range of matrix norm losses. A fully data driven estimator based on adaptive constrained $\ell_1$ minimization is proposed and its rate of convergence is obtained over a collection of parameter spaces. The estimator, called ACLIME, is easy to implement and performs well numerically. A major step in establishing the minimax rate of c…