Twitxy Saved

Negar Arabzadeh

Verified account This account is verified. Learn more

@NegarEmpr

Postdoc @UCBerkeley @BerkeleySky |👩🏻‍💻Prev @google, @MSFTResearch, @SpotifyResearch | 📚@UWaterloo | Interested in Information Retrieval
Berkeley, USA negara.info Joined April 2017
1.2K Following 1.7K Followers 558 Posts

Latest posts 5

Pinned post

Negar Arabzadeh Verified account @NegarEmpr
So excited to share that I received the SIGIR Early Career Research Award! 🥹
I still remember attending my first SIGIR, watching someone receive this award, and thinking, “There’s no way that could ever be me.” And now, here I am!😵
This truly means so much to me. Thank you to the @ACMSIGIR community for recognizing my contributions. #SIGIR2026

P.S. Get yourself a PhD supervisor who matches your award-celebration energy 😄 So cool to celebrate this moment together! @claclarke
22 replies 5 reposts 102 likes 12K views View on X
Negar Arabzadeh Verified account @NegarEmpr
I'll be at #EMNLP2026 in Budapest this week! 🎉 🇭🇺
Presenting "RAG over Thinking Traces Can Improve Reasoning Tasks" today at 11 AM
📍Poster Session A, Hall H.
Come say hi! happy to chat about reasoning, RAG, and everything in between!
Negar Arabzadeh Verified account @NegarEmpr May 12
1/ Thrilled to introduce T³: a corpus for RAG over reasoning tasks, built from thinking traces.
We show that surprisingly RAG can improve reasoning— with the right corpus.
Rag with Transformed Thinking Traces T³ gain by up to 43.9% on AIME 2025-2026.
🔗 arxiv.org/abs/2605.03344 🧵
View quoted post on X
Negar Arabzadeh Verified account @NegarEmpr
1/ 💰Multi-vector retrieval shouldn’t charge you by the token!
🎉 Excited to share FLINT (Fixed-budget Late INTeraction), a late-interaction retriever designed for long, complex queries with up to 89% reduction in index and 23-170× faster retrieval latency.⚡

🎛️ FLINT gives a vector-budget knob to balance storage, latency, and quality.

📄 Paper: arxiv.org/abs/2610.27273

How does it work? 🧵

ColBERT stores and compares one vector per token. FLINT pools every query and every document into a fixed number of vectors, so there’s far less to store and far fewer comparisons at search time.