Meta learning (computer science)

Meta learning is a subfield of Machine learning where automatic learning algorithms are applied on meta-data about machine learning experiments. Although different researchers hold different views as to what the term exactly means (see below), the main goal is to use such meta-data to understand how automatic learning can become flexible in solving different kinds of learning problems, hence to improve the performance of existing learning algorithms.

Flexibility is very important because each learning algorithm is based on a set of assumptions about the data, its inductive bias. This means that it will only learn well if the bias matches the data in the learning problem. A learning algorithm may perform very well on one learning problem, but very badly on the next. From a non-expert point of view, this poses strong restrictions on the use of machine learning or data mining techniques, since the relationship between the learning problem (often some kind of database) and the effectiveness of different learning algorithms is not yet understood.

By using different kinds of meta-data, like properties of the learning problem, algorithm properties (like performance measures), or patterns previously derived from the data, it is possible to select, alter or combine different learning algorithms to effectively solve a given learning problem. Critiques of meta learning approaches bear a strong resemblance to the critique of metaheuristic, which can be said to be a related problem.

Definition

A proposed definition^[1] for what qualifies as a meta learning system considers three requirements:

1. The system must include a learning subsystem, which adapts with experience.
2. Experience is gained by exploiting meta knowledge extracted
   • ...in a previous learning episode on a single dataset.
   • ...from different domains or problems.
3. Learning bias must be chosen dynamically.

The term bias in the last point refers to the set of assumptions influencing the choice of hypotheses for explaining the data^[2] and must not be confused with the notion of bias represented in the bias-variance dilemma. Meta learning is concerned with two aspects of learning bias; declarative bias specifies the representation of the space of hypotheses, and affects the size of the search space (i.e. represent hypotheses using linear functions only) while procedural bias imposes constraints on the ordering of the inductive hypotheses (i.e. preferring smaller hypotheses).

Different views on meta learning

These are some of the views on (and approaches to) meta learning, please note that there exist many variations on these general approaches:

• Discovering meta-knowledge works by inducing knowledge (e.g. rules) that expresses how each learning method will perform on different learning problems. The meta-data is formed by characteristics of the data (general, statistical, information-theoretic,... ) in the learning problem, and characteristics of the learning algorithm (type, parameter settings, performance measures,...). Another learning algorithm then learns how the data characteristics relate to the algorithm characteristics. Given a new learning problem, the data characteristics are measured, and the performance of different learning algorithms can be predicted. Hence, one can select the algorithms best suited for the new problem, at least if the induced relationship holds.
• Stacked generalisation works by combining a number of (different) learning algorithms. The meta-data is formed by the predictions of those different algorithms. Then another learning algorithm learns from this meta-data to predict which combinations of algorithms give generally good results. Given a new learning problem, the predictions of the selected set of algorithms are combined (e.g. by (weighted) voting) to provide the final prediction. Since each algorithm is deemed to work on a subset of problems, a combination is hoped to be more flexible and still able to make good predictions.
• Boosting is related to stacked generalisation, but uses the same algorithm multiple times, where the examples in the training data get different weights over each run. This yields different predictions, each focused on rightly predicting a subset of the data, and combining those predictions leads to better (but more expensive) results.
• Dynamic bias selection works by altering the inductive bias of a learning algorithm to match the given problem. This is done by altering key aspects of the learning algorithm, such as the hypothesis representation, heuristic formulae, or parameters. Many different approaches exist.
• Inductive transfer also called learning to learn, studies how the learning process can be improved over time. Meta-data consists of knowledge about previous learning episodes, and is used to efficiently develop an effective hypothesis for a new task. A related approach is called learning to learn, in which the goal is to use acquired knowledge from one domain to help learning in other domains.
• Other approaches using meta-data to improve automatic learning are learning classifier systems, case-based reasoning and constraint satisfaction.

References

• Vilalta R. and Drissi Y. (2002). A perspective view and survey of meta-learning, Artificial Intelligence Review, 18(2), 77—95.
• Giraud-Carrier, C., & Keller, J. (2002). Dealing with the data flood, J. Meij (ed), chapter Meta-Learning. STT/Beweton, The Hague.
• Lemke C., Budka M., and Gabrys B. (2013). Metalearning - a survey of trends and technologies, Artificial Intelligence Review, 44(1), 117—130.
• Brazdil P., Giraud-Carrier C., Soares C., Vilalta R. (2009) Metalearning: applications to data mining, chapter Metalearning: Concepts and Systems, Springer.

See also

• Metalearning article in Scholarpedia