Walk with @robertnishihara & I in NYC with 10% charge 🪫 as we talk through 5 key differences between 𝗟𝗟𝗠 𝗶𝗻𝗳𝗲𝗿𝗲𝗻𝗰𝗲 𝗩𝗦 𝗥𝗲𝗴𝘂𝗹𝗮𝗿 𝗶𝗻𝗳𝗲𝗿𝗲𝗻𝗰𝗲
Let’s see how much we can get through before our mic dies! 🤣
I told my parents that I’d like to drop out of my cs phd program at Stanford a few months back.
They didn’t let me, we’re asian :)
So I graduated and started @moonlake.
@sharonal_lee and I saw urgency, and opportunities. Excited to share that we raised a 28 million dollar seed round to build the future for simulations and games.
Grateful for the angels @naval, @goodfellow_ian@stevechen, @JeffDean@rauchg, @emerywells, @JaredLeto, @chrlaf, alongside many more, and the venture partners that we are fortunate to work with: @moislamvc, Shaun Johnson, @chrmanning, Artem Barsukov, Elvin Hao, @mercebent, @veelarco and William Freiberg. If you're a founder and you're not partnering with them, you're making a big mistake.
Check out what we're about 👇
Today, as part of our effort to make our platform transparent, we are open-sourcing the latest code used to recommend posts on the For You timeline.
Our algorithm is always a work in progress. We will continue to refine our approach to surface the most relevant content to our community.
https://t.co/fpnsBWGn0U
🤹 New blog post!
I write about our recent work on using hierarchical trees to enable sparse attention over irregular data (point clouds, meshes) - Erwin Transformer.
blog: https://t.co/dClrZ4tOoz
paper: https://t.co/EKUH9gJ7o3
Compressed version in the thread below:
AlphaEvolve by Deepmind and Text-based Search.
The AlphaEvolve paper is an evolution (sorry!) of the FunSearch paper that appeared in Nature in 2023 with partially overlapping authors. In a nutshell, it seems to me its FunSearch with modern reasoning LLMs:
A coding agent that continuously tries to improve code to solve a problem and scores it using multiple evaluators to measure progress.
The results are impressive: they improve the best known bounds on many problems including the Minimum Overlap Problem by Erdos, matrix multiplication, and the Kissing number in 11 dimensions.
There are several clever techniques I didn't understand including multiple evaluators (keeping a diverse set of solutions during the search seems to help) and an evolutionary database that keeps multiple code snippets to encourage exploration.
Some thoughts:
1. The solutions here are *pieces of code*, and this is a search agent that modifies, evaluates, and optimizes code i.e. pieces of text. This is in sharp contrast to Deep-RL where the solutions are models and what is optimized is their weights.
2. The bitter lesson teaches us that general methods that leverage computation are going to crush anything else.
So the problem has always been how do we leverage computation to search and optimize: E.g. search for sphere configurations, matrix multiplication algorithms, or chess playing machines.
Computers are good with numbers, so we express everything with neural networks, and leverage continuous optimization (gradient descent) to optimize weights.
But now, we arrive in a world where LLMs can read and modify code (or English). Computation can eat text directly, so now we can directly optimize over pieces of code, making local changes according to LLM suggestions.
As always, you must be able to measure something to optimize it, so evals are critical, but this is a new way to search that does not use gradients.
Are these text optimizers better than RL policy gradient methods that operate on weights, or is there some fundamental advantage of gradient-based methods?
Humans learn using text-based optimization
(Teacher says "make sure you check your answers before submitting the test!") but we don't know what happens to the neural weights and how they are updated.
A similar issue appears in prompt optimization methods, e.g. as done in DSPy vs RL finetuning.
The relationship of text-based optimization with gradient-based optimization is one of the most interesting questions that I'd like to understand more.
🚀 Excited to share our work Jailbreaking with Universal Multi-Prompts accepted at #NAACL2025 Findings! 🎉
We propose JUMP, a universal jailbreak method for LLMs that optimizes multi-prompts for high transferability.
🔗Paper: https://t.co/8vS3lexAoR
What to know about DeepSeek
https://t.co/9N8G534SzV
In which we aim to understand MoE, o1, scaling, tech reporting, modern semiconductors, microeconomics, and international geopolitics.
🎉At #ICASSP2024, I published a paper showing that synthetic data can effectively improve ASR models (https://t.co/wGdxodY8WA).
At #EMNLP2024, we're presenting SYN2REAL to address synthetic-to-real gap in ASR!
🔗Paper: https://t.co/W7l38Yino1
💡Project: https://t.co/g53zZNIENF
Diffusion based image editing and personalization methods are expensive💰due to training, latent optimization or prompt-tuning🤷♂️.
Introducing RF-Inversion🎯,the first efficient zero-shot inversion and editing framework for Flux🚀without training,optimization or prompt-tuning🧵⬇️