Abstract

In the present paper we consider the problem of estimating a periodic $(r+1)$-dimensional function $f$ based on observations from its noisy convolution. We construct a wavelet estimator of $f$, derive minimax lower bounds for the $L^{2}$-risk when $f$ belongs to a Besov ball of mixed smoothness and demonstrate that the wavelet estimator is adaptive and asymptotically near-optimal within a logarithmic factor, in a wide range of Besov balls. We prove in particular that choosing this type of mixed smoothness leads to rates of convergence which are free of the “curse of dimensionality” and, hence, are higher than usual convergence rates when $r$ is large. The problem studied in the paper is motivated by seismic inversion which can be reduced to solution of noisy two-dimensional convolution equations that allow to draw inference on underground layer structures along the chosen profiles. The common practice in seismology is to recover layer structures separately for each profile and then to combine the derived estimates into a two-dimensional function. By studying the two-dimensional version of the model, we demonstrate that this strategy usually leads to estimators which are less accurate than the ones obtained as two-dimensional functional deconvolutions. Indeed, we show that unless the function $f$ is very smooth in the direction of the profiles, very spatially inhomogeneous along the other direction and the number of profiles is very limited, the functional deconvolution solution has a much better precision compared to a combination of $M$ solutions of separate convolution equations. A limited simulation study in the case of $r=1$ confirms theoretical claims of the paper.

Highlights

  • Functional deconvolution problems have been introduced in Pensky and Sapatinas (2009) [19] and further developed in Pensky and Sapatinas (2010, 2011) [20, 21]

  • Discussion i) In the present paper, we constructed functional deconvolution estimators based on the hyperbolic wavelet thresholding procedure

  • We derived the lower and the upper bounds for the minimax convergence rates which confirm that estimators derived in the paper are adaptive and asymptotically near-optimal, within a logarithmic factor, in a wide range of Besov balls of mixed regularity

Read more

Summary

Estimation Algorithm

(the space of squared-integrable functions defined on the unit interval [0, 1]), i.e., f, g conjugate. Consider a bounded bandwidth periodized wavelet basis (e.g., Meyer-type) ψj,k(t) and finitely supported periodized s0-regular wavelet basis (e.g., Daubechies) ηj′,k′ (u). The choice of the Meyer wavelet basis for t is motivated by the fact that it allows easy evaluation of the the wavelet coefficients in the Fourier domain while finitely supported wavelet basis gives more flexibility in recovering a function which is spatially inhomogeneous in u. Let m0 and m′0 be the lowest resolution levels for the two bases and denote the scaling functions for the bounded bandwidth wavelet by ψm0−1,k(t) and the scaling functions for the finitely supported wavelet by ηm′0−1,k′ (u). The values of J, J′ and λjε will be defined later. We use the symbol C for a generic positive constant, independent of ε, which may take different values at different places

Smoothness classes
Lower bounds for the risk
Minimax upper bounds
Simulations
Proof of the lower bounds for the risk
Proofs of supplementary lemmas
Proof of upper bounds for the risk
Proofs of the statements in Section 5
Proofs of the statements in Section 6

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.