Skip to main content Accessibility help
×
Hostname: page-component-7479d7b7d-jwnkl Total loading time: 0 Render date: 2024-07-12T10:32:33.241Z Has data issue: false hasContentIssue false

18 - Exponential manifold by reproducing kernel Hilbert spaces

from Part III - Information geometry

Published online by Cambridge University Press:  27 May 2010

Paolo Gibilisco
Affiliation:
Università degli Studi di Roma 'Tor Vergata'
Eva Riccomagno
Affiliation:
Università degli Studi di Genova
Maria Piera Rogantin
Affiliation:
Università degli Studi di Genova
Henry P. Wynn
Affiliation:
London School of Economics and Political Science
Get access

Summary

Abstract

The purpose of this chapter is to propose a method of constructing exponential families of Hilbert manifolds, on which estimation theory can be built. Although there have been works on infinite-dimensional exponential families of Banach manifolds (Pistone and Sempi 1995, Gibilisco and Pistone 1998, Pistone and Rogantin 1999), they are not appropriate for discussing statistical estimation with a finite sample; the likelihood function with a finite sample is not realised as a continuous function on the manifold.

The proposed exponential manifold uses a reproducing kernel Hilbert space (RKHS) as a functional space in the construction. A RKHS is defined as a Hilbert space of functions such that evaluation of a function at an arbitrary point is a continuous functional on the Hilbert space. Since evaluation of the likelihood function is necessary for the estimation theory, it is very natural to use a manifold associated with a RKHS. Such a manifold can be either finite or infinite dimensional depending of the choice of RKHS.

This chapter focuses on the maximum likelihood estimation (MLE) with the exponential manifold associated with a RKHS. As in many non-parametric estimation methods, straightforward extension of MLE to an infinite-dimensional exponential manifold can be an ill-posed problem; the estimator is chosen from the infinitedimensional space, while only a finite number of constraints is given by the sample. To solve this problem, a pseudo-maximum likelihood method is proposed by restricting the infinite-dimensional manifold to a series of finite-dimensional sub-manifolds, which enlarge as the sample size increases. Some asymptotic results in the limit of infinite sample are shown, including the consistency of the pseudo-MLE.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×