ps:
I find it weird to do an optimization in which you know the global
optimum but do optimization anyway in hope of finding a worse local optimum.
--
___
Scikit-learn-general m
Hi Arezou.
As far as I know, if you don't regularize at all, the global optimum of
a compressing autoencoder is given by PCA, even with a sigmoid.
The optimization is non-convex, though, so it will be rather unlikely
that you will end up with a PCA-Equivalent basis.
The proof for the global opti
Hi everybody,
Does any one know if a sparse autoencoder with sigmoidal function (as its
activation function ) and less hidden units than the inputs units, works as a
feature extractor or as PCA?
I know if the number of hidden units are less than the number of input units
and if the activation f
