Question

The Lottery Ticket Hypothesis attempts to explain these constructs’ efficiency despite their low VC dimension. Proving that a sequence of these constructs converges to any arbitrary function is the goal of several Universal Approximation Theorems. One type of these constructs passes a 2D “mask” over values to compute an activation map. The LSTM was created to alleviate a problem with these constructs where a value “vanishes” (10[1])due to repeatedly applying the chain rule. Images can be processed using the “convolutional” type of these constructs. (10[1]-5[2])The weights of these constructs are typically updated using backpropagation, which was popularized by 2024 Nobel Laureate Geoffrey Hinton. (10[1])For 10 points, “deep learning” uses what biologically-inspired computational constructs? (10[2])■END■ (10[2])

ANSWER: artificial neural networks [or deep neural networks or ANNs or DNNs; accept specific types of neural networks such as convolutional neural networks or recurrent neural networks or CNNs or RNNs; accept “The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks”; prompt on classifiers or learners or machine learning models or large language models or LLMs; prompt on artificial neurons; reject “biological neural networks”]
<Other Science>
= Average correct buzz position

Back to tossups

Buzzes

PlayerTeamOpponentBuzz PositionValue
Danny Peelan (DII)Pitt AMichigan State B (UG)6510
Yahwanth Bajji (DII)Michigan AKenyon B (DII)83-5
Vishesh Verma (DII)Michigan State AOhio State B (DII)8310
Calvin Bostleman (UG)Ohio State A (UG)Ohio State C (DII)83-5
Oliver Thompson (DII)CWRU C (UG)Michigan State C (UG)10210
RuchirCWRU BKenyon A11210
Elijah Quan (DII)Michigan D (DII)CWRU D (DII)11210
Owen Brown (DII)Kenyon B (DII)Michigan A11310
Jacob Goodson (DII)Ohio State C (DII)Ohio State A (UG)11310