University of Cambridge > Talks.cam > Statistics > Information bounds for inverse problems with application to deconvolution and Lévy models

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Information bounds for inverse problems with application to deconvolution and Lévy models

Download to your calendar using vCal

If you have a question about this talk, please contact Quentin Berthet .

If a functional in a nonparametric inverse problem can be estimated with parametric rate, then the minimax rate gives no information about the ill-posedness of the problem. To have a more precise lower bound, we study semiparametric efficiency in the sense of Hájek–Le Cam for functional estimation in regular indirect models. These are characterized as models that can be locally approximated by a linear white noise model that is described by the generalized score operator. A convolution theorem for regular indirect models is proved. This applies to a large class of statistical inverse problems, which is illustrated for the prototypical white noise and deconvolution model. It is especially useful for nonlinear models. We discuss in detail a nonlinear model of deconvolution type where a Lévy process is observed at low frequency, concluding an information bound for the estimation of linear functionals of the jump measure.

This talk is part of the Statistics series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Walter's Room, Selwyn College State of Exception, Spaces of Terror: The Concentrationary Gothic and Whiteness as Spectral Terrorist LMS Invited Lectures 2011

Other talks

Machine Politics? Computers and AI in the History of Political Thought TBC Director's Welcome TBC The Magic of Magnetism Spectral theory for Dirac operators with singular potentials
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity