Jan 2027
18 Mon
19 Tue
20 Wed
21 Thu
22 Fri 09:00 AM – 06:00 PM IST
23 Sat 09:00 AM – 06:00 PM IST
24 Sun
Varun Tulsian
@varuntulsian
Submitted Oct 10, 2026
Submission type
Talk/session proposal (25 min + 5 min Q&A). A 20-minute showcase also works: outline items 3 to 5 and 7.
Describe your session in 2 paragraphs
You are defined by the company you keep. This talk follows that one old saying through three philosophies, three types of algorithm and nine seminal papers from two decades, from PageRank in 1998 to GraphRec in 2019. Take the saying literally in three ways and you can rebuild three algorithms. Important company makes you important: pass the importance around until it settles, and you get PageRank. Your company says what you are like: learn to predict the company, and you get word2vec. You wear a different mask in different company: weigh each neighbour by how well it matches what you look for, and you get attention.
This is how I do it. I start with each philosophy, a plain argument about the world, and only then write it as maths. Before each answer, I ask the room how they would solve it. Then I change the ideas, one detail at a time. Put a weighted average inside word2vec, with each neighbour weighted by how well it matches what the word looks for, and you are close to attention. Keep an algorithm, swap the table under it or change one detail of it, and you get six more of the papers in the grid below. Each change can be a new algorithm. So the audience can make their own, instead of taking what somebody built and extending it minutely. Then I put all three to work. Every meeting note, ticket and failed test creates a task, and someone has to own it. With a startup, I am building an attribution engine on their Jira and GitHub data: PageRank for who owns the code, vectors for who works like whom, attention for whose past work fits this task. Who should own it? Ask the company they keep. I have not built it yet. I will build it and present it. These are only building blocks, so the talk ends on one question: can you do better?
The nine papers, placed on a grid:
| Pass it around until it settles | Predict the company | Weigh the company | |
|---|---|---|---|
| Pages and graphs | PageRank, 1998 | DeepWalk, 2014; node2vec, 2016 | Graph attention networks, 2018 |
| Words and sentences | TextRank, 2004 | word2vec, 2013 | Transformer, 2017 |
| People | Who to Follow at Twitter, 2013 | DeepWalk, 2014, tested on social networks | GraphRec, 2019, weights learned from the two people’s vectors |
Outline (25 minutes + 5 minutes Q&A)
The examples before 21:00 are synthetic: they show how each algorithm behaves, not how well it works.
Mention 1-2 takeaways from your session
Which audiences will benefit most from your session?
Data scientists, analysts and ML engineers who use rankings, embeddings or LLMs and want the reasoning behind them. Students who wonder whether the basics still matter. Once the intuition is clear, these algorithms become building blocks, like LEGO, and you start to see new problems to apply them to.
Add your bio: who you are, where you work, and any relevant context
Varun Tulsian leads AI at Fermi.ai. He was VP, Head of AI at Needl.ai, where he worked on retrieval and question answering over long finance documents. He spent about eight years on search and recommendations at Walmart Global Tech. He has an ME in Computer Science from IISc. He writes about ML on his blog, wity’ai (https://varun-ml.github.io/).
LinkedIn: https://www.linkedin.com/in/varuntulsian
GitHub: https://github.com/varun-ml
Slides
Not yet. The written version of the talk is here: https://varun-ml.github.io/posts/pagerank-word2vec-attention/
Topic/domain tags
information retrieval, search, recommendations, open source, ranking, PageRank, embeddings, word2vec, attention, transformers, graph ML, NLP, first principles
Hosted by
{{ gettext('Login to leave a comment') }}
{{ gettext('Post a comment…') }}{{ errorMsg }}
{{ gettext('No comments posted yet') }}