hardMultiple Choice
PMLE Practice Question: A company deploys a training pipeline on Vertex…
A company deploys a training pipeline on Vertex AI using custom containers. The pipeline includes a hyperparameter tuning job that uses Bayesian optimization. After several runs, they observe that the tuning job is not converging and the search space is large. They want to reduce the number of trials while still finding good hyperparameters. Which strategy should they use?
Answer choices
Why each option matters
Answer the question above first, then reveal the full breakdown to understand why each option is right or wrong.
Correct answer & explanation
✓
Reduce the search space by applying feature selection and using prior knowledge.
Reducing the search space using prior knowledge directly decreases the number of trials needed. Option A is wrong because increasing parallel trials does not reduce the total number of trials. Option B is wrong because grid search generally requires more trials than Bayesian optimization. Option C is wrong because early stopping reduces time per trial but does not reduce the number of trials.
Answer analysis
Option-by-option breakdown
For each option: why learners choose it and why it is or isn't the right answer here.
- ✗
Increase the number of parallel trials to explore more points simultaneously.
Why it's wrong here
Raising parallel trial counts increases concurrent resource consumption and random variation without shrinking the search space, so convergence does not improve and total trials often rise. It is tempting because parallelism shortens wall-clock tuning time, which is the right goal when the search space is already well constrained and budget is ample.
- ✗
Use Grid search instead of Bayesian optimization to systematically cover the search space.
Why it's wrong here
Grid search scales exponentially with dimensionality, so a large search space demands far more trials than Bayesian optimisation, directly contradicting the goal. It is tempting because grid search exhaustively and reproducibly covers a space, which is correct when the space is small and discrete with few hyperparameters.
- ✗
Implement early stopping by using the 'early_stopping' flag in the hyperparameter tuning job.
Why it's wrong here
Early stopping halts poorly performing trials sooner, saving compute, but it does not reduce the number of trials needed to locate good hyperparameters in a large space. It is tempting because it is a genuine tuning-efficiency feature, and is correct when trials are long-running and resource cost, not convergence, is the concern.
- ✓
Reduce the search space by applying feature selection and using prior knowledge.
Why this is correct
Bayesian optimisation scales poorly with dimensionality, so pruning the search space via feature selection and encoding prior knowledge concentrates trials on promising regions. This reduces the number of trials needed while preserving solution quality, directly addressing the non-convergence and large search space.
Go deeper
Related to this question
About these practice questions
Courseiva writes every PMLE question from scratch — 775 in total, each with an explanation and a wrong-answer breakdown. None are copied from real exams or dumps. Learn why practice questions differ from exam dumps →
JA
Written by Johnson Ajibi, MSc IT Security
Senior Network & Security Engineer · founder of Courseiva
This PMLE practice question is part of Courseiva's free Google Cloud certification practice question bank. Courseiva provides original exam-style practice questions with explanations, topic-based practice, mock exams, readiness tracking, and study analytics to help learners prepare for the PMLE exam.