Yifeng Chu and I just posted our paper on chaining-type bounds for expected soft maxima of Gaussian processes. The analysis makes use of a nice blend of ideas from probability, statistical physics of disordered systems, and information theory. arxiv.org/abs/2606.22611
Upper and Lower Bounds on Expected Soft Maxima of Gaussian Processes arxiv.org
AI Weekly's analysis
→
- The paper derives upper and lower bounds for soft maxima of centered Gaussian processes, defined as Gibbs averages at inverse temperature β > 0.
- The bounds retain the same multiscale structure as generic chaining expressions, with a truncation term governed by the inverse temperature β.
- As β → ∞, the bounds recover the majorizing measure theorem; applied to the Sherrington-Kirkpatrick model, they yield a finite-size Parisi formula.
Read full analysis →
View on Bluesky ·
♥ 10
↻ 2
↩ 0
·
2 from the directory shared this ·
55d ago
eg www.nytimes.com/2025/03/04/o...
nytimes.com
Video of the talk I gave at the Cultural AI conference at NYU back in March is finally up (thanks again to @leifw.bsky.social and @t-shoemaker.bsky.social for having arranged this excellent event). www.youtube.com/watch?v=iYu9...
Part 4 | Cultural AI: An Emerging Field youtube.com
View on Bluesky ·
♥ 22
↻ 3
↩ 0
·
2 from the directory shared this ·
71d ago
New essay by @lioneltrolling.bsky.social: “We need to have a robust public debate and understanding of just how and where we apply AI technology. Not “smash the machines” and not “let it rip” either. Is that likely to happen? Well, no, but that’s what should happen.”
unpopularfront.news