Active-set based block coordinate descent algorithm in group LASSO for self-exciting threshold autoregressive model

Muhammad Jaffri Mohd Nasir (), Ramzan Nazim Khan (), Gopalan Nair () and Darfiana Nur ()
Additional contact information
Muhammad Jaffri Mohd Nasir: Universiti Malaysia Kelantan
Ramzan Nazim Khan: The University of Western Australia
Gopalan Nair: The University of Western Australia
Darfiana Nur: The University of Western Australia

Statistical Papers, 2024, vol. 65, issue 5, No 13, 2973-3006

Abstract: Abstract Group LASSO (gLASSO) estimator has been recently proposed to estimate thresholds for the self-exciting threshold autoregressive model, and a group least angle regression (gLAR) algorithm has been applied to obtain an approximate solution to the optimization problem. Although gLAR algorithm is computationally fast, it has been reported that the algorithm tends to estimate too many irrelevant thresholds along with the relevant ones. This paper develops an active-set based block coordinate descent (aBCD) algorithm as an exact optimization method for gLASSO to improve the performance of estimating relevant thresholds. Methods and strategy for choosing the appropriate values of shrinkage parameter for gLASSO are also discussed. To consistently estimate relevant thresholds from the threshold set obtained by the gLASSO, the backward elimination algorithm (BEA) is utilized. We evaluate numerical efficiency of the proposed algorithms, along with the Single-Line-Search (SLS) and the gLAR algorithms through simulated data and real data sets. Simulation studies show that the SLS and aBCD algorithms have similar performance in estimating thresholds although the latter method is much faster. In addition, the aBCD-BEA can sometimes outperform gLAR-BEA in terms of estimating the correct number of thresholds under certain conditions. The results from case studies have also shown that aBCD-BEA performs better in identifying important thresholds.

Keywords: Karush–Kuhn–Tucker; Group LASSO; SETAR; aBCD algorithm; BEA; Sparsity conditions (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s00362-023-01472-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:stpapr:v:65:y:2024:i:5:d:10.1007_s00362-023-01472-7

Ordering information: This journal article can be ordered from
http://www.springer. ... business/journal/362

DOI: 10.1007/s00362-023-01472-7

Access Statistics for this article

Statistical Papers is currently edited by C. Müller, W. Krämer and W.G. Müller

More articles in Statistical Papers from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().