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.14555

Help | Advanced Search

Mathematics > Statistics Theory

arXiv:2504.14555 (math)
[Submitted on 20 Apr 2025 (v1) , last revised 23 Apr 2025 (this version, v2)]

Title: Nonparametric Estimation in Uniform Deconvolution and Interval Censoring

Title: 非参数估计在一致去卷积和区间审查中的应用

Authors:Piet Groeneboom, Geurt Jongbloed
Abstract: In the uniform deconvolution problem one is interested in estimating the distribution function $F_0$ of a nonnegative random variable, based on a sample with additive uniform noise. A peculiar and not well understood phenomenon of the nonparametric maximum likelihood estimator in this setting is the dichotomy between the situations where $F_0(1)=1$ and $F_0(1)<1$. If $F_0(1)=1$, the MLE can be computed in a straightforward way and its asymptotic pointwise behavior can be derived using the connection to the so-called current status problem. However, if $F_0(1)<1$, one needs an iterative procedure to compute it and the asymptotic pointwise behavior of the nonparametric maximum likelihood estimator is not known. In this paper we describe the problem, connect it to interval censoring problems and a more general model studied in Groeneboom (2024) to state two competing naturally occurring conjectures for the case $F_0(1)<1$. Asymptotic arguments related to smooth functional theory and extensive simulations lead us to to bet on one of these two conjectures.
Abstract: 在一致去卷积问题中,人们感兴趣的是估计一个非负随机变量的分布函数 $F_0$,基于带有均匀噪声的样本。 在这种设定下,非参数最大似然估计量的一个奇特且尚未被充分理解的现象是 $F_0(1)=1$ 和 $F_0(1)<1$ 这两种情况之间的二分现象。 如果 $F_0(1)=1$,最大似然估计(MLE)可以通过一种直接的方式计算,并且可以利用与所谓的当前状态问题的联系推导出其渐近点态行为。 然而,如果 $F_0(1)<1$,则需要迭代程序来计算它,并且非参数最大似然估计量的渐近点态行为尚不清楚。 在本文中,我们描述了这个问题,将其与区间删失问题以及Groeneboom(2024年)研究的更一般模型联系起来,针对 $F_0(1)<1$ 的情形提出了两个竞争性的自然出现的猜想。 基于渐近论据和平滑函数理论以及广泛的模拟,我们倾向于其中一个猜想。
Comments: 16 pages, 4 figures
Subjects: Statistics Theory (math.ST)
MSC classes: 62G05, 62N01
Cite as: arXiv:2504.14555 [math.ST]
  (or arXiv:2504.14555v2 [math.ST] for this version)
  https://doi.org/10.48550/arXiv.2504.14555
arXiv-issued DOI via DataCite

Submission history

From: Piet Groeneboom [view email]
[v1] Sun, 20 Apr 2025 10:03:08 UTC (214 KB)
[v2] Wed, 23 Apr 2025 19:26:29 UTC (224 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:
math.ST
< prev   |   next >
new | recent | 2025-04
Change to browse by:
math
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号