Pith. sign in

REVIEW 3 major objections 5 minor 49 references

Map-Free Trajectory Prediction with Map Distillation and Hierarchical Encoding

T0 review · 3 major / 5 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The paper claims that a map-free trajectory predictor can internalize HD-map priors from a teacher's intermediate features, and reports state-of-the-art map-free results on Argoverse.

desk verdict A useful map-free architecture with a credible SOTA claim on Argoverse, but the 'map distillation' mechanism is unsupported by the experiments. read the letter →

arxiv 2411.10961 v1 pith:DVYMNR4H submitted 2024-11-17 cs.CV

Xiaodong Liu , Yucheng Xing , Xin Wang This is my paper · ORCID
classification cs.CV
keywords map-freetrajectorypredictionknowledgedistillationmotionforecastinghierarchicalencoderiterativedecoderHDmappriorsArgoverseautonomousdriving
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper's aim is to show that trajectory prediction does not have to choose between map-free deployment and map-informed accuracy. The authors propose MFTP, a student network that receives only agents' historical positions and interactions during inference, but is trained to imitate the intermediate trajectory-query features of a pre-trained map-based teacher, thereby absorbing map priors through knowledge distillation. They also contribute a hierarchical encoder that fuses multi-scale temporal agent features into $K$ trajectory queries and an iterative decoder that emits one second of future motion per step. On the Argoverse benchmark, the method reports the best known results among map-free predictors, and its no-distillation baseline already surpasses existing map-free and distilled map-free competitors. The upshot, if the claim holds, is that reliable motion forecasting no longer depends on the real-time availability of accurate HD maps.

What carries the argument

The load-bearing component is the trajectory query: a per-agent, per-mode vector that both the teacher and student maintain as the interface between encoding and decoding. The teacher's queries are enriched by agent-map attention and query-map attention; the student has no map modules, so the only way it can acquire map structure is through the two knowledge-distillation losses $L_{kd}^1$ and $L_{kd}^2$, which align student queries with teacher queries after encoding and at each of the $I_T$ decoder iterations. Around this core, the architecture uses factorized agent-agent attention (temporal attention with a causal mask, spatial attention over nearby agents), a Feature Aggregation module that forms $H$ hierarchical queries over different time intervals and fuses them into $K$ trajectory queries via concatenation and an MLP, and an iterative decoder that predicts 1-second motion segments in each of $I_T = 3$ steps. The relative-motion input representation, the relative position and heading embeddings, and the mixture-of-Gaussians regression loss are supporting elements; the identity that carries the paper's claim is the distilled trajectory query.

What would settle it

Train the same student with a teacher that never saw maps, or with the teacher's map inputs randomly permuted. If the student still shows the same improvement from distillation, then the transfer is not map priors. A second test: evaluate the distilled student on a dataset or scenario where agents move without lane constraints (an open parking lot or a roundabout) and check whether the distillation gain disappears; the assumption predicts it should.

Watch

Extended reading notes

Core claim

On the paper's own terms, the central discovery is that map priors can be separated from map inputs. A teacher that sees HD maps during training encodes lane geometry into the $K$ trajectory queries it uses to seed multimodal future trajectories; a student that never sees maps can be made to reproduce those query features by minimizing L2 distance at two points in the pipeline, after the encoder and before each MLP decode step. With this distillation, MFTP reaches a minADE$_6$ of 0.84, a minFDE$_6$ of 1.38, and a brier-minFDE$_6$ of 2.03 on the Argoverse test set under the map-free setting, surpassing prior map-free methods and the distillation-augmented HiVT-128+FOKD. The authors also show that the map-based teacher collapses when maps are withheld at inference (MFTP-T‡ degrades to minFDE$_6$ 3.77), while the distilled student does not, which they take as evidence that the student has internalized map structure rather than memorizing map coordinates.

Load-bearing premise

The method assumes that an agent's past movement carries enough of the road's lane structure that a student can learn map priors from the teacher's intermediate features; if trajectories never reflect lane topology, the distillation has nothing useful to pass along.

Editorial extensions

