Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Siddhant Pradhan

dblp:301/9312 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Reinforcement learning · 50% Robot manipulation · 50%
Network and information security
1 paper
Privacy and data protection · 100%
Human-computer interaction and pervasive computing
1 paper
Human-robot interaction · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
human-in-the-loop reinforcement learning
0.612022
On Optimizing Interventions in Shared Autonomy · AAAI 2022
Robotics › Robot manipulation › human-robot interaction
shared autonomy
0.612022
On Optimizing Interventions in Shared Autonomy · AAAI 2022
Human-robot interaction
shared control
0.612022
On Optimizing Interventions in Shared Autonomy · AAAI 2022
Privacy and data protection › differential privacy
differentially private query answering
0.512021
Relaxed Marginal Consistency for Differentially Private Query Answering · NeurIPS 2021
Privacy and data protection
differential privacy
0.512021
Relaxed Marginal Consistency for Differentially Private Query Answering · NeurIPS 2021

Methods — techniques the papers use, named apart from their topics

model-free reinforcement learning · 1.1constrained reinforcement learning · 1.1relaxed consistency constraints · 0.5marginal inference · 0.5graphical model · 0.5
YearPublicationVenuePosition
2022 On Optimizing Interventions in Shared Autonomy
abstract
Shared autonomy refers to approaches for enabling an autonomous agent to collaborate with a human with the aim of improving human performance. However, besides improving performance, it may often also be beneficial that the agent concurrently accounts for preserving the user’s experience or satisfaction of collaboration. In order to address this additional goal, we examine approaches for improving the user experience by constraining the number of interventions by the autonomous agent. We propose two model-free reinforcement learning methods that can account for both hard and soft constraints on the number of interventions. We show that not only does our method outperform the existing baseline, but also eliminates the need to manually tune a black-box hyperparameter for controlling the level of assistance. We also provide an in-depth analysis of intervention scenarios in order to further illuminate system understanding.
Weihao Tan, David Koleczek, Siddhant Pradhan, Nicholas Perello, Vivek Chettiar, Vishal Rohra, Aaslesha Rajaram, Soundararajan Srinivasan, H. M. Sajjad Hossain, Yash Chandak
AAAI3
2021 Relaxed Marginal Consistency for Differentially Private Query Answering
abstract
Many differentially private algorithms for answering database queries involve astep that reconstructs a discrete data distribution from noisy measurements. Thisprovides consistent query answers and reduces error, but often requires space thatgrows exponentially with dimension. PRIVATE-PGM is a recent approach that usesgraphical models to represent the data distribution, with complexity proportional tothat of exact marginal inference in a graphical model with structure determined bythe co-occurrence of variables in the noisy measurements. PRIVATE-PGM is highlyscalable for sparse measurements, but may fail to run in high dimensions with densemeasurements. We overcome the main scalability limitation of PRIVATE-PGMthrough a principled approach that relaxes consistency constraints in the estimationobjective. Our new approach works with many existing private query answeringalgorithms and improves scalability or accuracy with no privacy cost.
Ryan McKenna, Siddhant Pradhan, Daniel Sheldon, Gerome Miklau
NeurIPS2