Eigen Memory Tree

10/25/2022
by   Mark Rucker, et al.
0

This work introduces the Eigen Memory Tree (EMT), a novel online memory model for sequential learning scenarios. EMTs store data at the leaves of a binary tree and route new samples through the structure using the principal components of previous experiences, facilitating efficient (logarithmic) access to relevant memories. We demonstrate that EMT outperforms existing online memory approaches, and provide a hybridized EMT-parametric algorithm that enjoys drastically improved performance over purely parametric methods with nearly no downsides. Our findings are validated using 206 datasets from the OpenML repository in both bounded and infinite memory budget situations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/01/2020

An improved algorithm to reconstruct a binary tree from its inorder and postorder traversals

In this paper, we present InPos, an improved algorithm, to reconstruct ...
research
07/17/2018

Contextual Memory Trees

We design and study a Contextual Memory Tree (CMT), a learning memory co...
research
10/11/2022

Dynamic Ensemble Size Adjustment for Memory Constrained Mondrian Forest

Supervised learning algorithms generally assume the availability of enou...
research
01/11/2020

Parametric Probabilistic Quantum Memory

Probabilistic Quantum Memory (PQM) is a data structure that computes the...
research
10/04/2018

Compound Binary Search Tree and Algorithms

The Binary Search Tree (BST) is average in computer science which suppor...
research
05/23/2019

An Improved Reversible Data Hiding in Encrypted Images using Parametric Binary Tree Labeling

This work proposes an improved reversible data hiding scheme in encrypte...

Please sign up or login with your details

Forgot password? Click here to reset