Skip to content

Commit 18d7919

Browse files
nmheimjanfrancu
authored andcommitted
eql project; rule project draft
1 parent d62fb4d commit 18d7919

File tree

1 file changed

+30
-3
lines changed

1 file changed

+30
-3
lines changed

docs/src/projects.md

Lines changed: 30 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -8,10 +8,37 @@ extensive project together.
88
For you inspiration of what such a project could look like we have four
99
suggestions for you (which you can of course choose to work on as well).
1010

11-
## The *Improved Equation Learner* and its symbolic representation
11+
## The Equation Learner And Its Symbolic Representation
1212

13-
## An Evolutionary Algorithm applied to Julia's AST
13+
In many scientific and engineering one searches for interpretable (i.e.
14+
human-understandable) models instead of the black-box function approximators
15+
that neural networks provide.
16+
The [*equation learner*](http://proceedings.mlr.press/v80/sahoo18a.html) (EQL)
17+
is one approach that can identify concise equations that describe a given
18+
dataset.
1419

15-
## A Rule Learning Algorithm
20+
The EQL is essentially a neural network with different unary or binary
21+
activation functions at each indiviual unit. The network weights are
22+
regularized during training to obtain a sparse model which hopefully results in
23+
a model that represents a simple equation.
24+
25+
The goal of this project is to implement the EQL, and if there is enough time
26+
the [*improved equation learner*](https://arxiv.org/abs/2105.06331) (iEQL).
27+
The equation learners should be tested on a few toy problems (possibly inspired
28+
by the tasks in the papers). Finally, you will implement functionality that
29+
can transform the learned model into a symbolic, human readable, and exectuable
30+
Julia expression.
31+
32+
## An Evolutionary Algorithm Applied To Julia's AST
1633

1734
## Distributed Optimization Package
35+
36+
## A Rule Learning Algorithm
37+
38+
[Rule-based models](https://christophm.github.io/interpretable-ml-book/rules.html)
39+
are simple and very interpretable models that have been around for a long time
40+
and are gaining popularity again.
41+
The goal of this project is to implement a
42+
[sequential covering](https://christophm.github.io/interpretable-ml-book/rules.html#sequential-covering)
43+
algorithm called [`RIPPER`](http://www.cs.utsa.edu/~bylander/cs6243/cohen95ripper.pdf)
44+
and evaluate it on a number of datasets.

0 commit comments

Comments
 (0)