If this is right

  • If the distillation claim is right, fleets can run map-free inference without accepting a large accuracy penalty, provided a map-based teacher was available at training time.
  • The ablation studies show agent-agent spatial attention is the most valuable module in the map-free setting (removing it raises minADE$_6$ by 14.1% and minFDE$_6$ by 24.6%), indicating that interaction history substitutes for much of the information maps would normally provide.
  • The iterative decoder gives a direct speed-accuracy dial: predicting shorter segments (down to 0.5 s) improves minFDE$_6$, so deployment can trade a little latency for accuracy.
  • The teacher's sharp degradation when maps are removed at inference (minFDE$_6$ jumps from 1.22 to 3.77) implies that map-based models cannot simply be run without their map inputs, making a dedicated distilled student a safer runtime choice.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same teacher-to-student query-distillation recipe may generalize to other map-conditioned forecasting architectures and datasets (e.g., Waymo, nuScenes), since it only requires the teacher to expose per-query features and the student to keep the identical query structure.
  • The paper's implicit assumption that trajectories reflect lane topology is testable with a probe: train a lightweight decoder on the student's trajectory queries to predict local lane boundaries; if it fails, the distilled features do not actually encode map structure.
  • Because the student is matched to the teacher's intermediate features rather than its outputs, systematic teacher errors (e.g., confidently predicting a path into a closed lane) are likely to be inherited by the student; evaluating on lane-closure or construction scenarios would expose this failure mode.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper proposes MFTP, a map-free trajectory prediction architecture for Argoverse. The method trains a map-based teacher and a map-free student that distills intermediate teacher features (trajectory queries before and after the decoder) during training, so that no HD maps are needed at inference. The student uses a hierarchical encoder with factorized temporal/spatial attention and hierarchical query aggregation, plus an iterative decoder that predicts future trajectory segments in several steps. Experiments on Argoverse report state-of-the-art results among the compared map-free methods (e.g., validation minADE 0.68, minFDE 1.07, MR 0.11 for MFTP) and include ablations of the proposed attention modules, the number of hierarchical query levels, and the number of decoder iterations.

Significance. If the results are reproducible, MFTP is a meaningful advance in map-free trajectory prediction: it provides a transformer-style map-free baseline that outperforms HiVT-128+FOKD and prior map-free methods on Argoverse, and the intermediate-feature distillation scheme is simple, clearly described, and well integrated with a new hierarchical encoder and iterative decoder. The paper also gives useful ablations of temporal/spatial attention, feature aggregation, query-query attention, hierarchical query counts, and iterative decoding length. The main weakness is that the paper's central conceptual claim, that knowledge distillation transfers map-specific priors rather than generic feature information, is not tested with appropriate controls; in addition, the reported gains over the strongest baseline are small and come from single-run experiments without error bars, so the state-of-the-art claim is not yet statistically robust.

major comments (3)
  1. [Sec. 3.4, Eqs. (5)-(7), Table 1] The central claim that the student "benefits from map priors during training via knowledge distillation" (Abstract and Sec. 1) is not isolated by the experiments. The only comparison is between MFTP-NKD and MFTP, where the teacher is always the full map-based network, so the observed gains could come from generic feature imitation, from the teacher's larger effective capacity, or from the teacher's richer feature distributions, rather than from map topology. The statement in Sec. 4.3 that the results "confirm that the map-free student model can learn map priors through knowledge distillation" is also unsupported, because the cited AASA ablation is performed on MFTP-NKD without any knowledge distillation. I ask the authors to add a control condition: distill from a map-free teacher (or from a teacher trained with the map branch present but with zeroed/masked map input) using the same loss and architecture. If the student improves comparably under that control, the map-prior interpretation is not supported. The text should then be adjusted to describe the contribution as feature distillation from a map-based teacher, or the experiments should be extended to demonstrate map-specific transfer.
  2. [Tables 1 and 2] The state-of-the-art claim rests on single-run results without error bars or significance tests. The margins over the strongest baseline, HiVT-128+ FOKD, are small (validation minADE 0.68 vs. 0.71, minFDE 1.07 vs. 1.11; test minADE 0.84 vs. 0.88, minFDE 1.38 vs. 1.47). Optimization noise is not reported, so a reader cannot determine whether the reported lead is systematic or within run-to-run variation. Please report the mean and standard deviation over at least three independently seeded runs with identical hyperparameters for the main tables. If the margins are not robust, the state-of-the-art claim should be softened accordingly.
  3. [Sec. 4.3, Tables 3-5] All ablations are trained on only 20% of the Argoverse training data, while the main comparisons in Tables 1-2 are presumably trained on the full set. This makes it difficult to infer that the module contributions and the chosen hyperparameters (H=3, IT=3) are optimal or even beneficial at the full training scale. In particular, the text draws a strong conclusion from the AASA removal (a 24.6% relative increase in minFDE6) and links it to the map-prior hypothesis, but this result is from a reduced-data setting and does not involve knowledge distillation. Please either rerun the key ablations on full training data or explicitly discuss that the ablations are a reduced-scale study and restrict the conclusions accordingly.
