Sampling from a log-concave distribution with projected Langevin Monte Carlo (Q1650786)

From MaRDI portal
Revision as of 15:17, 21 October 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q130021959, #quickstatements; #temporary_batch_1729520221944)
scientific article
Language Label Description Also known as
English
Sampling from a log-concave distribution with projected Langevin Monte Carlo
scientific article

    Statements

    Sampling from a log-concave distribution with projected Langevin Monte Carlo (English)
    0 references
    0 references
    0 references
    0 references
    13 July 2018
    0 references
    The authors establish a bound on the number of steps required for the Projected Langevin Monte Carlo to attain a small total variation distance to the target measure. The properties of reflected Brownian is used to obtain a total variation bound from the Wasserstein bound. The arguments are generalized to an arbitrary smooth potential. Some preliminary experimental comparison between Langevin Monte Carlo and hit-and-run is presented.
    0 references
    Langevin Monte Carlo
    0 references
    sampling and optimization
    0 references
    log-concave measures
    0 references
    rapidly-mixing random walks
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references