🔥The 9th Round of Easy Loan, Earn $40 Reward is in progress❗️ ⏰ Promotion Period: January 15th - Feburary 15th, 2025 👉 Register now and check more details at gate.io/campaigns/358

This is my first paper done at FAIR. We show that adaptive visual token segmentation, especially in subobject-level (i.e., subwords in images), enables VLMs to have a better and faster learning of image understanding! arxiv.org/pdf/2402.14327

1/ Happy to share my first accepted paper as a PhD student at Meta and École normale supérieure | PSL which I will present at ICLR 2026: 📚 Our work proposes difFOCI, a novel rank-based objective for ✨better feature learning✨ In collab with David Lopez-Paz, Giulio Biroli and Levent Sagun!

📷 Hello Singapore! Meta is at #ICLR2025 EXPO 📷 Meta will be in Singapore this week for #ICLR25! Stop by our booth to chat with our team or learn more about our latest research. Things to know: 📷 Find us @ Booth #L03 (Rows 3-4, Columns L-M) in Hall 2. 📷 We're sharing 50+

#ICLR2025 Come say hi at our Fri 25 Apr poster session: "What Makes Large Language Models Reason in (Multi-Turn) Code Generation?" 📝✨ 📍 Hall 3 + Hall 2B #263 🕙 Fri 25 Apr, 10 a.m.–12:30 p.m. +08 link: iclr.cc/virtual/2025/p… paper: arxiv.org/abs/2410.08105

#ICLR2025 Come say hi at our Sat 26 Apr poster session: "The KoLMogorov Test: Compression by Code Generation" 📝✨ 📍Hall 3 + Hall 2B #557 🕙Sat 26 Apr 10 a.m. - 12:30 p.m. +08 repo: github.com/facebookresear… paper: arxiv.org/abs/2503.13992…

Check out our poster tmr at 10am at the ICLR Bidirectional Human-AI Alignment workshop! We cover how on-policy preference sampling can be biased and our optimal response sampling for human labeling. NYU Center for Data Science AI at Meta Julia Kempe Yaqi Duan x.com/feeelix_feng/s…

🚨 Your RL only improves 𝗽𝗮𝘀𝘀@𝟭, not 𝗽𝗮𝘀𝘀@𝗸? 🚨 That’s not a bug — it’s a 𝗳𝗲𝗮𝘁𝘂𝗿𝗲 𝗼𝗳 𝘁𝗵𝗲 𝗼𝗯𝗷𝗲𝗰𝘁𝗶𝘃𝗲 you’re optimizing. You get what you optimize for. If you want better pass@k, you need to optimize for pass@k at training time. 🧵 How?

Come meet us at the Human-AI Alignment workshop and talk about this fancy sampling scheme

❄️Andrew Zhao❄️ Yeah we are doing it and it’s called Soft Policy Optimization: arxiv.org/abs/2503.05453 It can learn from arbitrary on/off policy samples. TLDR it reparametrizes Q function by your LLM. An elegant property: Belleman equation satisfied by construction so not separate TD loss.

Emotional Replica.

another good one!

Let’s be clear. If you use schulman k3 estimator y’all optimizing for another thing: the reverse KL. Funnily people think schulman k2 estimator is biased, but it gives the right gradient.

We present an Autoregressive U-Net that incorporates tokenization inside the model, pooling raw bytes into words then word-groups. AU-Net focuses most of its compute on building latent vectors that correspond to larger units of meaning. Joint work with Badr Youbi Idrissi 1/8