643 citations · 769 across the 9 of their papers we have counts for
9 papers
AI co-mathematician: Accelerating mathematicians with agentic AI
Daniel Zheng, Ingrid von Glehn, Yori Zwols +15
We introduce the AI co-mathematician, a workbench for mathematicians to interactively leverage AI agents to pursue open-ended research. The AI co-mathematician is optimized to prov…
Solving Mixed Integer Programs Using Neural Networks
Vinod Nair, Sergey Bartunov, Felix Gimeno +16
Mixed Integer Programming (MIP) solvers rely on an array of sophisticated heuristics developed with decades of research to solve large-scale MIP instances encountered in practice.…
Woulda, Coulda, Shoulda: Counterfactually-Guided Policy Search
Lars Buesing, Theophane Weber, Yori Zwols +4
Learning policies on data synthesized by models can in principle quench the thirst of reinforcement learning algorithms for large amounts of real experience, which is often costly…
Generative Temporal Models with Spatial Memory for Partially Observed Environments
Marco Fraccaro, Danilo Jimenez Rezende, Yori Zwols +3
In model-based reinforcement learning, generative and temporal models of environments can be leveraged to boost agent performance, either by tuning the agent's representations duri…
PathNet: Evolution Channels Gradient Descent in Super Neural Networks
Chrisantha Fernando, Dylan Banarse, Charles Blundell +5
For artificial general intelligence (AGI) it would be efficient if multiple users trained the same giant neural network, permitting parameter reuse, without catastrophic forgetting…
Deep Reinforcement Learning with Attention for Slate Markov Decision Processes with High-Dimensional States and Actions
Peter Sunehag, Richard Evans, Gabriel Dulac-Arnold +3
Many real-world problems come with action spaces represented as feature vectors. Although high-dimensional control is a largely unsolved problem, there has recently been progress f…
Minimum length path decompositions
Dariusz Dereniowski, Wieslaw Kubiak, Yori Zwols
We consider a bi-criteria generalization of the pathwidth problem, where, for given integers and a graph , we ask whether there exists a path decomposition $\cP$ of su…
A De Bruijn-Erdos theorem for chordal graphs
Laurent Beaudou, Adrian Bondy, Xiaomin Chen +5
A special case of a combinatorial theorem of De Bruijn and Erdos asserts that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chvatal…
Lines in hypergraphs
Laurent Beaudou, Adrian Bondy, Xiaomin Chen +5
One of the De Bruijn - Erdos theorems deals with finite hypergraphs where every two vertices belong to precisely one hyperedge. It asserts that, except in the perverse case where a…