activity
20222026
most citedHumanity's Last Exam

23 citations · 32 across the 8 of their papers we have counts for

collaborators

8 papers

cs.LG2026

Bayesian Symbolic Regression with Entropic Reinforcement Learning

Oussama Boussif, Mohammed Mahfoud, Younesse Kaddar +6

Symbolic regression is the problem of finding an algebraic expression describing a stochastic dependence of a target variable on a set of inputs. Unlike forms of regression that fi…

cs.CL2025★ 1 cited

Uncertainty-Aware Step-wise Verification with Generative Reward Models

Zihuiwen Ye, Luckeciano Carvalho Melo, Younesse Kaddar +3

Complex multi-step reasoning tasks, such as solving mathematical problems, remain challenging for large language models (LLMs). While outcome supervision is commonly used, process…

cs.LG2025★ 23 cited

Humanity's Last Exam

Long Phan, Alice Gatti, Ziwen Han +1168

Benchmarks are important tools for tracking the rapid advancements in large language model (LLM) capabilities. However, benchmarks are not keeping pace in difficulty: LLMs now achi…

cs.AI2024

Can a Bayesian Oracle Prevent Harm from an Agent?

Yoshua Bengio, Michael K. Cohen, Nikolay Malkin +4

Is there a way to design powerful AI systems based on machine learning methods that would satisfy probabilistic safety guarantees? With the long-term goal of obtaining a probabilis…

cs.PL2023★ 3 cited

Probabilistic programming interfaces for random graphs: Markov categories, graphons, and nominal sets

Nathanael L. Ackerman, Cameron E. Freer, Younesse Kaddar +5

We study semantic models of probabilistic programming languages over graphs, and establish a connection to graphons from graph theory and combinatorics. We show that every well-beh…

cs.LG2023★ 4 cited

Amortizing intractable inference in large language models

Edward J. Hu, Moksh Jain, Eric Elmoznino +4

Autoregressive large language models (LLMs) compress knowledge from their training data through next-token conditional distributions. This limits tractable querying of this knowled…

cs.PL2023★ 1 cited

A model of stochastic memoization and name generation in probabilistic programming: categorical semantics via monads on presheaf categories

Younesse Kaddar, Sam Staton

Stochastic memoization is a higher-order construct of probabilistic programming languages that is key in Bayesian nonparametrics, a modular approach that allows us to extend models…

cs.PL2022

Affine Monads and Lazy Structures for Bayesian Programming

Swaraj Dash, Younesse Kaddar, Hugo Paquet +1

We show that streams and lazy data structures are a natural idiom for programming with infinite-dimensional Bayesian methods such as Poisson processes, Gaussian processes, jump pro…