Skip to content

Commit 946d0fd

Browse files
author
ercbk
committed
minor readme edits
1 parent 64cb3f6 commit 946d0fd

File tree

2 files changed

+3
-3
lines changed

2 files changed

+3
-3
lines changed

README.Rmd

+1-1
Original file line numberDiff line numberDiff line change
@@ -321,7 +321,7 @@ b_r + e_r + plot_layout(guides = "auto") +
321321

322322
#### Results:
323323

324-
* The longest runtime is under 30 minutes, so runtime isn't a large consideration if we are making a choice about sample size.
324+
* The longest runtime is under 30 minutes, so runtime isn't as large of a consideration if we are only comparing a few algorithms.
325325
* There isn't much difference in runtime between n = 100 and n = 2000.
326326
* For n = 100, there's a relatively large change in percent error when going from 1 repeat to 2 repeats. The error estimate then stabilizes for repeats 3 through 5.
327327
* n = 5000 gives poorer out-of-sample error estimates than n = 800 and n = 2000 for all values of repeats.

README.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -135,8 +135,8 @@ implementation and method used.
135135

136136
#### Results:
137137

138-
- The longest runtime is under 30 minutes, so runtime isn’t a large
139-
consideration if we are making a choice about sample size.
138+
- The longest runtime is under 30 minutes, so runtime isn’t as large
139+
of a consideration if we are only comparing a few algorithms.
140140
- There isn’t much difference in runtime between n = 100 and n =
141141
2000.
142142
- For n = 100, there’s a relatively large change in percent error when

0 commit comments

Comments
 (0)