Data Science

Chapter 11
Deep Learning and Contemporary AI

Post Graduate Program in AI and ML
Data Science   •   Post Graduate

Deep Learning and Contemporary AI

Introduction and context

Deep learning is a family of representation-learning methods in which a model learns successive transformations of data, usually by composing many parameterized layers. Unlike conventional machine learning, where analysts often design predictive features explicitly, deep models can learn features jointly with the prediction task. This capability has made neural networks central to computer vision, speech recognition, natural-language processing, recommendation, scientific modelling and generative AI.

The contemporary data scientist must understand deep learning at two levels. The first is technical: how tensors, layers, losses, optimization and evaluation work. The second is strategic and critical: whether a deep model is justified by the data, operational constraints, cost, safety requirements and consequences of error. A model that achieves a high benchmark score may still be unsuitable if its predictions are unreliable, expensive, biased or impossible to audit.

This chapter develops neural-network foundations; applications to text, images and sequences; embeddings and transformers; foundation and generative models; and practical evaluation, governance and deployment considerations.

Learning objectives

By the end of this chapter, a reader should be able to:

  1. Explain the structure and learning process of multilayer neural networks.
  2. Select suitable architectures for text, images and sequential data.
  3. Distinguish embeddings, encoders, decoders, transformers and foundation models.
  4. Apply appropriate loss functions, optimization methods and evaluation metrics.
  5. Evaluate deep-learning systems for reliability, cost, fairness, privacy and security.
  6. Design a responsible data-science workflow involving contemporary generative AI.

1. Neural networks as learned function approximators

A neuron receives an input vector, forms a weighted sum, adds a bias and applies a nonlinear activation. For an input vector x = (x₁, …, x_d), weights w = (w₁, …, w_d), bias b and activation function φ, its output is:

a = φ(wᵀx + b) = φ(∑ᵢ₌₁ᵈ wᵢxᵢ + b)

Here, x and w are dimensionless model quantities unless the application assigns units; b has the same units as the weighted sum, and a is the transformed output. The equation applies to a single neuron and assumes a finite vector input.

A dense layer applies this operation to many neurons simultaneously:

h = φ(Wx + b)

If x has dimension d and the layer has m units, W is an m × d matrix, b is an m-dimensional vector and h is an m-dimensional vector. A multilayer perceptron composes layers:

f(x; θ) = fL( fL−1( … f₂(f₁(x)) … ))

The parameter set θ contains all weights and biases. Depth permits the model to construct hierarchical representations. For example, an image network may learn edges in early layers, shapes in intermediate layers and object-level patterns in later layers.

Activation functions

Without nonlinear activation functions, a composition of linear layers is equivalent to one linear transformation and cannot represent complex decision boundaries. Common activations include:

ActivationDefinitionTypical use and limitation
Sigmoidσ(z) = 1/(1 + e^(−z))Binary output probability; saturation can produce small gradients
tanhtanh(z) = (ez − e^(−z))/(ez + e^(−z))Hidden states; also saturates
ReLUmax(0,z)Efficient hidden-layer activation; can produce permanently inactive units
GELUA smooth, probability-weighted gating functionCommon in transformer networks
Softmaxsoftmax(zᵢ) = e^(zᵢ)/∑ⱼe^(zⱼ)Converts class logits into a categorical distribution

Softmax probabilities sum to one and are meaningful as probabilities only under the modelling assumption that the classes are mutually exclusive and the output is calibrated. A model can be highly confident and wrong; softmax confidence is not automatically a measure of epistemic certainty.

Forward propagation, loss and learning

For supervised learning, a model produces ŷ = f(x; θ), and a loss measures disagreement with the target y. For N examples, empirical risk is commonly written as:

J(θ) = (1/N)∑ₙ₌₁ᴺ L(f(xₙ; θ), yₙ) + λΩ(θ)

L is the per-example loss, Ω is a regularization penalty, λ ≥ 0 controls its strength, and θ denotes all trainable parameters. The objective assumes that the training examples are represented in a form suitable for averaging and that the chosen loss reflects the decision problem.

For binary classification with target y ∈ {0,1} and predicted probability p, binary cross-entropy is:

L(y,p) = −[y log(p) + (1−y)log(1−p)]

For K mutually exclusive classes, with one-hot target y_k and predicted probabilities p_k:

L(y,p) = −∑ₖ₌₁ᴷ yₖ log(pₖ)

