University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Widths of convex sets and the power of adaption and randomization

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

Widths of convex sets and the power of adaption and randomization

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

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

DREW01 - Multivariate approximation, discretization, and sampling recovery

We present bounds between different widths of convex subsets of Banach spaces, including Gelfand, Kolmogorov and Bernstein widths.Using this, and some relations between widths and minimal errors, we obtain bounds on the maximal gain of adaptive and randomizedalgorithms over non-adaptive, deterministic ones for approximating linear operators on convex sets.  We conclude with an overview of the new state of the art and a list of open problems.   

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.

Other lists

engineering structure seminar Future Debates Sir David Khalili's 'The Art of Peace' Lecture

Other talks

Cambridge Reading Group on Reproduction Modern Multi-Level Partitioning for Block-Based IC Design and Machine Learning Registration and morning coffee Riemann-Hilbert Approach to the Elastodynamic Equation. Quarter Plane. Connection formulae between the Rayleigh waves along vertical and horizontal parts of the border. The Fredholm Factorization Method Directly Applied to Generalized Wiener-Hopf Equations Building closed ideals in L(L_1) using discretization
 

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