Pith. sign in

REVIEW 2 cited by

Deep Binary Reinforcement Learning for Scalable Verification

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 2203.05704 v1 pith:WT7MO7SM submitted 2022-03-11 cs.LG cs.AI

Deep Binary Reinforcement Learning for Scalable Verification

classification cs.LG cs.AI
keywords networksneuralbnnslearningreinforcementverificationadvancesbinary
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The use of neural networks as function approximators has enabled many advances in reinforcement learning (RL). The generalization power of neural networks combined with advances in RL algorithms has reignited the field of artificial intelligence. Despite their power, neural networks are considered black boxes, and their use in safety-critical settings remains a challenge. Recently, neural network verification has emerged as a way to certify safety properties of networks. Verification is a hard problem, and it is difficult to scale to large networks such as the ones used in deep reinforcement learning. We provide an approach to train RL policies that are more easily verifiable. We use binarized neural networks (BNNs), a type of network with mostly binary parameters. We present an RL algorithm tailored specifically for BNNs. After training BNNs for the Atari environments, we verify robustness properties.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

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

  1. Differentiable Weightless Controllers: Learning Logic Circuits for Continuous Control

    cs.LG 2025-12 conditional novelty 6.0

    Logic-gate circuits trained with gradient descent can match neural-network policies on most MuJoCo continuous-control tasks and run on FPGAs in a few clock cycles.

  2. Learning Quantized Continuous Controllers for Integer Hardware

    cs.LG 2025-11 conditional novelty 6.0

    QAT-trained MuJoCo policies match FP32 returns with 2–3 bit weights/activations and synthesize to microsecond, microjoule integer inference on a small Artix-7 FPGA.