5 citations · 8 across the 10 of their papers we have counts for
11 papers
Looped Actor: Depth-Recurrent Reasoning Models for Reinforcement Learning
T. Konstantin Rusch, Tim Seyde, Jared Boyer +2
Looped reasoning models repeatedly apply a shared set of parameters, enabling more computation without increasing the model size. These models also support input-dependent computat…
When Sensors Fail: Temporal Sequence Models for Robust PPO under Sensor Drift
Kevin Vogt-Lowell, Theodoros Tsiligkaridis, Rodney Lafuente-Mercado +4
Real-world reinforcement learning systems must operate under distributional drift in their observation streams, yet most policy architectures implicitly assume fully observed and n…
Quantifying Memory Use in Reinforcement Learning with Temporal Range
Rodney Lafuente-Mercado, Daniela Rus, T. Konstantin Rusch
How much does a trained RL policy actually use its past observations? We propose \emph{Temporal Range}, a model-agnostic metric that treats first-order sensitivities of multiple ve…
Neural Low-Discrepancy Sequences
Michael Etienne Van Huffel, Nathan Kirk, Makram Chahine +2
Low-discrepancy points are designed to efficiently fill the space in a uniform manner. This uniformity is highly advantageous in many problems in science and engineering, including…
The Curious Case of In-Training Compression of State Space Models
Makram Chahine, Philipp Nazari, Daniela Rus +1
State Space Models (SSMs), developed to tackle long sequence modeling tasks efficiently, offer both parallelizable training and fast inference. At their core are recurrent dynamica…
Decentralized Vision-Based Autonomous Aerial Wildlife Monitoring
Makram Chahine, William Yang, Alaa Maalouf +6
Wildlife field operations demand efficient parallel deployment methods to identify and interact with specific individuals, enabling simultaneous collective behavioral analysis, and…
Learning to Dissipate Energy in Oscillatory State-Space Models
Jared Boyer, T. Konstantin Rusch, Daniela Rus
State-space models (SSMs) are a class of networks for sequence learning that benefit from fixed state size and linear complexity with respect to sequence length, contrasting the qu…
Low Stein Discrepancy via Message-Passing Monte Carlo
Nathan Kirk, T. Konstantin Rusch, Jakob Zech +1
Message-Passing Monte Carlo (MPMC) was recently introduced as a novel low-discrepancy sampling approach leveraging tools from geometric deep learning. While originally designed for…
Oscillatory State-Space Models
T. Konstantin Rusch, Daniela Rus
We propose Linear Oscillatory State-Space models (LinOSS) for efficiently learning on long sequences. Inspired by cortical dynamics of biological neural networks, we base our propo…
Improving Efficiency of Sampling-based Motion Planning via Message-Passing Monte Carlo
Makram Chahine, T. Konstantin Rusch, Zach J. Patterson +1
Sampling-based motion planning methods, while effective in high-dimensional spaces, often suffer from inefficiencies due to irregular sampling distributions, leading to suboptimal…
Message-Passing Monte Carlo: Generating low-discrepancy point sets via Graph Neural Networks
T. Konstantin Rusch, Nathan Kirk, Michael M. Bronstein +2
Discrepancy is a well-known measure for the irregularity of the distribution of a point set. Point sets with small discrepancy are called low-discrepancy and are known to efficient…