The logarithm is natural unless otherwise specified. In implementation, p is clipped away from exactly zero to avoid undefined logarithms. Cross-entropy strongly penalizes confident incorrect predictions.

Gradient-based optimization updates parameters in the direction that reduces the objective. Basic gradient descent is:

θₜ₊₁ = θₜ − η∇θJ(θₜ)

η > 0 is the learning rate and ∇θJ is the gradient of the objective with respect to parameters. In practice, gradients are usually estimated using mini-batches. Optimizers such as momentum methods and Adam adapt the update using running estimates of gradients and squared gradients. They improve convenience and often convergence, but do not remove the need for learning-rate selection, validation and monitoring.

Backpropagation and generalization

Backpropagation applies the chain rule to compute gradients efficiently through a computational graph. If a loss depends on intermediate variables, the derivative with respect to an early parameter is the product of derivatives along the path. Repeated multiplication can cause vanishing or exploding gradients, especially in deep or recurrent networks. ReLU-like activations, residual connections, normalization, careful initialization and gated recurrence were developed partly to address these difficulties.

Training error and generalization error are distinct. A large network may fit its training data nearly perfectly yet perform poorly on new data. Regularization strategies include weight decay, dropout, data augmentation, early stopping and architectural constraints. Validation data should guide model and hyperparameter decisions; a final test set should remain untouched until the end. For time-dependent data, random splitting can leak future information and should be replaced by chronological or rolling validation.

2. Deep architectures for major data types

2.1 Images: convolutional and vision models

An image is commonly represented as a tensor with height, width and channels. A convolutional layer applies learned filters locally across spatial positions. For a two-dimensional single-channel input X and filter K, a cross-correlation operation, often called convolution in deep-learning software, can be written:

S(i,j) = ∑ₘ∑ₙ K(m,n)X(i+m,j+n) + b

The exact output dimensions depend on kernel size, stride and padding. Convolution shares the same filter parameters across locations, reducing parameter count and encoding an inductive bias that nearby pixels and repeated local patterns matter. Pooling or strided convolution can reduce spatial resolution, while residual blocks facilitate optimization in deep networks.

Modern vision systems include convolutional networks, vision transformers and hybrid architectures. Convolution is often data-efficient for local structure; attention-based vision models can represent long-range relationships but may require substantial pretraining. Transfer learning is frequently effective: a model pretrained on a broad image corpus is adapted to a narrower domain such as medical imaging. However, domain shift, label quality and calibration remain critical.

Image applications include classification, object detection, semantic segmentation, defect inspection, remote sensing and medical decision support. Evaluation must match the task. Accuracy can be misleading for rare defects; precision, recall, intersection-over-union, sensitivity, specificity and calibration may be more appropriate.

2.2 Text: tokens, embeddings and language models

Text is discrete, but neural networks operate on numerical vectors. A tokenizer maps text into tokens, which may be words, subwords, characters or bytes. An embedding matrix E ∈ ℝ^(V×d) maps a vocabulary of size V to d-dimensional vectors. If token i is represented by a one-hot vector e_i, its embedding is:

vᵢ = Eᵀeᵢ

Embeddings learned from context place items with similar usage near one another according to a chosen geometric relation. Similarity is often measured by cosine similarity:

cos(v,w) = (v·w)/(||v||₂||w||₂)

The measure is defined for nonzero vectors and is invariant to their positive scale. Embedding proximity is task- and corpus-dependent; it does not guarantee semantic identity, fairness or causal knowledge. Word embeddings can encode social stereotypes present in their training data, and a single vector may collapse multiple meanings of a polysemous word.

A language model estimates a sequence probability using the chain rule:

P(x₁,…,xT) = ∏ₜ₌₁ᵀ P(xₜ | x₁,…,xₜ₋₁)

T is the sequence length and x_t is the token at position t. Autoregressive models predict the next token. Masked-language models predict hidden tokens using surrounding context and are useful as bidirectional encoders. The training objective is often negative log-likelihood, equivalent to cross-entropy over target tokens.

2.3 Sequences: recurrence, convolution and attention

Sequential data includes sensor readings, transactions, speech, clickstreams and clinical events. A recurrent neural network maintains a hidden state:

hₜ = φ(Wₓxₜ + Wₕhₜ₋₁ + b)

Here x_t is the input at time t, h_t is the hidden state, W_x and W_h are parameter matrices, b is a bias and φ is an activation. The recurrence reuses parameters across time, but long dependencies may be difficult to learn. LSTM and GRU architectures use gates to regulate information flow.

