Modules
1. What is a Neuron?
2. Neural Networks
3. How Training Works
4. Word Embeddings
5. Attention Mechanism
6. The Transformer
7. How LLMs Work
8. RAG Pipelines
9. Building AI Agents
10. Prompt Engineering
11. Linear Regression
12. Logistic Regression
13. Decision Trees
14. Random Forest
15. K-Means Clustering
16. Cosine Similarity
17. Types of AI & AI Agents
18. Tokenization in NLP
19. Fine-Tuning LLMs
20. Evaluating LLMs
21. Vector Databases Explained
22. Diffusion Models & Image Generation
23. Generative Adversarial Networks (GANs)
24. Reinforcement Learning Basics
25. RLHF: Reinforcement Learning from Human Feedback
26. Convolutional Neural Networks (CNNs)
27. RNNs and LSTMs
28. Overfitting & Regularization
29. Hyperparameter Tuning
30. Support Vector Machines (SVM)
31. Naive Bayes Classifier
32. PCA & Dimensionality Reduction
33. Model Context Protocol (MCP)
34. Why LLMs Hallucinate
35. Context Windows & Long Context
36. Multimodal AI (Vision + Language)
37. AI Ethics & Bias in Machine Learning
38. Classifier Evaluation Metrics: Precision, Recall, ROC & F1
39. Bayesian Inference & MAP Estimation
40. Backpropagation Explained
41. Autoencoders & Variational Autoencoders
42. NLP Text Representation: N-grams, Bag-of-Words & TF-IDF
43. Markov Decision Processes & the Bellman Equation
44. Data Preprocessing & Cleaning for Machine Learning
45. Feature Engineering for Machine Learning
46. ML Frameworks Compared: TensorFlow, PyTorch & JAX
47. Data Selection & Active Learning
48. ML Hardware Acceleration: GPUs, TPUs & Accelerators
49. ML Benchmarking Methodology
50. Responsible AI Engineering: Safety & Robustness
51. DBSCAN & Hierarchical Clustering
52. ML Pipelines: Chaining Preprocessing and Models
53. History & Evolution of AI Systems
54. ML System Design Fundamentals
55. The Machine Learning Workflow & Lifecycle
56. Data Engineering for Machine Learning
57. Model Compression: Quantization, Pruning & Distillation
58. Model Serving & Inference Systems
59. MLOps: Monitoring & Maintaining Models in Production
60. The Turing Test & AI Evaluation
61. Heuristics & Search in AI
62. Genetic Algorithms & Evolutionary Computation
63. Knowledge Representation & Semantic Networks
64. Expert Systems
65. AI and Games: How AlphaZero Works
66. AI in Bioinformatics
67. Symbolic vs. Connectionist AI
68. Constraint Satisfaction Problems
69. Fuzzy Logic Systems
70. Multivariate Regression Analysis
71. Non-Linear Least Squares Fitting
72. k-Nearest Neighbors (kNN)
73. Ridge & Lasso Regression
74. Polynomial Regression
75. Boosting Algorithms: AdaBoost, Gradient Boosting & XGBoost
76. Ensemble Modeling: Bagging, Boosting & Stacking Compared
77. Gaussian Mixture Models
78. Linear Discriminant Analysis (LDA)
79. Anomaly Detection in Machine Learning
80. Time Series Forecasting with Machine Learning
81. Survival Analysis for Machine Learning
82. Multicollinearity & Variance Inflation Factor (VIF)
83. Cross-Validation Strategies
84. Statistical Hypothesis Testing for ML Model Comparison
85. Activation Functions Deep Dive: ReLU, ELU, Sigmoid, Softmax & Swish
86. Neural Network Hyperparameters Explained
87. The Multilayer Perceptron (MLP)
88. CNN Building Blocks: Convolution & Pooling Layers
89. Famous CNN Architectures: VGG, ResNet & Beyond
90. GRUs vs LSTMs
91. Transformer-XL & Reformer: Handling Longer Sequences
92. NLU vs NLG: Understanding vs Generating Language
93. The Pre-Transformer Embedding Era: ELMo, ULMFit & BERT
94. Deep Reinforcement Learning (DRL) Overview
95. Policy Gradient Methods
96. Actor-Critic Methods
97. Self-Supervised Learning
98. Transfer Learning
99. Batch Normalization & Layer Normalization
100. ML Deployment Paradigms: Cloud, Edge & Mobile
101. Edge AI & TinyML
102. System Balance: Matching ML Workloads to Hardware
103. Neural Computation Fundamentals
104. Network Architecture Design Tradeoffs
105. Distributed Training: Data & Model Parallelism
106. Federated Learning
107. ML Reproducibility Engineering
108. Feature Stores Explained
109. Model Registry & Versioning
110. A/B Testing ML Models in Production
111. Shadow Deployment & Canary Releases for ML
112. ML Cost Optimization
113. ONNX & Model Interoperability
114. Model Explainability: SHAP & LIME
115. ML System Observability
116. Synthetic Data Generation
117. Data Augmentation Techniques
118. ML Security: Adversarial Attacks
119. Privacy-Preserving Machine Learning
120. Chain-of-Thought Reasoning
121. Mixture of Experts (MoE)
122. Speculative Decoding
123. Constitutional AI & Alignment Techniques
124. Tool-Use Patterns in LLM Agents
125. Advanced RAG Patterns: Hybrid Search & Re-ranking
126. Semantic Search vs Keyword Search
127. Fine-Tuning Embedding Models
128. Prompt Injection Security
129. AI Red-Teaming
130. Speech Recognition (ASR)
131. Text-to-Speech (TTS)
132. Computer Vision: Object Detection
133. Image Segmentation
134. OCR & Document AI
135. NumPy Fundamentals for Machine Learning
136. Pandas for Data Science
137. Data Visualization for ML with Matplotlib
138. Model Interpretability: Feature Importance Methods
139. ML Experiment Tracking
140. AutoML Explained
141. Handling Imbalanced Data: SMOTE & Resampling Techniques
142. Multi-Label Classification
143. Multi-Task Learning
144. Zero-Shot & Few-Shot Learning
145. Curriculum Learning
146. Model Calibration
147. Snapshot & Neural Network Ensembles
148. Knowledge Graphs in AI
149. Jupyter Notebooks for Machine Learning
150. Linear Algebra for Machine Learning
151. Calculus for Machine Learning
152. Probability Theory for Machine Learning
153. Information Theory: Entropy, Cross-Entropy & KL Divergence
154. Optimization Algorithms: SGD, Adam & RMSprop Compared
155. Convex vs. Non-Convex Optimization
156. Lagrange Multipliers & Constrained Optimization
157. Monte Carlo Methods in Machine Learning
158. Numerical Stability in Machine Learning
159. The Central Limit Theorem for Machine Learning
160. Bootstrapping & Resampling Methods
161. Bayesian vs. Frequentist Statistics
162. Confidence Intervals for ML Metrics
163. Power Analysis & Sample Size Calculation
164. A/A Testing & Experiment Validity Checks
165. The Adam Optimizer Explained
166. Learning Rate Schedules: Warmup, Cosine Annealing & Step Decay
167. Gradient Clipping
168. Mixed Precision Training
169. Weight Initialization Strategies
170. Association Rule Mining & the Apriori Algorithm
171. Collaborative Filtering for Recommender Systems
172. Matrix Factorization for Recommender Systems
173. Content-Based Recommender Systems
174. The Cold Start Problem in Recommender Systems
175. Spectral Clustering
176. Mean Shift Clustering
177. Local Outlier Factor (LOF)
178. t-SNE Deep Dive
179. UMAP Deep Dive
180. Graph Neural Networks (GNNs)
181. Siamese Networks
182. One-Shot Learning & Meta-Learning (MAML)
183. Neural Ordinary Differential Equations (Neural ODEs)
184. Normalizing Flows
185. Energy-Based Models
186. Restricted Boltzmann Machines (RBMs)
187. Self-Organizing Maps (SOMs)
188. Capsule Networks
189. Spiking Neural Networks (SNNs)
190. Part-of-Speech Tagging & Named Entity Recognition
191. Dependency Parsing: Representing Sentence Structure
192. Coreference Resolution: Tracking Who's Who in Text
193. Text Summarization: Extractive vs. Abstractive
194. Machine Translation: From Rule-Based to Neural
195. Language Model Perplexity: What It Measures
196. Subword Tokenization Deep Dive: BPE, WordPiece & Unigram
197. Byte-Level Tokenization: Solving the Unknown-Token Problem
198. Instruction Tuning Datasets: Building FLAN & Alpaca-Style Data
199. RLHF Reward Hacking: When Models Game the Reward Model
200. Image Classification Metrics: Top-1 & Top-5 Accuracy
201. Super-Resolution with GANs
202. Neural Style Transfer
203. Human Pose Estimation
204. Face Recognition Systems
205. Video Action Recognition
206. Point Clouds & 3D Vision
207. SLAM Basics (Simultaneous Localization and Mapping)
208. Vision Data Augmentation Deep Dive
209. Image Captioning
210. Multi-Agent Reinforcement Learning
211. Inverse Reinforcement Learning
212. Imitation Learning
213. Reward Shaping in Reinforcement Learning
214. The Sparse Rewards Problem in RL
215. Sim-to-Real Transfer in Robotics
216. Offline Reinforcement Learning
217. Curiosity-Driven Exploration
218. Hierarchical Reinforcement Learning
219. Model-Based Reinforcement Learning
220. The ReAct Agent Pattern
221. Plan-and-Execute Agents
222. Multi-Agent Orchestration Patterns
223. Agent Memory Architectures
224. Agent Evaluation Methodology
225. Prompt Caching & Context Caching
226. Structured Outputs & JSON Mode
227. Vector Database Comparison Deep Dive
228. LoRA Merging & Model Merging
229. Quantization Formats: GGUF, AWQ & GPTQ Compared
230. AI Regulation: The EU AI Act & Risk-Based Frameworks
231. AI & Copyright: Open Questions
232. The Environmental Impact of AI
233. AI and the Future of Work
234. Learning to Rank for Search
235. Fraud Detection Systems with Machine Learning
236. Credit Scoring Models
237. Demand Forecasting with Machine Learning
238. Small Language Models (SLMs) vs. LLMs
239. On-Device LLMs
240. The Hugging Face Ecosystem Overview
241. LangChain vs. LlamaIndex
242. Agent Framework Comparison: AutoGPT, CrewAI & LangGraph
243. Feature Crossing for Recommenders
244. A/B Testing ML-Powered Products
245. Isolation Forest Deep Dive
246. OPTICS Clustering
247. Affinity Propagation Clustering
248. Decision Stumps & Weak Learners
249. Hopfield Networks
Share Guide
AI & MLDeep
Intermediate

