A new sequential algorithm for L2-approximation and application to Monte-Carlo integration

We design a new stochastic algorithm (called SALT) that sequentially approximates a given function in L2 w.r.t. a probability measure, using a finite sample of the distribution. By increasing the sets of approximating functions and the simulation effort, we compute a L2-approximation with higher and higher accuracy. The simulation effort is tuned in a robust way that ensures the convergence under rather general conditions. Then, we apply SALT to build efficient control variates for accurate numerical integration. Examples and numerical experiments support the mathematical analysis.

Data and Resources

Additional Info

Field Value
Source https://hal.science/hal-00972016
Author Gobet, Emmanuel, Surana, Khushboo
Maintainer CCSD
Last Updated May 5, 2026, 17:25 (UTC)
Created May 5, 2026, 17:25 (UTC)
Identifier hal-00972016
Language en
Rights https://about.hal.science/hal-authorisation-v1/
contributor Centre de Mathématiques Appliquées de l'Ecole polytechnique (CMAP) ; Institut National de Recherche en Informatique et en Automatique (Inria)-École polytechnique (X) ; Institut Polytechnique de Paris (IP Paris)-Institut Polytechnique de Paris (IP Paris)-Centre National de la Recherche Scientifique (CNRS)
creator Gobet, Emmanuel
date 2014-04-03T00:00:00
harvest_object_id 30746d10-ea7f-4eb4-a0da-270a15eec7b6
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2025-09-04T00:00:00
set_spec type:REPORT