Courseiva

AI-900 Practice Question: Describe fundamental principles of machine learning on Azure

What is 'Bayesian optimisation' in hyperparameter tuning?

⚠ Common exam trap

Watch out — candidates often confuse Bayesian optimisation with Bayesian inference for model parameters (Option A) or with adaptive learning rate algorithms (Option C), because both involve 'Bayesian' or 'optimisation' terminology but serve entirely different purposes.

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

A smart hyperparameter search that uses past trial results to select promising configurations

Bayesian optimisation is a smart hyperparameter search method that builds a probabilistic model (typically a Gaussian process) of the objective function based on past trial results. It uses an acquisition function (e.g., Expected Improvement) to balance exploration and exploitation, selecting the most promising hyperparameter configurations to evaluate next. This makes it far more efficient than grid or random search for expensive-to-evaluate models.

Answer analysis

Option-by-option breakdown

For each option: why learners choose it and why it is or isn't the right answer here.

  • A statistical method for updating model confidence as new training data arrives

    Why it's wrong here

    This describes Bayesian inference or online Bayesian model updating, not Bayesian optimization. Bayesian optimization is a global optimization strategy for expensive black-box functions, typically the validation performance as a function of hyperparameters. It uses a probabilistic surrogate model, such as a Gaussian process, to estimate where the optimum is likely to lie, and then chooses the next configuration to evaluate based on an acquisition function. It does not update 'confidence' in model predictions; rather, it maintains a belief about the location of the best hyperparameters.

  • A smart hyperparameter search that uses past trial results to select promising configurations

    Why this is correct

    Bayesian optimization is indeed a smart hyperparameter search technique: it builds a probabilistic surrogate model, such as a Gaussian process, from all previously evaluated hyperparameter configurations and the resulting performance scores. It then uses an acquisition function, like expected improvement, to balance exploration and exploitation and select the next candidate configuration that is most likely to improve upon the current best result. This approach minimizes the number of expensive training runs needed, making it highly effective when each hyperparameter evaluation is costly, such as when training large neural networks.

  • An automatic method for adjusting learning rate during training based on gradient information

    Why it's wrong here

    This is a description of adaptive gradient optimizers like Adam, Adagrad, or RMSprop, which modify the learning rate for each parameter based on past gradient magnitudes. Those are parameter update rules used within a single training run, whereas Bayesian optimization operates at a higher level: it searches the hyperparameter space across multiple training runs. Bayesian optimization does not use gradient information from the loss surface; it treats the relationship between hyperparameters and model performance as a black-box function and builds a probabilistic surrogate model instead. Learning rate is just one of many hyperparameters that Bayesian optimization might tune, but the method itself is not adjusting it during training.

  • A probabilistic approach to labelling uncertain training examples

    Why it's wrong here

    This option confuses Bayesian optimization with active learning or uncertainty-based sample selection. Active learning uses a model's probability outputs to identify unlabeled examples that are most uncertain, so they can be labeled by a human annotator to improve the model efficiently. Bayesian optimization, in contrast, does not label data or select training examples; its objective is to locate the optimal hyperparameter configuration by probabilistically modeling the objective function over the hyperparameter space. While it is a probabilistic approach, it is applied to search, not to labelling tasks.

About these practice questions

This AI-900 question is part of Courseiva's 985-question bank — original exam-style content with full explanations and wrong-answer analysis, never real exam questions or exam dumps. Learn why practice questions differ from exam dumps →

How Courseiva writes practice questions · Editorial policy

JA

Written by Johnson Ajibi, MSc IT Security

Senior Network & Security Engineer · founder of Courseiva

This AI-900 practice question is part of Courseiva's free Microsoft 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 AI-900 exam.