中文
相关论文

相关论文: Easier Estimation of Extremes under Randomized Res…

200 篇论文

Many applications involve estimation of a signal matrix from a noisy data matrix. In such cases, it has been observed that estimators that shrink or truncate the singular values of the data matrix perform well when the signal matrix has…

统计方法学 · 统计学 2018-06-20 David Gerard , Peter Hoff

We study the distribution of maxima (Extreme Value Statistics) for sequences of observables computed along orbits generated by random transformations. The underlying, deterministic, dynamical system can be regular or chaotic. In the former…

Loss tomography has been studied for more than 10 years and a number of estimators have been proposed. The estimators can be divided into two classes: maximum likelihood and non-maximum likelihood. The maximum likelihood estimators rely on…

网络与互联网体系结构 · 计算机科学 2012-10-03 Weiping Zhu

Approximate model counting for bit-vector SMT formulas (generalizing \#SAT) has many applications such as probabilistic inference and quantitative information-flow security, but it is computationally difficult. Adding random parity…

密码学与安全 · 计算机科学 2017-12-22 Seonmo Kim , Stephen McCamant

A central result in statistical theory is Pinsker's theorem, which characterizes the minimax rate in the normal means model of nonparametric estimation. In this paper, we present an extension to Pinsker's theorem where estimation is carried…

统计理论 · 数学 2014-09-25 Yuancheng Zhu , John Lafferty

This work theoretically studies the problem of estimating a structured high-dimensional signal $x_0 \in \mathbb{R}^n$ from noisy $1$-bit Gaussian measurements. Our recovery approach is based on a simple convex program which uses the hinge…

统计理论 · 数学 2020-06-02 Martin Genzel , Alexander Stollenwerk

This paper deals with the robust estimation problem of a signal given noisy observations. We assume that the actual statistics of the signal and observations belong to a ball about the nominal statistics. This ball is formed by placing a…

最优化与控制 · 数学 2017-05-02 Mattia Zorzi

We investigate the approximation for computing the sum $a_1+...+a_n$ with an input of a list of nonnegative elements $a_1,..., a_n$. If all elements are in the range $[0,1]$, there is a randomized algorithm that can compute an…

数据结构与算法 · 计算机科学 2012-03-01 Bin Fu , Wenfeng Li , Zhiyong Peng

We develop a methodology for conducting inference on extreme quantiles of unobserved individual heterogeneity (e.g., heterogeneous coefficients, treatment effects) in panel data and meta-analysis settings. Inference is challenging in such…

计量经济学 · 经济学 2026-02-04 Vladislav Morozov

Maximum likelihood estimators are often of limited practical use due to the intensive computation they require. We propose a family of alternative estimators that maximize a stochastic variation of the composite likelihood function. Each of…

机器学习 · 计算机科学 2010-03-04 Joshua V Dillon , Guy Lebanon

We develop a probabilistic method for assessing the tail behavior and geometric stability of one-dimensional n i.i.d. samples by tracking how their span contracts when the most extreme points are trimmed. Central to our approach is the…

机器学习 · 统计学 2025-09-03 Erwan Dereure , Emmanuel Akame Mfoumou , David Holcman

We formulate the notion of minimax estimation under storage or communication constraints, and prove an extension to Pinsker's theorem for nonparametric estimation over Sobolev ellipsoids. Placing limits on the number of bits used to encode…

统计理论 · 数学 2017-04-13 Yuancheng Zhu , John Lafferty

We propose a new method to estimate a root-directed spanning tree from extreme data. A prominent example is a river network, to be discovered from extreme flow measured at a set of stations. Our new algorithm utilizes qualitative aspects of…

机器学习 · 统计学 2023-12-29 Ngoc Mai Tran , Johannes Buck , Claudia Klüppelberg

We study a problem related to coin flipping, coding theory, and noise sensitivity. Consider a source of truly random bits $x \in \bits^n$, and $k$ parties, who have noisy versions of the source bits $y^i \in \bits^n$, where for all $i$ and…

概率论 · 数学 2007-05-23 Elchanan Mossel , Ryan O'Donnell

We study the problem of approximately recovering signals on a manifold from one-bit linear measurements drawn from either a Gaussian ensemble, partial circulant ensemble, or bounded orthonormal ensemble and quantized using Sigma-Delta or…

信息论 · 计算机科学 2019-04-25 Mark Iwen , Eric Lybrand , Aaron Nelson , Rayan Saab

A novel and comprehensive methodology designed to tackle the challenges posed by extreme values in the context of random censorship is introduced. The main focus is on the analysis of integrals based on the product-limit estimator of…

统计理论 · 数学 2025-02-18 Martin Bladt , Igor Rodionov

We consider a binary sequence generated by thresholding a hidden continuous sequence. The hidden variables are assumed to have a compound symmetry covariance structure with a single parameter characterizing the common correlation. We study…

统计理论 · 数学 2019-09-04 Haolei Weng , Yang Feng

We introduce a trimmed version of the Hill estimator for the index of a heavy-tailed distribution, which is robust to perturbations in the extreme order statistics. In the ideal Pareto setting, the estimator is essentially finite-sample…

统计方法学 · 统计学 2017-11-15 Shrijita Bhattacharya , Michael Kallitsis , Stilian Stoev

Statistical analysis of max-stable processes used to model spatial extremes has been limited by the difficulty in calculating the joint likelihood function. This precludes all standard likelihood-based approaches, including Bayesian…

统计计算 · 统计学 2011-12-14 Robert J. Erhardt , Richard L. Smith

We study tail estimation in Pareto-like settings for datasets with a high percentage of randomly right-censored data, and where some expert information on the tail index is available for the censored observations. This setting arises for…

应用统计 · 统计学 2019-11-13 Martin Bladt , Hansjoerg Albrecher , Jan Beirlant