I work in the ICU monitoring field, on the R&D team of a company with live systems at dozens of hospitals and multiple FDA approvals. We use extended Kalman filters (i.e. non-blackbox "ML") to estimate certain lab values of patients that are highly indicative of them crashing, based on live data from whatever set of monitors they're hooked up to - and it's highly robust. What the authors of this paper are doing is th…
PAC Learning is about compression, KF/EKF is more like Taylor expansion.
The specific types of PAC Learning that this paper covers has problems with a simplicity bias, and fairly low sensitivity.
While based on UHATs, this paper may provide some insights.
https://arxiv.org/abs/2502.02393
Obviously LLM and LRMs are the most studied, but even the recent posts on here from anthropic show that without a few high probability entries in the k-top results, confabulations are difficult for transformers.
Obviously there are PAC Learning methods that target anomaly detection, but they are very different than even EKF + Mc
You will note in this paper that even highly weighted features exhibited low sensitivity.
While the industry may find some pathological cases that make the approach usable, autograd and the need for parallelism make the application of this papers methods to tiny variations to multivariate problem ambitious.
They also only trained on medical data. Part of the reason the foundation models do so well is that they encode verifiers from a huge corpus that invalidates the traditional bias variance tradeoffs from the early 90's papers.
But they are still selecting from the needles and don't have access to the hay in the haystack.
The following paper is really not related except it shows how compression exacerbates that problem.
https://arxiv.org/abs/2205.06977
Chaitin's constant encoding the Halting problem, and that it is normal and uncomputable is the extreme top end of computability, but relates to the compression idea.
EKFs have access to the computable reals, and while non-linear, KF and EKFs can be thought of linearization of the approximations as a lens.
If the diagnostic indicators were both ergodic and Markovian, this paper's approach would probably be fairly reliable.
But these efforts are really about finding a many to one reduction that works.
I am skeptical about it in this case for PAC ML, but perhaps they will find a pathological case.
But the tradeoffs between statistical learning and expansive methods are quite different.
Obviously hype cycles drive efforts, I encourage you to look at this years AAAI conference report and see that you are not alone with the frustration on the single minded approach.
IMHO this paper is a net positive, showing that we are moving from a broad exploration to targeted applications.
But that is just my opinion.