--- a/writeup/aigaion-shorter.bib	Sat Sep 18 16:32:08 2010 -0400
+++ b/writeup/aigaion-shorter.bib	Sat Sep 18 16:44:46 2010 -0400
@@ -409,7 +409,7 @@
     volume = {5},
       year = {2004},
      pages = {1089--1105},
-  crossref = {JMLR-shorter},
+  journal = {Journal of Machine Learning Research},
   abstract = {Most machine learning researchers perform quantitative experiments to estimate generalization error and compare the performance of different algorithms (in particular, their proposed algorithm). In order to be able to draw statistically convincing conclusions, it is important to estimate the uncertainty of such estimates. This paper studies the very commonly used K-fold cross-validation estimator of generalization performance. The main theorem shows that there exists no universal (valid under all distributions) unbiased estimator of the variance of K-fold cross-validation. The analysis that accompanies this result is based on the eigen-decomposition of the covariance matrix of errors, which has only three different eigenvalues corresponding to three degrees of freedom of the matrix and three components of the total variance. This analysis helps to better understand the nature of the problem and how it can make naive estimators (that don’t take into account the error correlations due to the overlap between training and test sets) grossly underestimate variance. This is confirmed by numerical experiments in which the three components of the variance are compared when the difficulty of the learning problem and the number of folds are varied.},
 topics={Comparative},cat={J},
 }
@@ -1089,7 +1089,7 @@
     volume = {3},
       year = {2003},
      pages = {1137--1155},
-  crossref = {JMLR-shorter},
+  journal = {Journal of Machine Learning Research},
   abstract = {A goal of statistical language modeling is to learn the joint probability function of sequences of words in a language. This is intrinsically difficult because of the curse of dimensionality: a word sequence on which the model will be tested is likely to be different from all the word sequences seen during training. Traditional but very successful approaches based on n-grams obtain generalization by concatenating very short overlapping sequences seen in the training set. We propose to fight the curse of dimensionality by learning a distributed representation for words which allows each training sentence to inform the model about an exponential number of semantically neighboring sentences. The model learns simultaneously (1) a distributed representation for each word along with (2) the probability function for word sequences, expressed in terms of these representations. Generalization is obtained because a sequence of words that has never been seen before gets high probability if it is made of words that are similar (in the sense of having a nearby representation) to words forming an already seen sentence. Training such large models (with millions of parameters) within a reasonable time is itself a significant challenge. We report on experiments using neural networks for the probability function, showing on two text corpora that the proposed approach significantly improves on state-of-the-art n-gram models, and that the proposed approach allows to take advantage of longer contexts.},
 topics={Markov,Unsupervised,Language},cat={J},
 }
@@ -1569,7 +1569,7 @@
     author = {Bengio, Yoshua and Chapados, Nicolas},
      title = {Extensions to Metric-Based Model Selection},
       year = {2003},
-  crossref = {JMLR-shorter},
+  journal = {Journal of Machine Learning Research},
   abstract = {Metric-based methods have recently been introduced for model selection and regularization, often yielding very significant improvements over the alternatives tried (including cross-validation). All these methods require unlabeled data over which to compare functions and detect gross differences in behavior away from the training points. We introduce three new extensions of the metric model selection methods and apply them to feature selection. The first extension takes advantage of the particular case of time-series data in which the task involves prediction with a horizon h. The idea is to use at t the h unlabeled examples that precede t for model selection. The second extension takes advantage of the different error distributions of cross-validation and the metric methods: cross-validation tends to have a larger variance and is unbiased. A hybrid combining the two model selection methods is rarely beaten by any of the two methods. The third extension deals with the case when unlabeled data is not available at all, using an estimated input density. Experiments are described to study these extensions in the context of capacity control and feature subset selection.},
 topics={ModelSelection,Finance},cat={J},
 }
@@ -2255,7 +2255,7 @@
     volume = {11},
       year = {2010},
      pages = {625--660},
-  crossref = {JMLR-shorter},
+  journal = {Journal of Machine Learning Research},
   abstract = {Much recent research has been devoted to learning algorithms for deep architectures such as Deep Belief Networks and stacks of auto-encoder variants, with impressive results obtained in several areas, mostly on vision and language datasets. The best results obtained on supervised learning tasks involve an unsupervised learning component, usually in an unsupervised pre-training phase. Even though these new algorithms have enabled training deep models, many questions remain as to the nature of this difficult learning problem. The main question investigated here is the following: why does unsupervised pre-training work and why does it work so well? Answering these questions is important if learning in deep architectures is to be further improved. We propose several explanatory hypotheses and test them through extensive simulations. We empirically show the influence of pre-training with respect to architecture depth, model capacity, and number of training examples. The experiments confirm and clarify the advantage of unsupervised pre-training. The results suggest that unsupervised pre-training guides the learning towards basins of attraction of minima that are better in terms of the underlying data distribution; the evidence from these results supports a regularization explanation for the effect of pre-training.}
 }
 
@@ -2754,11 +2754,6 @@
            url = {http://snowbird.djvuzone.org/2007/abstracts/161.pdf}
 }
 
-@ARTICLE{JMLR-short,
-   journal = {JMLR},
-      year = {-1}
-}
-
 
 @INPROCEEDINGS{Kegl+Bertin+Eck-2008,
      author = {K{\'{e}}gl, Bal{\'{a}}zs and Bertin-Mahieux, Thierry and Eck, Douglas},
@@ -2870,7 +2865,7 @@
     volume = {10},
       year = {2009},
      pages = {1--40},
-  crossref = {JMLR-shorter},
+  journal = {Journal of Machine Learning Research},
   abstract = {Deep multi-layer neural networks have many levels of non-linearities allowing them to compactly represent highly non-linear and highly-varying functions. However, until recently it was not clear how to train such deep networks, since gradient-based optimization starting from random initialization often appears to get stuck in poor solutions. Hinton et al. recently proposed a greedy layer-wise unsupervised learning procedure relying on the training algorithm of restricted {Boltzmann} machines (RBM) to initialize the parameters of a deep belief network (DBN), a generative model with many layers of hidden causal variables. This was followed by the proposal of another greedy layer-wise procedure, relying on the usage of autoassociator networks. In the context of the above optimization problem, we study these algorithms empirically to better understand their success. Our experiments confirm the hypothesis that the greedy layer-wise unsupervised training strategy helps the optimization by initializing weights in a region near a good local minimum, but also implicitly acts as a sort of regularization that brings better generalization and encourages internal distributed representations that are high-level abstractions of the input. We also present a series of experiments aimed at evaluating the link between the performance of deep neural networks and practical aspects of their topology, for example, demonstrating cases where the addition of more depth helps. Finally, we empirically explore simple variants of these training algorithms, such as the use of different RBM input unit distributions, a simple way of combining gradient estimators to improve performance, as well as on-line versions of those algorithms.}
 }
 
@@ -3991,7 +3986,7 @@
      title = {The Need for Open Source Software in Machine Learning.},
       year = {2007},
       note = {institution: Fraunhofer Publica [http://publica.fraunhofer.de/oai.har] (Germany)},
-  crossref = {JMLR-shorter},
+  journal = {Journal of Machine Learning Research},
   abstract = {all authors: Sonnenburg, S. and Braun, M.L. and Ong, C.S. and Bengio, S. and Bottou, L. and Holmes, G. and {LeCun}, Y. and M{\~{A}}¼ller, K.-R. and Pereira, F. and Rasmussen, C.E. and R{\~{A}}¤tsch, G. and Sch{\~{A}}{\P}lkopf, B. and Smola, A. and Vincent, P. and Weston, J. and Williamson, R.C.
 
 Open source tools have recently reached a level of maturity which makes them suitable for building large-scale real-world systems. At the same time, the field of machine learning has developed a large body of powerful learning algorithms for diverse applications. However, the true potential of these methods is not used, since existing implementations are not openly shared, resulting in software with low usability, and weak interoperability. We argue that this situation can be significantly improved by increasing incentives for researchers to publish their software under an open source model. Additionally, we outline the problems authors are faced with when trying to publish algorithmic implementations of machine learning methods. We believe that a resource of peer reviewed software accompanied by short articles would be highly valuable to both the machine learning and the general scientific community.}
@@ -4466,11 +4461,6 @@
   publisher = {MIT Press}
 }
 
-@ARTICLE{JMLR,
-   journal = {Journal of Machine Learning Research},
-      year = {-1}
-}
-
 @INPROCEEDINGS{NIPS19,
      editor = {{Sch{\"{o}}lkopf}, Bernhard and Platt, John and Hoffman, Thomas},
       title = {Advances in Neural Information Processing Systems 19 (NIPS'06)},
@@ -4702,10 +4692,6 @@
        year = {-1},
   publisher = {Morgan Kaufmann}
 }
-@ARTICLE{JMLR-shorter,
-   journal = {JMLR},
-      year = {-1}
-}
 @INPROCEEDINGS{NIPS1-shorter,
       title = {NIPS'88},
   booktitle = {NIPS 1},
@@ -4840,3 +4826,5 @@
   booktitle = {AISTATS'2009},
        year = {-1}
 }
+
+

--- a/writeup/techreport.tex	Sat Sep 18 16:32:08 2010 -0400
+++ b/writeup/techreport.tex	Sat Sep 18 16:44:46 2010 -0400
@@ -1011,9 +1011,9 @@
 A Flash demo of the recognizer (where both the MLP and the SDA can be compared) 
 can be executed on-line at {\tt http://deep.host22.com}.
 
-\newpage
+%\newpage
 {
-\bibliography{strings,strings-short,strings-shorter,ift6266_ml,aigaion-shorter,specials}
+\bibliography{strings,strings-short,strings-shorter,ift6266_ml,specials,aigaion-shorter}
 %\bibliographystyle{plainnat}
 \bibliographystyle{unsrtnat}
 %\bibliographystyle{apalike}