Chain rules for Rademacher complexity

Two preliminary estimates are obtained for expected suprema of Bernoulli processes indexed by an image of a bounded Euclidean subset through a class of Lipschitz functions. If that bounded subset is given by the projection of a bounded function class onto a sample vector, the result can be considered as a control over empirical Rademacher complexity of a composite function class. Such an estimate can be applied to learning problems where the hypotheses have composite structure or where more than one function is needed to determine the empirical loss.

Name thesis:degree_name

M.S.

Level thesis:degree_level

Thesis

Discipline thesis:degree_discipline

Electrical & Computer Engr

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2022

Author dc:creator

• Chu, Yifeng

Contributors dc:contributor

• Raginsky, Maxim

• Rademacher complexity
• Bernoulli process
• composite function class
• generic chaining

Statement dc:rights

• Copyright 2021 Yifeng Chu

Language dc:language

en

Handle dc:identifier

http://hdl.handle.net/2142/113226

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/113226