Most scientific and engineering challenges can be organized along a complexity ladder.
Right above interpolation lies the learning of differential operators and their solution operators, an area where Gaussian Process/Kernel methods, come with rigorous guarantees and achieve SOTA in terms of data-efficiency and robustness. This talk then ascends to the ladder’s current frontier: algorithm synthesis. Here we introduce a computational‑language–processing framework that tokenizes low‑level computational actions and uses an ensemble‑based Monte‑Carlo Tree Search combined with reinforcement learning to assemble algorithms tailored to individual problem instances. We conclude by discussing where this ladder is taking us.
The first part of this talk is a joint work with based on joint work with Yasamin Jalalian, Juan Felipe Osorio Ramirez, Alexander Hsu, and Bamdad Hosseini.
The second part is joint work with Theo Bourdais, Abeynaya Gnanasekaran and Tuhin Sahai.
