← Search

Siddharth Srivastava

31 accepted papers

2026

Context-Sensitive Abstractions for Reinforcement Learning with Parameterized Actions

AAAI 2026technical

Real-world sequential decision-making often involves parameterized action spaces that require both, decisions regarding discrete actions and decisions about continuous action parameters governing how an action is executed. Existing approaches exhibit severe limitations in this setting---planning met

Cited by 0SourcePDFScholar
2025

Autonomous Evaluation of LLMs for Truth Maintenance and Reasoning Tasks

ICLR 2025poster

This paper presents AutoEval, a novel benchmark for scaling Large Language Model (LLM) assessment in formal tasks with clear notions of correctness, such as truth maintenance in translation and logical reasoning. AutoEval is the first benchmarking paradigm that offers several key advantages necessar…

Cited by 0SourcePDFScholar
2025

Autonomous Option Invention for Continual Hierarchical Reinforcement Learning and Planning

AAAI 2025technical

Abstraction is key to scaling up reinforcement learning (RL). However, autonomously learning abstract state and action representations to enable transfer and generalization remains a challenging open problem. This paper presents a novel approach for inventing, representing, and utilizing options, wh…

2025

Explain It as Simple as Possible, but No Simpler – Explanation via Model Simplification for Addressing Inferential Gap (Abstract Reprint)

IJCAI 2025

One of the core challenges of explaining decisions made by modern AI systems is the need to address the potential gap in the inferential capabilities of the system generating the decision and the user trying to make sense of it. This inferential capability gap becomes even more critical when it come

Cited by 0SourcePDFScholar
2025

From Real World to Logic and Back: Learning Generalizable Relational Concepts For Long Horizon Robot Planning

CoRL 2025poster

Humans efficiently generalize from limited demonstrations, but robots still struggle to transfer learned knowledge to complex, unseen tasks with longer horizons and increased complexity. We propose the first known method enabling robots to autonomously invent relational concepts directly from small…

Cited by 0SourceScholar
2025

Preserve Anything: Controllable Image Synthesis with Object Preservation

ICCV 2025poster

We introduce Preserve Anything, a novel method for con-trolled image synthesis that addresses key limitations in ob-ject preservation and semantic consistency in text-to-image(T2I) generation. Existing approaches often fail (i) to pre-serve multiple objects with fidelity, (ii) maintain semanticalign…

2025

Using Explainable AI and Hierarchical Planning for Outreach with Robots

AAAI 2025technical

Understanding how robots plan and execute tasks is crucial in today's world, where they are becoming more prevalent in our daily lives. However, teaching non-experts, such as K-12 students, the complexities of robot planning can be challenging. This work presents an open-source platform, JEDAI.Ed, t…

2024

Hierarchical Decompositions and Termination Analysis for Generalized Planning (Abstract Reprint)

IJCAI 2024poster

This paper presents new methods for analyzing and evaluating generalized plans that can solve broad classes of related planning problems. Although synthesis and learning of generalized plans has been a longstanding goal in AI, it remains challenging due to fun- damental gaps in methods for analyzing…

Cited by 0SourcePDFScholar
2024

Hierarchical Planning and Learning for Robots in Stochastic Settings Using Zero-Shot Option Invention

AAAI 2024technical

This paper addresses the problem of inventing and using hierarchical representations for stochastic robot-planning problems. Rather than using hand-coded state or action representations as input, it presents new methods for learning how to create a high-level action representation for long-horizon,…

Cited by 5SourcePDFScholar
2024

OmniVec2 - A Novel Transformer based Network for Large Scale Multimodal and Multitask Learning

CVPR 2024poster

We present a novel multimodal multitask network and associated training algorithm. The method is capable of ingesting data from approximately 12 different modalities namely image video audio text depth point cloud time series tabular graph X-ray infrared IMU and hyperspectral. The proposed approach…

Cited by 15SourcePDFScholar
2024

Talk2BEV: Language-enhanced Bird’s-eye View Maps for Autonomous Driving

ICRA 2024poster

This work introduces Talk2BEV, a large vision-language model (LVLM)1 interface for bird’s-eye view (BEV) maps commonly used in autonomous driving. While existing perception systems for autonomous driving scenarios have largely focused on a pre-defined (closed) set of object categories and driving sc…

Cited by 77SourcecodeScholar
2023

Autonomous Capability Assessment of Sequential Decision-Making Systems in Stochastic Settings

NeurIPS 2023poster

It is essential for users to understand what their AI systems can and can't do in order to use them safely. However, the problem of enabling users to assess AI systems with sequential decision-making (SDM) capabilities is relatively understudied. This paper presents a new approach for modeling the c…

2023

Conditional abstraction trees for sample-efficient reinforcement learning

UAI 2023poster

In many real-world problems, the learning agent needs to learn a problem’s abstractions and solution simultaneously. However, most such abstractions need to be designed and refined by hand for different problems and domains of application. This paper presents a novel top-down approach for constructi…

2022

Bridging the Gap: Providing Post-Hoc Symbolic Explanations for Sequential Decision-Making Problems with Inscrutable Representations

ICLR 2022poster

As increasingly complex AI systems are introduced into our daily lives, it becomes important for such systems to be capable of explaining the rationale for their decisions and allowing users to contest these decisions. A significant hurdle to allowing for such explanatory dialogue could be the {\em…

Cited by 42SourcePDFScholar
2022

Differential Assessment of Black-Box AI Agents

AAAI 2022technical

Much of the research on learning symbolic models of AI agents focuses on agents with stationary models. This assumption fails to hold in settings where the agent's capabilities may change as a result of learning, adaptation, or other post-deployment modifications. Efficient assessment of agents in s…

2022

Joint Communication and Motion Planning for Cobots

ICRA 2022poster

The increasing deployment of robots in co-working scenarios with humans has revealed complex safety and efficiency challenges in the computation of the robot behavior. Movement among humans is one of the most fundamental —and yet critical—problems in this frontier. While several approaches have addr…

Cited by 4SourceScholar
2022

Learning Generalized Policy Automata for Relational Stochastic Shortest Path Problems

NeurIPS 2022accept

Several goal-oriented problems in the real-world can be naturally expressed as Stochastic Shortest Path problems (SSPs). However, the computational complexity of solving SSPs makes finding solutions to even moderately sized problems intractable. State-of-the-art SSP solvers are unable to learn gener…

2022

Relational Abstractions for Generalized Reinforcement Learning on Symbolic Problems

IJCAI 2022poster

Reinforcement learning in problems with symbolic state spaces is challenging due to the need for reasoning over long horizons. This paper presents a new approach that utilizes relational abstractions in conjunction with deep learning to learn a generalizable Q-function for such problems. The learned…

2021

Asking the Right Questions: Learning Interpretable Action Models Through Query Answering

AAAI 2021technical

This paper develops a new approach for estimating an interpretable, relational model of a black-box autonomous agent that can plan and act. Our main contributions are a new paradigm for estimating such models using a rudimentary query interface with the agent and a hierarchical querying algorithm th…

2021

Beyond Image to Depth: Improving Depth Prediction Using Echoes

CVPR 2021poster

We address the problem of estimating depth with multi modal audio visual data. Inspired by the ability of animals, such as bats and dolphins, to infer distance of objects with echolocation, some recent methods have utilized echoes for depth estimation. We propose an end-to-end deep learning based pi…

Cited by 48PDFcodeScholar
2021

Exploiting Local Geometry for Feature and Graph Construction for Better 3D Point Cloud Processing with Graph Neural Networks

ICRA 2021poster

We propose simple yet effective improvements in point representations and local neighborhood graph construction within the general framework of graph neural networks (GNNs) for 3D point cloud processing. As a first contribution, we propose to augment the vertex representations with important local g…

Cited by 23SourcecodeScholar
2021

Learning Generalized Relational Heuristic Networks for Model-Agnostic Planning

AAAI 2021technical

Computing goal-directed behavior is essential to designing efficient AI systems. Due to the computational complexity of planning, current approaches rely primarily upon hand-coded symbolic action models and hand-coded heuristic function generators for efficiency. Learned heuristics for such problems…

2020

Anytime Integrated Task and Motion Policies for Stochastic Environments

ICRA 2020poster

In order to solve complex, long-horizon tasks, intelligent robots need to carry out high-level, abstract planning and reasoning in conjunction with motion planning. However, abstract models are typically lossy and plans or policies computed using them can be unexecutable. These problems are exacerba…

Cited by 45SourceScholar
2019

Learning 2D to 3D Lifting for Object Detection in 3D for Autonomous Vehicles

IROS 2019poster

We address the problem of 3D object detection from 2D monocular images in autonomous driving scenarios. We propose to lift the 2D images to 3D representations using learned neural networks and leverage existing networks working directly on 3D data to perform 3D object detection and localization. We…

Cited by 42SourceScholar
2018

Discrete-Continuous Mixtures in Probabilistic Programming: Generalized Semantics and Inference Algorithms

ICML 2018oral

Despite the recent successes of probabilistic programming languages (PPLs) in AI applications, PPLs offer only limited support for random variables whose distributions combine discrete and continuous elements. We develop the notion of measure-theoretic Bayesian networks (MTBNs) and use it to provide…

2018

Platform-Independent Benchmarks for Task and Motion Planning

RA-L 2018

We present the first platform-independent evaluation method for task and motion planning (TAMP). Previously point, various problems have been used to test individual planners for specific aspects of TAMP. However, no common set of metrics, formats, and problems have been accepted by the community. W

Cited by 73SourceScholar
2016

Guided search for task and motion plans using learned heuristics

ICRA 2016

Tasks in mobile manipulation planning often require thousands of individual motions to complete. Such tasks require reasoning about complex goals as well as the feasibility of movements in configuration space. In discrete representations, planning complexity is exponential in the length of the plan.

Cited by 83SourceScholar