On the power of adaption and randomization

Speaker(s)

Erich Novak

Affiliation

FSU Jena

Language of the talk

English

Date

May 29, 2025, 10:30 a.m.

Room

room 4070

Seminar

Seminar of Numerical Analysis Group

---

We present bounds between different widths of convex subsets of Banach spaces, including Gelfand and Bernstein widths, and discuss implications for the adaption problem. In particular, we obtain a bound on the maximal gain of adaptive and randomized algorithms over non-adaptive, deterministic ones for approximating linear operators on convex sets.
Joint work with David Krieg and Mario Ullrich.
 

---