Recursively updating the MLE as new observations stream in
$begingroup$
General Question
Say we have iid data $x_1$, $x_2$, ... $sim f(x,|,boldsymbol{theta})$ streaming in. We want to recursively compute the maximum likelihood estimate of $boldsymbol{theta}$. That is, having computed
$$hat{boldsymbol{theta}}_{n-1}=underset{boldsymbol{theta}inmathbb{R}^p}{argmax}prod_{i=1}^{n-1}f(x_i,|,boldsymbol{theta}),$$
we observe a new $x_n$, and wish to somehow incrementally update our estimate
$$hat{boldsymbol{theta}}_{n-1},,x_n to hat{boldsymbol{theta}}_{n}$$
without having to start from scratch. Are there generic algorithms for this?
Toy Example
If $x_1$, $x_2$, ... $sim N(x,|,mu, 1)$, then
$$hat{mu}_{n-1} = frac{1}{n-1}sumlimits_{i=1}^{n-1}x_iquadtext{and}quadhat{mu}_n = frac{1}{n}sumlimits_{i=1}^nx_i,$$
so
$$hat{mu}_n=frac{1}{n}left[(n-1)hat{mu}_{n-1} + x_nright].$$
maximum-likelihood online
$endgroup$
add a comment |
$begingroup$
General Question
Say we have iid data $x_1$, $x_2$, ... $sim f(x,|,boldsymbol{theta})$ streaming in. We want to recursively compute the maximum likelihood estimate of $boldsymbol{theta}$. That is, having computed
$$hat{boldsymbol{theta}}_{n-1}=underset{boldsymbol{theta}inmathbb{R}^p}{argmax}prod_{i=1}^{n-1}f(x_i,|,boldsymbol{theta}),$$
we observe a new $x_n$, and wish to somehow incrementally update our estimate
$$hat{boldsymbol{theta}}_{n-1},,x_n to hat{boldsymbol{theta}}_{n}$$
without having to start from scratch. Are there generic algorithms for this?
Toy Example
If $x_1$, $x_2$, ... $sim N(x,|,mu, 1)$, then
$$hat{mu}_{n-1} = frac{1}{n-1}sumlimits_{i=1}^{n-1}x_iquadtext{and}quadhat{mu}_n = frac{1}{n}sumlimits_{i=1}^nx_i,$$
so
$$hat{mu}_n=frac{1}{n}left[(n-1)hat{mu}_{n-1} + x_nright].$$
maximum-likelihood online
$endgroup$
$begingroup$
Awesome question!
$endgroup$
– dlnB
6 hours ago
2
$begingroup$
Don't forget the inverse of this problem: updating the estimator as old observations are deleted.
$endgroup$
– Hong Ooi
4 hours ago
add a comment |
$begingroup$
General Question
Say we have iid data $x_1$, $x_2$, ... $sim f(x,|,boldsymbol{theta})$ streaming in. We want to recursively compute the maximum likelihood estimate of $boldsymbol{theta}$. That is, having computed
$$hat{boldsymbol{theta}}_{n-1}=underset{boldsymbol{theta}inmathbb{R}^p}{argmax}prod_{i=1}^{n-1}f(x_i,|,boldsymbol{theta}),$$
we observe a new $x_n$, and wish to somehow incrementally update our estimate
$$hat{boldsymbol{theta}}_{n-1},,x_n to hat{boldsymbol{theta}}_{n}$$
without having to start from scratch. Are there generic algorithms for this?
Toy Example
If $x_1$, $x_2$, ... $sim N(x,|,mu, 1)$, then
$$hat{mu}_{n-1} = frac{1}{n-1}sumlimits_{i=1}^{n-1}x_iquadtext{and}quadhat{mu}_n = frac{1}{n}sumlimits_{i=1}^nx_i,$$
so
$$hat{mu}_n=frac{1}{n}left[(n-1)hat{mu}_{n-1} + x_nright].$$
maximum-likelihood online
$endgroup$
General Question
Say we have iid data $x_1$, $x_2$, ... $sim f(x,|,boldsymbol{theta})$ streaming in. We want to recursively compute the maximum likelihood estimate of $boldsymbol{theta}$. That is, having computed
$$hat{boldsymbol{theta}}_{n-1}=underset{boldsymbol{theta}inmathbb{R}^p}{argmax}prod_{i=1}^{n-1}f(x_i,|,boldsymbol{theta}),$$
we observe a new $x_n$, and wish to somehow incrementally update our estimate
$$hat{boldsymbol{theta}}_{n-1},,x_n to hat{boldsymbol{theta}}_{n}$$
without having to start from scratch. Are there generic algorithms for this?
Toy Example
If $x_1$, $x_2$, ... $sim N(x,|,mu, 1)$, then
$$hat{mu}_{n-1} = frac{1}{n-1}sumlimits_{i=1}^{n-1}x_iquadtext{and}quadhat{mu}_n = frac{1}{n}sumlimits_{i=1}^nx_i,$$
so
$$hat{mu}_n=frac{1}{n}left[(n-1)hat{mu}_{n-1} + x_nright].$$
maximum-likelihood online
maximum-likelihood online
edited 5 hours ago
bamts
asked 6 hours ago
bamtsbamts
780313
780313
$begingroup$
Awesome question!
$endgroup$
– dlnB
6 hours ago
2
$begingroup$
Don't forget the inverse of this problem: updating the estimator as old observations are deleted.
$endgroup$
– Hong Ooi
4 hours ago
add a comment |
$begingroup$
Awesome question!
$endgroup$
– dlnB
6 hours ago
2
$begingroup$
Don't forget the inverse of this problem: updating the estimator as old observations are deleted.
$endgroup$
– Hong Ooi
4 hours ago
$begingroup$
Awesome question!
$endgroup$
– dlnB
6 hours ago
$begingroup$
Awesome question!
$endgroup$
– dlnB
6 hours ago
2
2
$begingroup$
Don't forget the inverse of this problem: updating the estimator as old observations are deleted.
$endgroup$
– Hong Ooi
4 hours ago
$begingroup$
Don't forget the inverse of this problem: updating the estimator as old observations are deleted.
$endgroup$
– Hong Ooi
4 hours ago
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
See the concept of sufficiency and in particular, minimal sufficient statistics. In many cases you need the whole sample to compute the estimate at a given sample size, with no trivial way to update from a sample one size smaller (i.e. there's no convenient general result).
If the distribution is exponential family (and in some other cases besides; the uniform is a neat example) there's a nice sufficient statistic that can in many cases be updated in the manner you seek (i.e. with a number of commonly used distributions there would be a fast update).
One example I'm not aware of any direct way to either calculate or update is the estimate for the location of the Cauchy distribution (e.g. with unit scale, to make the problem a simple one-parameter problem). There may be a faster update, however, that I simply haven't noticed - I can't say I've really done more than glance at it for considering the updating case.
On the other hand, with MLEs that are obtained via numerical optimization methods, the previous estimate would in many cases be a great starting point, since typically the previous estimate would be very close to the updated estimate; in that sense at least, rapid updating should often be possible. Even this isn't the general case, though -- with multimodal likelihood functions (again, see the Cauchy for an example), a new observation might lead to the highest mode being some distance from the previous one (even if the locations of each of the biggest few modes didn't shift much, which one is highest could well change).
$endgroup$
1
$begingroup$
Thanks! The point about the MLE possibly switching modes midstream is particularly helpful for understanding why this would be hard in general.
$endgroup$
– bamts
2 hours ago
$begingroup$
You can see this for yourself with the above unit-scale Cauchy model and the data (0.1,0.11,0.12,2.91,2.921,2.933). The log-likelihood for the location has peaks near 0.5 and 2.5, and the (slightly) higher peak is the one near 0.5. Now make the next observation 10 and the mode of each of the two peaks barely moves but the second peak is now substantially higher. Gradient descent won't help you when that happens, it's almost like starting again. If your population is a mixture of two similar-size subgroups with different locations, such circumstances could occur - even in large samples. ... ctd
$endgroup$
– Glen_b♦
58 mins ago
$begingroup$
ctd... In the right situation, mode switching may occur fairly often.
$endgroup$
– Glen_b♦
7 mins ago
add a comment |
$begingroup$
In machine learning, this is referred to as online learning.
As @Glen_b pointed out, there are special cases in which the MLE can be updated without needing to access all the previous data. As he also points out, I don't believe there's a generic solution for finding the MLE.
A fairly generic approach for finding the approximate solution is to use something like stochastic gradient descent. In this case, as each observation comes in, we compute the gradient with respect to this individual observation and move the parameter values a very small amount in this direction. Under certain conditions, we can show that this will converge to a neighborhood of the MLE with high probability; the neighborhood is tighter and tighter as we reduce the step size, but more data is required for convergence. However, these stochastic methods in general require much more fiddling to obtain good performance than, say, closed form updates.
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "65"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstats.stackexchange.com%2fquestions%2f398220%2frecursively-updating-the-mle-as-new-observations-stream-in%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
See the concept of sufficiency and in particular, minimal sufficient statistics. In many cases you need the whole sample to compute the estimate at a given sample size, with no trivial way to update from a sample one size smaller (i.e. there's no convenient general result).
If the distribution is exponential family (and in some other cases besides; the uniform is a neat example) there's a nice sufficient statistic that can in many cases be updated in the manner you seek (i.e. with a number of commonly used distributions there would be a fast update).
One example I'm not aware of any direct way to either calculate or update is the estimate for the location of the Cauchy distribution (e.g. with unit scale, to make the problem a simple one-parameter problem). There may be a faster update, however, that I simply haven't noticed - I can't say I've really done more than glance at it for considering the updating case.
On the other hand, with MLEs that are obtained via numerical optimization methods, the previous estimate would in many cases be a great starting point, since typically the previous estimate would be very close to the updated estimate; in that sense at least, rapid updating should often be possible. Even this isn't the general case, though -- with multimodal likelihood functions (again, see the Cauchy for an example), a new observation might lead to the highest mode being some distance from the previous one (even if the locations of each of the biggest few modes didn't shift much, which one is highest could well change).
$endgroup$
1
$begingroup$
Thanks! The point about the MLE possibly switching modes midstream is particularly helpful for understanding why this would be hard in general.
$endgroup$
– bamts
2 hours ago
$begingroup$
You can see this for yourself with the above unit-scale Cauchy model and the data (0.1,0.11,0.12,2.91,2.921,2.933). The log-likelihood for the location has peaks near 0.5 and 2.5, and the (slightly) higher peak is the one near 0.5. Now make the next observation 10 and the mode of each of the two peaks barely moves but the second peak is now substantially higher. Gradient descent won't help you when that happens, it's almost like starting again. If your population is a mixture of two similar-size subgroups with different locations, such circumstances could occur - even in large samples. ... ctd
$endgroup$
– Glen_b♦
58 mins ago
$begingroup$
ctd... In the right situation, mode switching may occur fairly often.
$endgroup$
– Glen_b♦
7 mins ago
add a comment |
$begingroup$
See the concept of sufficiency and in particular, minimal sufficient statistics. In many cases you need the whole sample to compute the estimate at a given sample size, with no trivial way to update from a sample one size smaller (i.e. there's no convenient general result).
If the distribution is exponential family (and in some other cases besides; the uniform is a neat example) there's a nice sufficient statistic that can in many cases be updated in the manner you seek (i.e. with a number of commonly used distributions there would be a fast update).
One example I'm not aware of any direct way to either calculate or update is the estimate for the location of the Cauchy distribution (e.g. with unit scale, to make the problem a simple one-parameter problem). There may be a faster update, however, that I simply haven't noticed - I can't say I've really done more than glance at it for considering the updating case.
On the other hand, with MLEs that are obtained via numerical optimization methods, the previous estimate would in many cases be a great starting point, since typically the previous estimate would be very close to the updated estimate; in that sense at least, rapid updating should often be possible. Even this isn't the general case, though -- with multimodal likelihood functions (again, see the Cauchy for an example), a new observation might lead to the highest mode being some distance from the previous one (even if the locations of each of the biggest few modes didn't shift much, which one is highest could well change).
$endgroup$
1
$begingroup$
Thanks! The point about the MLE possibly switching modes midstream is particularly helpful for understanding why this would be hard in general.
$endgroup$
– bamts
2 hours ago
$begingroup$
You can see this for yourself with the above unit-scale Cauchy model and the data (0.1,0.11,0.12,2.91,2.921,2.933). The log-likelihood for the location has peaks near 0.5 and 2.5, and the (slightly) higher peak is the one near 0.5. Now make the next observation 10 and the mode of each of the two peaks barely moves but the second peak is now substantially higher. Gradient descent won't help you when that happens, it's almost like starting again. If your population is a mixture of two similar-size subgroups with different locations, such circumstances could occur - even in large samples. ... ctd
$endgroup$
– Glen_b♦
58 mins ago
$begingroup$
ctd... In the right situation, mode switching may occur fairly often.
$endgroup$
– Glen_b♦
7 mins ago
add a comment |
$begingroup$
See the concept of sufficiency and in particular, minimal sufficient statistics. In many cases you need the whole sample to compute the estimate at a given sample size, with no trivial way to update from a sample one size smaller (i.e. there's no convenient general result).
If the distribution is exponential family (and in some other cases besides; the uniform is a neat example) there's a nice sufficient statistic that can in many cases be updated in the manner you seek (i.e. with a number of commonly used distributions there would be a fast update).
One example I'm not aware of any direct way to either calculate or update is the estimate for the location of the Cauchy distribution (e.g. with unit scale, to make the problem a simple one-parameter problem). There may be a faster update, however, that I simply haven't noticed - I can't say I've really done more than glance at it for considering the updating case.
On the other hand, with MLEs that are obtained via numerical optimization methods, the previous estimate would in many cases be a great starting point, since typically the previous estimate would be very close to the updated estimate; in that sense at least, rapid updating should often be possible. Even this isn't the general case, though -- with multimodal likelihood functions (again, see the Cauchy for an example), a new observation might lead to the highest mode being some distance from the previous one (even if the locations of each of the biggest few modes didn't shift much, which one is highest could well change).
$endgroup$
See the concept of sufficiency and in particular, minimal sufficient statistics. In many cases you need the whole sample to compute the estimate at a given sample size, with no trivial way to update from a sample one size smaller (i.e. there's no convenient general result).
If the distribution is exponential family (and in some other cases besides; the uniform is a neat example) there's a nice sufficient statistic that can in many cases be updated in the manner you seek (i.e. with a number of commonly used distributions there would be a fast update).
One example I'm not aware of any direct way to either calculate or update is the estimate for the location of the Cauchy distribution (e.g. with unit scale, to make the problem a simple one-parameter problem). There may be a faster update, however, that I simply haven't noticed - I can't say I've really done more than glance at it for considering the updating case.
On the other hand, with MLEs that are obtained via numerical optimization methods, the previous estimate would in many cases be a great starting point, since typically the previous estimate would be very close to the updated estimate; in that sense at least, rapid updating should often be possible. Even this isn't the general case, though -- with multimodal likelihood functions (again, see the Cauchy for an example), a new observation might lead to the highest mode being some distance from the previous one (even if the locations of each of the biggest few modes didn't shift much, which one is highest could well change).
edited 5 hours ago
answered 5 hours ago
Glen_b♦Glen_b
214k23414764
214k23414764
1
$begingroup$
Thanks! The point about the MLE possibly switching modes midstream is particularly helpful for understanding why this would be hard in general.
$endgroup$
– bamts
2 hours ago
$begingroup$
You can see this for yourself with the above unit-scale Cauchy model and the data (0.1,0.11,0.12,2.91,2.921,2.933). The log-likelihood for the location has peaks near 0.5 and 2.5, and the (slightly) higher peak is the one near 0.5. Now make the next observation 10 and the mode of each of the two peaks barely moves but the second peak is now substantially higher. Gradient descent won't help you when that happens, it's almost like starting again. If your population is a mixture of two similar-size subgroups with different locations, such circumstances could occur - even in large samples. ... ctd
$endgroup$
– Glen_b♦
58 mins ago
$begingroup$
ctd... In the right situation, mode switching may occur fairly often.
$endgroup$
– Glen_b♦
7 mins ago
add a comment |
1
$begingroup$
Thanks! The point about the MLE possibly switching modes midstream is particularly helpful for understanding why this would be hard in general.
$endgroup$
– bamts
2 hours ago
$begingroup$
You can see this for yourself with the above unit-scale Cauchy model and the data (0.1,0.11,0.12,2.91,2.921,2.933). The log-likelihood for the location has peaks near 0.5 and 2.5, and the (slightly) higher peak is the one near 0.5. Now make the next observation 10 and the mode of each of the two peaks barely moves but the second peak is now substantially higher. Gradient descent won't help you when that happens, it's almost like starting again. If your population is a mixture of two similar-size subgroups with different locations, such circumstances could occur - even in large samples. ... ctd
$endgroup$
– Glen_b♦
58 mins ago
$begingroup$
ctd... In the right situation, mode switching may occur fairly often.
$endgroup$
– Glen_b♦
7 mins ago
1
1
$begingroup$
Thanks! The point about the MLE possibly switching modes midstream is particularly helpful for understanding why this would be hard in general.
$endgroup$
– bamts
2 hours ago
$begingroup$
Thanks! The point about the MLE possibly switching modes midstream is particularly helpful for understanding why this would be hard in general.
$endgroup$
– bamts
2 hours ago
$begingroup$
You can see this for yourself with the above unit-scale Cauchy model and the data (0.1,0.11,0.12,2.91,2.921,2.933). The log-likelihood for the location has peaks near 0.5 and 2.5, and the (slightly) higher peak is the one near 0.5. Now make the next observation 10 and the mode of each of the two peaks barely moves but the second peak is now substantially higher. Gradient descent won't help you when that happens, it's almost like starting again. If your population is a mixture of two similar-size subgroups with different locations, such circumstances could occur - even in large samples. ... ctd
$endgroup$
– Glen_b♦
58 mins ago
$begingroup$
You can see this for yourself with the above unit-scale Cauchy model and the data (0.1,0.11,0.12,2.91,2.921,2.933). The log-likelihood for the location has peaks near 0.5 and 2.5, and the (slightly) higher peak is the one near 0.5. Now make the next observation 10 and the mode of each of the two peaks barely moves but the second peak is now substantially higher. Gradient descent won't help you when that happens, it's almost like starting again. If your population is a mixture of two similar-size subgroups with different locations, such circumstances could occur - even in large samples. ... ctd
$endgroup$
– Glen_b♦
58 mins ago
$begingroup$
ctd... In the right situation, mode switching may occur fairly often.
$endgroup$
– Glen_b♦
7 mins ago
$begingroup$
ctd... In the right situation, mode switching may occur fairly often.
$endgroup$
– Glen_b♦
7 mins ago
add a comment |
$begingroup$
In machine learning, this is referred to as online learning.
As @Glen_b pointed out, there are special cases in which the MLE can be updated without needing to access all the previous data. As he also points out, I don't believe there's a generic solution for finding the MLE.
A fairly generic approach for finding the approximate solution is to use something like stochastic gradient descent. In this case, as each observation comes in, we compute the gradient with respect to this individual observation and move the parameter values a very small amount in this direction. Under certain conditions, we can show that this will converge to a neighborhood of the MLE with high probability; the neighborhood is tighter and tighter as we reduce the step size, but more data is required for convergence. However, these stochastic methods in general require much more fiddling to obtain good performance than, say, closed form updates.
$endgroup$
add a comment |
$begingroup$
In machine learning, this is referred to as online learning.
As @Glen_b pointed out, there are special cases in which the MLE can be updated without needing to access all the previous data. As he also points out, I don't believe there's a generic solution for finding the MLE.
A fairly generic approach for finding the approximate solution is to use something like stochastic gradient descent. In this case, as each observation comes in, we compute the gradient with respect to this individual observation and move the parameter values a very small amount in this direction. Under certain conditions, we can show that this will converge to a neighborhood of the MLE with high probability; the neighborhood is tighter and tighter as we reduce the step size, but more data is required for convergence. However, these stochastic methods in general require much more fiddling to obtain good performance than, say, closed form updates.
$endgroup$
add a comment |
$begingroup$
In machine learning, this is referred to as online learning.
As @Glen_b pointed out, there are special cases in which the MLE can be updated without needing to access all the previous data. As he also points out, I don't believe there's a generic solution for finding the MLE.
A fairly generic approach for finding the approximate solution is to use something like stochastic gradient descent. In this case, as each observation comes in, we compute the gradient with respect to this individual observation and move the parameter values a very small amount in this direction. Under certain conditions, we can show that this will converge to a neighborhood of the MLE with high probability; the neighborhood is tighter and tighter as we reduce the step size, but more data is required for convergence. However, these stochastic methods in general require much more fiddling to obtain good performance than, say, closed form updates.
$endgroup$
In machine learning, this is referred to as online learning.
As @Glen_b pointed out, there are special cases in which the MLE can be updated without needing to access all the previous data. As he also points out, I don't believe there's a generic solution for finding the MLE.
A fairly generic approach for finding the approximate solution is to use something like stochastic gradient descent. In this case, as each observation comes in, we compute the gradient with respect to this individual observation and move the parameter values a very small amount in this direction. Under certain conditions, we can show that this will converge to a neighborhood of the MLE with high probability; the neighborhood is tighter and tighter as we reduce the step size, but more data is required for convergence. However, these stochastic methods in general require much more fiddling to obtain good performance than, say, closed form updates.
answered 4 hours ago
Cliff ABCliff AB
13.6k12567
13.6k12567
add a comment |
add a comment |
Thanks for contributing an answer to Cross Validated!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstats.stackexchange.com%2fquestions%2f398220%2frecursively-updating-the-mle-as-new-observations-stream-in%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
Awesome question!
$endgroup$
– dlnB
6 hours ago
2
$begingroup$
Don't forget the inverse of this problem: updating the estimator as old observations are deleted.
$endgroup$
– Hong Ooi
4 hours ago