Pith. sign in

REVIEW 1 cited by

Quantum enhancements for deep reinforcement learning in large spaces

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 1910.12760 v2 pith:YW2MNZM2 submitted 2019-10-28 quant-ph cs.AIcs.LGstat.ML

classification quant-phcs.AIcs.LGstat.ML
keywords learningquantumdeepmodelsreinforcementcomputationalenhancementsmethods
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In the past decade, the field of quantum machine learning has drawn significant attention due to the prospect of bringing genuine computational advantages to now widespread algorithmic methods. However, not all domains of machine learning have benefited equally from quantum enhancements. Notably, deep learning and reinforcement learning, despite their tremendous success in the classical domain, both individually and combined, remain relatively unaddressed by the quantum community. Arguably, one reason behind this is the systematic use in these domains of models and methods without prominent computational bottlenecks, leaving little room for quantum improvements. In this work, we study the state-of-the-art neural-network approaches for reinforcement learning with quantum enhancements in mind. We demonstrate the substantial learning advantage that models with a sampling bottleneck can provide over conventional neural network architectures in complex learning environments. These so-called energy-based models, like deep energy-based reinforcement learning, and deep projective simulation that we also introduce in this work, effectively allow to trade off learning performance for efficiency of computation. To alleviate the additional computational costs, we propose to leverage future and near-term quantum algorithms, resulting in overall more advantageous learning algorithms. This is achieved using cutting-edge and new quantum computing machinery to speed-up classical sampling methods and by employing generalized models to gain an additional quantum advantage.

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. Free Energy Projective Simulation (FEPS): Active inference with interpretability

    cs.AI 2024-11 conditional novelty 6.0 of 10

    FEPS agents combine projective simulation with active inference to learn world models and goal-directed policies from prediction accuracy alone, resolving ambiguous observations without external rewards.

Pith tools