Neural Systems: Machine Learning and Artificial Neural Networks

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/35

flashcard set

Earn XP

Description and Tags

Vocabulary practice flashcards covering machine learning workflows, artificial neural networks, perceptrons, backpropagation, biological visual processing pathways, and deep learning models of single cortical neurons.

36 Terms

1
New cards

Training Data

The portion of cleaned data used to teach a machine learning model patterns and relationships.

2
New cards

Test Data

A separated subset of data, typically comprising 20%20\% to 30%30\% of the total dataset, used to evaluate a model's performance in a new context.

3
New cards
<p>Model Fitting</p>

Model Fitting

The alignment between a mathematical model and data patterns, categorized into under-fitting (too simple to capture patterns), good fit, and over-fitting (too specific to training data to generalize to new data).

4
New cards

Under-fitting

A modeling flaw that occurs when a model is too simple and cannot adequately capture the underlying patterns in the data.

5
New cards

Over-fitting

A modeling flaw that occurs when a model is excessively customized to the training data and fails to accurately predict new, unseen data.

6
New cards

Decision Tree

A machine learning structure where an algorithm learns to sort information into categories based on the fewest possible separating features.

7
New cards
<p>Convolution Kernel</p>

Convolution Kernel

A 1D or 2D grid of numbers passed over pixels during image processing to determine the influence of adjacent pixels and extract specific features such as blurring, sharpening, embossing, or edges.

8
New cards

Kernel Trick

A mathematical and statistical approach applied to nonlinear, overlapping datasets to project them into a higher-dimensional space where they can be separated.

9
New cards

Cross-Validation

An evaluation approach, such as k-fold cross-validation, that assesses model performance across multiple distinct subsets of data to verify generalizability.

10
New cards

Regularization

The technique of introducing penalties, such as L1 (Lasso) or L2 (Ridge), to discourage excessive model complexity and avoid fitting to noise.

11
New cards

Early Stopping

A safeguard during training that halts optimization as soon as performance on a separate validation set begins to deteriorate, preventing data memorization.

12
New cards

Pruning

The process of limiting the depth or removing superfluous branches of a decision tree to stop it from learning overly specific, non-generalizable patterns.

13
New cards

Dropout

A deep learning regularization technique where randomly selected nodes are deactivated during each training cycle to reduce co-adaptation and over-fitting.

14
New cards

Ensemble Methods

Techniques such as bagging (e.g., Random Forests) or boosting (e.g., Gradient Boosting) that combine outputs from multiple models to enhance generalization and reduce over-fitting.

15
New cards

Data Augmentation

The artificial expansion of a training dataset in neural networks through transformations such as rotating, flipping, or scaling existing images.

16
New cards

Error (Machine Learning)

The magnitude of the difference between the actual ground-truth value and the predicted output produced by the machine learning algorithm.

17
New cards

Traditional Machine Learning

Algorithms that learn tasks from data patterns without explicit step-by-step programming, but require humans to manually curate inputs and perform feature extraction.

18
New cards

Artificial Neural Network (ANN)

A computational architecture composed of interconnected nodes inspired by biological neurons that autonomously learns and extracts features directly from raw data.

19
New cards

Perceptron

The simplest neural network model for binary classification, which maps multiple binary inputs (0,1)(0, 1) into a single binary output (0,1)(0, 1) by adjusting weights and biases.

20
New cards

Perceptron Weight Update Rule

The learning equation Δwi=β(t−y)xi\Delta w_i = \beta (t - y) x_i, where ww represents weights, η\eta is learning rate, tt is the target output, yy is the actual output, and xix_i is the input feature.

21
New cards

McCulloch-Pitts (MCP) Neuron

A non-learning computational unit that integrates inputs and applies a strict threshold to produce a binary output based on fixed predetermined rules.

22
New cards

Multilayer Perceptron (MLP)

A feedforward artificial neural network formed by linking multiple perceptrons together across an input layer, one or more hidden layers, and an output layer.

23
New cards

Input Layer

The initial layer of an artificial neural network, wherein each node corresponds directly to an individual feature of the incoming data.

24
New cards

Hidden Layer

An intermediate network layer where nodes function as integrators by computing weighted sums of upstream inputs and applying activation functions.

25
New cards

Output Layer

The final layer of an artificial neural network that generates the model's ultimate classification, prediction, or decision.

26
New cards
<p>Backpropagation</p>

Backpropagation

An optimization algorithm that computes the gradient of the loss function relative to each weight and routes error backward through the network to update weights.

27
New cards

Simple Neural Network

A shallow neural network architecture containing only one or two hidden layers, appropriate for straightforward problems with restricted computational demands.

28
New cards

Deep Learning Network

An artificial neural network containing numerous hidden layers (tens to hundreds) that extracts hierarchical, complex features from extensive datasets.

29
New cards

Self-Information (I(E)I(E))

The quantification of information conveyed by a specific event EE, defined as I(E)=log⁡2(1p(E))I(E) = \log_2\left(\frac{1}{p(E)}\right).

30
New cards

Shannon's Entropy (H(X)H(X))

The average expected information content or uncertainty across all states of a random variable XX, calculated as H(X)=∑xP(x)log⁡(1P(x))H(X) = \sum_x P(x) \log\left(\frac{1}{P(x)}\right).

31
New cards
<p>Visual System Receptive Fields</p>

Visual System Receptive Fields

Hierarchical stimulus preferences across the visual pathway: ON-center retinal ganglion cells respond to a spot surrounded by a dark annulus, V1 simple cells respond to an elongated bar of light, and inferotemporal cortex cells respond to complex forms such as faces.

32
New cards
<p>Dorsal Stream</p>

Dorsal Stream

The visual processing pathway that projects from V1 toward MT and the parietal cortex, dedicated to encoding spatial location and motion ("where/how").

33
New cards

Ventral Stream

The visual processing pathway that projects from V1 toward V4 and the inferotemporal (IT) cortex, dedicated to decoding form, color, structure, and object identity ("what").

34
New cards

Parallel Processing

The simultaneous routing of identical visual signals across distinct pathways (such as dorsal and ventral streams) to enhance efficiency and provide functional redundancy.

35
New cards

Temporally Convolutional Neural Network (TCN)

A deep network structure with 55 to 88 layers shown by Beniaguev et al. (2021) to successfully mimic the input-output dynamics of a layer 5 cortical pyramidal cell at single-millisecond precision.

36
New cards

Neuronal Computational Complexity Drivers

The two primary biological factors identified in Beniaguev et al. (2021) that generate the deep-network complexity of single cortical pyramidal neurons: dendritic morphology and NMDA receptors.