activity
20242026
most citedMessage-Passing Monte Carlo: Generating low-discrepancy point sets via Graph Neural Networks

5 citations · 8 across the 10 of their papers we have counts for

collaborators
Showing 2025 · cs.LGShow all

5 papers · 2 filters

cs.LG2025

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…

cs.LG2025

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…

cs.LG2025

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…

cs.LG2025

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…

cs.LG2025★ 1 cited

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…