ATVA 2025 (series) / ATVA Papers /
Inductive Generalization in Reinforcement Learning from Specifications
We present a novel inductive generalization framework for RL from logical specifications. Many interesting tasks in RL environments have a natural inductive structure. These inductive tasks have similar overarching goals but they differ inductively in low-level predicates and distributions. We present a generalization procedure that leverages this inductive relationship to learn a higher-order function, a policy generator, that generates appropriately adapted policies for instances of an inductive task in a zero-shot manner. An evaluation of the proposed approach on a set of challenging control benchmarks demonstrates the promise of our framework in generalizing to unseen policies for long-horizon tasks.
Thu 30 OctDisplayed time zone: Chennai, Kolkata, Mumbai, New Delhi change
Thu 30 Oct
Displayed time zone: Chennai, Kolkata, Mumbai, New Delhi change
11:00 - 12:30 | |||
11:00 30mPaper | Inductive Generalization in Reinforcement Learning from Specifications ATVA Papers Vignesh Subramanian Georgia Institute of Technology, Rohit Kushwah , Subhajit Roy IIT Kanpur, Suguman Bansal Georgia Institute of Technology, USA | ||
11:30 30mPaper | Locally Pareto-Optimal Interpretations for Black-Box Machine Learning Models ATVA Papers Aniruddha Joshi UC Berkeley, Supratik Chakraborty IIT Bombay, S. Akshay , Shetal Shah IIT Bombay, India, Hazem Torfah Chalmers University of Technology, Sanjit Seshia UC Berkeley | ||
12:00 30mPaper | Solution-aware vs global ReLU selection: partial MILP strikes back for DNN verification ATVA Papers Yuke Liao CNRS@CREATE, Singapore, Blaise Genest IPAL - CNRS - CNRS@CREATE, Kuldeep S. Meel National University of Singapore, Shaan Aryaman NYU | ||