A Simple Proof of Optimal Approximations

by   Monika Csikos, et al.

The fundamental result of Li, Long, and Srinivasan on approximations of set systems has become a key tool across several communities such as learning theory, algorithms, combinatorics and data analysis (described as `the pinnacle of a long sequence of papers'). The goal of this paper is to give a simpler, self-contained, modular proof of this result for finite set systems. The only ingredient we assume is the standard Chernoff's concentration bound. This makes the proof accessible to a wider audience, readers not familiar with techniques from statistical learning theory, and makes it possible to be covered in a single self-contained lecture in an algorithms course.



page 1

page 2

page 3

page 4


A Short Proof of the Toughness of Delaunay Triangulations

We present a self-contained short proof of the seminal result of Dillenc...

Proof of Dudley's Convex Approximation

We provide a self contained proof of a result of Dudley [Dud64] which sh...

Tutorial on the Robust Interior Point Method

We give a short, self-contained proof of the interior point method and i...

A Self-contained Analysis of the Lempel-Ziv Compression Algorithm

This article gives a self-contained analysis of the performance of the L...

A Breezing Proof of the KMW Bound

In their seminal paper from 2004, Kuhn, Moscibroda, and Wattenhofer (KMW...

Short Combinatorial Proof that the DFJ Polytope is contained in the MTZ Polytope for the Asymmetric Traveling Salesman Problem

For the Asymmetric Traveling Salesman Problem (ATSP), it is known that t...

Note: An alternative proof of the vulnerability of k-NN classifiers in high intrinsic dimensionality regions

This document proposes an alternative proof of the result contained in a...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.