Skip to content

Commit

Permalink
Add link to Ponder paper
Browse files Browse the repository at this point in the history
Signed-off-by: Lehmann_Fabian <[email protected]>
  • Loading branch information
Lehmann-Fabian committed Oct 10, 2024
1 parent c482255 commit 2aecf43
Showing 1 changed file with 1 addition and 1 deletion.
2 changes: 1 addition & 1 deletion README.md
Original file line number Diff line number Diff line change
Expand Up @@ -152,7 +152,7 @@ The following strategies are available:
| linear/lr | The Linear predictor, will try to predict a memory usage that is linear to the task input size. |
| linear2/lr2 | The Linear predictor with an unequal loss function. The loss penalizes underprediction more than overprediction. |
| mean | The Mean predictor predicts the mean memory seen so far. Prediction is independent of the input size. |
| ponder | The Ponder predictor is an advanced memory prediction strategy that ponders between linear regression with unequal loss and historic values. Details are provided in our paper [tbd](). |
| ponder | The Ponder predictor is an advanced memory prediction strategy that ponders between linear regression with unequal loss and historic values. Details are provided in our paper [https://arxiv.org/pdf/2408.00047.pdf](https://arxiv.org/pdf/2408.00047.pdf). |
| constX | Predicts a constant value (X), if no X is given, it predicts 0. |
| polyX | Prediction will be based on the Xth polynomial function based on a task's input size. If no X is provided, it uses X=2. |

Expand Down

0 comments on commit 2aecf43

Please sign in to comment.