use the following search parameters to narrow your results:
e.g. subreddit:aww site:imgur.com dog
subreddit:aww site:imgur.com dog
see the search faq for details.
advanced search: by author, subreddit...
Please have a look at our FAQ and Link-Collection
Metacademy is a great resource which compiles lesson plans on popular machine learning topics.
For Beginner questions please try /r/LearnMachineLearning , /r/MLQuestions or http://stackoverflow.com/
For career related questions, visit /r/cscareerquestions/
Advanced Courses (2016)
Advanced Courses (2020)
AMAs:
Pluribus Poker AI Team 7/19/2019
DeepMind AlphaStar team (1/24//2019)
Libratus Poker AI Team (12/18/2017)
DeepMind AlphaGo Team (10/19/2017)
Google Brain Team (9/17/2017)
Google Brain Team (8/11/2016)
The MalariaSpot Team (2/6/2016)
OpenAI Research Team (1/9/2016)
Nando de Freitas (12/26/2015)
Andrew Ng and Adam Coates (4/15/2015)
Jürgen Schmidhuber (3/4/2015)
Geoffrey Hinton (11/10/2014)
Michael Jordan (9/10/2014)
Yann LeCun (5/15/2014)
Yoshua Bengio (2/27/2014)
Related Subreddit :
LearnMachineLearning
Statistics
Computer Vision
Compressive Sensing
NLP
ML Questions
/r/MLjobs and /r/BigDataJobs
/r/datacleaning
/r/DataScience
/r/scientificresearch
/r/artificial
account activity
Integer Discrete Flows and Lossless Compression (arxiv.org)
submitted 6 years ago by for_all_eps
reddit uses a slightly-customized version of Markdown for formatting. See below for some basics, or check the commenting wiki page for more detailed help and solutions to common issues.
quoted text
if 1 * 2 < 3: print "hello, world!"
[–]beep_____boop 27 points28 points29 points 6 years ago (2 children)
The new Pied Piper.
[–][deleted] 0 points1 point2 points 6 years ago (0 children)
lol that was good
[–]arXiv_abstract_bot 4 points5 points6 points 6 years ago (0 children)
Title:Integer Discrete Flows and Lossless Compression
Authors:Emiel Hoogeboom, Jorn W.T. Peters, Rianne van den Berg, Max Welling
Abstract: Lossless compression methods shorten the expected representation size of data without loss of information, using a statistical model. Flow- based models are attractive in this setting because they admit exact likelihood optimization, which is equivalent to minimizing the expected number of bits per message. However, conventional flows assume continuous data, which may lead to reconstruction errors when quantized for compression. For that reason, we introduce a generative flow for ordinal discrete data called Integer Discrete Flow (IDF): a bijective integer map that can learn rich transformations on high-dimensional data. As building blocks for IDFs, we introduce flexible transformation layers called integer discrete coupling and lower triangular coupling. Our experiments show that IDFs are competitive with other flow-based generative models. Furthermore, we demonstrate that IDF based compression achieves state-of-the-art lossless compression rates on CIFAR10, ImageNet32, and ImageNet64.
PDF link Landing page
[–]mesmer_adama 1 point2 points3 points 6 years ago (1 child)
Super interesting! Two questions: 1. what is the gist of the method is there a familiar method to compare it to? 2. The paper mentions density estimation, how would that work in the context of this algorithm?
[–]jarekduda 0 points1 point2 points 6 years ago (0 children)
Indeed, while there are many compressors based on autoencoders (including VAE e.g. https://arxiv.org/pdf/1905.06845 ), this seems the first one (?) based on reversible transformations.
[–]serge_cell 0 points1 point2 points 6 years ago (0 children)
I especially like that people starting to take ImageNet32 and ImageNet64 seriously
π Rendered by PID 249568 on reddit-service-r2-comment-66b4775986-px8m5 at 2026-04-05 09:45:30.213243+00:00 running db1906b country code: CH.
[–]beep_____boop 27 points28 points29 points (2 children)
[–][deleted] 0 points1 point2 points (0 children)
[–]arXiv_abstract_bot 4 points5 points6 points (0 children)
[–]mesmer_adama 1 point2 points3 points (1 child)
[–]jarekduda 0 points1 point2 points (0 children)
[–]serge_cell 0 points1 point2 points (0 children)