Stratification Learning

What is Stratification Learning?

Stratification learning (SL) is a new machine learning paradigm developed in RIKEN AIP-FUJITSU Collaboration Center (RAFCC), a leading research institute of artificial intelligence in Japan.

Beyond manifold learning

Stratification learning extends the concept of manifold learning for better handling of geometrically structured data in high dimensional spaces. Manifold learning relies on the assumption that high dimensional data in real-world applications is often sparse and distributed along with a low dimensional manifold. Stratification learning assumes that data are distributed along with a stratified space, which is a composite of manifolds of varying dimensions. Moreover, such data are stratified according to strata, i.e., component manifolds of the stratified space. By utilizing such a geometric structure, we can achieve an unprecedentedly efficient learning!

Where do stratified spaces arise?

Data distributed around a stratified space appear in the following examples. The applicability of SL is not limited to those; there would be many applications waiting to be discoverd!

Multiobjective optimization

Under some mild conditions, the Pareto critical set and local Pareto set of generic multiobjective optimization problems admin a stratification. Numerical optimizers give a sample from these solution sets. Such a sample is a good leaning source of stratification learning.

Biological data modeling

A stratified space also arises in modeling the genetypic divergence of a species in evolutionary biology. It is known that genotypes of a species distribute along with a “curved” simplex. A simplex is the simplest instance of stratified spaces, whose strata are vertices, edges, faces, and so on. By using a simplicial model, we can efficiently represent such a biological phenomenon.

Methods of Stratification Learning

Bezier simplex

The Bezier simplex is a high dimensional version of the Bezier curve. Since any stratified space is triangulable, the Bezier simplex is a primitive object to build up a complex stratified object.

Refereed Papers

The following list provides published papers of SL and source code for reproducing experiments therein.

  1. Ken Kobayashi, Naoki Hamada, Akiyoshi Sannai, Akinori Tanaka, Kenich Bannai and Masashi Sugiyama: “Bézier Simplex Fitting: Describing Pareto Fronts of Simplicial Problems with Small Samples in Multi-Objective Optimization,” in Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI-19), 2304-2313 (2019).
  2. Akinori Tanaka, Akiyoshi Sannai, Ken Kobayashi and Naoki Hamada: “Asymptotic Risk of Bézier Simplex Fitting,” in Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI-20), in press.

Tools

  1. PyTorch-BSF: PyTorch implementation of Bezier simplex fitting.