
I profess CS-ly at @UWaterloo. Previously, I monkeyed code for @Twitter, slides for @Cloudera, and scienced for @yupp_ai.
Nearby data lake
Joined February 2010
- Tweets4.6K
- Following875
- Followers15.4K
- Likes0
tl;dr - the team @Sahel_Sharify @Lingwei_Gu @nour_jedidi speedran nanochat by @karpathy using ClimbMix by @shizhediao et al. and then SFT'ed on relevance data from @beirmug @crystina_z to arrive at a competitive pointwise reranker: arxiv.org/abs/2610.11922
Our backbone: huggingface.co/castorini/gag…
Our reranker: huggingface.co/castorini/gag…
What are we up to? 🏡 Project Greenhouse: Progress Toward Fully Open and Sovereign Agentic Search w/ @Sahel_Sharify @Lingwei_Gu @nour_jedidi arxiv.org/abs/2610.11922
You mean, building things that are actually useful... and that people care about? Nice but how unacademic! 👍 Congratulations! I look forward to learning more! ❤️
Jimmy Lin retweeted
PhD defended today! 🎓
Huge thanks to my supervisor @WenhuChen for all the guidance and support throughout this journey, and to all my committee members for their time, thoughtful questions, and feedback.
Next stop: joining Meta FAIR as a Research Scientist. Excited for what’s ahead!
🤖 Made with AI
Jimmy Lin retweeted
Excited to share that our paper was accepted to EMNLP Findings 🎉
We ask a simple question: Does reasoning improve pointwise rerankers?
The answer? It can actually hurt... even for Rank1, a reranker trained to reason-then-answer 😱
📄 nourj98.github.io/papers/don…
🚨Do passage rerankers really need explicit reasoning?🤔—Maybe Not!
Our findings:
⚖️Standard rerankers outperform those w/ step-by-step reasoning!
🚫Disable reasoning from reasoning reranker actually improves reranking accuracy!🤯
👇But, why?
📰arxiv.org/abs/2505.16886
(1/6)
Jimmy Lin retweeted
To make an LLM a strong dense retriever, you often need training…
But what if you only have a few-examples 🥩🥦 and no training budget?
Just add RICE 🍚, a simple way to turn your LLM into an effective dense retriever that requires zero training 👨🍳
📄 arxiv.org/abs/2609.38099
Yo, I heard you like leaderboards. So I created another one: with ACM Fellows and Turing Award winners. Another target for citation and h-index benchmaxxing. 💪 lintool.github.io/acm-bigcow…
Summer passed in a blur... 🏖️🦩🍹 and I forgot to congratulate @HosnaOH for finishing her Master's! Her work with @amirhkarimi_ "A Unified Perturbation Framework for Analyzing Leaderboard Stability and Manipulation" arxiv.org/abs/2605.15761 just got a +1 from NeurIPS, so yay! 🎉
Achievement unlocked! 🔓 Does this come with stat bonuses or help with saving throws? uwaterloo.ca/computer-scienc…
My colleague @yuntiandeng about “Claudish” 🤖 and how AI coding agents are changing the way we communicate! uwaterloo.ca/news/media/q-an…
Jimmy Lin retweeted
1/ 🧵
BrowseComp-Plus (ACL 2026) set the standard for disentangled agentic search eval...
🙌 𝐁𝐫𝐨𝐰𝐬𝐞𝐂𝐨𝐦𝐩-𝐏𝐥𝐮𝐬_𝐂𝐌 makes it even better!
🚀 Same BCP questions grounded on 𝐂𝐥𝐢𝐦𝐛𝐌𝐢𝐱-𝟒𝟎𝟎𝐁 with 𝟓𝟓𝟑𝐌 𝐝𝐨𝐜𝐬.
💻 github.com/castorini/cmass
🚀 Introducing BrowseComp-Plus: A More Fair and Transparent Evaluation Benchmark of Deep-Research Agent.
It is a new Deep-Research evaluation benchmark built on top of BrowseComp. It features
- 📚 a fixed, carefully curated corpus of web documents
- ✅ human-verified positive documents
- ⚔️ web-mined challenging hard negatives.
With BrowseComp-Plus, you can thoroughly evaluate and compare the performance of different components in a deep-research system. e.g. GPT-5 + Qwen3-Embedding.
Code, dataset, and leaderboard links are provided at the end of this thread.
Jimmy Lin retweeted
In the past year, we've seen rapid progress in search agents! However, how well do these search agents work outside English?
Introducing⛵️MAST @🔥FIRE 2026, a new shared task focused on multilingual agentic search.















