Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > stat > arXiv:2409.01911

Help | Advanced Search

Statistics > Methodology

arXiv:2409.01911 (stat)
[Submitted on 3 Sep 2024 (v1) , last revised 13 Nov 2024 (this version, v2)]

Title: Variable selection in convex nonparametric least squares via structured Lasso: An application to the Swedish electricity distribution networks

Title: 通过结构化Lasso的凸非参数最小二乘变量选择:对瑞典电力配电网络的应用

Authors:Zhiqiang Liao
Abstract: We study the problem of variable selection in convex nonparametric least squares (CNLS). Whereas the least absolute shrinkage and selection operator (Lasso) is a popular technique for least squares, its variable selection performance is unknown in CNLS problems. In this work, we investigate the performance of the Lasso estimator and find out it is usually unable to select variables efficiently. Exploiting the unique structure of the subgradients in CNLS, we develop a structured Lasso method by combining $\ell_1$-norm and $\ell_{\infty}$-norm. The relaxed version of the structured Lasso is proposed for achieving model sparsity and predictive performance simultaneously, where we can control the two effects--variable selection and model shrinkage--using separate tuning parameters. A Monte Carlo study is implemented to verify the finite sample performance of the proposed approaches. We also use real data from Swedish electricity distribution networks to illustrate the effects of the proposed variable selection techniques. The results from the simulation and application confirm that the proposed structured Lasso performs favorably, generally leading to sparser and more accurate predictive models, relative to the conventional Lasso methods in the literature.
Abstract: 我们研究凸非参数最小二乘(CNLS)中的变量选择问题。 尽管最小绝对收缩和选择算子(Lasso)是一种流行的最小二乘技术,但其在CNLS问题中的变量选择性能尚不清楚。 在本工作中,我们研究了Lasso估计量的性能,并发现它通常无法有效地选择变量。 利用CNLS中次梯度的独特结构,我们通过结合$\ell_1$-范数和$\ell_{\infty}$-范数开发了一种结构化Lasso方法。 提出了结构化Lasso的放松版本,以同时实现模型稀疏性和预测性能,其中我们可以使用单独的调参来控制两个效应——变量选择和模型收缩。 实施了蒙特卡洛研究以验证所提出方法的有限样本性能。 我们还使用来自瑞典电力配电网络的真实数据来说明所提出的变量选择技术的效果。 模拟和应用的结果表明,所提出的结构化Lasso表现良好,通常相对于文献中的传统Lasso方法,能够生成更稀疏和更准确的预测模型。
Subjects: Methodology (stat.ME) ; Econometrics (econ.EM)
Cite as: arXiv:2409.01911 [stat.ME]
  (or arXiv:2409.01911v2 [stat.ME] for this version)
  https://doi.org/10.48550/arXiv.2409.01911
arXiv-issued DOI via DataCite

Submission history

From: Zhiqiang Liao [view email]
[v1] Tue, 3 Sep 2024 14:01:32 UTC (267 KB)
[v2] Wed, 13 Nov 2024 15:25:10 UTC (269 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
view license
Current browse context:
stat.ME
< prev   |   next >
new | recent | 2024-09
Change to browse by:
econ
econ.EM
stat

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号