Mirror averaging with sparsity priors

DOI10.3150/11-BEJ361zbMATH Open1243.62008arXiv1003.1189MaRDI QIDQ442083

Author name not available (Why is that?)

Publication date: 9 August 2012

Published in: (Search for Journal in Brave)

Abstract: We consider the problem of aggregating the elements of a possibly infinite dictionary for building a decision procedure that aims at minimizing a given criterion. Along with the dictionary, an independent identically distributed training sample is available, on which the performance of a given procedure can be tested. In a fairly general set-up, we establish an oracle inequality for the Mirror Averaging aggregate with any prior distribution. By choosing an appropriate prior, we apply this oracle inequality in the context of prediction under sparsity assumption for the problems of regression with random design, density estimation and binary classification.

Full work available at URL: https://arxiv.org/abs/1003.1189

zbMATH Keywords

No records found.

Mathematics Subject Classification ID

No records found.

This page was built for publication: Mirror averaging with sparsity priors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442083)