scientific article; zbMATH DE number 6860817

zbMath1442.60050arXiv1309.5977MaRDI QIDQ4637035

Hariharan Narayanan, Alexander Rakhlin

Publication date: 17 April 2018

Full work available at URL: https://arxiv.org/abs/1309.5977

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

truncated distributionslog-concave distribution

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Probability distributions: general theory (60E05) Learning and adaptive systems in artificial intelligence (68T05) Interior-point methods (90C51)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Randomized interior point methods for sampling and optimization
• Some things we've learned (about Markov chain Monte Carlo)
• An analog of the minimax theorem for vector payoffs
• Inference and modeling with log-concave distributions
• Ricci curvature of Markov chains on metric spaces
• The weighted majority algorithm
• Sampling from log-concave distributions
• Concentration inequalities using the entropy method
• Mirror descent and nonlinear projected subgradient methods for convex optimization.
• On the Riemannian geometry defined by self-concordant barriers and interior-point methods.
• Hit-and-run mixes fast
• Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
• Sequential Monte Carlo Methods in Practice
• Random Walks on Polytopes and an Affine Interior Point Method for Linear Programming
• The geometry of logconcave functions and sampling algorithms
• Interior-point methods for optimization
• The Markov chain Monte Carlo revolution
• Markov Chains and Stochastic Stability
• Random walks in a convex body and an improved volume algorithm
• A random polynomial-time algorithm for approximating the volume of convex bodies
• A sequential particle filter method for static models
• Model-Based Clustering, Discriminant Analysis, and Density Estimation
• Competitive On-line Statistics
• Adaptive Rejection Sampling for Gibbs Sampling
• Interior-Point Methods for Full-Information and Bandit Online Learning
• Simulated Annealing for Convex Optimization
• Prediction, Learning, and Games
• Relative loss bounds for on-line density estimation with the exponential family of distributions

This page was built for publication: