paper-with-me

홈 › Papers

Hey Pentti, We Did (More of) It!: A Vector-Symbolic Lisp With Residue Arithmetic

2025-11-11 · Connor Hanley, Eilene Tomkins-Flanaganm, Mary Alexandria Kelly arxiv

Using Frequency-domain Holographic Reduced Representations (FHRRs), we extend a Vector-Symbolic Architecture (VSA) encoding of Lisp 1.5 with primitives for arithmetic operations using Residue Hyperdimensional Computing (RHC). Encoding a Turing-complete syntax over a high-dimensional vector space increases the expressivity of neural network states, enabling network states to contain arbitrarily structured representations that are inherently interpretable. We discuss the potential applications of the VSA encoding in machine learning tasks, as well as the importance of encoding structured representations and designing neural networks whose behavior is sensitive to the structure of their representations in virtue of attaining more general intelligent agents than exist at present.

📄 PDF Abstract BibTeX arXiv:2511.08767

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Hey Pentti, We Did It!: A Fully Vector-Symbolic Lisp

2025-10-18 · Eilene Tomkins-Flanagan, Mary A. Kelly arxiv

Kanerva (2014) suggested that it would be possible to construct a complete Lisp out of a vector-symbolic architecture. We present the general form of a vector-symbolic representation of the five Lisp elementary functions…

Hey Pentti, We Did It Again!: Differentiable vector-symbolic types that prove polynomial termination

2025-10-18 · Eilene Tomkins-Flanagan, Connor Hanley, Mary A. Kelly arxiv

We present a typed computer language, Doug, in which all typed programs may be proved to halt in polynomial time, encoded in a vector-symbolic architecture (VSA). Doug is just an encoding of the light linear functional p…

Program Synthesis

Adapting A Vector-Symbolic Memory for Lisp ACT-R

2025-08-21 · Meera Ray, Christopher L. Dancy arxiv

Holographic Declarative Memory (HDM) is a vector-symbolic alternative to ACT-R's Declarative Memory (DM) system that can bring advantages such as scalability and architecturally defined similarity between DM chunks. We a…

From Tool Calling to Symbolic Thinking: LLMs in a Persistent Lisp Metaprogramming Loop

2025-06-08 · Jordi de la Torre

We propose a novel architecture for integrating large language models (LLMs) with a persistent, interactive Lisp environment. This setup enables LLMs to define, invoke, and evolve their own tools through programmatic int…

Text Generation

GLISp-r: A preference-based optimization algorithm with convergence guarantees

2022-02-02 · Davide Previtali, Mirko Mazzoleni, Antonio Ferramosca, Fabio Previdi

Preference-based optimization algorithms are iterative procedures that seek the optimal calibration of a decision vector based only on comparisons between couples of different tunings. At each iteration, a human decision…