[FAQ] : Homework 6 Q3 - my best n_estimators is 150, not 100: check DictVectorizer(sparse=...)
Maintainers usually reply within 2 days
Nobody has claimed this yet.
- #529 by @github-actions — closed without merging
Assessment
- Difficulty
- 1/5
- Estimated time
- Under an hour
- Newbie friendliness
- 25/100
- Issue type
- Documentation
- Clarity
- Clearly specified
- Activity status
- Stale
- Tech stack
- python, scikit-learn
- Domain
- documentation
Research direction
An open linked pull request (#529) is already addressing this FAQ, and the payload names no files. Check the repository’s existing FAQ format and compare the proposed change with the issue’s answer. Done means the FAQ follows the project’s conventions and clearly explains the sparse=True setting and its Q3 result.
Written by the indexing model from the issue text.
Description
Course
machine-learning-zoomcamp
Question
Homework 6 Q3: I sweep n_estimators over [10, 50, 100, 150] and my lowest validation RMSE is at 150, not 100. My random_state is 1 and my split calls are exactly as written. What am I doing wrong?
Answer
Almost certainly nothing — check your DictVectorizer. The homework says:
Use
DictVectorizer(sparse=True)to turn the dataframes into matrices.
If you used the default sparse=False (which is what the 06-trees lecture notebook uses, so
it is a very easy thing to copy), you get different numbers. Both runs below are identical code,
same random_state=1, same splits — only the sparse argument differs:
sparse=True (csr_matrix)
n_estimators=10 1.837054
n_estimators=50 1.771567
n_estimators=100 1.768136 <-- lowest -> answer 100
n_estimators=150 1.768804
sparse=False (ndarray)
n_estimators=10 1.839221
n_estimators=50 1.772875
n_estimators=100 1.768158
n_estimators=150 1.767692 <-- lowest -> answer 150
The Q3 answer flips: 100 with sparse=True, 150 with sparse=False. Use sparse=True, since
that is what the homework specifies, and submit 100.
Why do the numbers differ at all? scikit-learn's tree builder takes a different code path for CSR
sparse matrices than for dense arrays. The algorithm is the same, but floating-point summation
order and tie-breaking in split search differ slightly, and those tiny differences change which
samples land in which leaf. The effect is small (~0.002 RMSE here) but it is larger than the 100-vs-150
margin, which is only 0.0007 — so it flips the ranking.
The margin is genuinely tight, which is why this question is worth double-checking:
dv = DictVectorizer(sparse=True) # <- required by the homework
X_train = dv.fit_transform(df_train.to_dict(orient='records'))
X_val = dv.transform(df_val.to_dict(orient='records'))
For reference, the other questions are not sensitive to this setting — Q1 (model_year), Q4
(10) and Q5 (vehicle_weight) come out the same either way. Q2 shifts from 1.837 to 1.839, which
still rounds to the 1.837 option. Only Q3 actually changes.
Checklist
- I have searched existing FAQs and this question is not already answered
- The answer provides accurate, helpful information
- I have included any relevant code examples or links
- Dominant language
- Python
- Stars
- 8
- Forks
- 20
- Avg merge
- 4d 9h
- Merged PRs (30d)
- 27
Getting set up
- No Dockerfile or Docker Compose file
- No pull request template
- Read the contributing guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
More from DataTalksClub/faq
-
Two different inputs get the same XGBoost churn probability in my Flask API—does that mean my model is broken?Possibly taken @github-actions claimed this today. Openfaq-proposal
Difficulty 1/5 1-3 hours Newbie friendliness 85/100
DataTalksClub/faq#571 · 2 comments ·
Maintainers usually reply within 2 days
-
[FAQ] How do I use `GridSearchCV` with parallel processing, and how do I fix the scikit-learn parallel-processing warning?May be free again A pull request for this issue was closed without being merged. Openfaq-proposal
Difficulty 1/5 1-3 hours Newbie friendliness 86/100
DataTalksClub/faq#551 · 4 comments ·
Maintainers usually reply within 2 days
-
Difficulty 1/5 Under an hour Newbie friendliness 86/100
DataTalksClub/faq#550 · 1 comment ·
Maintainers usually reply within 2 days
-
Fixing ValueError: This solver needs samples of at least 2 classes in Logistic RegressionMay be free again A pull request for this issue was closed without being merged. Openfaq-proposal
Difficulty 2/5 1-3 hours Newbie friendliness 62/100
DataTalksClub/faq#532 · 2 comments ·
Maintainers usually reply within 2 days
-
[FAQ] Commit ID for ProjectsMay be free again A pull request for this issue was closed without being merged. Openfaq-proposal
Difficulty 1/5 Under an hour Newbie friendliness 84/100
DataTalksClub/faq#503 · 3 comments ·
Maintainers usually reply within 2 days
All issues in DataTalksClub/faq
Similar issues
-
Difficulty 2/5 1-3 hours Newbie friendliness 68/100
btclib-org/btclib#3062 ·
Maintainers usually reply within 1 day
-
area:evals area:infra enhancement
Difficulty 2/5 1-3 hours Newbie friendliness 74/100
jse-avl/support-bot#4 · 1 comment ·
-
bug good first issue
Difficulty 2/5 1-3 hours Newbie friendliness 85/100
qte77/agentic-job-offer-to-application-kit#487 · 1 comment ·
Maintainers usually reply within 1 day
-
Difficulty 2/5 1-3 hours Newbie friendliness 82/100
btclib-org/btclib-wallet#801 · 1 comment ·
Maintainers usually reply within 1 day
-
documentation good first issue
Difficulty 1/5 1-3 hours Newbie friendliness 94/100