IDEAS home Printed from
MyIDEAS: Log in (now much improved!) to save this paper

Continuously updated extremum estimators

Listed author(s):
  • PATILEA, Valentin

    (Institut de Statistique, Université catholique de Louvain, Louvain-la-Neuve, Belgium)

  • RENAULT, Eric

    (GREMAQ-IDEI, Université de Toulouse I and Institut Universitaire de France)

An important class of structural econometric models (nonlinear rational expectations, option pricing, auction models, ...) characterize observable variables as highly nonlinear transforma- tions of some latent variables. These transformations are one-to-one, but they depend on the unknown distribution of the latent variables through the equilibrium of the game and/or the learning process. Therefore numerical complexity of the equilibrium definition generates sub- stantial obstacles for the direct implementation of maximum likelihood inference. This is a particular case of argmax estimators based on a untractable sample based criterion Q[exp.T][thêta,lambda(thêta)] contaminated by the occurences of [thêta] in a ‘nuisance function’ [lambda(thêta)] to which corresponds a simple criterion Q[exp.T][thêta,lambda(thêta.exp0)] with [thêta.exp.0] the true, unknown value of the parameter. The natural idea is to replace the unknown value [lambda(thêta.exp0)] by some ’good proxy’, say [lambda(thêta.exp1)], to maximize Q[exp.T][thêta,lambda(thêta.exp1)] with respect to [thêta] and to get a new, updated estimate which, in turn, can be used for approxi- mating [lambda(thêta.exp0)],... Such steps can be considered for a fixed sample size (iterative M-estimators), or each time new data arrive (recursive estimators). In this paper we present and analyze several iterative and recursive (Robbins-Monro type) estimation procedures of this kind which, at the end, are applied to the class of structural econometric models which motivated this work.

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL:
Download Restriction: no

Paper provided by Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) in its series CORE Discussion Papers with number 1997076.

in new window

Date of creation: 01 Oct 1997
Handle: RePEc:cor:louvco:1997076
Contact details of provider: Postal:
Voie du Roman Pays 34, 1348 Louvain-la-Neuve (Belgium)

Phone: 32(10)474321
Fax: +32 10474304
Web page:

More information through EDIRC

No references listed on IDEAS
You can help add them by filling out this form.

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

When requesting a correction, please mention this item's handle: RePEc:cor:louvco:1997076. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Alain GILLIS)

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.

This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.