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 > math > arXiv:2504.10171

Help | Advanced Search

Mathematics > Statistics Theory

arXiv:2504.10171 (math)
[Submitted on 14 Apr 2025 ]

Title: Kullback-Leibler excess risk bounds for exponential weighted aggregation in Generalized linear models

Title: 广义线性模型中指数加权聚合的Kullback-Leibler超额风险界

Authors:The Tien Mai
Abstract: Aggregation methods have emerged as a powerful and flexible framework in statistical learning, providing unified solutions across diverse problems such as regression, classification, and density estimation. In the context of generalized linear models (GLMs), where responses follow exponential family distributions, aggregation offers an attractive alternative to classical parametric modeling. This paper investigates the problem of sparse aggregation in GLMs, aiming to approximate the true parameter vector by a sparse linear combination of predictors. We prove that an exponential weighted aggregation scheme yields a sharp oracle inequality for the Kullback-Leibler risk with leading constant equal to one, while also attaining the minimax-optimal rate of aggregation. These results are further enhanced by establishing high-probability bounds on the excess risk.
Abstract: 聚合方法作为统计学习中一种强大且灵活的框架应运而生,在回归、分类和密度估计等多种问题中提供统一的解决方案。 在广义线性模型(GLMs)的背景下,其中响应变量服从指数族分布,聚合提供了一种有吸引力的经典参数化建模的替代方案。 本文研究了GLMs中稀疏聚合的问题,旨在通过预测变量的稀疏线性组合来逼近真实的参数向量。 我们证明了一个指数加权聚合方案对于Kullback-Leibler风险给出了一个尖锐的oracle不等式,其主要常数等于一,同时达到了聚合的minimax最优速率。 这些结果进一步通过建立超额风险的高概率界得到增强。
Subjects: Statistics Theory (math.ST) ; Machine Learning (stat.ML)
Cite as: arXiv:2504.10171 [math.ST]
  (or arXiv:2504.10171v1 [math.ST] for this version)
  https://doi.org/10.48550/arXiv.2504.10171
arXiv-issued DOI via DataCite

Submission history

From: The Tien Mai [view email]
[v1] Mon, 14 Apr 2025 12:25:11 UTC (45 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
stat.ML
< prev   |   next >
new | recent | 2025-04
Change to browse by:
math
math.ST
stat
stat.TH

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号