<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Large Language Models on Chen Kai Blog</title><link>https://www.chenk.top/en/tags/large-language-models/</link><description>Recent content in Large Language Models on Chen Kai Blog</description><generator>Hugo</generator><language>en</language><lastBuildDate>Sat, 03 Jan 2026 09:00:00 +0000</lastBuildDate><atom:link href="https://www.chenk.top/en/tags/large-language-models/index.xml" rel="self" type="application/rss+xml"/><item><title>Recommendation Systems (12): Large Language Models and Recommendation</title><link>https://www.chenk.top/en/recommendation-systems/12-llm-recommendation/</link><pubDate>Sat, 03 Jan 2026 09:00:00 +0000</pubDate><guid>https://www.chenk.top/en/recommendation-systems/12-llm-recommendation/</guid><description>&lt;p>A user opens a movie app and types: &lt;em>&amp;ldquo;Something like Inception, but less depressing.&amp;rdquo;&lt;/em> A traditional recommender — collaborative filtering, two-tower DNN, even DIN — sees zero useful tokens here. It has no &lt;code>like&lt;/code> button to count, no co-watch graph to traverse, no user ID with history. The query has to be turned into IDs before the system can do anything.&lt;/p>
&lt;p>A Large Language Model has the opposite problem: it has &lt;em>too much&lt;/em> world knowledge but doesn&amp;rsquo;t know who this user is. It knows Inception is a Christopher Nolan film with non-linear narrative and a hopeful-but-ambiguous ending; it knows what &amp;ldquo;depressing&amp;rdquo; means in cinema; it can name twenty films that fit. But it can&amp;rsquo;t tell you which of those twenty the &lt;em>current&lt;/em> user has already seen, rated badly, or left half-watched.&lt;/p></description></item><item><title>Essence of Linear Algebra (18): Frontiers and Summary</title><link>https://www.chenk.top/en/linear-algebra/18-frontiers-and-summary/</link><pubDate>Wed, 30 Apr 2025 09:00:00 +0000</pubDate><guid>https://www.chenk.top/en/linear-algebra/18-frontiers-and-summary/</guid><description>&lt;p>We have walked the long road of linear algebra together. We started with arrows in the plane and ended at the gates of quantum computers, the inner workings of large language models, and the topology of data clouds. The remarkable thing — the thing this series has tried to make visible — is that the same handful of ideas keeps coming back. A vector is a state. A matrix is a transformation. A decomposition is the structure hiding inside the transformation. A norm tells you when you can trust your computation. Once you internalise that loop, every &amp;ldquo;frontier&amp;rdquo; looks less like a foreign country and more like another dialect of a language you already speak.&lt;/p></description></item></channel></rss>