One thing to note about Kolmogorov complexity is that it is uncomputable. There is no possible algorithm that, given finite sequence as input, produces an algorithm of minimum length that can reproduce that sequence. Just because something has a Kolmogorov complexity of (say) a few hundred million bits does not at all mean that it can be found by training anything on a few hundred million, or even a few hundred trillion, bits of data.
One thing to note about Kolmogorov complexity is that it is uncomputable. There is no possible algorithm that, given finite sequence as input, produces an algorithm of minimum length that can reproduce that sequence. Just because something has a Kolmogorov complexity of (say) a few hundred million bits does not at all mean that it can be found by training anything on a few hundred million, or even a few hundred trillion, bits of data.