• Corpus ID: 18769287

Improving Monte Carlo randomized approximation schemes

@article{Huber2014ImprovingMC,
  title={Improving Monte Carlo randomized approximation schemes},
  author={Mark L. Huber},
  journal={ArXiv},
  year={2014},
  volume={abs/1411.4074}
}
  • M. Huber
  • Published 14 November 2014
  • Mathematics, Computer Science
  • ArXiv
Consider a central problem in randomized approximation schemes that use a Monte Carlo approach. Given a sequence of independent, identically distributed random variables $X_1,X_2,\ldots$ with mean $\mu$ and standard deviation at most $c \mu$, where $c$ is a known constant, and $\epsilon,\delta > 0$, create an estimate $\hat \mu$ for $\mu$ such that $\text{P}(|\hat \mu - \mu| > \epsilon \mu) \leq \delta$. This technique has been used for building randomized approximation schemes for the volume… 

Quantum speedup of Monte Carlo methods

  • A. Montanaro
  • Computer Science
    Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2015
A quantum algorithm which can accelerate Monte Carlo methods in a very general setting, achieving a near-quadratic speedup over the best possible classical algorithm.

References

SHOWING 1-10 OF 11 REFERENCES

Approximation algorithms for the normalizing constant of Gibbs distributions

  • M. Huber
  • Computer Science, Mathematics
  • 2015
This work presents a new method for approximating the partition function to a specified level of relative accuracy using only a number of samples, that is, $O(ln(Z(\beta))\ln(\ln( Z(\beta))))$ when $Z(0)\geq1$.

An optimal algorithm for Monte Carlo estimation

An approximation algorithm AA is described which, given /spl epsiv/ and /spl delta/, when running independent experiments with respect to any Z, produces an estimate that is within a factor 1+ of /spl mu/ with probability at least 1-/spl delta/.

Computing the volume of convex bodies : a case where randomness provably helps

  • M. Dyer
  • Computer Science, Mathematics
  • 1991
The problem of computing the volume of a convex body K in R is discussed and worst-case results are reviewed and randomised approximation algorithms which show that with randomisation one can approximate very nicely are provided.

A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries

A polynomial-time randomized algorithm for estimating the permanent of an arbitrary n × n matrix with nonnegative entries computes an approximation that is within arbitrarily small specified relative error of the true value of the permanent.

LIKELIHOOD-BASED INFERENCE FOR MAT´ ERN TYPE III RE- PULSIVE POINT PROCESSES

In a repulsive point process, points act as if they are repelling one another, leading to underdispersed configurations when compared to a standard Poisson point process. Such models are useful when

Likelihood-based inference for Matérn type-III repulsive point processes

In a repulsive point process, points act as if they are repelling one another, leading to underdispersed configurations when compared to a standard Poisson point process. Such models are useful when

Simulated annealing in convex bodies and an O*(n4) volume algorithm

Catalan Numbers with Applications

1. Bionomial Coefficients 2. The Central Binomial Coefficient 3. The Central Binomial Coefficient Revisited 4. Binomial Coeffiecients Revisited 5. Catalan Numbers 6. The Ubiquity of Catalan Numbers I

Approximating the Number of Linear Extensions

Probability: Theory and Examples, 4th Edition