DeepAI AI Chat
Log In Sign Up

Graph-based Discriminators: Sample Complexity and Expressiveness

by   Roi Livni, et al.
Tel Aviv University

A basic question in learning theory is to identify if two distributions are identical when we have access only to examples sampled from the distributions. This basic task is considered, for example, in the context of Generative Adversarial Networks (GANs), where a discriminator is trained to distinguish between a real-life distribution and a synthetic distribution. we use a hypothesis class H and claim that the two distributions are distinct if for some h∈ H the expected value on the two distributions is (significantly) different. Our starting point is the following fundamental problem: "is having the hypothesis dependent on more than a single random example beneficial". To address this challenge we define k-ary based discriminators, which have a family of Boolean k-ary functions G. Each function g∈G naturally defines a hyper-graph, indicating whether a given hyper-edge exists. A function g∈G distinguishes between two distributions, if the expected value of g, on a k-tuple of i.i.d examples, on the two distributions is (significantly) different. We study the expressiveness of families of k-ary functions, compared to the classical hypothesis class H, which is k=1. We show a separation in expressiveness of k+1-ary versus k-ary functions. This demonstrate the great benefit of having k≥ 2 as distinguishers. For k≥ 2 we introduce a notion similar to the VC-dimension, and show that it controls the sample complexity. We proceed and provide upper and lower bounds as a function of our extended notion of VC-dimension.


Tight Sample Complexity of Large-Margin Learning

We obtain a tight distribution-specific characterization of the sample c...

Testing Identity of Multidimensional Histograms

We investigate the problem of identity testing for multidimensional hist...

Intrinsic Dimension Estimation

It has long been thought that high-dimensional data encountered in many ...

Distribution-Dependent Sample Complexity of Large Margin Learning

We obtain a tight distribution-specific characterization of the sample c...

Comparative Learning: A Sample Complexity Theory for Two Hypothesis Classes

In many learning theory problems, a central role is played by a hypothes...

Comments on the Du-Kakade-Wang-Yang Lower Bounds

Du, Kakade, Wang, and Yang recently established intriguing lower bounds ...

Provable limitations of deep learning

As the success of deep learning reaches more grounds, one would like to ...