# Robust estimation of the mean with bounded relative standard deviation

@article{Huber2018RobustEO,
title={Robust estimation of the mean with bounded relative standard deviation},
author={Mark Huber},
journal={arXiv: Computation},
year={2018}
}
• Mark Huber
• Published 2018
• Mathematics
• arXiv: Computation
• Many randomized approximation algorithms operate by giving a procedure for simulating a random variable $X$ which has mean $\mu$ equal to the target answer, and a relative standard deviation bounded above by a known constant $c$. Examples of this type of algorithm includes methods for approximating the number of satisfying assignments to 2-SAT or DNF, the volume of a convex body, and the partition function of a Gibbs distribution. Because the answer is usually exponentially large in the problem… CONTINUE READING

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 11 REFERENCES

## Approximation algorithms for the normalizing constant of Gibbs distributions

VIEW 1 EXCERPT

## Challenging the empirical mean and empirical variance: a deviation study

VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

## Monte-Carlo algorithms for enumeration and reliability problems

• Computer Science
• 24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
• 1983
VIEW 2 EXCERPTS

## Dimension-free PAC-Bayesian bounds for matrices, vectors, and linear least squares regression

• Mathematics
• 2017
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

## A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies

• Mathematics, Computer Science
• STOC
• 1989
VIEW 1 EXCERPT

## A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

VIEW 1 EXCERPT

• M. Huber

## Des valeurs moyennes

• P. Tchebichef
• Journal de Mathématique Pures et Appliquées 2(12), 177–184
• 1867
VIEW 1 EXCERPT

## On robust estimation of the location parameter

VIEW 2 EXCERPTS