The log-linear group-lasso estimator and its asymptotic properties

From MaRDI portal
Publication:442085

DOI10.3150/11-BEJ364zbMATH Open1243.62107arXiv0709.3526MaRDI QIDQ442085FDOQ442085


Authors: Yuval Nardi, Alessandro Rinaldo Edit this on Wikidata


Publication date: 9 August 2012

Published in: Bernoulli (Search for Journal in Brave)

Abstract: We define the group-lasso estimator for the natural parameters of the exponential families of distributions representing hierarchical log-linear models under multinomial sampling scheme. Such estimator arises as the solution of a convex penalized likelihood optimization problem based on the group-lasso penalty. We illustrate how it is possible to construct an estimator of the underlying log-linear model using the blocks of nonzero coefficients recovered by the group-lasso procedure. We investigate the asymptotic properties of the group-lasso estimator as a model selection method in a double-asymptotic framework, in which both the sample size and the model complexity grow simultaneously. We provide conditions guaranteeing that the group-lasso estimator is model selection consistent, in the sense that, with overwhelming probability as the sample size increases, it correctly identifies all the sets of nonzero interactions among the variables. Provided the sequences of true underlying models is sparse enough, recovery is possible even if the number of cells grows larger than the sample size. Finally, we derive some central limit type of results for the log-linear group-lasso estimator.


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




Recommendations




Cites Work


Cited In (14)

Uses Software





This page was built for publication: The log-linear group-lasso estimator and its asymptotic properties

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