minor comments (5)
  1. [Tables 1-2, footnotes] The table notes should clearly list the source of every baseline number and specify which numbers were produced by the authors; currently the dagger mark says the map-free performance is taken from [40] and the star says performance was reproduced by [40], but it is not stated whether the authors independently computed any baseline. Additionally, the MFTP-T-dagger row is not a map-free model in the training sense, and its large degradation when tested without maps is expected; this should be explained in the text so it is not read as a competing map-free baseline.
  2. [Sec. 3.2, Eq. (3)] The symbol Q is used both for the query in the attention operator of Eq. (1) and for the fused trajectory query in Eq. (3); using distinct symbols (e.g., Q_fused) would remove ambiguity.
  3. [Figure 2] The caption uses the abbreviation FA without defining it; please define Feature Aggregation (FA) in the caption or refer the reader to Sec. 3.2 where the module is introduced.
  4. [Eqs. (5)-(6)] Please specify whether L2 denotes the Euclidean norm or the squared L2 norm, since this affects the gradient scaling of the distillation loss.
  5. [Tables 4-5] These ablations report only minADE6, minFDE6, and MR6; reporting DAC and brier-minFDE6 would make the effect of the number of hierarchical queries and decoder iterations on confidence and drivable-area compliance visible.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the central claims are empirical and benchmarked against external methods, and no equation reduces to its own inputs.

full rationale

The paper's central claims are empirical and externally benchmarked: MFTP is evaluated against CRAT-Pred, Fast map-free, HiVT variants, and FOKD on the Argoverse test and validation sets, so the state-of-the-art claim is not equivalent to any fitted input. The map-prior distillation mechanism is implemented with standard L2 feature-alignment losses (Eqs. 5-7) between a fixed, separately trained map-based teacher and a map-free student; these losses do not by construction guarantee map knowledge transfer, which is why the authors' attribution of DAC gains to map priors is an experimental interpretation rather than a definitional identity. The teacher is trained independently with the same regression and classification objectives used for the student, and the student is also trained with its own Lreg and Lcls losses, so the distilled student is not forced to reproduce the teacher's outputs by construction. The hierarchical encoder, iterative decoder, and ablations are architectural contributions evaluated by standard metrics; none of the equations restate their inputs. The few self-citations (e.g., Refs. 19 and 38) appear only in a general related-work list and are not load-bearing for any derivation. The skeptical concern that the KD improvement could reflect generic feature imitation rather than specifically map priors is a question about experimental control and mechanism identification, not circularity, and it does not rise to any of the enumerated circularity patterns.

Assumptions & free parameters 9 free parameters · 4 assumptions · 0 invented entities

The method rests on hand-picked hyperparameters and the domain-specific premise that agent motion encodes lane topology. No newly invented physical or conceptual entities are introduced.

free parameters (9)
  • alpha = 1
    Weight of regression loss Lreg in Eq. 10; set to 1 without reported tuning.
  • beta = 1
    Weight of classification loss Lcls; set to 1.
  • gamma = 1
    Weight of distillation loss Lkd; set to 1; no ablation on loss weights is reported.
  • LE (encoder layers) = 3
    Stacked layers in hierarchical encoder; chosen by hand.
  • LD (decoder layers) = 3
    Iterative decoder layers per iteration; chosen by hand.
  • H (hierarchical query levels) = 3
    Number of time-interval queries; ablation shows H=4 gives no gain, so H=3 selected.
  • IT (decoder iterations) = 3
    Each iteration predicts 1 second; 6 iterations slightly improve minFDE but 3 chosen for efficiency.
  • interaction radius (dn) = 100 m
    Neighbor cutoff for spatial attention and agent-map attention; no sensitivity study.
  • feature dimension D
    Hidden feature dimension not specified in the paper; a free architecture choice.