Temporal convolutional networks use causal convolutions so that an output at time t does not depend on future observations. Transformers instead use attention and can process relationships between distant positions more directly. For streaming or low-latency applications, however, full attention may be costly and non-causal processing may be unacceptable.

3. Attention, transformers and foundation models

Scaled dot-product attention takes queries Q, keys K and values V:

Attention(Q,K,V) = softmax(QKᵀ/√dₖ)V

d_k is the key-vector dimension. The scaling factor reduces excessively large dot products, which otherwise can make softmax distributions sharply peaked and gradients less useful. Each query forms a weighted combination of values, where weights depend on query-key compatibility. Multi-head attention performs several attention operations with learned projections, allowing different relational patterns to be represented.

Transformers generally contain attention sublayers, position information, feed-forward networks, residual connections and normalization. Since attention alone does not identify sequence order, positional information must be supplied through learned or fixed representations, relative-position methods or related mechanisms. Transformer families include encoder-only models, decoder-only autoregressive models and encoder-decoder models.

A foundation model is pretrained on broad data and adapted to many downstream tasks through prompting, fine-tuning, adapters, retrieval augmentation or tool use. Its generality is useful, but its broad pretraining objective does not guarantee truthfulness, domain competence or compliance. A model may produce fluent text without having verified the underlying claim.

Retrieval-augmented generation (RAG) separates retrieval from generation. Documents are chunked and embedded; a query retrieves relevant passages; the language model conditions its response on those passages. RAG can improve freshness and traceability, but retrieval errors, poor chunking, prompt injection and unsupported synthesis remain possible. Citations should be checked against the source rather than accepted merely because they appear in an answer.

Fine-tuning changes model parameters using task-specific data. It can improve specialization but may cause catastrophic forgetting, privacy leakage or overfitting. Parameter-efficient methods update a small number of additional parameters or low-rank components, reducing storage and adaptation cost. Prompting is cheaper operationally but sensitive to wording and may be less stable across model versions.

4. Generative AI and probabilistic decoding

Generative models learn a distribution from which new examples can be produced. Autoregressive language generation samples or selects one token at a time. Temperature rescales logits before softmax; lower temperature generally makes output more concentrated, while higher temperature increases diversity. Top-k and nucleus (top-p) sampling restrict candidate tokens. These controls affect style and diversity, not factual correctness.

Other generative approaches include variational autoencoders, generative adversarial networks and diffusion models. A variational autoencoder learns a latent representation and a probabilistic decoder, balancing reconstruction with a regularization term that encourages a structured latent distribution. GANs train a generator and discriminator in competition, but can be unstable and suffer mode collapse. Diffusion models learn to reverse a gradual noising process and have become influential in image, audio and multimodal generation.

Generative AI is useful for drafting, code assistance, synthetic-data exploration, image creation, simulation and natural-language interfaces. Synthetic data should not automatically be treated as equivalent to real data: it may reproduce biases, omit rare cases or create unrealistic correlations. Any use in high-impact decisions requires validation against real-world outcomes and explicit controls for disclosure and misuse.

5. Evaluation: predictive quality is only one dimension

A deep-learning evaluation plan should begin with the decision and its error costs, not with a fashionable architecture. Important dimensions include:

DimensionQuestions
Predictive performanceDoes the model perform on representative, unseen data?
CalibrationDo predicted probabilities correspond to observed frequencies?
RobustnessWhat happens under noise, distribution shift or adversarial input?
FairnessAre error rates and benefits acceptable across relevant groups?
ReliabilityCan uncertainty, abstention and failure modes be monitored?
EfficiencyWhat are latency, memory, energy and inference costs?
GovernanceAre data provenance, access, documentation and accountability defined?
Human impactDoes automation improve decisions without displacing necessary judgment?

For a binary classifier, precision and recall are:

Precision = TP/(TP + FP)
Recall = TP/(TP + FN)

TP, FP and FN denote true positives, false positives and false negatives. Precision answers how many predicted positives were correct; recall answers how many actual positives were found. The appropriate balance depends on consequences. In disease screening, missing a case may be more costly than a referral for further testing; in an expensive intervention, false positives may dominate.

Expected loss can make this explicit. If actions a and outcomes y have cost C(a,y), a policy should consider:

Expected cost = ∑ₐ∑ᵧ P(a,y)C(a,y)

