Adaptive Lasso, Transfer Lasso, and Beyond: An Asymptotic Perspective

TL;DR

This paper analyzes the asymptotic properties of Adaptive Lasso and Transfer Lasso, revealing their differences, and introduces a new method combining their strengths, validated through theory and simulations.

Contribution

It provides a theoretical comparison of Adaptive Lasso and Transfer Lasso and proposes a novel method that integrates their advantages.

Findings

Transfer Lasso reduces non-asymptotic estimation errors.

Adaptive Lasso achieves variable selection consistency.

The new method outperforms individual methods in simulations.

Abstract

This paper presents a comprehensive exploration of the theoretical properties inherent in the Adaptive Lasso and the Transfer Lasso. The Adaptive Lasso, a well-established method, employs regularization divided by initial estimators and is characterized by asymptotic normality and variable selection consistency. In contrast, the recently proposed Transfer Lasso employs regularization subtracted by initial estimators with the demonstrated capacity to curtail non-asymptotic estimation errors. A pivotal question thus emerges: Given the distinct ways the Adaptive Lasso and the Transfer Lasso employ initial estimators, what benefits or drawbacks does this disparity confer upon each method? This paper conducts a theoretical examination of the asymptotic properties of the Transfer Lasso, thereby elucidating its differentiation from the Adaptive Lasso. Informed by the findings of this analysis, we introduce a novel method, one that amalgamates the strengths and compensates for the weaknesses of both methods. The paper concludes with validations of our theory and comparisons of the methods via simulation experiments.