assumptions (4)
  • domain assumption Agent trajectories inherently reflect the topology of map lanes
    Stated in Sec. 3.4 as the basis for map-prior distillation; if false, the student has no signal from which to recover map geometry.
  • domain assumption L2 alignment of query-level features transfers map priors
    Eqs. 5-7 define distillation only at trajectory queries and decoder query features; the paper does not test whether other layers are needed.
  • domain assumption 100 m neighborhood contains all relevant interaction context
    Sec. 4.1 sets spatial attention radius to 100 m without sensitivity analysis.
  • standard math Standard transformer attention and MLP blocks are suitable inductive biases for agent interaction modeling
    The architecture reuses Attention in Eq. 1 and LayerNorm/FFN blocks; these are treated as given.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Map-Free Trajectory Prediction with Map Distillation and Hierarchical Encoding." pith.science (2026). https://pith.science/paper/DVYMNR4H

@misc{pith2026241110961,
  author       = {Pith},
  title        = {Pith review of: Map-Free Trajectory Prediction with Map Distillation and Hierarchical Encoding},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/DVYMNR4H}},
  note         = {Machine review of arXiv:2411.10961}
}
read the original abstract

Reliable motion forecasting of surrounding agents is essential for ensuring the safe operation of autonomous vehicles. Many existing trajectory prediction methods rely heavily on high-definition (HD) maps as strong driving priors. However, the availability and accuracy of these priors are not guaranteed due to substantial costs to build, localization errors of vehicles, or ongoing road constructions. In this paper, we introduce MFTP, a Map-Free Trajectory Prediction method that offers several advantages. First, it eliminates the need for HD maps during inference while still benefiting from map priors during training via knowledge distillation. Second, we present a novel hierarchical encoder that effectively extracts spatial-temporal agent features and aggregates them into multiple trajectory queries. Additionally, we introduce an iterative decoder that sequentially decodes trajectory queries to generate the final predictions. Extensive experiments show that our approach achieves state-of-the-art performance on the Argoverse dataset under the map-free setting.

Figures

Figures reproduced from arXiv: 2411.10961 by the authors.

Figure 1
Figure 1. The differences between existing methods with ours. Existing map-based methods utilize map information during both training and inference, whereas map-free methods do not. In con￾trast, our method employs a pre-trained map-based teacher net￾work to distill map priors into a map-free student network. for interactions with agents. These methods focus on opti￾mizing the representation of contextual information, with th… view at source ↗
Figure 2
Figure 2. Overall framework of MFTP. MFTP has a pre-trained map-based teacher model and a map-free student model. The student has the same architecture as the teacher except for the map-related modules. The hierarchical agent features are progressively extracted after agent-agent temporal and spatial attention through the Feature Aggregation (FA) module in the encoder, and these features are then fused to form K trajectory qu… view at source ↗
Figure 3
Figure 3. Illustration of hierarchical feature aggregation and fusion. When provided with multiple features of a single agent, our approach employs multiple queries to extract different levels of features progressively. The first query aggregates all agent fea￾tures (dashed line) while the second only gathers features for ev￾ery 2 time intervals (solid line). Subsequently, these features are fused into a single trajectory que… view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: Qualitative results on Argoverse validation set. (a) illustrates the performance of our map-free model on intersection scenarios with various driving behaviors (e.g., go-straight, left-turn, big left-turn and right-turn from left to right) without leveraging map priors…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

