paper-with-me

홈 › Papers

BCQQ: Batch-Constraint Quantum Q-Learning with Cyclic Data Re-uploading

2023-04-27 · Maniraman Periyasamy, Marc Hölle, Marco Wiedmann, Daniel D. Scherer, Axel Plinge, Christopher Mutschler

Deep reinforcement learning (DRL) often requires a large number of data and environment interactions, making the training process time-consuming. This challenge is further exacerbated in the case of batch RL, where the agent is trained solely on a pre-collected dataset without environment interactions. Recent advancements in quantum computing suggest that quantum models might require less data for training compared to classical methods. In this paper, we investigate this potential advantage by proposing a batch RL algorithm that utilizes VQC as function approximators within the discrete batch-constraint deep Q-learning (BCQ) algorithm. Additionally, we introduce a novel data re-uploading scheme by cyclically shifting the order of input variables in the data encoding layers. We evaluate the efficiency of our algorithm on the OpenAI CartPole environment and compare its performance to the classical neural network-based discrete BCQ.

📄 PDF Abstract BibTeX arXiv:2305.00905

Code (0)

등록된 구현이 없습니다.

Tasks

Deep Reinforcement LearningQ-Learningreinforcement-learning

Methods 이 논문이 사용한 방법론

Q-Learning Q-Learning is an off-policy temporal difference control algorithm: $$Q\left(S\_{t}, A\_{t}\right) \leftarrow Q\left(S\_{t}, A\_{t}\right) + \alpha\left[R_{t+1} +…

Similar Papers 제목 키워드 기반

Order from chaos in quantum walks on cyclic graphs

2020-08-01 · Abhisek Panda, Colin Benjamin

It has been shown classically that combining two chaotic random walks can yield an ordered(periodic) walk. Our aim in this paper is to find a quantum analog for this rather counter-intuitive result. We study chaotic and …

Cyclic quantum causal modelling with a graph separation theorem

2025-02-06 · Carla Ferradini, Victor Gitton, V. Vilasini

Causal modelling frameworks link observable correlations to causal explanations, which is a crucial aspect of science. These models represent causal relationships through directed graphs, with vertices and edges denoting…

Causal Discovery

Q-Match: Iterative Shape Matching via Quantum Annealing

2021-05-06 · ICCV 2021 10 · Marcel Seelbach Benkner, Zorah Lähner, Vladislav Golyanik, Christof Wunderlich 외

Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) that becomes infeasible for shapes with high sampling density. A promising research direction is to tackle such quadratic o…

Bayesian Networks based Hybrid Quantum-Classical Machine Learning Approach to Elucidate Gene Regulatory Pathways

2019-01-23 · Radhakrishnan Balu, Ajinkya Borle

We report a scalable hybrid quantum-classical machine learning framework to build Bayesian networks (BN) that captures the conditional dependence and causal relationships of random variables. The generation of a BN consi…

ARCBIG-bench Machine Learning

DAG Learning from Zero-Inflated Count Data Using Continuous Optimization

2025-12-18 · Noriaki Sato, Marco Scutari, Shuichi Kawano, Rui Yamaguchi 외 arxiv

We address network structure learning from zero-inflated count data by casting each node as a zero-inflated generalized linear model and optimizing a smooth, score-based objective under a directed acyclic graph constrain…