ℓ_∞ Vector Contraction for Rademacher Complexity

11/15/2019
by   Dylan J. Foster, et al.
15

We show that the Rademacher complexity of any R^K-valued function class composed with an ℓ_∞-Lipschitz function is bounded by the maximum Rademacher complexity of the restriction of the function class along each coordinate, times a factor of Õ(√(K)).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/01/2016

A vector-contraction inequality for Rademacher complexities

The contraction inequality for Rademacher averages is extended to Lipsch...
research
07/29/2023

Restricted Holant Dichotomy on Domains 3 and 4

Holant^*(f) denotes a class of counting problems specified by a constrai...
research
12/20/2019

A vector-contraction inequality for Rademacher complexities using p-stable variables

Andreas Maurer in the paper "A vector-contraction inequality for Rademac...
research
04/20/2018

The Indentifiable Elicitation Complexity of the Mode is Infinite

A property is a real- or vector-valued function on a set of probability ...
research
04/20/2018

The Identifiable Elicitation Complexity of the Mode is Infinite

A property is a real- or vector-valued function on a set of probability ...
research
04/07/2013

Image Compression predicated on Recurrent Iterated Function Systems

Recurrent iterated function systems (RIFSs) are improvements of iterated...
research
12/15/2021

LTB curves with Lipschitz turn are par-regular

Preserving the topology during a digitization process is a requirement o...

Please sign up or login with your details

Forgot password? Click here to reset