The probabilities and costs must be estimated or elicited carefully. A high accuracy model may have greater expected cost than a lower-accuracy model if it makes expensive errors in critical subgroups.

Uncertainty has several sources. Aleatoric uncertainty reflects inherent variability or noisy observations; epistemic uncertainty reflects limited knowledge or data coverage. Ensembles, Bayesian approximations, conformal prediction and calibrated confidence methods can support uncertainty estimation, but none guarantees safety under arbitrary distribution shift. An abstention option—referring uncertain cases to a human—can be more responsible than forcing a prediction.

6. Reliability, cost and operational design

Deep-learning projects often fail because the data pipeline, not the architecture, is weak. Important controls include label audits, leakage tests, duplicate detection, versioned datasets, representative validation sets and monitoring after deployment. Data drift changes input distributions; concept drift changes the relationship between inputs and outcomes. Both can degrade performance.

Total cost of ownership includes data acquisition and labeling, experimentation, hardware, inference, storage, monitoring, security, model updates, human review and incident response. A larger model may improve quality but increase latency, carbon emissions and vendor dependence. Distillation, quantization, pruning, caching, batching and smaller specialist models may provide better system-level value. These techniques can change accuracy and calibration, so they require re-evaluation.

Reproducibility requires recording model versions, random seeds where meaningful, preprocessing, prompts, retrieval indexes, hyperparameters, evaluation data and software dependencies. Documentation should state intended use, prohibited use, known limitations, data provenance and observed subgroup performance. Model cards, datasheets and risk registers are practical instruments rather than substitutes for technical testing.

Security threats include membership inference, model extraction, data poisoning, prompt injection, insecure tool use and sensitive-data leakage. For generative systems, retrieved documents and user inputs should be treated as untrusted content. Tool permissions should follow least privilege, and outputs should be validated before they trigger external actions.

7. Ethics, regulation and responsible governance

Deep learning can amplify historical discrimination, especially when labels encode unequal access or institutional bias. Fairness cannot be reduced to one universal metric: demographic parity, equalized odds, equal opportunity and calibration can conflict when base rates differ. Teams should identify the relevant harm, affected groups and legal context, then justify the selected evaluation criteria.

Privacy requires data minimization, access control, retention limits and appropriate consent or legal basis. De-identification is not an absolute guarantee, particularly when multiple datasets can be linked. Differential privacy can limit the contribution of an individual to a released statistic or model, but it introduces a privacy–utility trade-off and requires careful accounting of the privacy budget.

Transparency should be matched to the audience. Users need understandable information about system capabilities, limitations and recourse. Developers need detailed logs and tests. Managers need ownership, escalation paths and measurable controls. In regulated or high-impact domains, human oversight must be meaningful: a nominal human who cannot understand, challenge or override the system is not an effective safeguard.

8. Applied case: an illustrative hospital triage assistant

Background

A regional hospital considers an AI assistant that summarizes emergency-department notes, retrieves relevant institutional protocols and suggests a triage category. This is an illustrative case, not a clinical recommendation.

Problem

Clinicians face documentation overload and variable access to protocols. The hospital wants to reduce search time without allowing an unverified model output to determine treatment. Risks include missing symptoms, unequal performance across language groups, privacy leakage and automation bias.

Analysis

The project team defines the task narrowly: retrieve protocol passages and draft a summary, while leaving triage decisions to licensed staff. It assembles a temporally separated evaluation set containing diverse ages, writing styles, languages and acuity levels. Labels are reviewed by multiple clinicians, and disagreements are recorded rather than silently resolved.

Performance is assessed using retrieval recall, summary factuality, omission rates for critical symptoms, subgroup results, calibration of any risk score, latency and clinician time saved. A red-team exercise tests prompt injection in copied notes, fabricated citations, ambiguous abbreviations and deliberately incomplete records.

Approach and solution

The system uses access-controlled retrieval over approved protocols, an instruction-constrained language model and a structured output containing source passages, uncertainty flags and missing-information prompts. It is prohibited from issuing medication orders. Clinicians must verify source passages and can reject or edit the draft. Every interaction is logged for audit, with sensitive content retained only according to policy.

A staged deployment begins in silent mode, where outputs are evaluated but not shown. It then moves to a limited pilot with trained users and rapid incident review. Monitoring includes drift in patient populations, changes in retrieval quality, subgroup omissions and rates at which clinicians accept unsupported statements.

