Primal and Dual Combinatorial Dimensions

08/23/2021
by   Pieter Kleer, et al.
0

We give tight bounds on the relation between the primal and dual of various combinatorial dimensions, such as the pseudo-dimension and fat-shattering dimension, for multi-valued function classes. These dimensional notions play an important role in the area of learning theory. We first review some (folklore) results that bound the dual dimension of a function class in terms of its primal, and after that give (almost) matching lower bounds. In particular, we give an appropriate generalization to multi-valued function classes of a well-known bound due to Assouad (1983), that relates the primal and dual VC-dimension of a binary function class.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/17/2019

On the Complexity of the k-Level in Arrangements of Pseudoplanes

A classical open problem in combinatorial geometry is to obtain tight as...
research
08/16/2021

Role of New Kernel Function in Complexity Analysis of an Interior Point Algorithm for Semi definite Linear Complementarity Problem

In this paper, we introduce a new kernel function which differs from pre...
research
12/08/2017

Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location

We re-examine parameters for the two main space decomposition technique...
research
08/23/2020

Streaming Submodular Matching Meets the Primal-Dual Method

We study streaming submodular maximization subject to matching/b-matchin...
research
02/08/2020

Towards a combinatorial characterization of bounded memory learning

Combinatorial dimensions play an important role in the theory of machine...
research
03/18/2022

Deterministic Bridge Regression for Compressive Classification

Pattern classification with compact representation is an important compo...

Please sign up or login with your details

Forgot password? Click here to reset