Efficient decoding of compositional structure in holistic representations

DOI10.1162/NECO_A_01590MaRDI QIDQ6982757zbMATH OpenFDO

Authors Denis Kleyko, Connor Bybee, Ping-Chen Huang, Christopher J. Kymn, Bruno A. Olshausen, E. Paxon Frady, Friedrich T. Sommer

Publication date 16 May 2025

Published in Neural Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1162/NECO_A_01590

zbMATH Keywords

decodinglearning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Decoding (94B35)

Cites work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A theoretical perspective on hyperdimensional computing
• A theory of sequence indexing and working memory in recurrent neural networks
• Compressed sensing
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• Matching pursuits with time-frequency dictionaries
• Representing objects, relations, and sequences
• Reservoir computing approaches to recurrent neural network training
• Scikit-learn: machine learning in Python

This page was built for publication: Efficient decoding of compositional structure in holistic representations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982757)