Skip to content

Commit 7be7f66

Browse files
changes to p6
1 parent 202edb2 commit 7be7f66

1 file changed

Lines changed: 5 additions & 5 deletions

File tree

mathprobs/p6/assignment.ipynb

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -10,9 +10,9 @@
1010
"\n",
1111
"The homework has two parts:\n",
1212
"\n",
13-
"**Part 1 — Debugging.** Find and fix every bug in `model.py` so this notebook trains the model end-to-end to ≥ 0.95 copy-task accuracy.\n",
13+
"**Part 1 — Debugging (Main Part).** Find and fix every bug in `model.py` so this notebook trains the model end-to-end to ≥ 0.95 copy-task accuracy.\n",
1414
"\n",
15-
"**Part 2 — Layer recovery.** A teammate trained the model to convergence, then mishandled the checkpoint and the 8 blocks got shuffled. You're given the shuffled weights. Recover the correct block ordering so the model works again.\n",
15+
"**Part 2 — Layer recovery (Bonus).** A teammate trained the model to convergence, then mishandled the checkpoint and the 8 blocks got shuffled. You're given the shuffled weights. Recover the correct block ordering so the model works again.\n",
1616
"\n",
1717
"The dataset (already on disk in `data/`) contains length-17 sequences of the form\n",
1818
"\n",
@@ -28,13 +28,13 @@
2828
"\n",
2929
"## Deliverables\n",
3030
"\n",
31-
"**Part 1**\n",
31+
"**Part 1 (2pts)**\n",
3232
"- **(A)** A table listing every bug you found with: file/line, cause (one sentence), minimal fix. (There are 12 bugs.)\n",
3333
"- **(B)** A fixed `model.py` such that this notebook reports `PASS` for Part 1.\n",
3434
"\n",
35-
"**Part 2**\n",
35+
"**Part 2 (Bonus)**\n",
3636
"- **(C)** The recovered permutation `block_order` (a list of 8 integers). The notebook will PASS only when both copy accuracy ≥ 0.95 **and** the MSE checksum against the trained model's reference output is below `1e-5`.\n",
37-
"- **(D)** A very concise paragraph describing the procedure you used to recover the order. Brute-force search is **NOT** acceptable. Think analytical / algorithmic.\n",
37+
"- **(D)** A very concise paragraph describing the procedure you used to recover the order. Brute-force search is **NOT** acceptable. Think analytical / algorithmic. Hint : What quantity might be predictive of the depth in the NN ?\n",
3838
"\n",
3939
"## Submission\n",
4040
"\n",

0 commit comments

Comments
 (0)