Corpus ID: 88515621

An optimal $(\epsilon,\delta)$-approximation scheme for the mean of random variables with bounded relative variance

@article{Huber2017AnO,
  title={An optimal \$(\epsilon,\delta)\$-approximation scheme for the mean of random variables with bounded relative variance},
  author={Mark Huber},
  journal={arXiv: Computation},
  year={2017}
}
  • Mark Huber
  • Published 2017
  • Mathematics
  • arXiv: Computation
  • Randomized approximation algorithms for many #P-complete problems (such as the partition function of a Gibbs distribution, the volume of a convex body, the permanent of a $\{0,1\}$-matrix, and many others) reduce to creating random variables $X_1,X_2,\ldots$ with finite mean $\mu$ and standard deviation$\sigma$ such that $\mu$ is the solution for the problem input, and the relative standard deviation $|\sigma/\mu| \leq c$ for known $c$. Under these circumstances, it is known that the number of… CONTINUE READING

    Figures from this paper.

    References

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

    Loss Minimization and Parameter Estimation with Heavy Tails

    VIEW 2 EXCERPTS
    HIGHLY INFLUENTIAL

    Heavy-tailed regression with a generalized median-of-means

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    Faster random generation of linear extensions

    VIEW 1 EXCERPT

    Polynomial-Time Approximation Algorithms for the Ising Model

    VIEW 2 EXCERPTS

    Fast perfect sampling from linear extensions

    • Mark Huber
    • Computer Science, Mathematics
    • Discret. Math.
    • 2006
    VIEW 2 EXCERPTS

    Random Generation of Combinatorial Structures from a Uniform Distribution

    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL