HyperAIHyperAI

Command Palette

Search for a command to run...

Concentration inequalities for log-concave sequences

Arnaud Marsiglietti James Melbourne

Abstract

We investigate quantitative implications of the notion of log-concavity through a probabilistic interpretation. In particular, we derive concentration inequalities, moment and entropy bounds for random variables satisfying a precise degree of log-concavity. Along the way, we recover, improve, and simplify several results existing in the literature. Our approach is based on majorization in the convex order.


Build AI with AI

From idea to launch — accelerate your AI development with free AI co-coding, out-of-the-box environment and best price of GPUs.

AI Co-coding
Ready-to-use GPUs
Best Pricing

HyperAI Newsletters

Subscribe to our latest updates
We will deliver the latest updates of the week to your inbox at nine o'clock every Monday morning
Powered by MailChimp