Lempel-Ziv algorithm has been my example counterpoint against simplistic takes of bitter lesson. LZ makes hardly any assumptions. Just stores strings. Is provably asymptotically optimal — will reach the entropy rate of the source given enough data. So as bitter-lesson pilled
Lempel-Ziv algorithm counters simplistic views.
Lempel-Ziv makes few assumptions and is asymptotically optimal with enough data.