paper-with-me

홈 › Papers

Tight relative estimation in the mean of Bernoulli random variables

2022-10-23 · Mark Huber

Given a stream of Bernoulli random variables, consider the problem of estimating the mean of the random variable within a specified relative error with a specified probability of failure. Until now, the Gamma Bernoulli Approximation Scheme (GBAS) was the method that accomplished this goal using the smallest number of average samples. In this work, a new method is introduced that is faster when the mean is bounded away from zero. The process uses a two-stage process together with some simple inequalities to get rigorous bounds on the error probability.

📄 PDF Abstract BibTeX arXiv:2210.12861

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Statistical Mean Estimation with Coded Relayed Observations

2025-05-14 · Yan Hao Ling, Zhouhao Yang, Jonathan Scarlett

We consider a problem of statistical mean estimation in which the samples are not observed directly, but are instead observed by a relay (``teacher'') that transmits information through a memoryless channel to the decode…

Decoder

Heavy Hitters and Bernoulli Convolutions

2019-05-22 · Alexander Kushkuley

A very simple event frequency approximation algorithm that is sensitive to event timeliness is suggested. The algorithm iteratively updates categorical click-distribution, producing (path of) a random walk on a standard …

Beyond Binomial and Negative Binomial: Adaptation in Bernoulli Parameter Estimation

2018-09-24 · Safa C. Medin, John Murray-Bruce, David Castañón, Vivek K Goyal

Estimating the parameter of a Bernoulli process arises in many applications, including photon-efficient active imaging where each illumination period is regarded as a single Bernoulli trial. Motivated by acquisition effi…

parameter estimation

Generalized Gumbel-Softmax Gradient Estimator for Generic Discrete Random Variables

2020-03-04 · Weonyoung Joo, Dongjun Kim, Seungjae Shin, Il-Chul Moon

Estimating the gradients of stochastic nodes in stochastic computational graphs is one of the crucial research questions in the deep generative modeling community, which enables the gradient descent optimization on neura…

Topic Models

An Efficient Labeled/Unlabeled Random Finite Set Algorithm for Multiobject Tracking

2021-09-11 · Thomas Kropfreiter, Florian Meyer, Franz Hlawatsch

We propose an efficient random finite set (RFS) based algorithm for multiobject tracking in which the object states are modeled by a combination of a labeled multi-Bernoulli (LMB) RFS and a Poisson RFS. The less computat…

Object