Aggregation for Linear Inverse Problems
type: Dataset
description: In the framework of inverse problems, we consider the question of aggregating estimators taken from a given collection. Extending usual results for the direct case, we propose a new penalty to achieve the best aggregation. An oracle inequality provides the asymptotic behavior of this estimator. We investigate here the price for considering indirect observations.
issued: 2026-05-05T10:33:26.340045
language: en
modified: 2026-05-05T10:33:26.340051
contact point: Organization
  fn: CCSD
keyword: aggregation
keyword: infoeu-reposemanticspreprint
keyword: inverse-problem
keyword: lasso
keyword: mathmath-stmathematics-mathstatistics-mathst
keyword: preprints-working-papers-
keyword: statthstatistics-statstatistics-theory-statth
landing page: https://hal.science/hal-00994717

Aggregation for Linear Inverse Problems
type: Distribution
format: HTML
issued: 2026-05-05T10:33:26.348089
modified: 2026-05-05T10:33:26.321074
access URL: https://hal.science/hal-00994717

test_moissonnage_selune
type: Agent