NCA-GENM NVIDIA Generative AI Multimodal Question and Answers

Zero-shot learning describes a model's capacity to correctly perform a task it was never explicitly trained or fine-tuned on, relying instead on knowledge and generalization ability acquired during broader pretraining. For LLMs, this typically means the model is given only a natural-language instruction or prompt describing the task — with no task-specific labeled examples provided in the prompt at all — and is expected to produce a reasonable response by generalizing from its pretraining. This is directly analogous to CLIP's zero-shot image classification (covered elsewhere in this set): a model trained broadly can be applied to a new, specific task purely through how the task is described to it, without additional task-specific training.

Option A is a subtly incorrect paraphrase: zero-shot learning is not about the model "learning from zero examples" during a training process — it's about applying a model that was never trained for the specific task at all, at inference time. The model isn't learning in the zero-shot moment; it's generalizing from prior training. Option B misapplies "zero" to training time rather than to task-specific examples — an unrelated concept. Option C directly contradicts the definition; zero-shot specifically refers to performance *without* task-specific training, not performance *after* extensive training on that task.

Zero-shot is typically contrasted with few-shot learning, where a small number of task-specific examples are included in the prompt to guide the model's response without updating its weights.

In a denoising diffusion probabilistic model (DDPM), the U-Net serves as the noise-prediction network at the core of the iterative generation process: at each reverse-diffusion timestep, the U-Net takes the current noisy image (and typically a timestep embedding, plus conditioning information like a CLIP text embedding in text-to-image models) as input and predicts the noise component present at that step. Subtracting this predicted noise incrementally, over many timesteps starting from pure Gaussian noise, progressively denoises the input into a coherent image — the mechanism by which DDPMs generate new images from pure noise. U-Net's architecture — a contracting encoder path paired with an expanding decoder path, connected by skip connections at matching resolutions — is well suited to this role because the skip connections preserve fine-grained spatial detail that would otherwise be lost through the network's downsampling bottleneck, which matters for producing sharp, high-fidelity denoised output at each step.

Options B, C, and D describe discriminative tasks — classification, detection, and segmentation — that describe *other* legitimate applications of U-Net-style architectures (originally developed for biomedical image segmentation) but do not describe its function specifically *within* the diffusion generative process. Within a DDPM pipeline specifically, U-Net's role is generative noise prediction supporting image synthesis from noise, not classification or detection of any kind.

Normalization rescales numeric features onto a common, well-defined range or distribution — for example, min-max scaling to [0,1], or standardization to zero mean and unit variance (z-score) — so that features measured on different scales contribute comparably to model training. Among the options given, "converting data into a specific format for easier analysis" is the closest description of this rescaling purpose, though the more precise technical framing is: normalization standardizes the scale of feature values to stabilize and accelerate optimization.

This matters mechanically because many algorithms are scale-sensitive: gradient descent converges faster and more stably when input features share a comparable range (large-scale features would otherwise dominate the loss gradient), distance-based methods (k-NN, k-means, SVMs with RBF kernels) require comparable scales for distance calculations to be meaningful, and regularization terms penalize weight magnitude uniformly, which only makes sense if inputs are on comparable scales.

It is important to distinguish normalization from the other three options: it does not remove data (A, which is cleansing/filtering), does not increase complexity (B, the opposite of its intent), and does not reduce dimensionality (D, which describes techniques like PCA or feature selection — an entirely separate preprocessing goal focused on the number of features, not their scale).

An ablation study systematically removes or isolates individual components of a system to measure each one's individual contribution to overall performance. In a multimodal pipeline combining MRI scans and radiology reports, a proper ablation study requires training and evaluating separate unimodal pipelines — an image-only model on MRI scans alone, and a text-only model on radiology reports alone — alongside the full multimodal pipeline. Comparing these unimodal baselines against the combined system's performance is what actually demonstrates whether fusion is adding genuine diagnostic value beyond what either modality provides independently, and it surfaces whether one modality is doing most of the work while the other contributes marginally (or is even introducing noise) — critical information for both model design decisions and clinical validation in a high-stakes diagnostic context.

Option A describes an early-fusion design choice, not an ablation methodology — it's a modeling decision, not a validation technique for understanding component contribution. Option C proposes abandoning one modality's diagnostic value entirely, which undermines rather than tests the multimodal hypothesis. Option D describes data quality/preprocessing work relevant earlier in the pipeline, not the comparative, component-isolating structure that defines an ablation study.

In a clinical context specifically, this ablation approach is also essential for regulatory and interpretability purposes — demonstrating that a diagnostic claim rests on genuine cross-modal signal, not a spurious correlation from a single dominant input.

