555watch
Stochastic Generative models can generate new and correct data if the distribution is right. Its in the definition
I'm not a doctor and don't know what I'm talking about, but would definitely advice against eye rubbing.
Confidence bounds for every correlation coefficient would add value and _might_ change some of the interpretations.
E.g.: "its average correlation with the other measurements is only 0.03, which is not just small, it is substantially smaller than the next smallest, which is ear breadth, with an average correlation of 0.13."
If the former is 0.03 +- 0.02 and the latter is 0.13 +- 0.07, we could claim that both are equal to 0 (or just equal).
Allow Russia to back down with positive land gains today and you create a precedent that any invasion on a non-NATO non-nuclear country is possible and viable just because you're a large world superpower.
This should not be the case, and a large part of Europe understands that. Hopefully, you will too.
Do I understand correctly that the GPT4All provides a delta on top of some LLAMA model variant? If so, does one need to first obtain the original LLAMA model weights to be able to run all the subsequent derivations? Is there a _legal_ way to obtain it without being a published AI researcher? If not, I'm not sure that Gpt4All is viable when looking for legal solutions.
We can already stop here and question, why does an upper bound on any similar probability interest us? If we want to show that the function $f$ exists with high probability, we should also consider lower bounds, not only the upper bounds as is done in the paper (clearly, I can bound any probability by 1 and would not be wrong).
But even leaving this question aside and going back to Theorem 2, they essentially show that for any sample of size $n$, they can find (and overfit) a smooth function $f$, given a sufficiently large model space $d$ and $k$. Assume I launch such a model in production, and continue generating further observations $n$. It follows from the theorem 2 that $f$ will quickly become unsuitable and require retraining on a larger training space $d$ and $k$.
However, from a statistical standing point, unless the data generating process is non-differentiable at every point, we should be able to assume that there exists N_epsilon, such, that for every n > n_epsilon, we should be able to find $f$ such that the errors would be controllably small (< epsilon) against the true data generating process f + sigma. So, beyond a certain $n$, further increasing of observations should not affect the initial fit of the model.
This is not at all what follows from the Theorem 2, suggesting that any such $f$ is still fitting on the errors, not necessarily the true process.
What am I missing (or assuming incorrectly)? Would be very interested to discuss this paper further!
That's probably the craziest takeaway from these. In my experience, losing half the vision + the middle part was the most often one. However, the craziest attack was when I temporarily lost the control of speech. The mind and thoughts were there, but nothing verbally said made sense when listening to myself. I'm so glad that taking a nap was enough to resolve that...