Compressive Classification (Machine Learning without learning)

12/04/2018
by   Vincent Schellekens, et al.
0

Compressive learning is a framework where (so far unsupervised) learning tasks use not the entire dataset but a compressed summary (sketch) of it. We propose a compressive learning classification method, and a novel sketch function for images.

READ FULL TEXT

page 1

page 2

page 3

research
04/17/2020

Statistical Learning Guarantees for Compressive Clustering and Compressive Mixture Modeling

We provide statistical learning guarantees for two unsupervised learning...
research
10/22/2019

Compressive Learning for Semi-Parametric Models

In the compressive learning theory, instead of solving a statistical lea...
research
04/26/2018

Quantized Compressive K-Means

The recent framework of compressive statistical learning aims at designi...
research
09/14/2020

When compressive learning fails: blame the decoder or the sketch?

In compressive learning, a mixture model (a set of centroids or a Gaussi...
research
10/27/2016

Compressive K-means

The Lloyd-Max algorithm is a classical approach to perform K-means clust...
research
02/12/2020

Compressive Learning of Generative Networks

Generative networks implicitly approximate complex densities from their ...
research
08/04/2020

Sketching Datasets for Large-Scale Learning (long version)

This article considers "sketched learning," or "compressive learning," a...

Please sign up or login with your details

Forgot password? Click here to reset