Variational Bayesian Sequence-to-Sequence Networks for Memory-Efficient Sign Language Translation

02/11/2021
by   Harris Partaourides, et al.
16

Memory-efficient continuous Sign Language Translation is a significant challenge for the development of assisted technologies with real-time applicability for the deaf. In this work, we introduce a paradigm of designing recurrent deep networks whereby the output of the recurrent layer is derived from appropriate arguments from nonparametric statistics. A novel variational Bayesian sequence-to-sequence network architecture is proposed that consists of a) a full Gaussian posterior distribution for data-driven memory compression and b) a nonparametric Indian Buffet Process prior for regularization applied on the Gated Recurrent Unit non-gate weights. We dub our approach Stick-Breaking Recurrent network and show that it can achieve a substantial weight compression without diminishing modeling performance.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/09/2019

Sequence-to-Sequence Natural Language to Humanoid Robot Sign Language

This paper presents a study on natural language to sign language transla...
research
05/08/2017

Convolutional Sequence to Sequence Learning

The prevalent approach to sequence to sequence learning maps an input se...
research
11/28/2018

Neural Sign Language Translation based on Human Keypoint Estimation

We propose a sign language translation system based on human keypoint es...
research
06/13/2016

Neural Associative Memory for Dual-Sequence Modeling

Many important NLP problems can be posed as dual-sequence or sequence-to...
research
07/21/2023

On the Universality of Linear Recurrences Followed by Nonlinear Projections

In this note (work in progress towards a full-length paper) we show that...
research
01/27/2019

Variational Smoothing in Recurrent Neural Network Language Models

We present a new theoretical perspective of data noising in recurrent ne...
research
10/11/2017

StackSeq2Seq: Dual Encoder Seq2Seq Recurrent Networks

A widely studied non-deterministic polynomial time (NP) hard problem lie...

Please sign up or login with your details

Forgot password? Click here to reset