Skip to content

Differentiable Programming for Learnable Graphs: Optimizing LLM Workflows W DSPy

viksit.substack.com
2 pointsviksit1 comment
On HN

Comments

Following up on my last post about optimizing tool selection with differentiable programming, I’ve been thinking about how to extend those ideas to full agent workflows. This post shares some early experiments using DSPy to optimize routing and structure end-to-end for a sample customer service agent workflow. Feedback welcome!

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.