Graph Chat with Golven Leroy on Predicting Graph Costs & Moving Past "It Depends"

episode

GraphGeeks Podcast not yet transcribed

▲ 0

Transcript

This episode hasn't been transcribed yet Upvotes decide what gets transcribed next — 0 so far. Sign in to upvote

Related

recent transcribed audio

Your partner wants profit. You want freedom. Now what? 22 min · 16 Sep 2026 · The Optometry Success Podcast

Finance and Budget Committee - Sep 15, 2026 1h 43m · 15 Sep 2026 · Prince William County Finance and Budget Committee

The Art of True Happiness | Dr. Arthur Brooks 2h 49m · 14 Sep 2026 · Huberman Lab

The Chris Wolfe Podcast: The Power of Quality Supplements 48 min · 14 Sep 2026 · EyeCode Media

NPR News: 09-13-2026 6PM EDT 4 min · 13 Sep 2026 · NPR News Now

Guenther Steiner's 2026 Madrid GP Recap! | Vankah Hours S3E18 1h 11m · 13 Sep 2026 · The Red Flags Podcast

Report any issue

Source

Recorded05 Jun 2026

Publisherfeeds.redcircle.com ↗

Handlerec:18745623

Show notes

How do we move past the ultimate graph answer: "It depends"?Live from the Open Data Science Conference (ODSC), Amy Hodler sat down with Golven Leroy, graph researcher and data science lead at Graphable, to discuss groundbreaking core mathematics that could change how we calculate the compute cost, latency, and bounds of graphs and trees—independently of technology.We also dive into his top takeaways from ODSC, including tracking LLM experiments with MLflow, revolutionary chip/circuit design, and open-source frameworks like Agor for visualizing enterprise AI agents.Link to the referenced paper: https://msp.org/involve/2026/19-2/p05.xhtml

Ask this episode

“What did the council decide on item 42?” — answered with the speaker and the moment.

Sign in