"LLMs or Naive Bayes? Old Gems or New Ways"
With Dmitry Mishin, John Graham, Seungmin Kim, Mahidhar Tatineni, and Frank Würthwein. Published as a short paper at PEARC '26; the preprint is on [arXiv:2609.13185](https://arxiv.org/abs/2609.13185).
There's a recurring question in research computing: with LLMs this good, should we retire classical methods like Naive Bayes? Our PEARC '26 paper answers it with measurements, not vibes, and the answer isn't what the hype suggests.
What we did
We benchmarked Complement Naive Bayes (CNB) with TF-IDF bigrams against zero-shot and few-shot LLMs spanning four model families and a 37× range in scale (27B up to a 1T-parameter mixture-of-experts), across three text-classification tasks, plus a low-contamination control to keep the numbers honest.
The headline results
The decision line
The takeaway isn't "classical always wins", it's that the right choice is task- and data-dependent:
To make that call automatic instead of tribal, the paper includes a Kubernetes Helm operator that automates model selection using configurable thresholds and verifiable Prometheus metrics. Pick the policy, the operator routes the work.
Why this matters in HPC
For resource-constrained HPC practitioners doing text classification with labeled data, NB remains the efficient default, and the article arms you with the exact numbers for when it isn't. The full story, including the operator, is in the paper: [arXiv:2609.13185](https://arxiv.org/abs/2609.13185).