activity
20182022
most citedDeep Latent Competition: Learning to Race Using Visual Control Policies in Latent Space

3 citations · 7 across the 4 of their papers we have counts for

collaborators

8 papers

cs.LG20221 cited

Neighborhood Mixup Experience Replay: Local Convex Interpolation for Improved Sample Efficiency in Continuous Control Tasks

Ryan Sander, Wilko Schwarting, Tim Seyde +3

Experience replay plays a crucial role in improving the sample efficiency of deep reinforcement learning agents. Recent advances in experience replay propose using Mixup (Zhang et…

cs.LG20213 cited

Is Bang-Bang Control All You Need? Solving Continuous Control with Bernoulli Policies

Tim Seyde, Igor Gilitschenski, Wilko Schwarting +4

Reinforcement learning (RL) for continuous control typically employs distributions whose support covers the entire action space. In this work, we investigate the colloquially known…

cs.RO2021

HYPER: Learned Hybrid Trajectory Prediction via Factored Inference and Adaptive Sampling

Xin Huang, Guy Rosman, Igor Gilitschenski +4

Modeling multi-modal high-level intent is important for ensuring diversity in trajectory prediction. Existing approaches explore the discrete nature of human intent before predicti…

cs.LG20213 cited

Deep Latent Competition: Learning to Race Using Visual Control Policies in Latent Space

Wilko Schwarting, Tim Seyde, Igor Gilitschenski +4

Learning competitive behaviors in multi-agent settings such as racing requires long-term reasoning about potential adversarial interactions. This paper presents Deep Latent Competi…

cs.RO2019

Deep Context Maps: Agent Trajectory Prediction using Location-specific Latent Maps

Igor Gilitschenski, Guy Rosman, Arjun Gupta +2

In this paper, we propose a novel approach for agent motion prediction in cluttered environments. One of the main challenges in predicting agent motion is accounting for location a…

cs.LG2019

SiPPing Neural Networks: Sensitivity-informed Provable Pruning of Neural Networks

Cenk Baykal, Lucas Liebenwein, Igor Gilitschenski +2

We introduce a pruning algorithm that provably sparsifies the parameters of a trained model in a way that approximately preserves the model's predictive accuracy. Our algorithm use…