aboutsummaryrefslogtreecommitdiff
path: root/thesis/parts/design.tex
diff options
context:
space:
mode:
authorAria Shrimpton <me@aria.rip>2024-03-27 17:10:21 +0000
committerAria Shrimpton <me@aria.rip>2024-03-27 17:10:21 +0000
commit2f75ce401867feaddce578e09be542407c327f48 (patch)
tree9865e39aa815787a17fcaccd155bbe25d5e93f70 /thesis/parts/design.tex
parent98340e2ddf76a50b7341444a161362b1d01beb22 (diff)
analysis & write up cost models
Diffstat (limited to 'thesis/parts/design.tex')
-rw-r--r--thesis/parts/design.tex2
1 files changed, 1 insertions, 1 deletions
diff --git a/thesis/parts/design.tex b/thesis/parts/design.tex
index 6d9c482..fba4437 100644
--- a/thesis/parts/design.tex
+++ b/thesis/parts/design.tex
@@ -139,7 +139,7 @@ In the case of \code{Vec::contains}, we would expect the resulting polynomial to
In our implementation, we fit a function of the form $x_0 + x_1 n + x_2 n^2 + x_3 \log_2 n$, using regular least-squares fitting.
Whilst we could use a more complex technique, in practice this is good enough: Most common operations are polynomial at worst, and more complex models risk overfitting.
-
+\todo{mention discarding outliers}
%% Limitations
This method works well for many operations and structures, although has notable limitations.