Constrained Adaptive Rejection Sampling - Loris D’Antoni

Constrained Adaptive Rejection Sampling - Loris D’Antoni

Loris D’Antoni, Professor of Computer Science and Engineering at UC San Diego, discusses his paper “Constrained Adaptive Rejection Sampling,” which introduces a constrained decoding algorithm that preserves the original language model distribution while satisfying formal constraints, enabling higher-quality structured generation for applications including compiler testing, code generation, and scientific discovery.


Explore how the rise of large language models has reshaped research in programming languages, and how formal methods remain essential for producing software that is both useful and trustworthy in the era of AI-generated code.


In This Episode -


• Program synthesis in the age of LLMs

• Why constrained decoding distorts language model distributions

• Adaptive rejection sampling with remembered failures

• Formal methods for trustworthy AI-generated code

• Compiler fuzzing with language models

• Using symbolic methods to improve LLM output

• Automata theory

• Verified code translation and equivalence checking


References -

• UCSD Programming Systems: https://cseweb.ucsd.edu/groups/progsys/

• Nadia Polikarpova: https://cseweb.ucsd.edu/~npolikarpova/

• Rajeev Alur: https://www.cis.upenn.edu/~alur/

• Code Metal: https://www.codemetal.ai/


About the Paper -


“Constrained Adaptive Rejection Sampling”

Loris D’Antoni, Pavel Parys, Sriram Vadia, Taylor Berg-Kirkpatrick


Large language models often rely on constrained decoding to generate outputs that satisfy grammars or structured schemas, but existing methods can substantially distort the model’s probability distribution. This paper introduces Constrained Adaptive Rejection Sampling (CARS), an algorithm that incrementally learns from rejected samples while provably sampling from the correct constrained distribution, producing significantly higher-quality outputs and large improvements in practical tasks such as compiler fuzzing.


https://arxiv.org/pdf/2510.01902


About the Guest -


Loris D’Antoni is Jacobs Faculty Scholar and Professor of Computer Science and Engineering at the University of California, San Diego, where he leads the Programming Systems Group. His research spans program synthesis, programming languages, formal verification, compiler testing, and trustworthy AI systems, with recent work focusing on combining formal methods with LLMs. He also serves as a Scholar at Code Metal, where he works on verified AI-assisted software engineering.

https://cseweb.ucsd.edu/~ldantoni/


Credits -

• Host & Music: Bryan Landers, Technical Staff, Ndea

• Editor: Alejandro Ramirez

• https://x.com/ndea

• https://x.com/bryanlanders

• https://ndea.com

Tämä jakso on lisätty Podme-palveluun avoimen RSS-syötteen kautta eikä se ole Podmen omaa tuotantoa. Siksi jakso saattaa sisältää mainontaa.

Jaksot(16)

Why Creativity Cannot Be Interpolated - MLST

Why Creativity Cannot Be Interpolated - MLST

Jeremy Budd, Assistant Professor at the University of Birmingham, and Tim Scarfe, CEO of Machine Learning Street Talk, discuss the paper “Why Creativity Cannot Be Interpolated”, which argues that genu...

22 Heinä 1h 3min

Inventing Inductive Logic Programming - Stephen Muggleton

Inventing Inductive Logic Programming - Stephen Muggleton

Stephen Muggleton, Emeritus Professor at Imperial College London, discusses his paper “Inductive Logic Programming”, which introduced and named the field. The paper presents a framework that combines ...

18 Kesä 57min

Recursive Program Synthesis - Aws Albarghouthi

Recursive Program Synthesis - Aws Albarghouthi

Aws Albarghouthi, Associate Professor of Computer Science at the University of Wisconsin-Madison, discusses his paper “Recursive Program Synthesis”, which introduced Escher, an inductive synthesis alg...

27 Touko 55min

DreamCoder's Wake-Sleep Library Learning - Kevin Ellis

DreamCoder's Wake-Sleep Library Learning - Kevin Ellis

Kevin Ellis, Assistant Professor at Cornell University, discusses his influential paper “DreamCoder,” which presents a system that jointly learns reusable program abstractions and a neural search stra...

7 Huhti 47min

Semantic Programming by Example with Pre-trained Models - Gust Verbruggen

Semantic Programming by Example with Pre-trained Models - Gust Verbruggen

Gust Verbruggen, Senior AI researcher and member of the PROSE team at Microsoft, discusses his paper "Semantic Programming by Example with Pre-trained Models," which introduces a framework for integra...

3 Maalis 1h 15min

February 2026 Podcast Recap

February 2026 Podcast Recap

Program synthesis is the problem of automatically generating code that satisfies a specification. The real challenge isn’t searching faster, it’s making the right parts of the search space searchable ...

9 Helmi 6min

Relational Decomposition for Program Synthesis - Céline Hocquette

Relational Decomposition for Program Synthesis - Céline Hocquette

The way a problem is represented can determine whether it is solvable at all.Céline Hocquette, AI researcher at Ndea and former postdoctoral researcher at the University of Oxford, discusses her paper...

2 Helmi 47min