The question
Compare a line and a polynomial workflow for Candy winpercent from sugarpercent. Decide whether the extra flexibility is supported.
data/ml-learning/ML-X02.csv Complete workflow and evidenceYour inputs
Challenge input · ML-X02
85 observations. One candy product in the survey. Load the CSV file yourself.
Download challenge input CSV · Original source dataset · Source and original dictionary
Ready to load: comma-delimited UTF-8, header row, no saved index. No filtering or target construction is required.
sugarpercent | winpercent |
|---|---|
| 0.732 | 66.9717 |
| 0.604 | 67.6029 |
| 0.011 | 32.2611 |
| 0.011 | 46.1165 |
| 0.906 | 52.3415 |
| 0.465 | 50.3475 |
| 0.604 | 56.9145 |
| 0.313 | 23.4178 |
Column meanings and units
sugarpercent: sugar percentile. pricepercent: price percentile. winpercent: percentage of survey matchups won. Ingredient, bar and multipack fields are 0/1 flags.
Percentile ranks are neither physical sugar percentages nor currency prices. Ratios of percentiles do not measure economic value. Chocolate and fruit flags can overlap; non-chocolate is not synonymous with fruit. The ML class target is defined by winpercent ≥ 50.
Ready to load: comma-delimited UTF-8, header row, no saved index. No filtering or target construction is required.
| Column | Stored type |
|---|---|
sugarpercent | float64 |
winpercent | float64 |
How we validate this model
Reserve 20% of the declared population for the final test using split seed 42. Use a random split.
Use the same five training folds, shuffled with seed 42, for reference comparison, candidates and selection. Use out-of-fold training predictions for diagnosis. Select with negative RMSE (larger is better) and compare with a training-mean reference. Report final RMSE in original target units. Open final-test evidence after selection and diagnosis.
The file is available in the Python working folder. Load it yourself.
- Compare a line and a
polynomialworkflow for Candywinpercentfromsugarpercent. - Decide whether the extra flexibility is supported.
cv_resultsreference_resultschosen_nameresidualsfinal_rmseOutputs you create
cv_results- Dataframe indexed by the requested model IDs, with
initial_score,selected_scoreandsettingscolumns. - Scores are observed mean training-fold scores;
settingsdescribes the chosen recipe.
- Dataframe indexed by the requested model IDs, with
reference_resultscross_validateresult for the dummy reference; test_score contains five scores.
chosen_name- Model ID nominated from training evidence.
residuals- Training-only
actual,predictedandactual-minus-predictedresidualevidence.
- Training-only
final_rmse- Root mean squared error in original target units.
Deliverables
These conditions describe a complete workflow. Use the declared Python variables beside the editor; Check inspects evidence from your Run.
Python name key
Teal outlines name table columns. Violet left rules name Python objects. Dotted rules mark syntax, functions and parameters. Use each name exactly as shown.
Words in this task
DataFrame- a table with rows and columns
- numeric
- a number, rather than text
- dummy
- a simple reference model used for comparison
- folds
- training-data groups used to compare models on the same held-out rows
- out-of-fold
- predictions made for training rows by models that did not fit those rows
- aligned
- matched by row or category identity, rather than guessed position
- residuals
- observed values minus predicted values
- RMSE
- root mean squared error: an error measure that gives larger errors more weight
Data boundary
- Load the supplied challenge CSV, define the declared
X/yand keep aligned row identities through the split. - Keep learned preparation inside each training fit.
- Load the supplied challenge CSV, define the declared
Validation & selection
- Compare the requested
initialmodel families with a dummy reference on matching trainingfolds. - Evaluate the declared
settingswhere applicable and choose from training evidence.
- Compare the requested
Diagnosis
- Use out-of-fold training predictions to inspect
residualsor class errors before opening the final test.
- Use out-of-fold training predictions to inspect
Final evidence
- Fit the nominated model on training rows and evaluate the reserved rows once.
- Report saved predictions, the requested metrics and labelled evidence
- Explain limitations without using the final test for further selection.
The playground workflow
Use the same data boundary as ML → Workflow: frame, split, explore, prepare, validate against a reference, diagnose, then make the final evaluation. Each step answers one question.
- Choose what to predictEstimate candy win rate from sugarpercent; each row is one candy.
- Split data and save the test setWhich rows are available for learning, and which are being saved for the final check?
- Explore training dataDoes sugarpercent show a training pattern related to candy win rate?
- Define the preparation recipeWhat preparation does this particular model need?
- Build the model pipelineDoes adding curved terms improve the numeric prediction relationship?
- Validate the initial modelDo validation results stay reasonably similar across folds?
- Compare with a simple referenceDo the selected features beat a simple guess on the same training folds?
- Tune the modelIs degree 2 or degree 3 more useful?
- Inspect validation errorsDo training-only residuals form a roughly random cloud around zero?
- Final testHow does the saved final candy win rate error compare with the initial-model CV and any selected-setting CV for Candy Power Ranking · 1 continuous feature, and what pattern did the model miss?
Data policy Keep target-derived inputs out of X. Use training-only selection for prediction.
Help Hints & explained solution
Choose the amount of help you need. Opening one hint does not reveal the others.
Hint 1 — Think
A lower training error is not enough.
Hint 2 — Tools
PolynomialFeatures, StandardScaler, Ridge, Pipeline and GridSearchCV.
Revisit: Regression checkpoint
Hint 3 — Approach
Compare both candidates on the same folds before choosing and opening final evidence.
Explained solution
This complete script replaces the editor contents. It includes the input setup and the workflow.
import numpy as np
import pandas as pd
df=pd.read_csv('data/ml-learning/ML-X02.csv')
from sklearn.base import clone
from sklearn.model_selection import train_test_split, KFold, cross_validate, cross_val_predict, GridSearchCV
from sklearn.dummy import DummyRegressor
from sklearn.metrics import root_mean_squared_error
import matplotlib.pyplot as plt
import seaborn as sns
X=df[['sugarpercent']]
y=df['winpercent']
X_train,X_test,y_train,y_test=train_test_split(X,y,test_size=.2,random_state=42)
folds=KFold(n_splits=5,shuffle=True,random_state=42)
candidates={}
grids={}
# Prepare inputs and construct the candidate pipeline.
preprocessor = 'passthrough'
from sklearn.pipeline import Pipeline
from sklearn.linear_model import LinearRegression
model = LinearRegression()
pipeline = Pipeline([('prepare', preprocessor), ('model', model)])
model = pipeline
candidates['simple_linear']=model
grids['simple_linear']=None
# Prepare inputs and construct the candidate pipeline.
from sklearn.pipeline import Pipeline
from sklearn.preprocessing import PolynomialFeatures, StandardScaler
from sklearn.linear_model import Ridge
polynomial = PolynomialFeatures(degree=2, include_bias=False)
scale = StandardScaler()
model = Ridge()
pipeline = Pipeline([('polynomial', polynomial), ('scale', scale), ('model', model)])
model = pipeline
candidates['polynomial']=model
grids['polynomial']={'polynomial__degree': [2, 3]}
# Validate initial candidates on matching training folds.
initial_results={name:cross_validate(candidate,X_train,y_train,cv=folds,scoring='neg_root_mean_squared_error') for name,candidate in candidates.items()}
# Compare with a simple reference before tuning.
reference_results=cross_validate(DummyRegressor(strategy='mean'),X_train,y_train,cv=folds,scoring='neg_root_mean_squared_error')
rows=[]
selected={}
for name,candidate in candidates.items():
initial=initial_results[name]
grid=grids[name]
if grid:
search=GridSearchCV(candidate,grid,cv=folds,scoring='neg_root_mean_squared_error',n_jobs=1)
search.fit(X_train,y_train)
selected[name]=search.best_estimator_
validation_score=float(search.best_score_)
settings=search.best_params_
else:
selected[name]=candidate
validation_score=float(np.mean(initial['test_score']))
settings='Keep defaults: no production search'
rows.append({'model':name,'initial_score':float(np.mean(initial['test_score'])),'selected_score':validation_score,'settings':str(settings)})
cv_results=pd.DataFrame(rows).set_index('model')
# This solution nominates by mean training-fold score. Other evidence-based choices can be defensible.
chosen_name=cv_results.selected_score.idxmax()
chosen=selected[chosen_name]
oof_predictions=cross_val_predict(chosen,X_train,y_train,cv=folds)
diagnostic_y=y_train
residuals=pd.DataFrame({'actual':diagnostic_y,'predicted':oof_predictions,'residual':diagnostic_y-oof_predictions})
fig,ax=plt.subplots(figsize=(6,4))
sns.scatterplot(x=residuals.predicted,y=residuals.residual,s=12,ax=ax)
ax.axhline(0,color='black')
ax.set(xlabel='Training-validation prediction',ylabel='Residual',title='Training-only residuals')
fig.tight_layout()
fig.savefig('diagnostic.png',dpi=150,bbox_inches='tight')
final_model=clone(chosen).fit(X_train,y_train)
final_predictions=final_model.predict(X_test)
final_rmse=root_mean_squared_error(y_test,final_predictions)
print('Final RMSE:',final_rmse)
View input setup in this script
These opening lines are included in the complete script above. They load the challenge input.
import numpy as np
import pandas as pd
df=pd.read_csv('data/ml-learning/ML-X02.csv')Why these steps exist
- Matching folds compare the line with the complete expansion–scale–
Ridgerecipe. Degree selection uses training evidence, so extra flexibility must earn its place before the nominated workflow predicts final rows. Residuals and fold variation qualify a small score difference.
Another valid approach
Equivalent ordinary Python is welcome. A defensible candidate or grouping need not match the solution’s choice; objective evidence must remain consistent.