kaggle-abstract-reasoning

KO | EN

gitlite — search

#python #java #python3 #arduino #golang #machine-learning #rust #html #flask #javascript #seismology #nodejs

kaggle-abstract-reasoning

★ 23 Open GitHub ↗

Our solution of the Kaggle Abstraction and Reasoning Challenge

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Kaggle Abstraction and Reasoning Challenge
This is our solution of [Kaggle Abstraction and Reasoning Challenge](https://www.kaggle.com/c/abstraction-and-reasoning-challenge) which scored 10th on the leaderboard (there were 915 competitors).

## The challenge
The Abstraction and Reasoning Corpus (https://github.com/fchollet/ARC) offers 400 tasks in the train dataset, 
400 tasks in the validation set, and 100 tasks in the test set (hidden). Every task is a little similar to some tasks from IQ test.
An example of a task: 
![Task 1](https://raw.githubusercontent.com/artyompal/kaggle-abstract-reasoning/master/pic/task1.png)

So, every task is a little puzzle. There are 2 to 4 images in the "train" set, and 1-2 "test" images, 
for which we have to provide an answer. There is some mapping between inputs and outputs, which our program has to guess. 
For example, the task above is obviously about changing the color of any nested figure to the color of its surrounding. 
Oh, by the way, output image shape might differ from the input's shape, we must guess it too! 
All image dimensions are not greater than 30x30.

The task is solved if and only if all predicted image pixels are correct and predicted image shape is correct. More examples below.

Draw horizontal and vertical lines: 
![Task 2](https://raw.githubusercontent.com/artyompal/kaggle-abstract-reasoning/master/pic/task2.png)

Reshape figures, use all unique colors: 
![Task 3](https://raw.githubusercontent.com/artyompal/kaggle-abstract-reasoning/master/pic/task3.png)

Count the most frequent color at the top, put it to the bottom: 
![Task 4](https://raw.githubusercontent.com/artyompal/kaggle-abstract-reasoning/master/pic/task4.png)

Move shapes with overlap: 
![Task 5](https://raw.githubusercontent.com/artyompal/kaggle-abstract-reasoning/master/pic/task5.png)

Replicate figure on the right with colors and locations on the left: 
![Task d](https://raw.githubusercontent.com/artyompal/kaggle-abstract-reasoning/master/pic/taskd.png)

## How would you solve this?

Before reading below, take a minute and think if you can write a program to solve tasks like these. 
Keep in mind that such program is expected to solve new, unseen tasks of a similar nature, but not necessarily of one of aforementioned types.
Humans solve tasks like these easily. Tasks could involve something like moving pieces, sorting by some criterio, painting pixels,
projecting, using symmetry and so on.

## Our approach

We have build a Genetic Algorithm on top of Cellular Automata and global transformations. 
We created a Domain-Specific Language (DSL) which describes possible programs to solve such tasks. 
It has simple operations like move, paint, check neighbours and so on.

### Cellular Automata

Cellular Automaton (think Conway's Game of Life) is a set of rules which are repeatedly applied per-pixel to the input image 
until convergence is reached. Rules are something like: check neighbours and paint pixel or paint pixels in some direction.

### Global rules

Global rules are more interesting. They are:
* tile the input;
* flip or rotate;
* draw pixels, starting from the border;
* fill;
* remove rows;
* draw lines;
* split image;
* crop figure or crop non-background pixels;
* make holes;
* move pieces;
* and replace colors (this allows everything else work together).

### Genetic Algorithm

The number of possible combinations is combinatorial (i.e. huge). 
To iterate over this space efficiently, we use a genetic algorithm.
In a few words, this means that we start with a population of random programs, then we pick most promising ones and 
apply mutations and/or crossover. These are called asexual and sexual reproduction, correspondingly.

### Add more tricks

We introduced split and merge rules. This means that we can split image into several buffers, every figure is in its own buffer,
and apply transformations to every buffer independently. This greatly improves leaderboard score.

## Results
As a result, the algorithm solves even more complex tasks (which it wasn't supposed to solve originally). 
This task implies sorting bars by height and recoloring them:
![Task 10](https://raw.githubusercontent.com/artyompal/kaggle-abstract-reasoning/master/pic/task10.png)

## Building and running
From the root directory of this repo, do this:

```
pip install .
cd python-dsl-code
python genetics.py
```

## Preparing submission for Kaggle
```
cd python-dsl-code
python bake_kernel.py
```

This will generate a file called `kernel.py`. 
Create a script kernel on Kaggle, upload this file and hit Save.
After kernel runs, it will generate submission.csv.

## Technical details
Initially, everything was implemented in Python. After we teamed up, we identified Python code as a bottleneck 
and ported all rules to C++. This improved performance by a factor 50 to 100, so it allowed us to solve more complex tasks 
withing same time constraints.

We use pybind11 to build Python extension module.

## More information
This forum thread has more information on our solution; also, you can ask us any questions over there: https://www.kaggle.com/c/abstraction-and-reasoning-challenge/discussion/154294

You can also play with this notebook which has Python version of our code: https://www.kaggle.com/alexfritz/genetic-dsl-part-from-10th-place-python-version

## References
If you're looking for details of this challenge, evaluation metric, etc, you might want to read paper "On the Measure of Intelligence" by François Chollet: https://arxiv.org/abs/1911.01547

kaggle-abstract-reasoning

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README