Tanya Pedersen is a third-year Bachelor of Information Technology student with Federation University. Tanya’s primary area of interest is Artificial Intelligence, she hopes to further explore Artificial Intelligence over the next several years by undertaking postgraduate research in the field.
Determining and Evaluating Bounded Algorithms for MOMAB
The project can be broken into four tasks, those being:
The formulation of different confidence intervals for Maximum Utility Loss in the Multi-Objective Multi-Armed Bandits environment.
The development of a learning algorithm that terminates once a Maximum Utility Loss bound is met.
The development of a learning algorithm that guarantees a MOPAC bound.
And finally an empirical and theoretical comparison of our algorithms with those of Auer et. al (2016).