Eluder Dimension and Generalized Rank

04/14/2021
by   Gene Li, et al.
0

We study the relationship between the eluder dimension for a function class and a generalized notion of rank, defined for any monotone "activation" σ : ℝ→ℝ, which corresponds to the minimal dimension required to represent the class as a generalized linear model. When σ has derivatives bounded away from 0, it is known that σ-rank gives rise to an upper bound on eluder dimension for any function class; we show however that eluder dimension can be exponentially smaller than σ-rank. We also show that the condition on the derivative is necessary; namely, when σ is the relu activation, we show that eluder dimension can be exponentially larger than σ-rank.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/29/2022

Equivalences among Z_p^s-linear Generalized Hadamard Codes

The _p^s-additive codes of length n are subgroups of _p^s^n, and can be ...
research
01/19/2022

Quasi optimal anticodes: structure and invariants

It is well-known that the dimension of optimal anticodes in the rank-met...
research
07/26/2022

Rank and pairs of Rank and Dimension of Kernel of ℤ_pℤ_p^2-linear codes

A code C is called ℤ_pℤ_p^2-linear if it is the Gray image of a ℤ_pℤ_p^2...
research
10/16/2012

Learning to Rank With Bregman Divergences and Monotone Retargeting

This paper introduces a novel approach for learning to rank (LETOR) base...
research
08/28/2021

Visible Rank and Codes with Locality

We propose a framework to study the effect of local recovery requirement...
research
10/06/2021

A Theory of Tournament Representations

Real world tournaments are almost always intransitive. Recent works have...
research
12/06/2018

Generalizations of Laver tables

We shall generalize the notion of a Laver table to algebras which may ha...

Please sign up or login with your details

Forgot password? Click here to reset