Fetching the paper…
Reading the bibliography…
We prove that the Cram\'er transform of the uniform measure on a convex body in $\mathbb{R}^n$ is a $(1+o(1)) n$-self-concordant barrier, improving a seminal result of Nesterov and Nemirovski.
Convex set functions in d-space
C. Borell · 1975
Earlier work this paper cites.
Problem Complexity and Method Efficiency in Optimization
A. Nemirovski and D. Yudin · 1983
Earlier work this paper cites.
A new polynomial-time algorithm for linear programming
N. Karmarkar · 1984
Earlier work this paper cites.
Universal portfolios
T. M. Cover · 1991
Earlier work this paper cites.
Interior-point polynomial algorithms in convex programming
Y. Nesterov and A. Nemirovski · 1994
Earlier work this paper cites.
Barrier functions in interior point methods
O. Güler · 1996
Earlier work this paper cites.
The Concentration of Measure Phenomenon
M. Ledoux · 2001
Earlier work this paper cites.
The extreme points of subsets of s-concave probabilities and a geometric localization theorem
M. Fradelizi and O. Guédon · 2004
Earlier work this paper cites.
Interior point polynomial time methods in convex programming
A. Nemirovski · 2004
Earlier work this paper cites.
Introductory lectures on convex optimization: A basic course
Y. Nesterov · 2004
Cited alongside, same era.
Prediction, Learning, and Games
N. Cesa-Bianchi and G. Lugosi · 2006
Cited alongside, same era.
On convex perturbations with a bounded isotropic constant
B. Klartag · 2006
Cited alongside, same era.
The geometry of logconcave functions and sampling algorithms
L. Lovász and S. Vempala · 2007
Cited alongside, same era.
Competing in the dark: An efficient algorithm for bandit linear optimization
J. Abernethy, E. Hazan, and A. Rakhlin · 2008
Cited alongside, same era.
Graphical models, exponential families, and variational inference
M. J. Wainwright and M. I. Jordan · 2008
Cited alongside, same era.
Regret analysis of stochastic and nonstochastic multi-armed bandit problems
S. Bubeck and N. Cesa-Bianchi · 2012
Later among the works it cites.
Towards minimax policies for online linear optimization with bandit feedback
S. Bubeck, N. Cesa-Bianchi, and S.M. Kakade · 2012
Later among the works it cites.
Random walks on polytopes and an affine interior point method for linear programming
R. Kannan and H. Narayanan · 2012
Later among the works it cites.
Volumetric spanners: an efficient exploration basis for learning
E. Hazan, Z. Karnin, and R. Meka · 2014
Closest in time.
Canonical barriers on convex cones
R. Hildebrand · 2014
Closest in time.
Logarithmically-concave moment measures i
B. Klartag · 2014
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Approximately gaussian marginals and the hyperplane conjecture
R. Eldan and B. Klartag · 2011
Cited alongside, same era.
Centroid bodies and the logarithmic laplace transform – a unified approach
Boʼaz Klartag and Emanuel Milman · 2011
Cited alongside, same era.
Path-finding methods for linear programming : Solving linear programs in O ~ ( rank ) \widetilde{O}(\sqrt{\mathrm{rank}}) iterations and faster algorithms for maximum flow
Y. T. Lee and A. Sidford · 2014
Closest in time.
A schwarz lemma for kähler affine metrics and the canonical potential of a proper convex cone
D. Fox · 2015
Closest in time.