On the power of adaption and randomization

Prelegent(ci)

Erich Novak

Afiliacja

FSU Jena

Język referatu

angielski

Termin

29 maja 2025 10:30

Pokój

p. 4070

Seminarium

Seminarium Zakładu Analizy Numerycznej

---

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.
 

---