mlsanityData to 7 Oct 2026

The entropic barrier is n-self-concordant

arXiv 2112.10947 ↗First posted 21 Dec 2021math.MG cs.LG math.OCcited by 6

Not on the map. Why?

Abstract (arXiv)

For any convex body K subseteq mathbb Rn, S. Bubeck and R. Eldan introduced the entropic barrier on K and showed that it is a (1+o(1)) , n-self-concordant barrier. In this note, we observe that the optimal bound of n on the self-concordance parameter holds as a consequence of the dimensional Brascamp-Lieb inequality.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 3 of its 21 references that are in the map. First posted on arXiv 21 Dec 2021.

Builds on

3 of 21 references.

References · 3

  1. 2020Efficient constrained sampling via the mirror-Langevin algorithmcited by 55
  2. 2020Exponential ergodicity of mirror-Langevin diffusionscited by 37
  3. 2018Universal Barrier is n-Self-Concordantcited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 2; 2024: 1; 2025: 1; 2026: 1.

6 papers.

  1. 2023A Unified Analysis of Nonstochastic Delayed Feedback for Combinatorial Semi-Bandits, Linear Bandits, and MDPscited by 15
  2. 2023Algorithmic Aspects of the Log-Laplace Transform and a Non-Euclidean Proximal Samplercited by 9
  3. 2024Corruption-Robust Linear Bandits: Minimax Optimality and Gap-Dependent Misspecificationcited by 6
  4. 2026A unified complexity bound for logconcave samplingcited by 3
  5. 2022Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexitycited by 0
  6. 2025Self-Concordant Perturbations for Linear Banditscited by 0