49 extracted references · 31 canonical work pages

  1. [1]

    Adapt: Efficient multi-agent trajectory prediction with adaptation

    G ¨orkay Aydemir, Adil Kaan Akan, and Fatma G¨uney. Adapt: Efficient multi-agent trajectory prediction with adaptation. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pages 8295–8305, 2023. 1, 2, 5

    work page 2023

  2. [2]

    Layer normalization

    Jimmy Lei Ba, Jamie Ryan Kiros, and Geoffrey E Hin- ton. Layer normalization. arXiv preprint arXiv:1607.06450,

    arXiv

  3. [3]

    Eigentrajectory: Low-rank descriptors for multi-modal trajectory forecasting

    Inhwan Bae, Jean Oh, and Hae-Gon Jeon. Eigentrajectory: Low-rank descriptors for multi-modal trajectory forecasting. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pages 10017–10029, 2023. 1

    work page 2023

  4. [4]

    Vehicle trajectory prediction works, but not everywhere

    Mohammadhossein Bahari, Saeed Saadatnejad, Ahmad Rahimi, Mohammad Shaverdikondori, Amir Hossein Shahidzadeh, Seyed-Mohsen Moosavi-Dezfooli, and Alexandre Alahi. Vehicle trajectory prediction works, but not everywhere. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages 17123–17133, 2022. 1

    work page 2022

  5. [5]

    nuscenes: A multi- modal dataset for autonomous driving

    Holger Caesar, Varun Bankiti, Alex H Lang, Sourabh V ora, Venice Erin Liong, Qiang Xu, Anush Krishnan, Yu Pan, Gi- ancarlo Baldan, and Oscar Beijbom. nuscenes: A multi- modal dataset for autonomous driving. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 11621–11631, 2020. 2

    2020

  6. [6]

    Multipath: Multiple probabilistic anchor tra- jectory hypotheses for behavior prediction

    Yuning Chai, Benjamin Sapp, Mayank Bansal, and Dragomir Anguelov. Multipath: Multiple probabilistic anchor tra- jectory hypotheses for behavior prediction. arXiv preprint arXiv:1910.05449, 2019. 5

    arXiv 1910

  7. [7]

    Argoverse: 3d tracking and forecasting with rich maps

    Ming-Fang Chang, John Lambert, Patsorn Sangkloy, Jag- jeet Singh, Slawomir Bak, Andrew Hartnett, De Wang, Peter Carr, Simon Lucey, Deva Ramanan, et al. Argoverse: 3d tracking and forecasting with rich maps. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 8748–8757, 2019. 1, 2, 6

    work page 2019

  8. [8]

    Online knowledge distillation with diverse peers

    Defang Chen, Jian-Ping Mei, Can Wang, Yan Feng, and Chun Chen. Online knowledge distillation with diverse peers. In Proceedings of the AAAI conference on artificial intelligence, volume 34, pages 3430–3437, 2020. 3

    work page 2020

