<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Meta-Learning on Chen Kai Blog</title><link>https://www.chenk.top/en/tags/meta-learning/</link><description>Recent content in Meta-Learning on Chen Kai Blog</description><generator>Hugo</generator><language>en</language><lastBuildDate>Sat, 20 Sep 2025 09:00:00 +0000</lastBuildDate><atom:link href="https://www.chenk.top/en/tags/meta-learning/index.xml" rel="self" type="application/rss+xml"/><item><title>Reinforcement Learning (11): Hierarchical RL and Meta-Learning</title><link>https://www.chenk.top/en/reinforcement-learning/11-hierarchical-and-meta-rl/</link><pubDate>Sat, 20 Sep 2025 09:00:00 +0000</pubDate><guid>https://www.chenk.top/en/reinforcement-learning/11-hierarchical-and-meta-rl/</guid><description>&lt;p>Standard RL treats every problem as a flat sequence of atomic decisions: observe state, pick an action, receive a reward, repeat. That works when the horizon is short and rewards are dense, but it breaks down on the kind of tasks humans solve effortlessly. &amp;ldquo;Make breakfast&amp;rdquo; is not one decision; it is a tree of subtasks &amp;mdash; &lt;em>brew coffee&lt;/em>, &lt;em>fry eggs&lt;/em>, &lt;em>toast bread&lt;/em>, &lt;em>plate it up&lt;/em> &amp;mdash; each of which is itself a small policy. &lt;strong>Hierarchical RL (HRL)&lt;/strong> lets agents reason and act at multiple timescales by treating macro-actions as first-class citizens.&lt;/p></description></item><item><title>Transfer Learning (4): Few-Shot Learning</title><link>https://www.chenk.top/en/transfer-learning/04-few-shot-learning/</link><pubDate>Mon, 19 May 2025 09:00:00 +0000</pubDate><guid>https://www.chenk.top/en/transfer-learning/04-few-shot-learning/</guid><description>&lt;p>Show a child one photograph of a pangolin and they will spot pangolins for life. Show a deep learning model one photograph and it will give you a uniformly random guess. Few-shot learning is the field that closes that gap: building classifiers that work with only one to ten labeled examples per class.&lt;/p>
&lt;p>The trick is not to memorize individual classes harder. It is to learn &lt;em>how to learn&lt;/em> from very few examples, then carry that ability over to brand-new classes at test time. This article covers the two families that dominate the field today: &lt;strong>metric learning&lt;/strong>, which learns a good distance function, and &lt;strong>meta-learning&lt;/strong>, which learns a good initialization.&lt;/p></description></item><item><title>Graph Neural Networks for Learning Equivariant Representations of Neural Networks</title><link>https://www.chenk.top/en/standalone/gnn-equivariant-representations/</link><pubDate>Sun, 03 Apr 2022 09:00:00 +0000</pubDate><guid>https://www.chenk.top/en/standalone/gnn-equivariant-representations/</guid><description>&lt;p>Shuffling the hidden neurons of a trained MLP yields the exact same function, but the flat parameter vector looks entirely different. This fact ruins most attempts at &amp;ldquo;learning over neural networks&amp;rdquo;: naive representations treat two functionally identical models as unrelated points in parameter space, causing the downstream learner to waste capacity rediscovering a symmetry it should have for free. This paper, &lt;em>Graph Neural Networks for Learning Equivariant Representations of Neural Networks&lt;/em> (Kofinas et al., ICML 2024), proposes a clean fix: turn the network into a graph and use a GNN whose architecture natively respects the relevant permutation symmetry.&lt;/p></description></item></channel></rss>