aboutsummaryrefslogtreecommitdiffstats
path: root/finale/sections
diff options
context:
space:
mode:
authorThibaut Horel <thibaut.horel@gmail.com>2015-12-11 21:39:50 -0500
committerThibaut Horel <thibaut.horel@gmail.com>2015-12-11 21:39:50 -0500
commit4f673d21722aba9afa87af633c33e83cfd6a802f (patch)
treede84c267d66e9a49e1c082e95df5b233ac50074f /finale/sections
parent6d9f6bad8fea9e062b2427f0950c662f3f83fd4a (diff)
downloadcascades-4f673d21722aba9afa87af633c33e83cfd6a802f.tar.gz
Some bullshit on using SGD for online learning (however I think the intuition
is correct and could be used to obtain a formal guarantee)
Diffstat (limited to 'finale/sections')
-rw-r--r--finale/sections/active.tex17
1 files changed, 14 insertions, 3 deletions
diff --git a/finale/sections/active.tex b/finale/sections/active.tex
index 7b9b390..3e130aa 100644
--- a/finale/sections/active.tex
+++ b/finale/sections/active.tex
@@ -101,7 +101,18 @@ a Bernouilli variable of parameter $\Theta_{i,j}$.
proposed approximation of $U$.
\end{remark}
-\paragraph{Online Bayesian Updates} bullshit on SGD on data streams. Cite
-"SGD as an online algorithm for data streams". Should tie this with our VI
-algorithm.
+\emph{Computational Considerations.} Given the online nature of the Active
+Learning scenario described above, it is crucial the algorithm used to perform
+Bayesian Inference supports online updates. This will be the case when using
+Stochastic Gradient Descent to optimize the Variational Inference objective as
+described in Section 3.2 and as used in the experiments in Section 5.
+However, contrary to the standard application of SGD, each data point will only
+be processed once. It has been noted in prior works (see for example
+\cite{bottou}) that when SGD is used on infinite data stream, with each data
+point being processed only once, the interpretation is that SGD is directly
+optimizing the expected loss against the distribution of the input data stream
+(as opposed to the empirical distribution of the fixed input data set in
+standard offline learning). In our case, as we learn the graph in an active
+manner, the distribution of the input data stream converges to the uniform
+distribution which shows the consistency of the resulting inference method.