Pages that link to "Item:Q3437021"
From MaRDI portal
The following pages link to The geometry of logconcave functions and sampling algorithms (Q3437021):
Displaying 50 items.
- A multivariate Gnedenko law of large numbers (Q378786) (← links)
- The floating body and the hyperplane conjecture (Q420971) (← links)
- Computational results of an \(O^{\ast }(n^{4})\) volume algorithm (Q421722) (← links)
- Gibbs/Metropolis algorithms on a convex polytope (Q455635) (← links)
- Log-concavity and strong log-concavity: a review (Q485901) (← links)
- On randomized fictitious play for approximating saddle points over convex sets (Q747628) (← links)
- Dispersion of mass and the complexity of randomized geometric algorithms (Q947778) (← links)
- Projective re-normalization for improving the behavior of a homogeneous conic linear system (Q1016122) (← links)
- Rapid mixing of geodesic walks on manifolds with positive curvature (Q1617133) (← links)
- Sampling from a log-concave distribution with projected Langevin Monte Carlo (Q1650786) (← links)
- Exploratory distributions for convex functions (Q1737974) (← links)
- Concentration of the empirical level sets of Tukey's halfspace depth (Q1740596) (← links)
- Local continuity of log-concave projection, with applications to estimation under model misspecification (Q1983616) (← links)
- Stability of the Prékopa-Leindler inequality for log-concave functions (Q2039563) (← links)
- A lower-bound on monopoly profit for log-concave demand (Q2069972) (← links)
- Unadjusted Langevin algorithm for sampling a mixture of weakly smooth potentials (Q2083423) (← links)
- Concentration inequalities for log-concave distributions with applications to random surface fluctuations (Q2129697) (← links)
- Oracle lower bounds for stochastic gradient sampling algorithms (Q2137007) (← links)
- Stochastic zeroth-order discretizations of Langevin diffusions for Bayesian inference (Q2137043) (← links)
- Simulated annealing for convex optimization: rigorous complexity analysis and practical perspectives (Q2156386) (← links)
- On Condorelli inequality for log-concave demand (Q2158377) (← links)
- Anti-concentration of polynomials: dimension-free covariance bounds and decay of Fourier coefficients (Q2165541) (← links)
- Correction of AI systems by linear discriminants: probabilistic foundations (Q2200569) (← links)
- A remark on approximating permanents of positive definite matrices (Q2226442) (← links)
- Fast multivariate log-concave density estimation (Q2337320) (← links)
- Statistical active learning algorithms for noise tolerance and differential privacy (Q2345952) (← links)
- Thin shell implies spectral gap up to polylog via a stochastic localization scheme (Q2375769) (← links)
- On the computational complexity of MCMC-based estimators in large samples (Q2388988) (← links)
- Pointwise estimates for marginals of convex bodies (Q2426508) (← links)
- Error bounds for Metropolis-Hastings algorithms applied to perturbations of Gaussian measures in high dimensions (Q2443195) (← links)
- A central limit theorem for convex sets (Q2457766) (← links)
- On the symmetry function of a convex set (Q2467164) (← links)
- Hit-and-Run for Numerical Integration (Q2926241) (← links)
- The Core of the Participatory Budgeting Problem (Q2959845) (← links)
- On Sampling from Multivariate Distributions (Q3088131) (← links)
- Oracle Estimation of a Change Point in High-Dimensional Quantile Regression (Q4559700) (← links)
- Gaussian Cooling and $O^*(n^3)$ Algorithms for Volume and Gaussian Volume (Q4571932) (← links)
- The accessibility of convex bodies and derandomization of the hit and run algorithm (Q4604053) (← links)
- Comparison of hit-and-run, slice sampler and random walk Metropolis (Q4611278) (← links)
- (Q4637035) (← links)
- Ulam floating bodies (Q4973664) (← links)
- (Q5053192) (← links)
- Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization (Q5076724) (← links)
- (Q5090402) (← links)
- A Generalized Central Limit Conjecture for Convex Bodies (Q5115960) (← links)
- Two-Sided Estimates for Order Statistics of Log-Concave Random Vectors (Q5115962) (← links)
- Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation (Q5116548) (← links)
- A simplified proof of CLT for convex bodies (Q5146559) (← links)
- (Q5148946) (← links)
- Approximate Spectral Gaps for Markov Chain Mixing Times in High Dimensions (Q5154639) (← links)
