Prev: L12, Next: L14

Zoom: Link, TopHat: Link, GoogleForm: Link, Piazza: Link, Feedback: Link.
Tools
📗 You can expand all TopHat Quizzes and Discussions: , and print the notes: , or download all text areas as text file: .
📗 For visibility, you can resize all diagrams on page to have a maximum height that is percent of the screen height: .
📗 Calculator:
📗 Canvas:


Slide:




# Midterm Information

📗 Part 1 from 1:00 to 2:15 on July 10.
📗 Part 2 from 1:00 to 2:15 on July 11.
📗 Both parts covers materials from L1 to L11 (including L11).
📗 Open book, LLMs allowed during the exam.
📗 15 questions in Part 1 and 15 questions in Part 2.
📗 6 new questions, 22 questions from the past exams (list to be updated on Piazza).
TopHat Game
📗 We will post questions that are very similar to the questions on the exam based on your choices in this TopHat coordination game.
➩ A: We will post 0 questions.
➩ B: We will post 1 questions if more than 50 percent of you choose B.
➩ C: We will post 2 questions if more than 75 percent of you choose C.
➩ D: We will post 3 questions if more than 90 percent of you choose D.
➩ E: We will post 0 questions.



# Coordination Game

📗 91 percent voted for D, so three new questions will be posted here before Monday.

ID:

📗 Question 1 (on Part 1)
📗 [3 points] (new) There are three training documents in a training set with words in each document. The word "" appeared in total in the three documents. The TF-IDF features for the word "" for the first two documents are both \(0\). What is the TF-IDF feature for the third document? Note: there are two possible answers to this question, one of them is \(0\), what is the other one?
📗 Answer: .

📗 Question 2 (on Part 2)
📗 [3 points] (new) Suppose there are two classes \(C\) for "cats" and \(F\) for "flerkens" and \(4\) training items each with a single numerical feature \(\left(x_{i}, y_{i}\right)\) = . What is the minimum and maximum (due to the different ways the training set is divided into folds) 2-fold cross validation accuracy of the 1-nearest neighbor classifier on this training set? Enter two numbers between 0 and 1. If the minimum and the maximum are the same, enter the same number twice.
📗 Answer (comma separated vector): .

📗 Question 3 (on Part 2)
📗 [3 points] (new) When training a recurrent neural network with input features, hidden recurrent units, and output units. During one step of stochastic gradient descent, for one training item sequence of length , the values of weights and biases are updated (a weight is considered updated if one gradient descent step is applied, including when the gradient is 0). For another training item sequence of length , how many weights and biases are updated? Enter a single integer: the total number of weights plus biases.
📗 Answer: .

The only genetic algorithm question on the exams will be:

📗 Question 4 (on Part 1)
📗 [3 points] (new) When training policy networks to control Flappy Birds, genetic algorithm is used and the fitness of the birds in the population are . During the cross-over phase, reproduction probabilities are computed based on fitness and sampling is done with replacement. What is the probability that the first bird (i.e. with fitness ) is sampled twice in a single iteration (single cross-over between two birds) of cross-over (thus surviving to the next generation)?
📗 Answer: .



# Midterm Stats

X1 Permutations: Link
X2 Permutations: Link

X1: Mean = 84.88%, Stdev = 16.59
Q 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
MAX 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4
PROB 0.85 0.99 0.76 0.93 0.90 0.94 0.69 0.94 0.92 0.69 0.43 0.92 0.90 0.99 1
RPBI 8.82 3.34 8.87 6.79 7.74 6.26 9.25 6.26 7.33 9.25 6.17 7.33 7.74 3.07 0


X2: Mean = 90.41%, Stdev = 14.81
Q 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
MAX 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4
PROB 0.89 0.95 0.95 0.97 0.96 0.96 0.63 0.93 0.97 0.86 0.97 0.95 0.81 0.95 1
RPBI 8.22 7.07 7.07 5.22 5.81 6.25 9.67 7.73 5.22 9.75 5.22 7.07 10.45 7.07 0


TopHat Discussion
📗 Is the midterm hard?
➩ A: Too easy.
➩ B: Easy.
➩ C: Just right.
➩ D: Hard.
➩ E: Too hard.



📗 Notes and code adapted from the course taught by Professors Jerry Zhu, Yudong Chen, Yingyu Liang, and Charles Dyer.
📗 Content from note blocks marked "optional" and content from Wikipedia and other demo links are helpful for understanding the materials, but will not be explicitly tested on the exams.
📗 Please use Ctrl+F5 or Shift+F5 or Shift+Command+R or Incognito mode or Private Browsing to refresh the cached JavaScript.
📗 You can expand all TopHat Quizzes and Discussions: , and print the notes: , or download all text areas as text file: .
📗 If there is an issue with TopHat during the lectures, please submit your answers on paper (include your Wisc ID and answers) or this Google form Link at the end of the lecture.
📗 Anonymous feedback can be submitted to: Form. Non-anonymous feedback and questions can be posted on Piazza: Link

Prev: L12, Next: L14





Last Updated: August 22, 2025 at 10:06 AM