Efficient Representations for Large Dynamic Sequences in ML - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Poster Communications Year : 2017

Efficient Representations for Large Dynamic Sequences in ML

Abstract

The use of sequence containers, including stacks, queues, and double-ended queues, is ubiquitous in programming. When the maximal number of elements is not known in advance, containers need to grow dynamically. For this purpose, most ML programs either rely on lists or vectors. These structures are inefficient, both in terms of time and space usage. We investigate the use of chunked-based data structures. Such structures save a lot of memory and may deliver better performance than classic container data structures. We observe a 2x speedup compared with vectors, and up to a 3x speedup compared with lengthy lists.
Fichier principal
Vignette du fichier
chunkseq_ml.pdf (160.67 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01669407 , version 1 (20-12-2017)

Identifiers

  • HAL Id : hal-01669407 , version 1

Cite

Arthur Charguéraud, Mike Rainey. Efficient Representations for Large Dynamic Sequences in ML. ML Family Workshop, Sep 2017, Oxford, United Kingdom. 2017. ⟨hal-01669407⟩
158 View
213 Download

Share

Gmail Facebook X LinkedIn More