Skip to content

Commit a0fa45c

Browse files
committed
Pushing the docs to dev/ for branch: master, commit b70472bd241cb28ac8acfc4e69ccab61acccf14b
1 parent 9805d7f commit a0fa45c

File tree

1,220 files changed

+3791
-3791
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

1,220 files changed

+3791
-3791
lines changed

dev/_downloads/33bc25666e895f6720c86dffe127d651/plot_randomized_search.ipynb

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -15,7 +15,7 @@
1515
"cell_type": "markdown",
1616
"metadata": {},
1717
"source": [
18-
"\n# Comparing randomized search and grid search for hyperparameter estimation\n\n\nCompare randomized search and grid search for optimizing hyperparameters of a\nrandom forest.\nAll parameters that influence the learning are searched simultaneously\n(except for the number of estimators, which poses a time / quality tradeoff).\n\nThe randomized search and the grid search explore exactly the same space of\nparameters. The result in parameter settings is quite similar, while the run\ntime for randomized search is drastically lower.\n\nThe performance is may slightly worse for the randomized search, and is likely\ndue to a noise effect and would not carry over to a held-out test set.\n\nNote that in practice, one would not search over this many different parameters\nsimultaneously using grid search, but pick only the ones deemed most important.\n"
18+
"\n# Comparing randomized search and grid search for hyperparameter estimation\n\n\nCompare randomized search and grid search for optimizing hyperparameters of a\nlinear SVM with SGD training.\nAll parameters that influence the learning are searched simultaneously\n(except for the number of estimators, which poses a time / quality tradeoff).\n\nThe randomized search and the grid search explore exactly the same space of\nparameters. The result in parameter settings is quite similar, while the run\ntime for randomized search is drastically lower.\n\nThe performance is may slightly worse for the randomized search, and is likely\ndue to a noise effect and would not carry over to a held-out test set.\n\nNote that in practice, one would not search over this many different parameters\nsimultaneously using grid search, but pick only the ones deemed most important.\n"
1919
]
2020
},
2121
{
Binary file not shown.
Binary file not shown.

dev/_downloads/e513756bb76c5dd32d311eb11e341567/plot_randomized_search.py

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44
=========================================================================
55
66
Compare randomized search and grid search for optimizing hyperparameters of a
7-
random forest.
7+
linear SVM with SGD training.
88
All parameters that influence the learning are searched simultaneously
99
(except for the number of estimators, which poses a time / quality tradeoff).
1010

dev/_downloads/scikit-learn-docs.pdf

4.26 KB
Binary file not shown.

dev/_images/iris.png

0 Bytes

0 commit comments

Comments
 (0)