Results:
Learnability for the Information Bottleneck
Tailin Wu ([email protected]), Ian Fischer ([email protected]),
Isaac L. Chuang ([email protected]), Max Tegmark ([email protected])
Results:
2. Prove sufficient conditions for IB Learnability:
Identify IB-learnability is determined by the conspicuous subset: the largest confident, typical, and
imbalanced subset
3. Provide a practical algorithm to estimate and discover the conspicuous subset
Learnability for the Information Bottleneck
Tailin Wu ([email protected]), Ian Fischer ([email protected]),
Isaac L. Chuang ([email protected]), Max Tegmark ([email protected])
Results:
4. Demonstrate our theoretical conditions and algorithm in synthetic, MNIST and CIFAR10 datasets:
Learnability for the Information Bottleneck
Tailin Wu ([email protected]), Ian Fischer ([email protected]),
Isaac L. Chuang ([email protected]), Max Tegmark ([email protected])
Synthetic
CIFAR10
MNIST:
Conspicuous subset
(all “1”):
Above the conspicuous threshold
(other digits):