Neural Network Hyperparameters Explained

12 min read

Learn
Deep Reading
Estimated 12 mins
Prereq
Intermediate
Basic ML concepts helpful
Interactive
Static Playbook
Static guide & reference tables

Hyperparameters vs. parameters

A neural network's parameters — weights and biases — are learned automatically by gradient descent during training. Its hyperparameters are everything you set before training begins that controls how that learning happens: how big a step to take, how many examples to look at per step, how much to randomly disable, and how to initialize everything before learning starts.

Get the hyperparameters wrong and the exact same architecture can fail to train at all, train painfully slowly, or overfit badly — even though the model's theoretical capacity never changed. Understanding what each one actually does mechanically (not just "tune it with a sweep") makes debugging a stalled or diverging training run far faster.

Learning rate: the most important knob

The learning rate $\eta$ scales how large a step gradient descent takes at each update: $w \leftarrow w - \eta \nabla L(w)$. It is widely considered the single most important hyperparameter to get right.

Too high, and updates overshoot the minimum of the loss landscape — the loss can oscillate wildly or diverge to infinity/NaN. Too low, and training crawls: the model technically moves toward a good solution but takes so many steps that it looks stalled, or gets permanently stuck in a shallow local plateau it could have escaped with a bigger step. The textbook diagnostic: plot the loss curve. A spiky, exploding loss means the learning rate is too high; a flat, barely-moving loss (that isn't already near its best achievable value) means it's too low.

python

Note

Optimizers like Adam adjust the effective step size per-parameter based on recent gradient history, which makes them more forgiving than plain SGD. But they still have a base learning rate that matters enormously — Adam with a learning rate of 0.1 will still diverge on most problems, and Adam with 1e-6 will still crawl. Adaptive optimizers reduce how finely you need to tune, not whether you need to tune at all.

Batch size: a tradeoff between gradient quality and speed

The batch size determines how many training examples are used to compute each gradient estimate before updating weights. A larger batch gives a gradient estimate that's closer to the true gradient over the full dataset (less noisy), and modern hardware can process larger batches more efficiently in parallel. A smaller batch gives a noisier gradient estimate, but that noise can actually help — it acts as a mild regularizer, nudging the optimizer out of sharp, narrow minima that tend to generalize poorly, toward flatter minima that tend to generalize better.

In practice, very large batches often need a correspondingly larger learning rate to train in a similar number of steps (since each step covers more data, you can afford to move further), and very small batches need a smaller learning rate to avoid instability from the noisier gradient. Batch size and learning rate are not independent knobs — changing one usually means revisiting the other.

Dropout: regularization by random deletion

Dropout randomly deactivates a fraction $p$ of neurons' outputs during each training step (commonly $p = 0.2$ to $0.5$), forcing the network to not rely too heavily on any single neuron or narrow combination of neurons. Because a different random subset is dropped on every forward pass, the network effectively trains a huge ensemble of overlapping sub-networks that share weights, and that ensembling effect is a strong regularizer against overfitting.

At test time, dropout is turned off entirely — all neurons are active — but outputs are typically rescaled (or, in the "inverted dropout" convention used by most frameworks, scaling is baked into training instead) so that the expected magnitude of activations matches what the network saw during training. Forgetting to disable dropout at inference time is a common and confusing bug: it makes evaluation outputs nondeterministic and the model perform worse than it actually is.

python

Weight initialization: setting the starting point

Before training starts, weights must be initialized to some value — and the choice matters more than it might seem. Initializing all weights to zero is catastrophic: every neuron in a layer receives identical gradients and stays identical forever, so the network can never break symmetry and effectively collapses to a single neuron per layer.

Random initialization with the wrong scale causes its own problems. Too large, and activations and gradients can explode as they compound through layers (each layer's output feeds the next with ever-growing magnitude). Too small, and activations shrink toward zero layer by layer — a form of vanishing signal even before you've picked an activation function. Xavier/Glorot initialization scales initial weights based on the number of inputs and outputs of a layer to keep activation variance roughly stable across layers, and is well-suited to sigmoid/tanh activations. He initialization uses a similar idea but accounts for the fact that ReLU zeroes out half its inputs on average, making it the standard choice for ReLU-family networks.

Hyperparameter cheat sheet

HyperparameterToo high / too muchToo low / too littleTypical starting point
Learning rateLoss oscillates or diverges (NaN)Training crawls, looks stalled1e-3 for Adam, tune with a short LR sweep
Batch sizeSlower per-epoch convergence, needs more memoryNoisy gradients, unstable training32–256 depending on model/data size
Dropout rateUnderfitting — network can't learn enoughLittle regularization, overfits easily0.2–0.5 for fully connected layers
Weight initialization scaleExploding activations/gradientsVanishing activations/gradientsHe init (ReLU) or Xavier init (sigmoid/tanh)

Note

A classic mistake: trying several learning rates or dropout rates and picking whichever gives the best test set score. This effectively fits hyperparameters to the test set the same way weights get fit to training data, quietly invalidating the test set as an unbiased estimate of generalization. Hyperparameter search should use a separate validation set (or cross-validation), with the test set touched only once, at the very end, to report a final honest number.

What's next

With activation functions and training hyperparameters covered, the next lesson zooms out to architecture: the Multilayer Perceptron, how stacking perceptron-like units into layers gives a network the ability to approximate far more complex functions than any single unit could alone.

I build these systems professionally.

Whether it's a RAG pipeline, analytics migration, or AI workflow — let's talk.

Need custom AI or MarTech setup? Let's build together.