On weak ε-nets and the Radon number

07/17/2017
by   Shay Moran, et al.
0

We show that the Radon number characterizes the existence of weak nets in separable convexity spaces (an abstraction of the euclidean notion of convexity). The construction of weak nets when the Radon number is finite is based on Helly's property and on metric properties of VC classes. The lower bound on the size of weak nets when the Radon number is large relies on the chromatic number of the Kneser graph. As an application, we prove a boosting-type result for weak ϵ-nets.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/06/2018

Deciding Detectability for Labeled Petri Nets

Detectability of discrete event systems (DESs) is a property to determin...
research
02/25/2021

Digital almost nets

Digital nets (in base 2) are the subsets of [0,1]^d that contain the exp...
research
02/20/2020

Weighted Epsilon-Nets

Motivated by recent work of Bukh and Nivasch on one-sided ε-approximants...
research
12/21/2019

Bandit Multiclass Linear Classification for the Group Linear Separable Case

We consider the online multiclass linear classification under the bandit...
research
08/06/2019

A State Class Construction for Computing the Intersection of Time Petri Nets Languages

We propose a new method for computing the language intersection of two T...
research
03/14/2019

Highly irregular separated nets

In 1998 Burago and Kleiner and (independently) McMullen gave examples of...
research
08/19/2021

Convexity via Weak Distributive Laws

We study the canonical weak distributive law δ of the powerset monad ove...

Please sign up or login with your details

Forgot password? Click here to reset