Well, I ask you—do you think any other ML model, trained over the domain of all human text, with sufficient success to reach GPT-4 level perplexity, would turn out to be simpler?
If we’re literally considering a universal quantifier over the set of all possible ML models, then I’d think it extremely likely that there does exist a simpler model with perplexity no worse than GPT-4. I’m confused as to how you (seem to have) arrived at the opposite conclusion.
If we’re literally considering a universal quantifier over the set of all possible ML models, then I’d think it extremely likely that there does exist a simpler model with perplexity no worse than GPT-4. I’m confused as to how you (seem to have) arrived at the opposite conclusion.