AdamW: Decoupled Weight Decay for Neural Networks
Covers AdamW by understanding why L2 regularization and weight decay diverge in adaptive optimizers.
405 items · Page 9 of 9
Create a free account to keep your reading organized, join thoughtful discussions, and get more from every chapter.
Free to join · Takes less than a minute
Why
I created this space so readers can learn together, ask questions, and make sense of difficult ideas.

Covers AdamW by understanding why L2 regularization and weight decay diverge in adaptive optimizers.
Explains how batch normalization eliminates internal covariate shift by normalizing layer activations.
Covers L1 regularization (LASSO) in machine learning, covering mathematical foundations, optimization theory, practical implementation.
Latent Semantic Analysis uses matrix factorization to uncover hidden relationships between terms and documents for retrieval, clustering, and topic discovery.
Multiple linear regression estimates how several predictors relate to an outcome. Covers OLS formulas, assumptions, interpretation, diagnostics, and Python.
Covers multicollinearity in regression analysis with this practical guide. VIF analysis, correlation matrices, coefficient stability testing.
Covers Byte Pair Encoding (BPE), the subword tokenization algorithm powering GPT and modern LLMs. Explains how BPE builds a vocabulary.
Explains how GloVe derives word embeddings from co-occurrence ratios, derives the weighted least squares objective.
Covers Ordinary Least Squares (OLS) regression, including mathematical derivations, matrix formulations, step-by-step examples, and Python implementation.
Covers BM25, the major probabilistic ranking algorithm that changed information retrieval. Explains how BM25 solved TF-IDF's limitations.
Simple linear regression models the relationship between one predictor and an outcome. Covers OLS formulas, assumptions, interpretation, and Python.
Examines the CBOW Word2Vec architecture covering context averaging, the objective function, gradient derivation, training dynamics.
Explains how the Skip-gram model trains a neural network to predict context words and learns dense word embeddings.
Generalized linear models combine link functions with probability distributions. Covers logistic and Poisson regression, maximum likelihood, and Python.
Examines raw, log-scaled, boolean, augmented, and L2-normalized term frequency variants, with sparsity analysis and efficient computation using scikit-learn.
Explains how perplexity measures language model quality through cross-entropy and information theory.
Explains how n-gram language models assign probabilities to word sequences using the chain rule, Markov assumption, and MLE.
Covers smoothing techniques that solve the zero probability problem in n-gram models, from simple add-k smoothing through Good-Turing estimation to Kneser-Ney.
Covers regular expressions for text processing, covering metacharacters, quantifiers, lookarounds, and practical NLP patterns.
Covers OpenAI's ChatGPT release in 2022, including the conversational interface, RLHF training approach, safety measures.
Examines Mixtral 8x7B's sparse architecture and top-2 expert routing. Explains how MoE models match Llama 2 70B quality.
Create a free account to keep your reading organized, join thoughtful discussions, and get more from every chapter.
Free to join · Takes less than a minute
Why
I created this space so readers can learn together, ask questions, and make sense of difficult ideas.
