Pith. sign in

REVIEW 1 cited by

Projective simulation for artificial intelligence

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1104.3787 v3 pith:YXYGS3QL submitted 2011-04-19 nlin.AO cond-mat.dis-nnquant-ph

classification nlin.AOcond-mat.dis-nnquant-ph
keywords simulationactionagentclipslearningmodelnetworkprojective
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We propose a model of a learning agent whose interaction with the environment is governed by a simulation-based projection, which allows the agent to project itself into future situations before it takes real action. Projective simulation is based on a random walk through a network of clips, which are elementary patches of episodic memory. The network of clips changes dynamically, both due to new perceptual input and due to certain compositional principles of the simulation process. During simulation, the clips are screened for specific features which trigger factual action of the agent. The scheme is different from other, computational, notions of simulation, and it provides a new element in an embodied cognitive science approach to intelligent action and learning. Our model provides a natural route for generalization to quantum-mechanical operation and connects the fields of reinforcement learning and quantum computation.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning

    quant-ph 2025-01 conditional novelty 6.0 of 10

    Searching over edge-swap variations of hypergraph product codes with an erasure-decoding cost function yields codes that beat Progressive Edge-Growth codes on erasure and bit-flip channels.

Pith tools