🎓How I Study AIHISA
📖Read
📄Papers📰Blogs🎬Courses
💡Learn
🛤️Paths📚Topics💡Concepts🎴Shorts
🎯Practice
📝Daily Log🎯Prompts🧠Review
SearchSettings
How I Study AI - Learn AI Papers & Lectures the Easy Way

Concepts8

Groups

📐Linear Algebra15📈Calculus & Differentiation10🎯Optimization14🎲Probability Theory12📊Statistics for ML9📡Information Theory10🔺Convex Optimization7🔢Numerical Methods6🕸Graph Theory for Deep Learning6🔵Topology for ML5🌐Differential Geometry6∞Measure Theory & Functional Analysis6🎰Random Matrix Theory5🌊Fourier Analysis & Signal Processing9🎰Sampling & Monte Carlo Methods10🧠Deep Learning Theory12🛡️Regularization Theory11👁️Attention & Transformer Theory10🎨Generative Model Theory11🔮Representation Learning10🎮Reinforcement Learning Mathematics9🔄Variational Methods8📉Loss Functions & Objectives10⏱️Sequence & Temporal Models8💎Geometric Deep Learning8

Category

🔷All∑Math⚙️Algo🗂️DS📚Theory

Level

AllBeginnerIntermediate
∑MathIntermediate

L1 Regularization (Lasso)

L1 regularization (Lasso) adds a penalty \(\lambda \sum_{i=1}^{p} |w_i|\) to the loss, which pushes many coefficients exactly to zero and performs feature selection.

#lasso#l1 regularization#soft-thresholding+12
⚙️AlgorithmAdvanced

Interior Point Methods

Interior point methods solve constrained optimization by replacing hard constraints with a smooth barrier that becomes infinite at the boundary, keeping iterates strictly inside the feasible region.

#interior point method
Advanced
Filtering by:
#kkt conditions
#logarithmic barrier
#central path
+12
∑MathAdvanced

KKT Conditions

KKT conditions generalize Lagrange multipliers to handle inequality constraints in constrained optimization problems.

#kkt conditions#lagrangian#complementary slackness+12
∑MathIntermediate

Convex Optimization Problems

A convex optimization problem minimizes a convex function over a convex set, guaranteeing that every local minimum is a global minimum.

#convex optimization#gradient descent#projected gradient+12
∑MathIntermediate

Lagrange Multipliers & Constrained Optimization

Lagrange multipliers let you optimize a function while strictly satisfying equality constraints by introducing auxiliary variables (the multipliers).

#lagrange multipliers#constrained optimization#kkt conditions+11
📚TheoryIntermediate

Lagrangian Duality

Lagrangian duality turns a constrained minimization problem into a related maximization problem that provides lower bounds on the original objective.

#lagrangian duality#kkt conditions#slater condition+11
📚TheoryIntermediate

Convex Optimization

Convex optimization studies minimizing convex functions over convex sets, where every local minimum is guaranteed to be a global minimum.

#convex optimization#convex function#convex set+12
📚TheoryIntermediate

Optimization Theory

Optimization theory studies how to choose variables to minimize or maximize an objective while respecting constraints.

#optimization#convex optimization#gradient descent+12