A Pareto-based Approach to Multi-Objective Machine Learning
- When?
- Thursday 12 May 2011, 15:30 to 16:30
- Where?
- 39BB02
- Open to:
- Students, Staff
- Speaker:
- Professor Yaochu Jin
Machine learning is inherently a multi-objective task. Traditionally, however, either only one of the objectives is adopted as the cost function or multiple objectives are aggregated to a scalar cost function. This can be mainly attributed to the fact that most conventional learning algorithms can only deal with a scalar cost function. Over the last decade, efforts on solving machine learning problems using the Pareto-based multi-objective optimization methodology have gained increasing impetus, thanks to the great success in multi-objective optimization using evolutionary algorithms and other population-based stochastic search methods.
It has been shown that Pareto-based multi-objective learning approaches are more powerful compared to learning algorithms with a scalar cost function in addressing various topics of machine learning, such as clustering, feature selection, improvement of generalization ability, knowledge extraction, and ensemble generation.
One common benefit of the different multi-objective learning approaches is that a deeper insight into the learning problem can be gained by analyzing the Pareto front composed of multiple Pareto-optimal solutions. This talk provides an overview of recent advances in multi-objective machine learning, focusing on supervised learning. In addition, a number of case studies are provided to illustrate the major benefits of the Pareto-based approach to machine learning, e.g., how to identify interpretable models and models that can generalize on unseen data from the obtained Pareto-optimal solutions.