The answer is stochastic gradient descent (SGD), which is the correct choice because it trains a linear regression model on a 10-million-row dataset with 50 features far more efficiently than batch methods. SGD updates model parameters using just one training example per iteration, allowing it to converge much faster per epoch than batch gradient descent, which would require processing the entire dataset before each update. On the CompTIA AI+ AI0-001 exam, this question tests your understanding of how large dataset training SGD scales computationally—the key trap is assuming that because the dataset fits in memory, batch gradient descent or the normal equation is viable, but both become prohibitively slow at this scale. A strong memory tip: think “SGD = Single Gradient per step, saving time on huge data.”
AI0-001 Machine Learning and Deep Learning Practice Question
This AI0-001 practice question tests your understanding of machine learning and deep learning. Read the scenario carefully and evaluate each option against the stated constraints before committing to an answer. After answering, compare your reasoning against the explanation and wrong-answer breakdown below. Once you have made your selection, read the full explanation to reinforce the concept and understand why each distractor is designed to mislead on exam day.
A data engineer is designing a pipeline to train a linear regression model on a dataset with 10 million rows and 50 features. The dataset fits in memory. Which approach should the engineer use to train the model efficiently?
Answer the question above first, then reveal the full breakdown to understand why each option is right or wrong.
Correct answer & explanation
✓
Stochastic gradient descent
Stochastic gradient descent (SGD) is the most efficient approach for training a linear regression model on a dataset with 10 million rows and 50 features because it updates the model parameters using only one training example per iteration, leading to much faster convergence per epoch compared to batch methods. Since the dataset fits in memory, SGD can still be implemented efficiently without the overhead of loading data in batches from disk, and it scales well to large datasets where the normal equation or batch gradient descent would be computationally prohibitive.
Key principle: Answer the scenario, not the keyword: identify the specific constraint before choosing the most familiar-sounding option.
Answer analysis
Option-by-option breakdown
For each option: why learners choose it and why it is or isn't the right answer here.
✗
Normal equation
Why it's wrong here
Normal equation requires computing (X^T X)^{-1}, which is computationally expensive for large datasets.
✗
Batch gradient descent
Why it's wrong here
Batch gradient descent uses the whole dataset for each update, which is slow for large datasets.
✗
Principal component analysis
Why it's wrong here
PCA reduces dimensionality but does not train a model.
✓
Stochastic gradient descent
Why this is correct
SGD updates weights per sample, making it efficient for large datasets.
Related concept
Read the scenario before looking for a memorised answer.
Common exam traps
Common exam trap: answer the scenario, not the keyword
CompTIA often tests the misconception that the normal equation is always the best for small feature sets, but the trap here is that candidates overlook the massive computational cost of the O(n * f^2) matrix multiplication when n is large (10 million rows), even though f is small (50 features).
Detailed technical explanation
How to think about this question
SGD approximates the true gradient using a single randomly selected sample, introducing noise that can help escape local minima but requires careful tuning of the learning rate schedule (e.g., decreasing learning rate over time) to ensure convergence. In practice, mini-batch gradient descent (a compromise between batch and stochastic) is often preferred for hardware efficiency, but for a dataset of this size, SGD's per-iteration cost of O(f) (50 operations) makes it the fastest option for reaching a good solution quickly. The key trade-off is that SGD's gradient estimate has high variance, so it may oscillate around the optimum, but this can be mitigated with techniques like momentum or adaptive learning rates (e.g., Adam).
KKey Concepts to Remember
Read the scenario before looking for a memorised answer.
Find the constraint that changes the correct option.
Eliminate answers that are true in general but not in this case.
TExam Day Tips
→Watch for words such as best, first, most likely and least administrative effort.
→Review why wrong options are wrong, not only why the correct option is correct.
Key takeaway
Answer the scenario, not the keyword: identify the specific constraint before choosing the most familiar-sounding option.
Real-world example
How this comes up in practice
A practitioner preparing for the AI0-001 exam encounters this exact type of scenario on the job. The correct answer here is not the most general option — it is the best answer for the specific constraint described. Answer the scenario, not the keyword: identify the specific constraint before choosing the most familiar-sounding option. Real exam questions reward reading the full scenario before eliminating options, because the constraint defines which answer fits.
What to study next
Got this wrong? Here's your next step.
Identify which exam domain this question belongs to, review the core concept, then practise similar questions from the same domain.
Machine Learning and Deep Learning — This question tests Machine Learning and Deep Learning — Read the scenario before looking for a memorised answer..
What is the correct answer to this question?
The correct answer is: Stochastic gradient descent — Stochastic gradient descent (SGD) is the most efficient approach for training a linear regression model on a dataset with 10 million rows and 50 features because it updates the model parameters using only one training example per iteration, leading to much faster convergence per epoch compared to batch methods. Since the dataset fits in memory, SGD can still be implemented efficiently without the overhead of loading data in batches from disk, and it scales well to large datasets where the normal equation or batch gradient descent would be computationally prohibitive.
What should I do if I get this AI0-001 question wrong?
Identify which exam domain this question belongs to, review the core concept, then practise similar questions from the same domain.
What is the key concept behind this question?
Read the scenario before looking for a memorised answer.
About these practice questions
Courseiva creates original exam-style practice questions with explanations and wrong-answer analysis. It does not publish real exam questions, exam dumps, or protected exam content. Learn why practice questions differ from exam dumps →
Share a tip, memory trick, or ask about the reasoning behind this question. Do not post real exam questions, leaked content, braindumps, or copyrighted exam material. Comments are moderated and may be removed without notice.
This AI0-001 practice question is part of Courseiva's free CompTIA 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 AI0-001 exam.
Question Discussion
Share a tip, memory trick, or ask about the reasoning behind this question. Do not post real exam questions, leaked content, braindumps, or copyrighted exam material. Comments are moderated and may be removed without notice.
Sign in to join the discussion.