Show all 49 references
  1. [9]

    Forecast-mae: Self-supervised pre-training for motion forecasting with masked autoencoders

    Jie Cheng, Xiaodong Mei, and Ming Liu. Forecast-mae: Self-supervised pre-training for motion forecasting with masked autoencoders. In Proceedings of the IEEE/CVF In- ternational Conference on Computer Vision , pages 8679– 8689, 2023. 1

    2023

  2. [10]

    Hierarchical latent structure for multi-modal vehicle trajectory forecasting

    Dooseop Choi and KyoungWook Min. Hierarchical latent structure for multi-modal vehicle trajectory forecasting. In European Conference on Computer Vision, pages 129–145. Springer, 2022. 1

    2022

  3. [11]

    Vectornet: Encoding hd maps and agent dynamics from vectorized rep- resentation

    Jiyang Gao, Chen Sun, Hang Zhao, Yi Shen, Dragomir Anguelov, Congcong Li, and Cordelia Schmid. Vectornet: Encoding hd maps and agent dynamics from vectorized rep- resentation. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 11525– 11...

    2020

  4. [12]

    Densetnt: End-to-end trajectory prediction from dense goal sets

    Junru Gu, Chen Sun, and Hang Zhao. Densetnt: End-to-end trajectory prediction from dense goal sets. In Proceedings of the IEEE/CVF International Conference on Computer Vi- sion, pages 15303–15312, 2021. 1

    2021

  5. [13]

    Online knowl- edge distillation via collaborative learning

    Qiushan Guo, Xinjiang Wang, Yichao Wu, Zhipeng Yu, Ding Liang, Xiaolin Hu, and Ping Luo. Online knowl- edge distillation via collaborative learning. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pat- tern Recognition, pages 11020–11029, 2020. 3

    2020

  6. [14]

    A comprehensive overhaul of feature distillation

    Byeongho Heo, Jeesoo Kim, Sangdoo Yun, Hyojin Park, No- jun Kwak, and Jin Young Choi. A comprehensive overhaul of feature distillation. InProceedings of the IEEE/CVF Inter- national Conference on Computer Vision, pages 1921–1930,

    1921

  7. [15]

    Knowledge transfer via distillation of activation boundaries formed by hidden neurons

    Byeongho Heo, Minsik Lee, Sangdoo Yun, and Jin Young Choi. Knowledge transfer via distillation of activation boundaries formed by hidden neurons. In Proceedings of the AAAI Conference on Artificial Intelligence , volume 33, pages 3779–3787, 2019. 3

    2019

  8. [16]

    Distill- ing the knowledge in a neural network

    Geoffrey Hinton, Oriol Vinyals, and Jeff Dean. Distill- ing the knowledge in a neural network. arXiv preprint arXiv:1503.02531, 2015. 3

    2015 arXiv

  9. [17]

    Motiondiffuser: Controllable multi-agent motion prediction using diffusion

    Chiyu Jiang, Andre Cornman, Cheolho Park, Benjamin Sapp, Yin Zhou, Dragomir Anguelov, et al. Motiondiffuser: Controllable multi-agent motion prediction using diffusion. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 9644–9653, 2023. 1

    2023

  10. [18]

    Paraphras- ing complex network: Network compression via factor trans- fer

    Jangho Kim, SeongUk Park, and Nojun Kwak. Paraphras- ing complex network: Network compression via factor trans- fer. Advances in neural information processing systems, 31,

  11. [19]

    Multi-modality cascaded fusion technology for au- tonomous driving

    Hongwu Kuang, Xiaodong Liu, Jingwei Zhang, and Zicheng Fang. Multi-modality cascaded fusion technology for au- tonomous driving. In 2020 4th International Conference on Robotics and Automation Sciences (ICRAS) , pages 44–49. IEEE, 2020. 1

    2020

  12. [20]

    Shadow knowledge distillation: Bridg- ing offline and online knowledge transfer

    Lujun Li and Zhe Jin. Shadow knowledge distillation: Bridg- ing offline and online knowledge transfer. Advances in Neu- ral Information Processing Systems, 35:635–649, 2022. 3

    2022

  13. [21]

    Distilling a powerful student model via online knowledge distillation

    Shaojie Li, Mingbao Lin, Yan Wang, Yongjian Wu, Yonghong Tian, Ling Shao, and Rongrong Ji. Distilling a powerful student model via online knowledge distillation. IEEE Transactions on Neural Networks and Learning Sys- tems, 2022. 3

    2022

  14. [22]

    Sit: A spatial interaction-aware transformer- based model for freeway trajectory prediction

    Xiaolong Li, Jing Xia, Xiaoyong Chen, Yongbin Tan, and Jing Chen. Sit: A spatial interaction-aware transformer- based model for freeway trajectory prediction. ISPRS In- ternational Journal of Geo-Information , 11(2):79, 2022. 2, 5

    2022

  15. [23]

    Online knowledge distillation for efficient pose estimation

    Zheng Li, Jingwen Ye, Mingli Song, Ying Huang, and Zhi- geng Pan. Online knowledge distillation for efficient pose estimation. In Proceedings of the IEEE/CVF international conference on computer vision , pages 11740–11750, 2021. 3

    2021

  16. [24]

    Learning lane graph represen- tations for motion forecasting

    Ming Liang, Bin Yang, Rui Hu, Yun Chen, Renjie Liao, Song Feng, and Raquel Urtasun. Learning lane graph represen- tations for motion forecasting. In Computer Vision–ECCV 2020: 16th European Conference, Glasgow, UK, August 23– 28, 2020, Proceedings, Part II 16, pages 541–556. Springer,

    2020

  17. [25]

    Laformer: Trajectory prediction for autonomous driving with lane-aware scene constraints

    Mengmeng Liu, Hao Cheng, Lin Chen, Hellward Broszio, Jiangtao Li, Runjiang Zhao, Monika Sester, and Michael Ying Yang. Laformer: Trajectory prediction for autonomous driving with lane-aware scene constraints. arXiv preprint arXiv:2302.13933, 2023. 1

    2023 arXiv

  18. [26]

    Im- proved knowledge distillation via teacher assistant

    Seyed Iman Mirzadeh, Mehrdad Farajtabar, Ang Li, Nir Levine, Akihiro Matsukawa, and Hassan Ghasemzadeh. Im- proved knowledge distillation via teacher assistant. In Pro- ceedings of the AAAI conference on artificial intelligence , volume 34, pages 5191–5198, 2020. 3

    2020

  19. [27]

    Wayformer: Motion forecasting via simple & efficient attention networks

    Nigamaa Nayakanti, Rami Al-Rfou, Aurick Zhou, Kratarth Goel, Khaled S Refaat, and Benjamin Sapp. Wayformer: Motion forecasting via simple & efficient attention networks. In 2023 IEEE International Conference on Robotics and Au- tomation (ICRA), pages 2980–2987. IEEE, 2023. 1, 4, 5

    2023

  20. [28]

    Relational knowledge distillation

    Wonpyo Park, Dongju Kim, Yan Lu, and Minsu Cho. Relational knowledge distillation. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 3967–3976, 2019. 3

    2019

  21. [29]

    Switchable online knowledge distillation

    Biao Qian, Yang Wang, Hongzhi Yin, Richang Hong, and Meng Wang. Switchable online knowledge distillation. In European Conference on Computer Vision, pages 449–466. Springer, 2022. 3

    2022

  22. [30]

    Crat-pred: Vehicle trajectory prediction with crystal graph convolutional neural networks and multi-head self-attention

    Julian Schmidt, Julian Jordan, Franz Gritschneder, and Klaus Dietmayer. Crat-pred: Vehicle trajectory prediction with crystal graph convolutional neural networks and multi-head self-attention. In 2022 International Conference on Robotics and Automation (ICRA), pages 7799–7805....

    2022

  23. [31]

    Motionlm: Multi-agent motion forecast- ing as language modeling

    Ari Seff, Brian Cera, Dian Chen, Mason Ng, Aurick Zhou, Nigamaa Nayakanti, Khaled S Refaat, Rami Al-Rfou, and Benjamin Sapp. Motionlm: Multi-agent motion forecast- ing as language modeling. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pages 8579–...

    2023

  24. [32]

    Motion transformer with global intention localization and lo- cal movement refinement

    Shaoshuai Shi, Li Jiang, Dengxin Dai, and Bernt Schiele. Motion transformer with global intention localization and lo- cal movement refinement. Advances in Neural Information Processing Systems, 35:6531–6543, 2022. 1, 2, 4, 5, 6

    2022

  25. [33]

    Mtr++: Multi-agent motion prediction with symmetric scene modeling and guided intention querying

    Shaoshuai Shi, Li Jiang, Dengxin Dai, and Bernt Schiele. Mtr++: Multi-agent motion prediction with symmetric scene modeling and guided intention querying. arXiv preprint arXiv:2306.17770, 2023. 2, 4

    2023 arXiv

  26. [34]

    Scalability in perception for autonomous driving: Waymo open dataset

    Pei Sun, Henrik Kretzschmar, Xerxes Dotiwalla, Aurelien Chouard, Vijaysai Patnaik, Paul Tsui, James Guo, Yin Zhou, Yuning Chai, Benjamin Caine, et al. Scalability in perception for autonomous driving: Waymo open dataset. In Proceed- ings of the IEEE/CVF conference on computer ...

    2020

  27. [35]

    Contrastive representation distillation

    Yonglong Tian, Dilip Krishnan, and Phillip Isola. Contrastive representation distillation. arXiv preprint arXiv:1910.10699, 2019. 3

    1910 arXiv

  28. [36]

    Multipath++: Efficient information fu- sion and trajectory aggregation for behavior prediction

    Balakrishnan Varadarajan, Ahmed Hefny, Avikalp Srivas- tava, Khaled S Refaat, Nigamaa Nayakanti, Andre Cornman, Kan Chen, Bertrand Douillard, Chi Pang Lam, Dragomir Anguelov, et al. Multipath++: Efficient information fu- sion and trajectory aggregation for behavior prediction....

    2022

  29. [37]

    Attention is all you need

    Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszko- reit, Llion Jones, Aidan N Gomez, Łukasz Kaiser, and Illia Polosukhin. Attention is all you need. Advances in neural information processing systems, 30, 2017. 4

    2017

  30. [38]

    Ptseformer: Progressive temporal-spatial enhanced transformer towards video object detection

    Han Wang, Jun Tang, Xiaodong Liu, Shanyan Guan, Rong Xie, and Li Song. Ptseformer: Progressive temporal-spatial enhanced transformer towards video object detection. In European Conference on Computer Vision, pages 732–747. Springer, 2022. 1

    2022

  31. [39]

    Dis- tilling object detectors with fine-grained feature imitation

    Tao Wang, Li Yuan, Xiaopeng Zhang, and Jiashi Feng. Dis- tilling object detectors with fine-grained feature imitation. In Proceedings of the IEEE/CVF Conference on Computer Vi- sion and Pattern Recognition, pages 4933–4942, 2019. 3

    2019

  32. [40]

    Enhanc- ing mapless trajectory prediction through knowledge distil- lation

    Yuning Wang, Pu Zhang, Lei Bai, and Jianru Xue. Enhanc- ing mapless trajectory prediction through knowledge distil- lation. arXiv preprint arXiv:2306.14177, 2023. 2, 6

    2023 arXiv

  33. [41]

    Fend: A future enhanced distribution-aware contrastive learning framework for long-tail trajectory prediction

    Yuning Wang, Pu Zhang, Lei Bai, and Jianru Xue. Fend: A future enhanced distribution-aware contrastive learning framework for long-tail trajectory prediction. In Proceed- ings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 1400–1409, 2023. 1

    2023

  34. [42]

    Argoverse 2: Next generation datasets for self-driving perception and forecasting

    Benjamin Wilson, William Qi, Tanmay Agarwal, John Lambert, Jagjeet Singh, Siddhesh Khandelwal, Bowen Pan, Ratnesh Kumar, Andrew Hartnett, Jhony Kaesemodel Pontes, et al. Argoverse 2: Next generation datasets for self-driving perception and forecasting. arXiv preprint arXiv:230...

    2023 arXiv

  35. [43]

    Peer collaborative learn- ing for online knowledge distillation

    Guile Wu and Shaogang Gong. Peer collaborative learn- ing for online knowledge distillation. In Proceedings of the AAAI Conference on artificial intelligence, volume 35, pages 10302–10310, 2021. 3

    2021

  36. [44]

    A fast and map-free model for trajectory prediction in traffics

    Junhong Xiang, Jingmin Zhang, and Zhixiong Nan. A fast and map-free model for trajectory prediction in traffics. arXiv preprint arXiv:2307.09831, 2023. 2, 6

    2023 arXiv

  37. [45]

    Feature nor- malized knowledge distillation for image classification

    Kunran Xu, Lai Rui, Yishi Li, and Lin Gu. Feature nor- malized knowledge distillation for image classification. In European conference on computer vision , pages 664–680. Springer, 2020. 3

    2020

  38. [46]

    Decoupled knowledge distillation

    Borui Zhao, Quan Cui, Renjie Song, Yiyu Qiu, and Jiajun Liang. Decoupled knowledge distillation. In Proceedings of the IEEE/CVF Conference on computer vision and pattern recognition, pages 11953–11962, 2022. 3

    2022

  39. [47]

    Query-centric trajectory prediction

    Zikang Zhou, Jianping Wang, Yung-Hui Li, and Yu-Kai Huang. Query-centric trajectory prediction. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pat- tern Recognition, pages 17863–17873, 2023. 1, 2, 4

    2023

  40. [48]

    Hivt: Hierarchical vector transformer for multi-agent motion prediction

    Zikang Zhou, Luyao Ye, Jianping Wang, Kui Wu, and Ke- jie Lu. Hivt: Hierarchical vector transformer for multi-agent motion prediction. In Proceedings of the IEEE/CVF Con- ference on Computer Vision and Pattern Recognition, pages 8823–8833, 2022. 1, 2, 6

    2022

  41. [49]

    Ipcc-tp: Utilizing incre- mental pearson correlation coefficient for joint multi-agent trajectory prediction

    Dekai Zhu, Guangyao Zhai, Yan Di, Fabian Manhardt, Hendrik Berkemeyer, Tuan Tran, Nassir Navab, Federico Tombari, and Benjamin Busam. Ipcc-tp: Utilizing incre- mental pearson correlation coefficient for joint multi-agent trajectory prediction. In Proceedings of the IEEE/CVF Co...

    2023

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.