Signals 4 · free daily AI digest

On the SoS Certifiability of Log-Concave Distributions

Paper recorded by Signals 4 on 2026-09-24 in cs.LG. Abstract reproduced from arXiv; link to the original below.

Published 2026-09-24 on arXiv · recorded by Signals 4 on 2026-09-25

Category: cs.LG · 机器学习 · first seen 2026-09-25

Abstract

For an arbitrary isotropic log-concave distribution $P$ on $\mathbb{R}^d$, we prove that the polynomial $(Cm)^m\|v\|_2^m - \mathbb{E}_{X\sim P}\langle X,v\rangle^m$ is a sum of squares for every even $m\ge2$, where $C>0$ is a universal constant. This removes the dependence on the Poincaré constant in the theorem of Kothari and Steinhardt (arXiv:1711.07465), recovering the optimal moment bounds for

Read on arXiv →

#13 most recent of 293 cs.LG papers we have recorded · ↑ newer: Orbital Error Dynamics: Self-Organized Criticality, Ephemeral Paramete · ↓ older: MQSS-Selector: RL-Guided Pass Selection for an MLIR Compilation Pipeli
Cite this page: On the SoS Certifiability of Log-Concave Distributions: the #13 most recent of 293 cs.LG papers we have recorded (as of 2026-09-24). Source: Signals 4 (Signals API) — https://data.jiangzhang.ca/signals4/t/papers/on-the-sos-certifiability-of-log-concave-distributions.html
Free to quote with attribution to “Signals 4 (Signals API)”. Machine-readable: papers.json
Related: More cs.LG papers · arXiv signals · All papers · Today in AI
Get 4 AI signals a day by email — free.
Subscribe free → See all plans →
Get 4 AI signals a day by email — free
All models · All repos · By company · Daily editions