A kernel (or filter) in a CNN is a small matrix of learnable weights that slides across the input (an image, feature map, or intermediate activation) computing a dot product at each spatial position — the convolution operation. Each kernel is trained to detect a specific local pattern: early-layer kernels typically learn to detect low-level features like edges and color gradients, while kernels in deeper layers combine these into detectors for more complex, higher-level patterns (textures, object parts, and eventually whole-object representations as receptive fields grow with depth). A convolutional layer typically applies many kernels in parallel, each producing its own output channel, collectively forming the layer's feature map.

The other options describe separate CNN components with distinct responsibilities: the loss function (B) is computed at the network's output based on the difference between predictions and ground truth, entirely separate from the kernel's role in feature extraction. Classification (C) is typically performed by fully connected (dense) layers — often with a softmax activation — placed after the convolutional feature-extraction stack, not by the kernels themselves. Normalization (D) is handled by dedicated layers such as batch normalization or layer normalization, inserted between convolutional layers to stabilize activations, again a separate mechanism from the convolution operation itself.

In the context described — comparing the performance of different AI models against each other — the purpose of evaluation is to systematically measure each candidate model's performance on relevant metrics (accuracy, F1, WER, BLEU, latency, or task-specific measures) using held-out data, in order to determine which architecture, configuration, or training approach performs best for the target task. This is the immediate, operational purpose of the evaluation experiment being described: comparative performance measurement that informs model-selection decisions.

The other options describe legitimate but distinct concerns that belong to different domains within a full AI development lifecycle rather than to the "evaluate performance of different models" activity specifically described in the question: ethical implications (B) fall under Trustworthy AI governance — fairness audits, bias assessments, and impact reviews — conducted alongside, not as a substitute for, performance evaluation. Studying impact on human behavior (C) belongs to human-computer interaction or longitudinal deployment studies, a separate research activity from a controlled model-comparison experiment. Cost-effectiveness analysis (D) is a business/engineering consideration weighing performance gains against compute, infrastructure, and development cost — relevant to deployment decisions, but not what "evaluating model performance" itself measures.

Rigorous evaluation in this context requires a held-out test set the models were not trained or tuned on, appropriate metric selection for the task, and often statistical significance testing when comparing close results.

A box plot (box-and-whisker plot) summarizes the distribution of a numeric variable — median, interquartile range, and outliers — as a single compact glyph, and critically, multiple box plots can be placed side by side to compare distributions across categorical groupings. This makes it well suited to the scenario described: comparing the spread and central tendency of performance scores across several models, further faceted by modality, in one readable figure. Box plots make skew, variance, and outlier prevalence immediately comparable across groups in a way a single summary statistic (like mean accuracy) cannot.

A histogram (B) shows the distribution of a single variable well but does not scale cleanly to side-by-side comparison across many model/modality combinations without becoming visually cluttered. A heatmap (A) is excellent for showing a matrix of values (e.g., mean score per model × modality pair) but represents point estimates, not distributions — it cannot convey variance or spread. A pie chart (D) is inappropriate for any continuous performance metric.

In practice, a violin plot — which overlays a kernel density estimate on the box plot's summary statistics — is often preferred when the underlying distribution's shape (e.g., bimodality) matters, but among the given options, the box plot is the correct choice for distributional comparison across groups.

Batch size has a direct, proportional relationship with VRAM consumption during both training and inference: each sample in a batch requires its own memory allocation for input tensors, intermediate activations at every layer, and output tensors, all of which must reside in GPU memory simultaneously while the batch is being processed. Decreasing the batch size means fewer samples occupy memory concurrently, directly reducing peak VRAM consumption — this is precisely why reducing batch size is one of the first, most common remedies when a model run fails with an out-of-memory (OOM) error on a GPU with limited VRAM.

Option C states the inverse of the correct relationship and is a genuinely important misconception to correct: increasing batch size increases VRAM consumption, not decreases it — parallelism across the batch means more simultaneous memory occupancy, not less. It's true that larger batches improve GPU compute *utilization* and *throughput* (better amortizing fixed kernel-launch overhead and better exploiting parallel hardware) up to the point VRAM allows, but that throughput benefit is a separate effect from, and does not reduce, memory consumption. Options A and B both incorrectly claim batch size is memory-neutral, when it is in fact one of the most direct, easily controlled levers for managing VRAM usage — alongside model precision (quantization, mixed precision) and activation checkpointing, covered in the Performance Optimization domain elsewhere in this set.

The standard ML project lifecycle proceeds: data collection first, since you need raw data before anything else can happen; data preprocessing next, to clean, transform, and prepare that raw data (handling missing values, normalization, encoding, splitting into train/validation/test sets) into a form a model can consume; model training next, where the algorithm learns patterns from the preprocessed training data; and model evaluation last, where the trained model's performance is measured on held-out data it did not see during training. Each stage depends on the output of the one before it — you cannot preprocess data you haven't collected, train on data that hasn't been cleaned and split, or evaluate a model that hasn't been trained — which is what makes B the only internally consistent ordering among the four options.

