Rustem Takhanov

Feldman's memorization lower bound can be arbitrarily inaccurate, but a corrected version using full-sample posterior probabilities offers an exact replacement.

Conditional KRR lets you bake in prior knowledge by injecting unpenalized features into kernel methods, boosting performance when you know the right features to use.