Spaces:
Sleeping
Sleeping
MilesCranmer
commited on
Commit
•
97d94c6
1
Parent(s):
6518f83
Update todo
Browse files
README.md
CHANGED
@@ -147,7 +147,6 @@ pd.DataFrame, Results dataframe, giving complexity, MSE, and equations
|
|
147 |
|
148 |
# TODO
|
149 |
|
150 |
-
- [ ] Record very best individual in each population, and return at end.
|
151 |
- [ ] Update hall of fame every iteration
|
152 |
- [ ] Calculate feature importances of future mutations, by looking at correlation between residual of model, and the features.
|
153 |
- Store feature importances of future, and periodically update it.
|
@@ -162,6 +161,7 @@ pd.DataFrame, Results dataframe, giving complexity, MSE, and equations
|
|
162 |
- Current most expensive operations:
|
163 |
- [ ] Calculating the loss function - there is duplicate calculations happening.
|
164 |
- [x] Declaration of the weights array every iteration
|
|
|
165 |
- [x] Write our own tree copy operation; deepcopy() is the slowest operation by far.
|
166 |
- [x] Hyperparameter tune
|
167 |
- [x] Create a benchmark for accuracy
|
|
|
147 |
|
148 |
# TODO
|
149 |
|
|
|
150 |
- [ ] Update hall of fame every iteration
|
151 |
- [ ] Calculate feature importances of future mutations, by looking at correlation between residual of model, and the features.
|
152 |
- Store feature importances of future, and periodically update it.
|
|
|
161 |
- Current most expensive operations:
|
162 |
- [ ] Calculating the loss function - there is duplicate calculations happening.
|
163 |
- [x] Declaration of the weights array every iteration
|
164 |
+
- [x] Record very best individual in each population, and return at end.
|
165 |
- [x] Write our own tree copy operation; deepcopy() is the slowest operation by far.
|
166 |
- [x] Hyperparameter tune
|
167 |
- [x] Create a benchmark for accuracy
|