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:1911.00554

Help | Advanced Search

Statistics > Methodology

arXiv:1911.00554 (stat)
[Submitted on 1 Nov 2019 (v1) , last revised 12 Feb 2020 (this version, v2)]

Title: Penalized robust estimators in logistic regression with applications to sparse models

Title: 带惩罚的鲁棒估计量在逻辑回归中的应用:稀疏模型

Authors:Ana M. Bianco, Graciela Boente, Gonzalo Chebi
Abstract: Sparse covariates are frequent in classification and regression problems and in these settings the task of variable selection is usually of interest. As it is well known, sparse statistical models correspond to situations where there are only a small number of non--zero parameters and for that reason, they are much easier to interpret than dense ones. In this paper, we focus on the logistic regression model and our aim is to address robust and penalized estimation for the regression parameter. We introduce a family of penalized weighted $M-$type estimators for the logistic regression parameter that are stable against atypical data. We explore different penalizations functions and we introduce the so--called Sign penalization. This new penalty has the advantage that it depends only on one penalty parameter, avoiding arbitrary tuning constants. We discuss the variable selection capability of the given proposals as well as their asymptotic behaviour. Through a numerical study, we compare the finite sample performance of the proposal corresponding to different penalized estimators either robust or classical, under different scenarios. A robust cross--validation criterion is also presented. The analysis of two real data sets enables to investigate the stability of the penalized estimators to the presence of outliers.
Abstract: 稀疏协变量在分类和回归问题中很常见,在这些情况下,变量选择通常是一个重要的任务。 众所周知,稀疏统计模型对应于只有少量非零参数的情况,因此它们比密集模型更容易解释。 本文聚焦于逻辑回归模型,并旨在解决回归参数的稳健性和惩罚性估计问题。 我们引入了一类针对逻辑回归参数的惩罚加权$M-$型估计量,这些估计量能够抵抗异常数据的影响。 我们探讨了不同的惩罚函数,并提出了所谓的“Sign惩罚”。 这种新惩罚的优势在于它仅依赖一个惩罚参数,避免了任意调整常数。 我们讨论了所提出方法的变量选择能力及其渐近行为。 通过数值研究,我们在不同场景下比较了不同惩罚估计量(无论是稳健的还是经典的)在有限样本下的性能。 此外,还提出了一个稳健的交叉验证准则。 通过对两个真实数据集的分析,可以研究惩罚估计量对异常值存在的稳定性。
Subjects: Methodology (stat.ME)
Cite as: arXiv:1911.00554 [stat.ME]
  (or arXiv:1911.00554v2 [stat.ME] for this version)
  https://doi.org/10.48550/arXiv.1911.00554
arXiv-issued DOI via DataCite

Submission history

From: Graciela Boente Prof. [view email]
[v1] Fri, 1 Nov 2019 18:58:42 UTC (248 KB)
[v2] Wed, 12 Feb 2020 23:37:32 UTC (240 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
stat.ME
< prev   |   next >
new | recent | 2019-11
Change to browse by:
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号