Login / Signup
Bounding the error of discretized Langevin algorithms for non-strongly log-concave targets.
Arnak S. Dalalyan
Lionel Riou-Durand
Avetik G. Karagulyan
Published in:
CoRR (2019)
Keyphrases
</>
learning algorithm
significant improvement
data structure
theoretical analysis
recently developed
computational cost
optimization problems
computationally efficient
benchmark datasets
error bounds
data sets
information systems
data streams
simulated annealing
error rate
orders of magnitude