Stanford CS231n examples connect classification, detection, segmentation, score maps, FCNs, masks and IoU to the robotics RL series and Modern AI VI.
Topic: #robot-learning
A collection of 12 posts about robot-learning.
How ECoT and inference-time scaling let robots spend computation on decisions.
Turning generalization, contact sensing, rapid adaptation, and lifelong learning into research questions.
How one model can control multiple robots.
How world models predict the consequences of robot actions.
From rewards and values to Bellman equations, value and policy iteration, Q-learning, DQN and continuous-action control. Compare the original figures with timestamped transcripts and work through small grids and numerical examples.
A guided reading of REINFORCE, baselines and advantages, importance sampling, TRPO, PPO, and SAC, checked against the original slides and public captions. Worked calculations clarify probability ratios, entropy, and loss signs.
Why can averaging fail when a scene admits several correct actions? Explore VAEs, VQ-VAEs, DDPM and DDIM, Diffusion Policy, and flow matching through original figures, public captions, and supplementary lectures.
How can a robot remember states that one photograph cannot reveal? From attention, tokens, and position information to CLIP, VLMs, ACT, and FAST, this chapter compares slides with public captions and works through numerical examples.
What do robots learn, and how do they act? Follow the ETH 2026 lecture slides through policies, imitation learning, reinforcement learning and VLAs, then connect the ideas to working code and simulation examples.
Follow a robot's goal into physical motion through coordinate frames, inverse kinematics, trajectories and PID control, then build an MDP from states, actions, transitions and rewards. Read the ETH Lecture 2 slides alongside the transcript and a simulation I ran.
From behavior cloning to DAgger, multimodal action distributions and latent plans. Follow the original figures and lecture transcripts to distinguish data, loss and execution, then check the ideas with numerical examples.