1. Bi-convexity and bi-martingales;Aumann;Israel Journal of Mathematics,1986
2. Bach, F. R. & Moulines, E. (2011). Non-asymptotic analysis of stochastic approximation algorithms for machine learning. In Proceedings of the 25th annual conference on neural information processing systems, (pp. 451–459).
3. Complex-valued autoencoders;Baldi;Neural Networks,2012
4. Universal approximation bounds for superpositions of a sigmoidal function;Barron;IEEE Transactions on Information Theory,1993
5. Bertsekas, D. P. (2010). Incremental gradient, subgradient, and proximal methods for convex optimization: A Survey, Tech. rep., Massachusetts Institute of Technology Labratory for Information and Decision Systems. URL http://arxiv.org/abs/1507.01030.