Benchmarking Data Efficiency and Computational Efficiency of Temporal Action Localization Models

Jan Warchocki, Teodor Oprescu, Yunhan Wang, Alexandru Damacus, Paul Misterka +4 more
8/24/2023
cs.CV

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

In temporal action localization, given an input video, the goal is to predict which actions it contains, where they begin, and where they end. Training and testing current state-of-the-art deep learning models requires access to large amounts of data and computational power. However, gathering such data is challenging and computational resources might be limited. This work explores and measures how current deep temporal action localization models perform in settings constrained by the amount of data or computational power. We measure data efficiency by training each model on a subset of the training set. We find that TemporalMaxer outperforms other models in data-limited settings. Furthermore, we recommend TriDet when training time is limited. To test the efficiency of the models during inference, we pass videos of different lengths through each model. We find that TemporalMaxer requires the least computational resources, likely due to its simple architecture.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{warchocki2023benchmarking,
  title  = {Benchmarking Data Efficiency and Computational Efficiency of Temporal Action Localization Models},
  author = {Jan Warchocki and Teodor Oprescu and Yunhan Wang and Alexandru Damacus and Paul Misterka and Robert-Jan Bruintjes and Attila Lengyel and Ombretta Strafforello and Jan van Gemert},
  year   = {2023},
  eprint = {2308.13082},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2308.13082v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2308.13082.svg)](https://codeofpaper.com/paper/2308.13082)

Discussion