<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Victor</title><link>https://www.victorexplore.com/</link><description>Recent content on Victor</description><generator>Hugo -- 0.169.0</generator><language>en-us</language><lastBuildDate>Sun, 29 Jun 2025 00:00:00 +0000</lastBuildDate><atom:link href="https://www.victorexplore.com/index.xml" rel="self" type="application/rss+xml"/><item><title>Decision making framework using probability theory</title><link>https://www.victorexplore.com/posts/how-to-live-a-good-life/descion-making-framework-using-probability-theory/</link><pubDate>Sun, 29 Jun 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/how-to-live-a-good-life/descion-making-framework-using-probability-theory/</guid><description>A framework for making decisions under uncertainty with probability theory: actions, outcomes and how to choose between them.</description></item><item><title>Applying RL to derive Optimal Policy for human behavior</title><link>https://www.victorexplore.com/posts/how-to-live-a-good-life/you-are-rl-agent/</link><pubDate>Sun, 25 May 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/how-to-live-a-good-life/you-are-rl-agent/</guid><description>Human behaviour modelled as a reinforcement learning problem: the world as the environment, the senses as observations and the brain as the policy.</description></item><item><title>The Complete Guide to the X 'For You' Algorithm</title><link>https://www.victorexplore.com/posts/how-x-algo-works/</link><pubDate>Sat, 24 May 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/how-x-algo-works/</guid><description>A technical breakdown of how X&amp;#39;s recommendation algorithm actually works, based on the open-source code. Not speculation—just what the code says.</description></item><item><title>What is Retrieval Augmented Generation? (RAG)</title><link>https://www.victorexplore.com/posts/dump/rag/</link><pubDate>Sat, 24 May 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/dump/rag/</guid><description>What retrieval augmented generation is, which limits of large language models it addresses, and how it works.</description></item><item><title>Overview of Reinforcement Learning</title><link>https://www.victorexplore.com/posts/reinforcement-learning/0-cheatsheat/</link><pubDate>Fri, 09 May 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/reinforcement-learning/0-cheatsheat/</guid><description>An overview of reinforcement learning: the basic terms, the Markov decision process, the interaction loop and the aim, in maths.</description></item><item><title>How reinforcement learning works in Unity</title><link>https://www.victorexplore.com/posts/how-reinforcement-learning-works-in-unity/</link><pubDate>Sat, 01 Mar 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/how-reinforcement-learning-works-in-unity/</guid><description>How reinforcement learning works in Unity: the packages, how Unity communicates with Python, and what to know before PPO.</description></item><item><title>AI Roadmap</title><link>https://www.victorexplore.com/posts/dump/ai-roadmap/</link><pubDate>Sat, 01 Feb 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/dump/ai-roadmap/</guid><description>The step-by-step roadmap I made for my younger brother to learn AI: maths, coding, machine learning and what to do after.</description></item><item><title>Why we need a virtual environment</title><link>https://www.victorexplore.com/posts/dump/virtual-environment/</link><pubDate>Sat, 01 Feb 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/dump/virtual-environment/</guid><description>Why Python projects need a virtual environment, built up from what a module and a package are.</description></item><item><title>Adaboost</title><link>https://www.victorexplore.com/posts/prnn/33--adaboost/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/prnn/33--adaboost/</guid><description>AdaBoost derived from the general boosting form: the problem setting, how the step size is found and the full algorithm.</description></item><item><title>Aggregated posterior mismatch</title><link>https://www.victorexplore.com/posts/adrl/13---aggregated-posterior-mismatch-/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/13---aggregated-posterior-mismatch-/</guid><description>Why the aggregated posterior of a VAE does not match the prior, and why the EM algorithm does not have this problem.</description></item><item><title>Bayes classifier</title><link>https://www.victorexplore.com/posts/prnn/5---bayes-classifier/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/prnn/5---bayes-classifier/</guid><description>The Bayes classifier, its notation, and why it is the best classifier for the 0-1 loss.</description></item><item><title>Bias variance tradeoff</title><link>https://www.victorexplore.com/posts/prnn/19--bias-variance-tradeoff/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/prnn/19--bias-variance-tradeoff/</guid><description>How the average squared-error risk splits into bias, variance and irreducible noise, and what the tradeoff means.</description></item><item><title>Boosting</title><link>https://www.victorexplore.com/posts/prnn/31---boosting/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/prnn/31---boosting/</guid><description>How boosting trains models one after another, each one correcting the errors of the ones before, with the maths.</description></item><item><title>Cheat sheet</title><link>https://www.victorexplore.com/posts/adrl/cheatsheet/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/cheatsheet/</guid><description>A formula sheet for deep generative models: divergences, common probability distributions and the key results from the notes.</description></item><item><title>Conditional GANs(cGANs)</title><link>https://www.victorexplore.com/posts/adrl/10---conditional-gans/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/10---conditional-gans/</guid><description>How a conditional GAN feeds extra information such as class labels to the generator and the discriminator, with the objective and the training steps.</description></item><item><title>Conditional score matching</title><link>https://www.victorexplore.com/posts/adrl/24---conditional-score-matching/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/24---conditional-score-matching/</guid><description>Score matching with labelled data: classifier guidance and classifier-free guidance.</description></item><item><title>Convex conjugate</title><link>https://www.victorexplore.com/posts/adrl/4---convex-conjugate/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/4---convex-conjugate/</guid><description>The convex conjugate (Fenchel conjugate): definition, properties, and why the conjugate of the conjugate gives the function back.</description></item><item><title>DDIM (Denoising Diffusion Implicit Models)</title><link>https://www.victorexplore.com/posts/adrl/30---ddim/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/30---ddim/</guid><description>Why DDPM inference needs many sequential steps, how DDIM gives up the Markov assumption, the derivation and how inference works.</description></item><item><title>DDPMs as SDEs</title><link>https://www.victorexplore.com/posts/adrl/27-ddpm-as-sdes/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/27-ddpm-as-sdes/</guid><description>How the DDPM forward process becomes a continuous SDE, how the SDE is reversed, and how the reverse SDE is made discrete again.</description></item><item><title>Decision Trees</title><link>https://www.victorexplore.com/posts/prnn/28---descion-trees/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/prnn/28---descion-trees/</guid><description>How a decision tree splits data, how it is grown with Gini impurity or mean squared error, and how it is pruned.</description></item><item><title>Deep learning and generative models notes: index</title><link>https://www.victorexplore.com/posts/adrl/0---index/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/0---index/</guid><description>A list of my deep learning notes in order: divergences, GANs, VAEs, diffusion models, score matching, SDEs and sequence models.</description></item><item><title>Denoising Diffusion Probabilistic Models (DDPM) - part 1</title><link>https://www.victorexplore.com/posts/adrl/16---denoising-diffusion-probabilistic-models-ddpm---part-1/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/16---denoising-diffusion-probabilistic-models-ddpm---part-1/</guid><description>DDPM seen as a VAE with many latent variables: notation, the latent posterior and how the ELBO breaks into parts.</description></item><item><title>Denoising Diffusion Probabilistic Models (DDPM) - part 2</title><link>https://www.victorexplore.com/posts/adrl/17---denoising-diffusion-probabilistic-models-ddpm---part-2/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/17---denoising-diffusion-probabilistic-models-ddpm---part-2/</guid><description>The three parts of the DDPM ELBO explained: the reconstruction term, the prior matching term and the denoising matching term.</description></item><item><title>Denoising Diffusion Probabilistic Models (DDPM) - part 3</title><link>https://www.victorexplore.com/posts/adrl/18---denoising-diffusion-probabilistic-modelsddpm---part-3/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/18---denoising-diffusion-probabilistic-modelsddpm---part-3/</guid><description>The DDPM reparameterisation, the architecture, and the training and inference steps.</description></item><item><title>Difference between SMLD and DDPM</title><link>https://www.victorexplore.com/posts/adrl/23---difference-between-smld-and-ddpm/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/23---difference-between-smld-and-ddpm/</guid><description>How SMLD (noise conditional score networks) and DDPM differ in the forward process and in inference.</description></item><item><title>Domain adversarial networks (DANs)</title><link>https://www.victorexplore.com/posts/adrl/11---domain-adversarial-networks/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/11---domain-adversarial-networks/</guid><description>How domain adversarial networks learn features that work across domains: the feature extractor, the domain discriminator and the training objective.</description></item><item><title>Expectation Maximization (EM) algorithm</title><link>https://www.victorexplore.com/posts/prnn/8---em-algorithm/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/prnn/8---em-algorithm/</guid><description>The EM algorithm from latent variable models and variational inference: the ELBO, how it is made tight, and EM for Gaussian mixtures.</description></item><item><title>F-Divergence</title><link>https://www.victorexplore.com/posts/adrl/3---f-divergence/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/3---f-divergence/</guid><description>F-divergence as a general measure of the difference between two probability distributions, with its main properties.</description></item><item><title>Frechet Inception Distance (FID)</title><link>https://www.victorexplore.com/posts/adrl/9--frechet-inception-distance/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/9--frechet-inception-distance/</guid><description>Why generative models cannot be evaluated like discriminative models, and what the Frechet Inception Distance measures.</description></item><item><title>Generative Adversarial Networks (GANs)</title><link>https://www.victorexplore.com/posts/adrl/5---gans/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/5---gans/</guid><description>GANs derived from F-divergence minimisation, and why the network is called adversarial.</description></item><item><title>Generative vs Discriminative Models</title><link>https://www.victorexplore.com/posts/adrl/1--what-is-the-difference-between-generative-model-and-discriminative-model/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/1--what-is-the-difference-between-generative-model-and-discriminative-model/</guid><description>What a generative model learns, what a discriminative model learns, how the two differ, and what a conditional generative model is.</description></item><item><title>Infinite horizon discounted cost problems</title><link>https://www.victorexplore.com/posts/reinforcement-learning/11-feb-2025/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/reinforcement-learning/11-feb-2025/</guid><description>Infinite horizon discounted cost problems: the setting, the optimal cost function, Bellman operators and the Bellman equation.</description></item><item><title>Info VAEs: Information Maximizing Variational Autoencoders</title><link>https://www.victorexplore.com/posts/adrl/14.1-info-vae/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/14.1-info-vae/</guid><description>How InfoVAE changes the VAE objective with a mutual information term to fix the aggregated posterior mismatch, and how it is trained.</description></item><item><title>Introduction to Controlled Markov Chains and Markov Decision Processes</title><link>https://www.victorexplore.com/posts/reinforcement-learning/16-jan-2025/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/reinforcement-learning/16-jan-2025/</guid><description>Controlled Markov chains and Markov decision processes: policies, optimal policies and the principle of optimality.</description></item><item><title>Introduction to Reinforcement Learning</title><link>https://www.victorexplore.com/posts/reinforcement-learning/1-introduction-to-reinforcement-learning/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/reinforcement-learning/1-introduction-to-reinforcement-learning/</guid><description>The core idea of reinforcement learning, an agent that learns from reward, and the core problems of the field.</description></item><item><title>JEPA - Joint Embedding Prediction and Autoencoding</title><link>https://www.victorexplore.com/posts/adrl/36---jepa/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/36---jepa/</guid><description>The JEPA framework: prediction in embedding space, the formulation, training and downstream use.</description></item><item><title>K-means clustering</title><link>https://www.victorexplore.com/posts/prnn/35---k-means-clustering/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/prnn/35---k-means-clustering/</guid><description>K-means as hard clustering, derived from mixture model clustering, with the algorithm.</description></item><item><title>KL Divergence - Kullback-Leibler Divergence</title><link>https://www.victorexplore.com/posts/adrl/2---kl-divergence---kullback-leibler-divergence/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/2---kl-divergence---kullback-leibler-divergence/</guid><description>KL divergence with intuition and properties, and why minimising it is the same as maximising likelihood.</description></item><item><title>Learning the system model from data and Monte Carlo methods</title><link>https://www.victorexplore.com/posts/reinforcement-learning/19-feb-2025/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/reinforcement-learning/19-feb-2025/</guid><description>How to learn the system model from data, and Monte Carlo methods for value estimation: first-visit and every-visit.</description></item><item><title>Linear Discriminant Analysis(LDA)</title><link>https://www.victorexplore.com/posts/prnn/9---linear-discriminant-analysis/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/prnn/9---linear-discriminant-analysis/</guid><description>Linear discriminant analysis derived from Gaussian class-conditional densities for two classes.</description></item><item><title>Linear regression</title><link>https://www.victorexplore.com/posts/prnn/12---linear-regression/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/prnn/12---linear-regression/</guid><description>Linear regression from the ideal regressor: its derivation, how to read it, and empirical risk minimisation.</description></item><item><title>Machine learning notes: index</title><link>https://www.victorexplore.com/posts/prnn/0---index/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/prnn/0---index/</guid><description>A list of my machine learning notes in order: classifiers, regression, density estimation, SVMs, neural networks, trees, boosting and clustering.</description></item><item><title>Miscellaneous Machine Learning Terms</title><link>https://www.victorexplore.com/posts/prnn/27---miscellaneous-terms/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/prnn/27---miscellaneous-terms/</guid><description>Short definitions of common machine learning terms: epoch, batch size and the variants of gradient descent.</description></item><item><title>Multi-Armed Bandit Problem</title><link>https://www.victorexplore.com/posts/reinforcement-learning/2-multi-armed-bandit-problem/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/reinforcement-learning/2-multi-armed-bandit-problem/</guid><description>The multi-armed bandit problem: action-value methods, greedy and epsilon-greedy policies and incremental updates.</description></item><item><title>Naive GANs</title><link>https://www.victorexplore.com/posts/adrl/6---naive-gans/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/6---naive-gans/</guid><description>The original GAN: derivation from the general F-divergence form, how to read the objective, and how it is trained.</description></item><item><title>Neural network</title><link>https://www.victorexplore.com/posts/prnn/25---neural-network/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/prnn/25---neural-network/</guid><description>A neural network defined as a composition of functions, with the common non-linear activation functions.</description></item><item><title>Noise Contrastive Estimation</title><link>https://www.victorexplore.com/posts/adrl/33---noise-contrastive-estimation/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/33---noise-contrastive-estimation/</guid><description>The idea behind noise contrastive estimation: learn a distribution by learning to tell its samples from noise, with the formulation.</description></item><item><title>Parzen window estimate</title><link>https://www.victorexplore.com/posts/prnn/17---parzen-window-estimate/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/prnn/17---parzen-window-estimate/</guid><description>The Parzen window (kernel density) estimate: the idea, the uniform and Gaussian kernels, and the algorithm.</description></item><item><title>Policy Iteration</title><link>https://www.victorexplore.com/posts/reinforcement-learning/4-policy-iteration/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/reinforcement-learning/4-policy-iteration/</guid><description>Policy iteration and modified policy iteration: the algorithm, the key proposition and convergence.</description></item><item><title>Policy iteration for infinite horizon discounted cost problems</title><link>https://www.victorexplore.com/posts/reinforcement-learning/18-feb-2025/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/reinforcement-learning/18-feb-2025/</guid><description>The optimality conditions of policy iteration in discounted cost problems, and the algorithm step by step.</description></item><item><title>Precursor: Stochastic Differential Equations (SDEs)</title><link>https://www.victorexplore.com/posts/adrl/25--precursor-to-stochastic-differential-equations-sdes/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/25--precursor-to-stochastic-differential-equations-sdes/</guid><description>Why the sampling steps of Langevin dynamics, DDPM and SMLD are discrete versions of a continuous process, with worked examples.</description></item><item><title>Q Learning</title><link>https://www.victorexplore.com/posts/reinforcement-learning/25-feb-2025/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/reinforcement-learning/25-feb-2025/</guid><description>Q-learning explained: model-based against model-free methods, the Q-function and the Q-Bellman equation.</description></item><item><title>Score matching part 1</title><link>https://www.victorexplore.com/posts/adrl/20---score-matching-part-1/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/20---score-matching-part-1/</guid><description>Sampling seen as optimisation, the score function, and explicit and implicit score matching.</description></item><item><title>Score matching part 2</title><link>https://www.victorexplore.com/posts/adrl/21---score-matching-part-2/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/21---score-matching-part-2/</guid><description>Why the trace term in implicit score matching is a problem, and how projected and sliced score matching avoid it.</description></item><item><title>Score matching part 3</title><link>https://www.victorexplore.com/posts/adrl/22---score-matching-part-3/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/22---score-matching-part-3/</guid><description>Denoising score matching, the reparameterisation that makes training efficient, and the data coverage problem.</description></item><item><title>Sequence to sequence models (Transformers)</title><link>https://www.victorexplore.com/posts/adrl/transformers/31.5/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/transformers/31.5/</guid><description>Sequence models from hidden Markov models and RNNs to transformers, with attention heads and multi-head attention.</description></item><item><title>SMLD as SDE</title><link>https://www.victorexplore.com/posts/adrl/28---smld-as-sde/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/28---smld-as-sde/</guid><description>How the SMLD forward process becomes a continuous SDE, how the SDE is reversed, and how the reverse SDE is made discrete again.</description></item><item><title>State space models &amp; Mamba</title><link>https://www.victorexplore.com/posts/adrl/32-state-space-models/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/32-state-space-models/</guid><description>State space models from the linear form to Mamba: Euler&amp;#39;s method, unrolling the equations and how the A matrix is initialised.</description></item><item><title>Stochastic Differential Equations (SDEs)</title><link>https://www.victorexplore.com/posts/adrl/26---stochastic-differential-equations-sdes/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/26---stochastic-differential-equations-sdes/</guid><description>An introduction to stochastic differential equations for diffusion models: the formal definition and what Brownian motion is and is not.</description></item><item><title>Support vector machine(SVM) when data is linearly separable</title><link>https://www.victorexplore.com/posts/prnn/21---support-vector-machine---data-linearly-separable/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/prnn/21---support-vector-machine---data-linearly-separable/</guid><description>The support vector machine for linearly separable data: the optimisation problem, the dual form, and how to find w and b.</description></item><item><title>Support vector machine(SVM) when data is not linearly separable</title><link>https://www.victorexplore.com/posts/prnn/22---svm---dataset-is-not-linearly-separable/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/prnn/22---svm---dataset-is-not-linearly-separable/</guid><description>The soft-margin support vector machine for data that is not linearly separable: slack variables, the dual form, and how to find w and b.</description></item><item><title>SVM with kernel</title><link>https://www.victorexplore.com/posts/prnn/23---svm-with-kernel/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/prnn/23---svm-with-kernel/</guid><description>The kernel trick and how it lets a support vector machine work in a higher-dimensional space without computing the feature map.</description></item><item><title>TD Learning</title><link>https://www.victorexplore.com/posts/reinforcement-learning/20-feb-2025/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/reinforcement-learning/20-feb-2025/</guid><description>TD learning from incomplete episodes: the TD(lambda) algorithm and its special cases TD(0) and TD(1).</description></item><item><title>Temporal difference learning</title><link>https://www.victorexplore.com/posts/reinforcement-learning/13-mar-2025/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/reinforcement-learning/13-mar-2025/</guid><description>Temporal difference learning for policy evaluation: the Bellman equation behind it and the approaches to value estimation.</description></item><item><title>Understanding Stochastic Shortest Path Problems: A Deep Dive into Mathematical Foundations</title><link>https://www.victorexplore.com/posts/reinforcement-learning/30-jan-2025/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/reinforcement-learning/30-jan-2025/</guid><description>Stochastic shortest path problems: expected stage cost, the cost-to-go function and the Bellman operators.</description></item><item><title>VAE as regularized autoencoder</title><link>https://www.victorexplore.com/posts/adrl/14---vae-as-regularized-autoencoder/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/14---vae-as-regularized-autoencoder/</guid><description>How the VAE objective splits into a reconstruction error and a regulariser, the link to MAP estimation, and beta-VAEs.</description></item><item><title>Value Iteration</title><link>https://www.victorexplore.com/posts/reinforcement-learning/3-value-iteration/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/reinforcement-learning/3-value-iteration/</guid><description>Value iteration for stochastic shortest path problems: the dynamic programming operator, its properties and the Gauss-Seidel variant.</description></item><item><title>Variational encoding(VAEs)</title><link>https://www.victorexplore.com/posts/adrl/12---variational-encoding/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/12---variational-encoding/</guid><description>Variational autoencoders from the start: the problem setting, the model, and why and how the reparameterisation trick is used.</description></item><item><title>Wasserstein GANs (WGANs)</title><link>https://www.victorexplore.com/posts/adrl/8---wasserstein-gans-/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/8---wasserstein-gans-/</guid><description>The perfect discriminator theorem, Wasserstein GANs, what k-Lipschitz means and how to enforce the 1-Lipschitz constraint.</description></item><item><title>Wasserstein metric</title><link>https://www.victorexplore.com/posts/adrl/7--wasserstein-metric/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/adrl/7--wasserstein-metric/</guid><description>The Wasserstein distance between two distributions: definition, properties and how it relates to KL divergence.</description></item><item><title>XGBoost - Gradient boosted regression tree</title><link>https://www.victorexplore.com/posts/prnn/32---xg-boost/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/posts/prnn/32---xg-boost/</guid><description>How XGBoost builds decision trees one after another, each one correcting the errors of the trees before, step by step.</description></item><item><title>About</title><link>https://www.victorexplore.com/about/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/about/</guid><description>Who Victor is and what this site is for.</description></item><item><title>Contact</title><link>https://www.victorexplore.com/contact/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/contact/</guid><description>How to reach Victor.</description></item><item><title>LastCig</title><link>https://www.victorexplore.com/lastcig/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/lastcig/</guid><description>LastCig is a quit-smoking app for Android. Track cigarettes, resist cravings and watch your body recover.</description></item><item><title>LastCig Privacy Policy</title><link>https://www.victorexplore.com/lastcig/privacy/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/lastcig/privacy/</guid><description>How the LastCig app and the LastCig video publisher handle your data.</description></item><item><title>Privacy Policy</title><link>https://www.victorexplore.com/privacy/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://www.victorexplore.com/privacy/</guid><description>What victorexplore.com and the 1000 Cuts game collect, and how ads use cookies.</description></item></channel></rss>