paper-with-me

홈 › Papers

ATLAS: Universal Function Approximator for Memory Retention

2022-08-10 · Heinrich van Deventer, Anna Bosman

Artificial neural networks (ANNs), despite their universal function approximation capability and practical success, are subject to catastrophic forgetting. Catastrophic forgetting refers to the abrupt unlearning of a previous task when a new task is learned. It is an emergent phenomenon that hinders continual learning. Existing universal function approximation theorems for ANNs guarantee function approximation ability, but do not predict catastrophic forgetting. This paper presents a novel universal approximation theorem for multi-variable functions using only single-variable functions and exponential functions. Furthermore, we present ATLAS: a novel ANN architecture based on the new theorem. It is shown that ATLAS is a universal function approximator capable of some memory retention, and continual learning. The memory of ATLAS is imperfect, with some off-target effects during continual learning, but it is well-behaved and predictable. An efficient implementation of ATLAS is provided. Experiments are conducted to evaluate both the function approximation and memory retention capabilities of ATLAS.

📄 PDF Abstract BibTeX arXiv:2208.05388

Code (0)

등록된 구현이 없습니다.

Tasks

Continual Learning

Similar Papers 제목 키워드 기반

KASAM: Spline Additive Models for Function Approximation

2022-05-12 · Heinrich van Deventer, Pieter Janse van Rensburg, Anna Bosman

Neural networks have been criticised for their inability to perform continual learning due to catastrophic forgetting and rapid unlearning of a past concept when a new concept is introduced. Catastrophic forgetting can b…

Additive modelsContinual Learning

Parameterized Convex Universal Approximators for Decision-Making Problems

2022-01-17 · Jinrae Kim, Youdan Kim

Parameterized max-affine (PMA) and parameterized log-sum-exp (PLSE) networks are proposed for general decision-making problems. The proposed approximators generalize existing convex approximators, namely, max-affine (MA)…

Decision Making

Hierarchical Universal Value Function Approximators

2024-10-11 · Rushiv Arora

There have been key advancements to building universal approximators for multi-goal collections of reinforcement learning value functions -- key elements in estimating long-term returns of states in a parameterized manne…

Hierarchical Reinforcement Learningreinforcement-learningReinforcement Learning

Coupling-based Invertible Neural Networks Are Universal Diffeomorphism Approximators

2020-06-20 · NeurIPS 2020 12 · Takeshi Teshima, Isao Ishikawa, Koichi Tojo, Kenta Oono 외

Invertible neural networks based on coupling flows (CF-INNs) have various machine learning applications such as image synthesis and representation learning. However, their desirable characteristics such as analytic inver…

Image GenerationRepresentation Learning

Universal Approximation with Softmax Attention

2025-04-22 · Jerry Yao-Chieh Hu, Hude Liu, Hong-Yu Chen, Weimin Wu 외

We prove that with linear transformations, both (i) two-layer self-attention and (ii) one-layer self-attention followed by a softmax function are universal approximators for continuous sequence-to-sequence functions on c…