An efficient algorithm for T-estimation

We introduce an efficient and exact algorithm, together with a faster but approximate version, which implements with a sub-quadratic complexity the hold-out derived from T-estimation. We study empirically the performance of this hold-out in the context of density estimation considering well-known competitors (hold-out derived from least-squares or Kullback-Leibler divergence, model selection procedures, etc.) and classical problems including histogram or bandwidth selection. Our algorithms are integrated in a companion R-package called Density.T.HoldOut available on the CRAN

Data and Resources

Additional Info

Field Value
Source https://hal.science/hal-00986229
Author Magalhães, Nelo, Rozenholc, Yves
Maintainer CCSD
Last Updated May 5, 2026, 12:23 (UTC)
Created May 5, 2026, 12:23 (UTC)
Identifier hal-00986229
Language en
Rights https://about.hal.science/hal-authorisation-v1/
contributor Model selection in statistical learning (SELECT) ; Laboratoire de Mathématiques d'Orsay (LMO) ; Université Paris-Sud - Paris 11 (UP11)-Centre National de la Recherche Scientifique (CNRS)-Université Paris-Sud - Paris 11 (UP11)-Centre National de la Recherche Scientifique (CNRS)-Centre Inria de Saclay ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
creator Magalhães, Nelo
date 2014-04-05T00:00:00
harvest_object_id a074e27c-e708-4877-971f-5812c2ec6e1e
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2025-02-26T00:00:00
set_spec type:UNDEFINED