Outcome

In this illustrative scenario, the pilot reduces protocol-search time but reveals that summaries are less reliable for shorthand-heavy notes and non-dominant languages. The hospital therefore limits use to retrieval and administrative summarization, adds language-specific evaluation and requires explicit confirmation for critical symptoms. The result is not a claim that AI replaces clinical judgment; it is an example of narrowing scope when evidence does not support a broader deployment.

Learning points

  1. Define the decision boundary and prohibited actions before selecting a model.
  2. Evaluate the complete sociotechnical system, not only the language model.
  3. Source-grounded generation improves traceability but does not eliminate hallucination.
  4. Silent-mode testing and staged release expose operational failures safely.
  5. Human oversight must include time, expertise and authority to challenge the output.

9. A practical deep-learning workflow

A defensible workflow is iterative:

  1. Specify the decision, users, harm scenarios and success criteria.
  2. Audit data provenance, representativeness, labels, leakage and legal permissions.
  3. Establish a simple baseline, such as logistic regression, nearest-neighbor retrieval or a rules system.
  4. Select an architecture whose inductive bias fits the data and constraints.
  5. Separate training, validation and test data according to the data-generating process.
  6. Train with monitored objectives, reproducible configurations and early stopping where appropriate.
  7. Evaluate quality, calibration, robustness, subgroup performance, cost and usability.
  8. Conduct error analysis on real examples, especially high-impact failures.
  9. Pilot with safeguards, logging, rollback and human escalation.
  10. Monitor drift and incidents, and retire or retrain the system when assumptions no longer hold.

The baseline is important. A deep model should earn its additional complexity through measurable improvement in the actual operating environment. If the data are small, labels are unreliable or latency is strict, a simpler model may be more accurate, interpretable and maintainable.

Contemporary directions

Current research explores multimodal foundation models, long-context processing, efficient adaptation, retrieval and tool-using agents, small on-device models, synthetic-data quality, mechanistic interpretability, robust alignment and evaluation under distribution shift. These directions are promising but unsettled. Benchmark gains can reflect contamination, repeated data or narrow test conditions. Claims should therefore be assessed through independent evaluation, transparent methodology and comparison with strong baselines.

The most useful contemporary perspective is not that deep learning solves every data problem. Rather, it provides a powerful set of function approximators and interfaces whose value depends on data quality, objective design, deployment context and governance. Sound data science combines statistical reasoning, engineering discipline, domain expertise and ethical accountability.

Chapter Summary

Deep learning learns layered representations by composing parameterized transformations and optimizing a loss through backpropagation. Activations create nonlinear capacity; regularization and validation support generalization. Convolutional models exploit spatial locality, recurrent and temporal-convolutional models represent sequential structure, and transformers use scaled attention to connect positions across a sequence.

Embeddings provide vector representations whose similarity is dependent on data and task. Foundation models extend pretrained representations across tasks, while generative AI produces new content through autoregressive, latent-variable, adversarial or diffusion processes. Retrieval augmentation can improve grounding but does not guarantee factuality.

Evaluation must go beyond accuracy to include calibration, robustness, subgroup performance, uncertainty, latency, energy, privacy, security, cost and human impact. Responsible deployment requires clear scope, representative testing, monitoring, documentation, access control and meaningful human oversight. The appropriate model is the one that satisfies the decision’s technical and social requirements, not necessarily the largest or newest model.

Key Terms

Neural network: A parameterized composition of computational layers that maps inputs to outputs.

Activation function: A nonlinear function applied to a neuron or layer output.

Backpropagation: Efficient gradient computation through a computational graph using the chain rule.

Loss function: A quantity measuring disagreement between predictions and targets.

Regularization: A method that constrains learning to improve generalization or stability.

Embedding: A learned numerical vector representing a discrete or structured object.

Tokenization: Conversion of text into units processed by a language model.

Convolution: A shared local operation that detects spatial or temporal patterns.

Recurrent neural network: A network that carries a hidden state across sequence positions.

Attention: A mechanism that weights values according to query–key compatibility.

Transformer: An architecture built primarily from attention, feed-forward layers and residual processing.

Foundation model: A broadly pretrained model adaptable to multiple downstream tasks.

Generative AI: AI that produces new text, images, audio, code or other content.

Retrieval-augmented generation: Generation conditioned on information retrieved from an external collection.

Calibration: Agreement between predicted probabilities and observed event frequencies.

