The VC-dimension of k-vertex d-polytopes

04/09/2020
by   Andrey Kupavskii, et al.
0

In this short note, we show that the VC-dimension of the class of k-vertex polytopes in ℝ^d is at most 8d^2klog_2k, answering an old question of Long and Warmuth.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/26/2020

A lower bound for splines on tetrahedral vertex stars

A tetrahedral complex all of whose tetrahedra meet at a common vertex is...
research
03/16/2011

A note on active learning for smooth problems

We show that the disagreement coefficient of certain smooth hypothesis c...
research
07/13/2020

Approximate Vertex Enumeration

The problem to compute a V-polytope which is close to a given H-polytope...
research
09/23/2021

Corpus and Models for Lemmatisation and POS-tagging of Old French

Old French is a typical example of an under-resourced historic languages...
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
11/08/2017

A Weak Compatibility Condition for Newest Vertex Bisection in any dimension

We define a weak compatibility condition for the Newest Vertex Bisection...
research
01/24/2022

A note on increasing paths in countable hypergraphs

An old result of Müller and Rödl states that a countable graph G has a s...

Please sign up or login with your details

Forgot password? Click here to reset