← Search

Rami Al-Rfou

10 accepted papers

2024

MoST: Multi-Modality Scene Tokenization for Motion Prediction

CVPR 2024poster

Many existing motion prediction approaches rely on symbolic perception outputs to generate agent trajectories such as bounding boxes road graph information and traffic lights. This symbolic representation is a high-level abstraction of the real world which may render the motion prediction model vuln…

Cited by 9SourcePDFScholar
2024

Scaling Motion Forecasting Models with Ensemble Distillation

ICRA 2024poster

Motion forecasting has become an increasingly critical component of autonomous robotic systems. Onboard compute budgets typically limit the accuracy of real-time systems. In this work we propose methods of improving motion forecasting systems subject to limited compute budgets by combining model ens…

Cited by 4SourceScholar
2023

MotionLM: Multi-Agent Motion Forecasting as Language Modeling

ICCV 2023poster

Reliable forecasting of the future behavior of road agents is a critical component to safe planning in autonomous vehicles. Here, we represent continuous trajectories as sequences of discrete motion tokens and cast multi-agent motion prediction as a language modeling task over this domain. Our model…

Cited by 104PDFScholar
2023

Wayformer: Motion Forecasting via Simple & Efficient Attention Networks

ICRA 2023poster

Motion forecasting for autonomous driving is a challenging task because complex driving scenarios involve a heterogeneous mix of static and dynamic inputs. It is an open problem how best to represent and fuse information about road geometry, lane connectivity, time-varying traffic light state, and h…

Cited by 315SourceScholar
2022

Narrowing the coordinate-frame gap in behavior prediction models: Distillation for efficient and accurate scene-centric motion forecasting

ICRA 2022poster

Behavior prediction models have proliferated in recent years, especially in the popular real-world robotics application of autonomous driving, where representing the distribution over possible futures of moving agents is essential for safe and comfortable motion planning. In these models, the choice…

Cited by 13SourceScholar
2021

Knowledge Graph Based Synthetic Corpus Generation for Knowledge-Enhanced Language Model Pre-training

NAACL 2021long

Prior work on Data-To-Text Generation, the task of converting knowledge graph (KG) triples into natural text, focused on domain-specific benchmark datasets. In this paper, however, we verbalize the entire English Wikidata KG, and discuss the unique challenges associated with a broad, open-domain, la…

2021

The Power of Scale for Parameter-Efficient Prompt Tuning

EMNLP 2021main

In this work, we explore “prompt tuning,” a simple yet effective mechanism for learning “soft prompts” to condition frozen language models to perform specific downstream tasks. Unlike the discrete text prompts used by GPT-3, soft prompts are learned through backpropagation and can be tuned to incorp…

2021

mT5: A Massively Multilingual Pre-trained Text-to-Text Transformer

NAACL 2021long

The recent “Text-to-Text Transfer Transformer” (T5) leveraged a unified text-to-text format and scale to attain state-of-the-art results on a wide variety of English-language NLP tasks. In this paper, we introduce mT5, a multilingual variant of T5 that was pre-trained on a new Common Crawl-based dat…

2021

nmT5 - Is parallel data still relevant for pre-training massively multilingual language models?

ACL 2021short

Recently, mT5 - a massively multilingual version of T5 - leveraged a unified text-to-text format to attain state-of-the-art results on a wide variety of multilingual NLP tasks. In this paper, we investigate the impact of incorporating parallel data into mT5 pre-training. We find that multi-tasking l…

Cited by 22SourcePDFScholar
2018

Watch Your Step: Learning Node Embeddings via Graph Attention

NeurIPS 2018poster

Graph embedding methods represent nodes in a continuous vector space, preserving different types of relational information from the graph. There are many hyper-parameters to these methods (e.g. the length of a random walk) which have to be manually tuned for every graph. In this paper, we replace pr…

Cited by 298SourcePDFScholar