Skip to content

Instantly share code, notes, and snippets.

View Astralidea's full-sized avatar
💭
I may be slow to respond.

Felix Li Astralidea

💭
I may be slow to respond.
  • Menlo Park, California, U.S.
  • 11:24 (UTC +08:00)
View GitHub Profile
@Astralidea
Astralidea / llm-wiki.md
Created April 17, 2026 07:03 — forked from karpathy/llm-wiki.md
llm-wiki

LLM Wiki

A pattern for building personal knowledge bases using LLMs.

This is an idea file, it is designed to be copy pasted to your own LLM Agent (e.g. OpenAI Codex, Claude Code, OpenCode / Pi, or etc.). Its goal is to communicate the high level idea, but your agent will build out the specifics in collaboration with you.

The core idea

Most people's experience with LLMs and documents looks like RAG: you upload a collection of files, the LLM retrieves relevant chunks at query time, and generates an answer. This works, but the LLM is rediscovering knowledge from scratch on every question. There's no accumulation. Ask a subtle question that requires synthesizing five documents, and the LLM has to find and piece together the relevant fragments every time. Nothing is built up. NotebookLM, ChatGPT file uploads, and most RAG systems work this way.

@Astralidea
Astralidea / K_Menas
Last active January 17, 2017 04:17
import org.apache.spark.mllib.clustering.{KMeans, KMeansModel}
import org.apache.spark.mllib.linalg.Vectors
val data = sc.textFile("/home/xueyanli/work/data/jingjinji09LocationAppDevice_aa")
val point = data.map(_.split('\t') match {case Array(id,time,x,y,app,phone) => Vectors.dense(x.toDouble, y.toDouble) case _ => Vectors.dense(0.0, 0.0) })
val numClusters = 2
val numIterations = 20
val clusters = KMeans.train(point, numClusters, numIterations)
point.take(1000).map(v => v.toString() + " belong to cluster :" + clusters.predict(v)).foreach(println)