Liquid Time-constant Networks

نویسندگان

چکیده

We introduce a new class of time-continuous recurrent neural network models. Instead declaring learning system's dynamics by implicit nonlinearities, we construct networks linear first-order dynamical systems modulated via nonlinear interlinked gates. The resulting models represent with varying (i.e., liquid) time-constants coupled to their hidden state, outputs being computed numerical differential equation solvers. These exhibit stable and bounded behavior, yield superior expressivity within the family ordinary equations, give rise improved performance on time-series prediction tasks. To demonstrate these properties, first take theoretical approach find bounds over dynamics, compute expressive power trajectory length measure in latent space. then conduct series experiments manifest approximation capability Liquid Time-Constant Networks (LTCs) compared classical modern RNNs.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constant-Time Loading of Shallow 1-Dimensional Networks

The complexity of learning in shallow I-Dimensional neural networks has been shown elsewhere to be linear in the size of the network. However, when the network has a huge number of units (as cortex has) even linear time might be unacceptable. Furthermore, the algorithm that was given to achieve this time was based on a single serial processor and was biologically implausible. In this work we co...

متن کامل

Constant Time per Edge Is Optimal in Rooted Tree Networks

We analyze how the expected packet delay in rooted tree networks is aaected by the distribution of time needed for a packet to cross an edge using stochastic comparison methods. Our result generalizes previously known results that the delay when the crossing time is exponentially distributed yields an upper bound for the expected delay when the crossing time is constant on this class of of netw...

متن کامل

Constant Time Dynamic Programming on Directed Reconfigurable Networks

ÐSeveral dynamic programming algorithms are considered which can be efficiently implemented using parallel networks with reconfigurable buses. The bit model of general reconfigurable meshes with directed links, common write, and unit-time delay for broadcasting is assumed. Given two sequences of length m and n, respectively, their longest common subsequence can be found in constant time by an O...

متن کامل

Robust, Almost Constant Time Shortest-Path Queries in Road Networks

When you drive to somewhere ‘far away’, you will leave your current location via one of only a few ‘important’ traffic junctions. Recently, other research groups and we have largely independently developed this informal observation into transit node routing, a technique for reducing quickest-path queries in road networks to a small number of table lookups. The contribution of our paper is twofo...

متن کامل

Verifying Constant-Time Implementations

The constant-time programming discipline is an effective countermeasure against timing attacks, which can lead to complete breaks of otherwise secure systems. However, adhering to constant-time programming is hard on its own, and extremely hard under additional efficiency and legacy constraints. This makes automated verification of constant-time code an essential component for building secure s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2021

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v35i9.16936