LEARNING HEURISTICS FOR QUANTIFIED BOOLEANF ORMULAS THROUGH REINFORCEMENT LEARNING

登录免费注册

资源分类

论文
算法
数据集
经验分享
技术动态
行业动态

论文
学习
研究领域

算法
学习
研究领域

数据集
自动驾驶
图片

经验分享
学习
研究领域

技术动态
计算机视觉
自然语言处理

行业动态
教育
语音识别

》资源》论文》LEARNING HEURISTICS FOR QUANTIFIED BOOLEANF ORMULAS THROUGH REINFORCEMENT LEARNING

LEARNING HEURISTICS FOR QUANTIFIED BOOLEANF ORMULAS THROUGH REINFORCEMENT LEARNING

2020-01-02 |

84 |

51 |

LEARNING HEURISTICS FOR QUANTIFIED BOOLEANF ORMULAS THROUGH REINFORCEMENT LEARNING
论文

Abstract

We demonstrate how to learn efficient heuristics for automated reasoning algorithms for quantified Boolean formulas through deep reinforcement learning. We focus on a backtracking search algorithm, which can already solve formulas of impressive size up to hundreds of thousands of variables. The main challenge is to find a representation of these formulas that lends itself to making predictions in a scalable way. For a family of challenging problems in 2QBF we learn a heuristic that solves significantly more formulas compared to the existing handwritten heuristics.

上一篇：IS AGOOD REPRESENTATION SUFFICIENT FOR SAMPLEEFFICIENT REINFORCEMENT LEARNING ?

下一篇：EPISODIC REINFORCEMENT LEARNING WITH ASSO -CIATIVE MEMORY

用户评价