Matrix regularization techniques for online multitask learning

In this paper we examine the problem of prediction with expert advice in a setup where the learner is presented with a sequence of examples coming from different tasks. In order for the learner to be able to benefit from performing multiple tasks simultaneously, we make assumptions of task relatedness by constraining the comparator to use a lesser number of best experts than the number of tasks. We show how this corresponds naturally to learning under spectral or structural matrix constraints, and propose regularization techniques to enforce the constraints. The regularization techniques proposed here are interesting in their own right and multitask learning is just one application for the ideas. A theoretical analysis of one such regularizer is performed, and a regret bound that shows benefits of this setup is reported.

Closing the gap between bandit and full-information online optimization : high-probability regret bound

We demonstrate a modification of the algorithm of Dani et al for the online linear optimization problem in the bandit setting, which allows us to achieve an O( \sqrt{T ln T} ) regret bound in high probability against an adaptive adversary, as opposed to the in expectation result against an oblivious adversary of Dani et al. We obtain the same dependence on the dimension as that exhibited by Dani et al. The results of this paper rest firmly on those of Dani et al and the remarkable technique of Auer et al for obtaining high-probability bounds via optimistic estimates. This paper answers an open question: it eliminates the gap between the high-probability bounds obtained in the full-information vs bandit settings.

Adaptive online gradient descent

We study the rates of growth of the regret in online convex optimization. First, we show that a simple extension of the algorithm of Hazan et al eliminates the need for a priori knowledge of the lower bound on the second derivatives of the observed functions. We then provide an algorithm, Adaptive Online Gradient Descent, which interpolates between the results of Zinkevich for linear functions and of Hazan et al for strongly convex functions, achieving intermediate rates between [square root T] and [log T]. Furthermore, we show strong optimality of the algorithm. Finally, we provide an extension of our results to general norms.

Doorway to research : Issues in the development of an interactive website for international graduate students

This paper describes results of a study evaluating the content, functionality and design features of an innovative online website called the Doorway to Research (http://rsc.acid.net.au/Main.aspx) , which was developed to support international graduate students studying at universities in Australia. First, the key features of the website are described. Second, the result of a pilot study involving 12 students and faculty members who tested key aspects of the design, content and functionality of the website and provided written and oral feedback base on task-based questions and focus group discussions are explored. Finally, recommendations for future development are presented. Results of the study indicate general student satisfaction with the website and its design, content and functionality, with specific areas identified for further development.

Influence of preexercise muscle glycogen content on transcriptional activity of metabolic and myogenic genes in well-trained humans

To determine whether pre-exercise muscle glycogen content influences the transcription of several early-response genes involved in the regulation of muscle growth, seven male strength-trained subjects performed one-legged cycling exercise to exhaustion to lower muscle glycogen levels (Low) in one leg compared with the leg with normal muscle glycogen (Norm) and then the following day completed a unilateral bout of resistance training (RT). Muscle biopsies from both legs were taken at rest, immediately after RT, and after 3 h of recovery. Resting glycogen content was higher in the control leg (Norm leg) than in the Low leg (435 ± 87 vs. 193 ± 29 mmol/kg dry wt; P < 0.01). RT decreased glycogen content in both legs (P < 0.05), but postexercise values remained significantly higher in the Norm than the Low leg (312 ± 129 vs. 102 ± 34 mmol/kg dry wt; P < 0.01). GLUT4 (3-fold; P < 0.01) and glycogenin mRNA abundance (2.5-fold; not significant) were elevated at rest in the Norm leg, but such differences were abolished after exercise. Preexercise mRNA abundance of atrogenes was also higher in the Norm compared with the Low leg [atrogin: ?14-fold, P < 0.01; RING (really interesting novel gene) finger: ?3-fold, P < 0.05] but decreased for atrogin in Norm following RT (P < 0.05). There were no differences in the mRNA abundance of myogenic regulatory factors and IGF-I in the Norm compared with the Low leg. Our results demonstrate that 1) low muscle glycogen content has variable effects on the basal transcription of select metabolic and myogenic genes at rest, and 2) any differences in basal transcription are completely abolished after a single bout of heavy resistance training. We conclude that commencing resistance exercise with low muscle glycogen does not enhance the activity of genes implicated in promoting hypertrophy.

Online banking customization via tag-based interaction

In this paper, we describe ongoing work on online banking customization with a particular focus on interaction. The scope of the study is confined to the Australian banking context where the lack of customization is evident. This paper puts forward the notion of using tags to facilitate personalized interactions in online banking. We argue that tags can afford simple and intuitive interactions unique to every individual in both online and mobile environments. Firstly, through a review of related literature, we frame our work in the customization domain. Secondly, we define a range of taggable resources in online banking. Thirdly, we describe our preliminary prototype implementation with respect to interaction customization types. Lastly, we conclude with a discussion on future work.