Distribution shift: A change between training conditions and deployment conditions.

Data drift: Change in the distribution of observed inputs over time.

Prompt injection: An attack that manipulates model instructions through untrusted input.

Model card: Documentation describing a model’s intended use, performance and limitations.

Human oversight: Responsible human ability to review, challenge and control system outputs.

Review Questions

Short Answer Questions

  1. Why are nonlinear activation functions necessary in a multilayer network?
  2. What does an embedding represent, and why is cosine similarity useful?
  3. State the difference between precision and recall.
  4. Why does scaled dot-product attention divide by √d_k?
  5. Give two reasons why a foundation model may produce an unreliable answer.

Long Answer Questions

  1. Explain forward propagation, loss minimization and backpropagation in a supervised neural network. Include the role of validation and regularization.
  2. Compare convolutional networks, recurrent networks and transformers for image or sequence applications.
  3. Explain how retrieval-augmented generation works and critically assess its failure modes.
  4. Discuss the technical, economic and governance dimensions of evaluating a generative-AI system.
  5. Explain why a high benchmark score is insufficient evidence for deployment in a high-impact domain.

Analytical / Application Questions

  1. A fraud detector has high accuracy but misses most fraudulent transactions because fraud is rare. Which metrics and evaluation design should be added, and why?
  2. Design a staged evaluation plan for a transformer-based customer-support assistant that can access internal documents and issue refunds.
  3. A hospital model performs well overall but has substantially higher omission rates for one language group. Propose a diagnostic and mitigation plan that addresses data, model, workflow and governance.

Multiple Choice Questions with Answers

Question 1

Which operation introduces nonlinear representational capacity into a standard neural network?

A. Adding a bias only

B. Applying a nonlinear activation function

C. Increasing the batch size

D. Shuffling the test set

Correct Answer: B. Applying a nonlinear activation function

Question 2

For binary classification, what does recall measure?

A. The proportion of predicted positives that are correct

B. The proportion of all predictions that are correct

C. The proportion of actual positives that are identified

D. The proportion of predicted negatives that are correct

Correct Answer: C. The proportion of actual positives that are identified

Question 3

In scaled dot-product attention, why is QKᵀ divided by √d_k?

A. To remove positional information

B. To reduce excessively large dot products and stabilize softmax

C. To make all values equal

D. To convert tokens into images

Correct Answer: B. To reduce excessively large dot products and stabilize softmax

Question 4

What is the main purpose of an embedding?

A. To store a dataset without labels

B. To represent an object as a learned numerical vector

C. To guarantee that two words have identical meanings

D. To eliminate all bias from text

Correct Answer: B. To represent an object as a learned numerical vector

Question 5

Which method is most appropriate for evaluating a model on genuinely future time periods?

A. Randomly duplicating future observations into training

B. Chronological or rolling validation

C. Using only the training error

D. Selecting the test set after viewing its labels repeatedly

Correct Answer: B. Chronological or rolling validation

Question 6

A binary classifier produces TP = 80 and FP = 20. What is its precision?

A. 0.20

B. 0.50

C. 0.80

D. 0. หน

Correct Answer: C. 0.80

Question 7

What is a central characteristic of retrieval-augmented generation?

A. It permanently retrains the model after every query

B. It conditions generation on information retrieved from an external collection

C. It guarantees that every generated statement is true

D. It removes the need to evaluate document quality

Correct Answer: B. It conditions generation on information retrieved from an external collection

Question 8

Which is an example of distribution shift?

A. The model uses the same preprocessing at training and deployment

B. The deployment population differs systematically from the training population

C. A gradient is computed using a mini-batch

D. A model has a bias parameter

Correct Answer: B. The deployment population differs systematically from the training population

Question 9

Which practice best supports safe deployment of a high-impact AI system?

A. Allowing automatic action without logging

B. Using only overall accuracy

C. Staged release with monitoring, human escalation and rollback

D. Removing all human review to avoid inconsistency

Correct Answer: C. Staged release with monitoring, human escalation and rollback

Question 10

What is a likely trade-off when replacing a smaller model with a much larger model?

A. Higher capacity may accompany greater latency, memory and inference cost

B. The larger model always has perfect calibration

C. The larger model eliminates data-provenance concerns

D. The larger model cannot overfit

Correct Answer: A. Higher capacity may accompany greater latency, memory and inference cost

Data Science
Chapter 11 of 15