Subrat Prasad Panda

Subrat Prasad Panda

PhD Candidate · Computer Science · NTU Singapore

Trustworthy RL · Neurosymbolic AI

$ ls interests/ RLNeurosymbolic AIVerificationCPS & roboticsTools
Reinforcement Learning
  • Hierarchical & goal-conditioned RL
  • Sample-efficient learning
  • Sparse-reward & long-horizon tasks
  • Robust & distributional RL
  • RL fine-tuning of foundation models
Neurosymbolic AI
  • Programmatic & interpretable policies
  • Differentiable decision trees
  • Symbolic planning with incremental knowledge
  • Interpretable abstractions & world models
Safety & Verification
  • Formal verification of learned controllers
  • Reach-avoid & safety certificates
  • Abstraction-based reasoning
Applications
  • Cyber-physical systems
  • Microgrid energy management
  • Autonomous navigation & robotics
  • LLM planning for embodied agents
Tools
  • Python
  • C
  • PyTorch
  • TensorFlow
  • ROS 2
  • MATLAB
  • LaTeX

I’m a PhD candidate in Computer Science at NTU Singapore, advised by Arvind Easwaran (NTU) and Blaise Genest (CNRS IPAL, France), working on trustworthy reinforcement learning for safety-critical systems: making RL policies transparent, safe and verifiable. In particular, I work on neurosymbolic techniques, especially symbolic policies that are amenable to formal verification, and on learning methods to train them.

More broadly, I’m interested in neurosymbolic AI that integrates intuitive (System 1) learning with explicit, deliberative (System 2) reasoning, and in the maths underneath it all: learning theory and statistics.

Before NTU, I did an M.Tech in Computer Science at ISI Kolkata and a B.Tech in Electronics & Instrumentation at NIT Silchar.

highlights

DTSemNet Oblique decision trees, trained like neural networks

An exact, approximation-free encoding of oblique decision trees as neural networks, so trees train end-to-end with vanilla gradient descent. The resulting tree policies are interpretable and amenable to formal safety verification.

JMLR 2026ECAI 2024 jmlrecaicodeproject

BWTS Belief World Tree Search

Neurosymbolic hierarchical RL that builds its abstract world model from incrementally added knowledge, rather than learning it upfront, improving sample efficiency on sparse-reward, long-horizon tasks.

ECML-PKDD 2026 arxivcode

all publications →

Looking for postdoc / research roles.

I’ll submit my thesis around Dec 2026 and am looking for roles from Feb 2027 in neurosymbolic RL for trustworthy deployment: differentiable symbolic methods for interpretability and safety, and symbolic knowledge for sample efficiency, with applications in robotics and energy systems.

Writing an RL book: Zero to Hero.

From bandits and MDPs to modern deep RL, with from-scratch code for every algorithm, written to be read alongside the maths. Work in progress; code at deep-rl-jutsu.

news

older news
2025 · 2
2024 · 2
  • DTSemNet — training oblique decision trees with vanilla gradient descent — accepted at ECAI 2024.

  • Co-organized NTU’s first Deep Learning Bootcamp.

2023 · 3

recent writing

older posts
2023 · 2