2 code implementations • 30 Jun 2024 • Gabriel Poesia, David Broman, Nick Haber, Noah D. Goodman
We propose novel methods for hindsight relabeling on proof search trees to significantly improve the agent's sample efficiency in both tasks.
1 code implementation • 17 Jun 2024 • Krista Opsahl-Ong, Michael J Ryan, Josh Purtell, David Broman, Christopher Potts, Matei Zaharia, Omar Khattab
To make this tractable, we factorize our problem into optimizing the free-form instructions and few-shot demonstrations of every module and introduce several strategies to craft task-grounded instructions and navigate credit assignment across modules.
no code implementations • 27 May 2024 • Bobby Yan, Alexander J. Root, Trevor Gale, David Broman, Fredrik Kjolstad
To bridge this gap, we introduce Scorch, a library that seamlessly integrates efficient sparse tensor computation into the PyTorch ecosystem, with an initial focus on inference workloads on CPUs.
no code implementations • 23 Apr 2023 • Daniel Arnström, David Broman, Daniel Axehill
For such solvers, we leverage a previously proposed complexity certification framework to generate a finite set of archetypal optimization problems; we prove that these archetypal problems form an execution-time equivalent cover of all possible problems; that is, that they capture the execution time for solving any possible optimization problem that can be encountered online.
5 code implementations • 25 Aug 2017 • Lawrence M. Murray, Daniel Lundén, Jan Kudlicka, David Broman, Thomas B. Schön
For inference with Sequential Monte Carlo, this automatically yields improvements such as locally-optimal proposals and Rao-Blackwellization.
2 code implementations • 1 Feb 2017 • Cláudio Gomes, Casper Thule, David Broman, Peter Gorm Larsen, Hans Vangheluwe
It is essential to find new ways of enabling experts in different disciplines to collaborate more efficient in the development of ever more complex systems, under increasing market pressures.
Systems and Control 65Y10 I.6.1; I.6.7
1 code implementation • 11 Jun 2015 • Måns Magnusson, Leif Jonsson, Mattias Villani, David Broman
We propose a parallel sparse partially collapsed Gibbs sampler and compare its speed and efficiency to state-of-the-art samplers for topic models on five well-known text corpora of differing sizes and properties.