Skip to contentSkip to filters

We use cookies for analytics.

Inference-Time Algorithms: A Theoretical Lens on Tractability and Error Propagation

Machine Learning, Deep Learning and seminar by Andrej Risteski, Carnegie Mellon University

Hosted by Simons Institute for the Theory of Computing

Thursday 09:45 Los Angeles (GMT-7)

Recording available

Berkeley, United States
Related content

Recording

47 min

Abstract

Inference-time algorithms place pretrained models inside larger computational loops, trading extra computation for accuracy or control. This talk studies efficiency and error propagation with imperfect learned oracles. Examples include stochastic backtracking in generator–verifier systems and the conditions under which diffusion steering can favour rewards while remaining close to the original model.

Topics

Inference-time algorithmspretrained modelscomputational loopsefficiencyerror propagationlearned oraclesstochastic backtrackinggenerator–verifier systemsdiffusion steering