References
- Agarwal, A., Daumé, H., and Gerber, S. (2010). Learning Multiple Tasks Using Manifold Regularization, in Proceedings of Advances in Neural Information Processing Systems, pp. 46–54.
- Agarwal, A., Rakhlin, A., and Bartlett, P. (2008). Matrix Regularization Techniques for Online Multitask Learning, Technical Report UCB/EECS-2008-138, EECS Department, University of California, Berkeley.
- Bartlett, P., Hazan, E., and Rakhlin, A. (2008). Adaptive Online Gradient Descent, in Proceedings of Advances in Neural Information Processing Systems, pp. 65–72.
- Bengio, Y. and Frasconi, P. (1996). Input–Output HMM’s for Sequence Processing, IEEE Transactions on Neural Networks 7: 1231–1249. doi:10.1109/72.536317
- Bertsekas, D. (1999). Nonlinear Programming, Boston: Athena Scientific.
- Brown, C., Freedman, V., Sastry, N., McGonagle, K., Pfeffer, F., Schoeni, R., and Stafford, F. (2015). Panel Study of Income Dynamics, Public Use Dataset, Ann Arbor: University of Michigan.
- Cesa-Bianchi, N. and Lugosi, G. (2006). Prediction, Learning, and Games, Cambridge: Cambridge University Press.
- Chiang, C., Yang, T., Lee, C., Mahdavi, M., Lu, C., Jin, R., and Zhu, S. (2012). Online Optimization with Gradual Variations, in Proceedings of Conference on Learning Theory, vol. 23, pp. 6.1–6.20.
- Dietterich, T. (2002). Machine Learning for Sequential Data: A Review, in Structural, Syntactic, and Statistical Pattern Recognition, pp. 15–30.
- Dontchev, A. and Rockafellar, R. (2009). Implicit Functions and Solution Mappings: A View from Variational Analysis, New York: Springer.
- Duchi, J., Hazan, E., and Singer, Y. (2011). Adaptive Subgradient Methods for Online Learning and Stochastic Optimization, Journal of Machine Learning Research 12: 2121–2159.
- Duchi, J. and Singer, Y. (2009). Efficient Online and Batch Learning Using Forward Backward Splitting, Journal of Machine Learning Research 10: 2899–2934.
- Evgeniou, T. and Pontil, M. (2004). Regularized Multi-Task Learning, in Proceedings of Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’04, pp. 109–117.
- Fawcett, T. (2006). An Introduction to ROC Analysis, Pattern Recognition Letters 27: 861–874. doi:10.1016/j.patrec.2005.10.010
- Fawcett, T. and Provost, F. (1997) Adaptive Fraud Detection, Data Mining and Knowledge Discovery 1: 291–316. doi:10.1023/A:1009700419189
- Hastie, T., Tibshirani, R., and Friedman, J. (2001). The Elements of Statistical Learning: Data Mining, Inference, and Prediction, New York: Springer.
- Hazan, E., Agarwal, A., and Kale, S. (2007). Logarithmic Regret Algorithms for Online Convex Optimization, Machine Learning 69: 169–192. doi:10.1007/s10994-007-5016-8
- Mohri, M., Rostamizadeh, A., and Talwalkar, A. (2012). Foundations of Machine Learning, Boston: MIT Press.
- Murphy, K. and Welch, F. (1990). Empirical Age-Earnings Profiles, Journal of Labor Economics, 8: 202–229. doi:10.1086/298220
- Pan, S. and Yang, Q. (2010). A Survey on Transfer Learning, IEEE Transactions on Knowledge and Data Engineering 22: 1345–1359. doi:10.1109/TKDE.2009.191
- Qian, N. and Sejnowski, T. (1988). Predicting the Secondary Structure of Globular Proteins Using Neural Network Models, Journal of Molecular Biology 202: 865–884. doi:10.1016/0022-2836(88)90564-5
- Rakhlin, A. and Sridharan, K. (2012). Online Learning with Predictable Sequences, arXiv: 1208.3728.
- Shalev-Shwartz, S. and Kakade, S. (2009). Mind the Duality Gap: Logarithmic Regret Algorithms for Online Optimization, in Proceedings of Advances in Neural Information Processing Systems, pp. 1457–1464.
- Shalev-Shwartz, S. and Singer, Y. (2007). Convex Repeated Games and Fenchel Duality, in Proceedings of Advances in Neural Information Processing Systems, pp. 1265–1271.
- Shalev-Shwartz, S. and Singer, Y. (2007). Logarithmic Regret Algorithms for Strongly Convex Repeated Games, Technical Report, Hebrew University.
- Towfic, Z., Chu, J., and Sayed, A. (2013). Online Distributed Online Classification in the Midst of Concept Drifts, Neurocomputing 112: 138–152. doi:10.1016/j.neucom.2012.12.043
- Wächter, A. and Biegler, L. T. (2006). On the Implementation of a Primal-Dual Interior Point Filter Line Search Algorithm for Large-Scale Nonlinear Programming, Mathematical Programming 106: 25–57. doi:10.1007/s10107-004-0559-y
- Wilson, C. and Veeravalli, V. (2016a). Adaptive Sequential Learning, in Proceedings of Asilomar Conference on Signals, Systems and Computers, pp. 326–330.
- Wilson, C. and Veeravalli, V. (2016b). Adaptive Sequential Optimization with Applications to Machine Learning, in Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing, pp. 2642–2646.
- Wilson, C., Veeravalli, V. V., and Nedić, A. (2018). Adaptive Sequential Stochastic Optimization, IEEE Transactions on Automatic Control 64: 496–509. doi:10.1109/TAC.2018.2816168
- Xiao, L. (2010). Dual Averaging Methods for Regularized Stochastic Learning and Online Optimization, Journal of Machine Learning Research 11: 2543–2596.
- Zhang, Y. and Yeung, D. (2012). A Convex Formulation for Learning Task Relationships in Multi-Task Learning, arXiv: 1203.3536.
- Zinkevich, M. (2003). Online Convex Programming and Generalized Infinitesimal Gradient Ascent, in Proceedings of International Conference on Machine Learning, pp. 928–936.