University of Cambridge > > Probability Theory and Statistics in High and Infinite Dimensions > Sequential complexities and uniform martingale LLN

Sequential complexities and uniform martingale LLN

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

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

Uniform laws of large numbers play a key role in statistics and learning theory. In this talk, we describe martingale analogues of the uniform laws and introduce new notions of ``sequential complexities’’. Extending the symmetrization technique to sequences of dependent random variables leads us to a notion of a tree. We then introduce a definition of a tree covering number, extend the chaining analysis, introduce an analogue of the VC dimension, and prove a counterpart to the classical combinatorial result of Vapnik-Chervonenkis-Sauer-Shelah. Our definitions and results can be seen as non-i.i.d. extensions of some of the key notions in empirical process theory.

This talk is part of the Probability Theory and Statistics in High and Infinite Dimensions series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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