Prepare experiment logs
Collect past runs with model family, hyperparameters, dataset characteristics and evaluation metrics; normalise categorical fields and filter duplicates before splitting.
Rank candidate models. Balance accuracy and cost.
A model-selection recommendation engine suggests candidate models or model configurations given an experiment signature, dataset and constraints. Key issues include representing experiment metadata, ranking suggestions by expected utility (accuracy, latency, cost) and providing human-reviewable explanations for each suggestion.
Learning concept · Not a validated service
A model-selection recommendation engine suggests candidate models or model configurations given an experiment signature, dataset and constraints. Key issues include representing experiment metadata, ranking suggestions by expected utility (accuracy, latency, cost) and providing human-reviewable explanations for each suggestion.
A proposed application for MLOps or platform teams: suggest promising model families and configurations from past experiment logs to reduce manual search. The supplied starter does not implement this extension; it illustrates a basic item-recommendation pattern that could be adapted.
Collect past runs with model family, hyperparameters, dataset characteristics and evaluation metrics; normalise categorical fields and filter duplicates before splitting.
Start with similarity-based retrieval (experiment-to-experiment) or a simple ranking model trained on past successes to produce candidate suggestions for a new experiment signature.
Use offline ranking metrics such as NDCG or MAP computed on held-out experiment traces and examine failure cases where suggested models underperform.
Serve top suggestions with confidence scores, provenance (why recommended) and a human-review workflow before any automated deployment.
The supplied starter constructs a tiny user-item rating table, pivots it into a user-by-item matrix, computes cosine similarity between users, finds the most similar user to a target, and recommends that neighbour's top-rated unseen items. It prints the neighbour and the recommended item scores.
matrix = ratings.pivot_table(index="user", columns="item", values="rating").fillna(0)
user_similarity = pd.DataFrame(
cosine_similarity(matrix),
index=matrix.index,
columns=matrix.index,
)
target_user = "user_1"
neighbor = user_similarity[target_user].drop(target_user).idxmax()
unseen_items = matrix.loc[target_user][matrix.loc[target_user] == 0].index
scores = matrix.loc[neighbor, unseen_items].sort_values(ascending=False)The code demonstrates basic user-based collaborative filtering on nine toy ratings, not model-selection recommendations. It uses a small hard-coded rating table and offers no experiment-log features, no model metadata, no ranking metrics for model choices and no production safeguards such as caching or feedback capture.
A proposed extension is to ingest experiment logs (model family, dataset fingerprints, hyperparameters, metrics), derive experiment signatures, train a ranking model that predicts expected metric gain and cost, and surface top candidates with explanations and human-review controls.
This is a potential application pathway, not a delivered product. The supplied starter does not implement this service or validate it with real users.
Networkers Home runs this topic inside its AI Engineer Course, with placement support and hands-on labs.