paper-with-me

홈 › Papers

Dynamic probabilistic logic models for effective abstractions in RL

2021-10-15 · Harsha Kokel, Arjun Manoharan, Sriraam Natarajan, Balaraman Ravindran, Prasad Tadepalli

State abstraction enables sample-efficient learning and better task transfer in complex reinforcement learning environments. Recently, we proposed RePReL (Kokel et al. 2021), a hierarchical framework that leverages a relational planner to provide useful state abstractions for learning. We present a brief overview of this framework and the use of a dynamic probabilistic logic model to design these state abstractions. Our experiments show that RePReL not only achieves better performance and efficient learning on the task at hand but also demonstrates better generalization to unseen tasks.

📄 PDF Abstract BibTeX arXiv:2110.08318

Code (0)

등록된 구현이 없습니다.

Tasks

reinforcement-learningReinforcement LearningReinforcement Learning (RL)

Similar Papers 제목 키워드 기반

Data-driven Abstractions for Verification of Deterministic Systems

2022-11-03 · Rudi Coppola, Andrea Peruffo, Manuel Mazo Jr

A common technique to verify complex logic specifications for dynamical systems is the construction of symbolic abstractions: simpler, finite-state models whose behaviour mimics the one of the systems of interest. Typica…

Probabilistic Program Abstractions

2017-05-28 · Steven Holtzen, Todd Millstein, Guy Van Den Broeck

Abstraction is a fundamental tool for reasoning about complex systems. Program abstraction has been utilized to great effect for analyzing deterministic programs. At the heart of program abstraction is the relationship b…

Abstracting Probabilistic Models: A Logical Perspective

2018-10-04 · Vaishak Belle

Abstraction is a powerful idea widely used in science, to model, reason and explain the behavior of systems in a more tractable search space, by omitting irrelevant details. While notions of abstraction have matured for …

Robustly Complete Finite-State Abstractions for Control Synthesis of Stochastic Systems

2023-03-08 · Yiming Meng, Jun Liu

The essential step of abstraction-based control synthesis for nonlinear systems to satisfy a given specification is to obtain a finite-state abstraction of the original systems. The complexity of the abstraction is usual…

A Formal Tool for Verification of Probabilistic Spiking Neural Networks Based on Quotient Abstractions

2026-06-12 · Nikan Zandian Jazi, Elisabetta De Maria, Christopher Leturc arxiv

Spiking Neural Networks (SNNs) model biological neural dynamics more faithfully than classical artificial networks, but their stochastic, event-driven computation -- rooted in ion-channel noise and unreliable synaptic ve…