Browsing Mathematics (Faculty of) by Subject "kolmogorov complexity"
Now showing items 1-2 of 2
-
Less is More: Restricted Representations for Better Interpretability and Generalizability
(University of Waterloo, 2023-08-22)Deep neural networks are prevalent in supervised learning for large amounts of tasks such as image classification, machine translation and even scientific discovery. Their success is often at the sacrifice of interpretability ... -
Style Recognition in Music with Context Free Grammars and Kolmogorov Complexity
(University of Waterloo, 2020-03-11)The Kolmogorov Complexity of an object is incomputable. But built in its structure is a way to specify description methods of an object that is computable in some sense. Such a description method then can be exploited ...