University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Bohnenblust--Hille inequalities and low-degree learning

Bohnenblust--Hille inequalities and low-degree learning

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact nobody.

QIAW02 - New trends at the intersection of quantum information theory, quantum groups and operator algebras

A fundamental problem from computational learning theory is to efficiently reconstruct an unknown Boolean function. One classical result of this problem for the random query model is the low-degree algorithm of Linial, Mansour, and Nisan in 1993. This method saw exponential improvement in 2022 by Eskenazis and Ivanisvili via a family of dimension-free polynomial inequalities named after Bohnenblust and Hille dating back to Littlewood’s work in 1930. In this talk, I will review the recent progress along this line of research on discrete quantum systems, and discuss parallel advances in classical harmonic analysis. This is based on joint work with Alexander Volberg and Joseph Slote.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity