just p-hack it.
from fossilesque@mander.xyz to science_memes@mander.xyz on 24 Jun 18:42
https://mander.xyz/post/32743831

#science_memes

threaded - newest

TropicalDingdong@lemmy.world on 24 Jun 18:58 next collapse

Cross validation: “What am I a joke to you?”

icelimit@lemmy.ml on 25 Jun 16:12 collapse

What’s cross validation?

Sirius006@sh.itjust.works on 25 Jun 16:24 next collapse

A joke to you.

TropicalDingdong@lemmy.world on 25 Jun 16:59 collapse

Cross validation is a way of calculating the likely uncertainty of any model (it doesn’t have to be a machine learning model).

A common cross validation approach is LOOCV (leave one out cross validation), for small datasets. Another is K-folds cross validation. In any case, the basics is to leave out “some amount” of your training data, totally removed from the training process, then you train your model, then you validate it on the trained model. You then repeat this process over the k-folds or each unit of your training data to create a valid uncertainty.

<img alt="" src="https://upload.wikimedia.org/wikipedia/commons/c/c7/LOOCV.gif">

So a few things. First, this a standard approach in machine learning, because once you get stop making the assumptions of frequentism (and you probably should), you no longer get things like uncertainty for free, because the assumptions aren’t met.

In some approaches in machine learning, this is necessary because there really isn’t a tractable way to get uncertainty from the model (although in others, like random forest, you get cross validation for free).

Cross validation is great because you really don’t need to understand anything about the model itself; you just implement the validation strategy and you get a valid answer for the model uncertainty.

bratorange@feddit.org on 24 Jun 22:44 next collapse

Funny thing there is actually attempts at modeling uncertainty in Deep Learning. But they are rarely used because they are either super inaccurate or have super slow convergence. (MCMC, Bayesian neural networks) The problem is essentially that learning algorithms cannot properly integrate over certainty distributions, so only an approximation can be trained, which is often pretty slow.

uuldika@lemmy.ml on 25 Jun 10:06 collapse

if they existed they’d be killer for RL. RL is insanely unstable when the distribution shifts as the policy starts exploring different parts of the state space. you’d think there’d be some clean approach to learning P(Xs|Ys) that can handle continuous shift of the Ys distribution in the training data, but there doesn’t seem to be. just replay buffers and other kludges.

minoscopede@lemmy.world on 24 Jun 23:48 next collapse

Thank you for your service brave memer

ZkhqrD5o@lemmy.world on 25 Jun 13:45 collapse

Haha, random sampling go brr. :)