Drift Q-Learning

Preprint 2026

DriftQL generates actions in one forward pass using a learned drift field. Attraction keeps candidates near the data, repulsion spreads them out, and the critic tilts the objective toward higher value. No ODE solver, no distillation network.

2 min · Anas Houssaini, Mohamad H. Danesh, Amin Abyaneh, Scott Fujimoto, Hsiu-Chin Lin, David Meger

Toward Hardware-Agnostic Quadrupedal World Models

Preprint 2026

A single world model trained across eight quadrupeds that generalizes zero-shot to new robot morphologies by explicitly conditioning on physical specifications rather than baking in a fixed embodiment.

2 min · Mohamad H. Danesh, Chenhao Li, Amin Abyaneh, Anas Houssaini, Kirsty Ellis, Glen Berseth, Marco Hutter, Hsiu-Chin Lin

Contractive Diffusion Policies

ICLR 2026

CDPs add a simple contraction regularizer to diffusion policies, pulling nearby sampling trajectories together to suppress solver and score-matching errors. This yields more robust action generation in offline RL and imitation learning, especially in low-data regimes.

2 min · Amin Abyaneh, Charlotte Morissette, Mohamad Danesh, Anas Houssaini, David Meger, Gregory Dudek, Hsiu-Chin Lin

VOCALoco: Viability-Optimized Cost-Aware Adaptive Locomotion

RA-L 2026

VOCALoco predicts the viability and cost of transport for several pretrained locomotion skills from local heightmaps, then executes the safest, most efficient one. It improves robustness on stairs and transfers zero-shot to real hardware.

2 min · Stanley Wu, Mohamad H. Danesh, Simon Li, Hanna Yurchyk, Amin Abyaneh, Anas El Houssaini, David Meger, Hsiu-Chin Lin

Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery

ICLR 2025

Imitation learning policies often fail when robots drift out-of-sample. We propose SCDS, a framework that models policies as contractive dynamical systems, ensuring all rollouts converge regardless of perturbations. The architecture guarantees contractivity by construction, enabling unconstrained optimization. We also provide formal bounds on worst-case and expected loss, and demonstrate strong out-of-sample recovery on manipulation and navigation tasks.

3 min · Amin Abyaneh*, Mahrokh Boroujeni*, Hsiu-Chin Lin, Giancarlo Ferrari-Trecate