this post was submitted on 15 Jul 2024
125 points (100.0% liked)
Technology
37717 readers
382 users here now
A nice place to discuss rumors, happenings, innovations, and challenges in the technology sphere. We also welcome discussions on the intersections of technology and society. If it’s technological news or discussion of technology, it probably belongs here.
Remember the overriding ethos on Beehaw: Be(e) Nice. Each user you encounter here is a person, and should be treated with kindness (even if they’re wrong, or use a Linux distro you don’t like). Personal attacks will not be tolerated.
Subcommunities on Beehaw:
This community's icon was made by Aaron Schneider, under the CC-BY-NC-SA 4.0 license.
founded 2 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
Machine learning and compression have always been closely tied together. It's trying to learn the "rules" that describe the data rather than memorizing all the data.
I remember implementing a paper older than me in our "Information Theory" course at university that treated the creation of a decision tree as compression. Their algorithm considered sending the decisions tree and all the exceptions to the decision tree and the tree itself. If a node in the tree increased the overall message size, it would simply be pruned. This way they ensured that you wouldn't make conclusions while having very little data and would only add the big patterns in the data.
Fundamentally it is just compression, it's just a way better method of compression than all the models that we had before.
EDIT: The paper I'm talking about is "Inferring decision trees using the minimum description length principle" - L. Ross Quinlan & Ronald L. Rivest
Thank you for this contribution! I was familiar with the idea of ML models capturing a compressed snapshot of the data, but that work on exploring its limits in DTs looks very interesting.