Showing 2024Show all
2 papers · 1 filter
cs.DS2024
Tokenisation is NP-Complete
Philip Whittington, Gregor Bachmann, Tiago Pimentel
In this work, we prove the NP-completeness of two variants of tokenisation, defined as the problem of compressing a dataset to at most symbols by either finding a vocabulary d…
cs.LG2024
Interpolated-MLPs: Controllable Inductive Bias
Sean Wu, Jordan Hong, Keyu Bai +1
Due to their weak inductive bias, Multi-Layer Perceptrons (MLPs) have subpar performance at low-compute levels compared to standard architectures such as convolution-based networks…