PapersWithELO
← ICLR 2024 leaderboard

In-Depth Comparison of Regularization Methods For Long-Tailed Learning in Trajectory Prediction

Divya Thuremella, Lars Kunze

robotics & planningTrajectory PredictionLong-Tailed LearningImbalanced RegressionAutonomous Vehicles
1.60100
Fused
band ≈ ±15 pct pts (from σ = 0.29)
1.20100
Mimo
band ≈ ±20 pct pts (from σ = 0.41)
1.20100
DeepSeek
band ≈ ±21 pct pts (from σ = 0.42)

OpenReview ground truth

Rejected

TL;DR — We compare regularization-based long-tailed learning techniques for trajectory prediction, and provide in-depth analysis.

Abstract

Autonomous robots have the biggest potential for risk because they operate in open-ended environments where humans interact in complex, diverse ways. To operate, such systems must predict this behaviour, especially if it's part of the unexpected and potentially dangerous long tail of the dataset. Previous works on long-tailed trajectory prediction use models which do not predict a distribution of trajectories with likelihoods associated with each prediction. Furthermore, they report metrics which are biased by the ground-truth. Therefore, we aim to examine regularization methods for long-tailed trajectory prediction by comparing them on the KDE metric, which is designed to compare distributions of trajectories. Moreover, we are the first to report the performance of these methods on both the pedestrian and vehicle classes of the NuScenes dataset.

Author context

Most prolific author: 1 submissions (credibility 1.00).

No mass-submission penalty for this paper (authors within normal submission volume).

Aggregate statistics only — no individual author rankings.

Ranking trajectory

Percentile by tournament round — convergence indicates rating stability.

Judge assessments

Mean overall score 0.0 ± 0.0 (n = 32)