Options A, C, and D each place a downstream step before its prerequisite: A attempts preprocessing before collection (nothing to preprocess yet); C and D both place evaluation before training and, in D's case, before data even exists — evaluation requires a trained model to assess, so it cannot logically precede training or the data-collection/preprocessing steps that training itself depends on.

In practice this pipeline is iterative rather than strictly linear — evaluation results often send you back to preprocessing (feature engineering) or even data collection (targeted collection to address weak subgroups) — but the canonical forward sequence for a first pass remains collection → preprocessing → training → evaluation.

Representativeness bias occurs when a training dataset systematically over- or under-samples subpopulations relative to the population the deployed system will actually encounter — for example, a facial recognition dataset skewed toward lighter-skinned faces, or a multimodal medical dataset drawn predominantly from one demographic group. Because models learn statistical patterns from their training distribution, an unrepresentative dataset produces a model whose accuracy, calibration, and fairness properties degrade for underrepresented groups, even when aggregate accuracy metrics look acceptable.

This is precisely why aggregate accuracy is an insufficient safeguard: option B's framing — that bias doesn't matter "as long as predictions are accurate" — conflates overall accuracy with subgroup accuracy, and a model can post strong aggregate numbers while systematically failing specific populations. Option D is factually false; AI systems have no inherent neutrality — they inherit and can amplify whatever patterns (including societal biases) exist in their training data and objective function. Option C is also incorrect: mitigating representativeness bias is significantly cheaper and more effective when addressed at the data-collection and curation stage — through stratified sampling, bias audits, and diverse data sourcing — than after deployment, when it becomes a retraining and remediation problem, and by then real-world harm may have already occurred.

A/B testing in an ML engineering context is a controlled experimental methodology where two (or more) model variants — for example, a current production model (A) and a candidate replacement (B) — are deployed simultaneously to randomly assigned, statistically comparable segments of live traffic, and their real-world performance is compared on business or task-relevant metrics (conversion rate, click-through rate, task accuracy, latency-adjusted engagement). This provides causal evidence of which model performs better under actual production conditions, which offline evaluation on static held-out datasets cannot fully capture, since production data distributions shift and downstream user behavior interacts with model outputs in ways offline metrics miss.

Option A narrows A/B testing incorrectly to UI changes alone; while A/B testing originated in and remains common for UI/UX experimentation, its application in ML engineering explicitly extends to comparing model versions, algorithms, and feature sets — not just interface elements. Option B misattributes a distinct methodology (systematic hyperparameter search, covered in the previous question) to A/B testing, which evaluates already-trained model variants rather than searching a hyperparameter space. Option C is simply incorrect — A/B testing is a cornerstone of responsible ML deployment and MLOps practice, gating rollout decisions before full production release.

An autoencoder learns to compress input data into a lower-dimensional latent (bottleneck) representation via its encoder, then reconstruct the original input from that representation via its decoder, trained by minimizing reconstruction error on normal data. Because the model is optimized specifically to reconstruct patterns it has seen frequently during training, it becomes proficient at compressing and reconstructing "normal" instances but performs poorly — producing high reconstruction error — on inputs that deviate structurally from the training distribution, i.e., anomalies. Thresholding reconstruction error thus provides a natural, unsupervised anomaly score without requiring labeled anomalous examples, which are often scarce or unavailable in real-world settings.

This mechanism is the operative characteristic tested here, not classification accuracy (B, which describes a supervised discriminative task the autoencoder is not directly trained for), image enhancement (C, a description closer to denoising autoencoders' side effect rather than the core anomaly-detection mechanism), or forecasting (D, which describes sequence models like RNNs/LSTMs applied to time series, a different architecture family and objective).

Variants such as variational autoencoders (VAEs) extend this idea probabilistically, and in multimodal settings, cross-modal autoencoders can flag anomalies where reconstruction fails to reconcile one modality given another.

GANs are purpose-built generative models: as covered in the previous question, the generator component learns the underlying distribution of a training dataset and produces new synthetic samples that resemble it — new images, audio, or other data types that did not exist in the original dataset but are statistically consistent with it. This generative capability is GAN's defining characteristic and the reason it is the correct answer among the options given, distinguishing it from the other three algorithms, all of which are fundamentally discriminative or unsupervised techniques rather than generative ones.

Decision trees (A) and support vector machines (B) are supervised discriminative algorithms — they learn a decision boundary or a set of rules to classify or predict outputs from inputs, with no mechanism for producing novel data samples resembling a training distribution. K-means clustering (C) is unsupervised but serves a partitioning function, grouping existing data points into clusters based on similarity — it identifies structure in data that already exists rather than synthesizing new data points that didn't exist before.

It's worth noting GANs are one of several generative model families (alongside variational autoencoders and diffusion models, both covered elsewhere in this set) — among the four options presented here, however, GAN is the only one designed for generation at all, making this a comparatively direct elimination once the discriminative-vs-generative distinction is applied.