A team is using Hyperopt to tune hyperparameters for a gradient boosting model. They want to use an algorithm that can handle both continuous and categorical hyperparameters and is efficient. Which algorithm should they choose?

TPE (Tree-structured Parzen Estimator)

A team is optimizing a machine learning pipeline that includes feature engineering, model training, and inference. The current inference algorithm has O(n^2) time complexity, where n is the number of training samples. They need to reduce inference time to meet a real-time requirement. Which approach would be most effective?

Increase the number of training samples to improve the model's accuracy

Replace the algorithm with one that has O(log n) complexity, such as a tree-based model, if accuracy is maintained

Optimize the code by using vectorized operations, but keep the same algorithm

Use a more powerful CPU to speed up the O(n^2) algorithm

What is the defining characteristic of grid search for hyperparameter tuning?

It uses a probabilistic model to guide the search

It adaptively adjusts hyperparameters during training

It evaluates all possible combinations of a predefined set of hyperparameter values

It randomly samples hyperparameter values from a distribution

Certified Artificial Intelligence Practitioner (CAIP)

Domain 3Objective 2

Objective 3.2 Optimize the Algorithm (e.g., Structure, Run Time, Tuning Hyperparameters) AIP-210 Practice Questions (Page 3)

Part of the 3.0 Training and Tuning ML Systems and Models domain, which accounts for 24% of the AIP-210 exam.

30questions here

6free pages

9concepts

24%of the exam

Questions 11–15

11expert · hard
A team is using Bayesian optimization to tune a model. They have a limited number of trials and want to balance exploration of unknown regions with exploitation of known good regions. Which acquisition function is designed to balance this trade-off?
Select an answer first
12application · medium
A team is using Hyperopt to tune hyperparameters for a gradient boosting model. They want to use an algorithm that can handle both continuous and categorical hyperparameters and is efficient. Which algorithm should they choose?
Select an answer first
13expert · hard
A team is optimizing a machine learning pipeline that includes feature engineering, model training, and inference. The current inference algorithm has O(n^2) time complexity, where n is the number of training samples. They need to reduce inference time to meet a real-time requirement. Which approach would be most effective?
Select an answer first
14foundation · easy
What is the defining characteristic of grid search for hyperparameter tuning?
Select an answer first
15foundation · easy
Which algorithm would generally have the lowest time complexity for searching a sorted array?
Select an answer first

Finished these 5 questions?

Review the revealed explanations, or continue through the curriculum.

Next 5 questions →Back to AIP-210

Free Basic Practice is a study aid with revealable answers — not a scored exam. Examers.io is independent and not affiliated with or endorsed by CertNexus. “AIP-210” is a trademark of its owner, used for identification only.

Objective 3.2 Optimize the Algorithm (e.g., Structure, Run Time, Tuning Hyperparameters) AIP-210 Practice Questions (Page 3)

Questions 11–15

A team is using Bayesian optimization to tune a model. They have a limited number of trials and want to balance exploration of unknown regions with exploitation of known good regions. Which acquisition function is designed to balance this trade-off?

A team is using Hyperopt to tune hyperparameters for a gradient boosting model. They want to use an algorithm that can handle both continuous and categorical hyperparameters and is efficient. Which algorithm should they choose?

What is the defining characteristic of grid search for hyperparameter tuning?

Which algorithm would generally have the lowest time complexity for searching a sorted array?

Keep studying — 3.0 Training and Tuning ML Systems and Models