forked from rohitg00/ai-engineering-from-scratch
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathquiz.json
More file actions
90 lines (90 loc) · 3.18 KB
/
Copy pathquiz.json
File metadata and controls
90 lines (90 loc) · 3.18 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
{
"lesson": "05-autonomous-research-agent",
"title": "Capstone 05 — Autonomous Research Agent (AI-Scientist Class)",
"questions": [
{
"stage": "pre",
"question": "What search shape does the AI-Scientist-class agent use to explore experiments?",
"options": [
"Beam search over token outputs",
"Best-first tree search over experiment nodes with a novelty x quality x budget score",
"Pure reinforcement learning from human feedback",
"Breadth-first expansion with random scoring"
],
"correct": 1,
"explanation": ""
},
{
"stage": "pre",
"question": "Why is the sandbox configured with --network=none and bounded resource caps?",
"options": [
"To force the agent to use prompt caching",
"To enforce deterministic floating-point arithmetic",
"To allow GPU passthrough by default",
"To prevent network egress and contain experiment side effects within a reproducible envelope"
],
"correct": 3,
"explanation": ""
},
{
"stage": "check",
"question": "What is the role of the vision critique step in the writer loop?",
"options": [
"Translates figures into bar charts",
"Compiles the LaTeX draft to PDF, then has a VLM critique layout, figure legibility, and claim-evidence alignment",
"Generates new experiment ideas from screenshots",
"Replaces matplotlib at render time"
],
"correct": 1,
"explanation": ""
},
{
"stage": "check",
"question": "How does the reviewer ensemble gate the pipeline?",
"options": [
"A single judge accepts or rejects on a binary flag",
"Reviewers vote anonymously and the majority wins",
"Reviews run after publication only",
"Five judges score on NeurIPS-style rubrics and the weighted aggregate must clear a threshold, otherwise the draft loops back to the writer"
],
"correct": 3,
"explanation": ""
},
{
"stage": "check",
"question": "Which cost discipline does the capstone enforce per paper?",
"options": [
"A $30 hard budget tracked through Langfuse counters and pre-run estimates",
"Cost-only optimization without quality checks",
"Unbounded compute, hard wall-clock only",
"GPU-hours tracked but never capped"
],
"correct": 0,
"explanation": ""
},
{
"stage": "post",
"question": "Which scoring function ranks tree nodes for further expansion?",
"options": [
"Novelty x quality x remaining budget",
"Citation count of related papers",
"Random uniform priority",
"Output length and token count"
],
"correct": 0,
"explanation": ""
},
{
"stage": "post",
"question": "What does the red-team report exercise against the system?",
"options": [
"Caching hit rate on system prompts",
"Multi-tenant data leakage in the vector DB",
"Latency tail under packet loss",
"Sandbox-escape attempts such as fork bombs, network exfiltration, and filesystem escapes"
],
"correct": 3,
"explanation": ""
}
]
}