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

Sahil Jain

dblp:65/8280 · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
6since 2021 · last 2025
—ORCID · conflict

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

Artificial intelligence and machine learning · 3 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 since 2021Theory of computation · 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.

Theoretical computer science
1 paper
Automated reasoning and model checking · 67% Graph algorithms and graph theory · 33%
Artificial intelligence
1 paper
Reinforcement learning · 100%
Human-computer interaction and pervasive computing
1 paper
Human-robot interaction · 100%

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

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory › graph traversal
breadth-first search
0.712023
Counterexample Guided Knowledge Compilation for Boolean Functional Synthesis · CAV (1) 2023
Automated reasoning and model checking
knowledge compilation
0.712023
Counterexample Guided Knowledge Compilation for Boolean Functional Synthesis · CAV (1) 2023
Automated reasoning and model checking › synthesis
skolem function synthesis
0.712023
Counterexample Guided Knowledge Compilation for Boolean Functional Synthesis · CAV (1) 2023
Machine learning › Reinforcement learning › reward learning
preference-based reward learning
0.512021
Demonstration of the EMPATHIC Framework for Task Learning from Implicit Human Feedback · AAAI 2021

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

inverse reinforcement learning · 1.0deep neural network · 1.0negation normal form · 0.7existential quantification · 0.7counterexample-guided abstraction · 0.7
YearPublicationVenuePosition
2025 Elucidating Optimal Reward-Diversity Tradeoffs in Text-to-Image Diffusion Models
abstract
Text-to-image (T2I) diffusion models have become prominent tools for generating high-fidelity images from text prompts. However, when trained on unfiltered internet data, these models can produce unsafe, incorrect, or stylis-tically undesirable images that are not aligned with human preferences. To address this, recent approaches have incor-porated human preference datasets to fine-tune T2I mod-els or to optimize reward functions that capture these pref-erences. Although effective, these methods are vulnerable to reward hacking, where the model overfits to the reward function, leading to a loss of diversity in the generated images. In this paper, we prove the inevitability of reward hacking and study natural regularization techniques like KL divergence and LoRA scaling, and their limitations for diffusion models. We also introduce Annealed Importance Guidance (AIG), an inference-time regularization inspired by Annealed Importance Sampling, which retains the di-versity of the base model while achieving Pareto-Optimal reward-diversity tradeoffs. Our experiments demonstrate the benefits of AIG for Stable Diffusion models, striking the optimal balance between reward optimization and im-age diversity. Furthermore, a user study confirms that AIG improves diversity and quality of generated images across different model architectures and reward functions.
Rohit Jena, Ali Taghibakhshi, Sahil Jain, Gerald Shen, Nima Tajbakhsh, Arash Vahdat
WACV3
2024 Leveraging Prosody as an Informative Teaching Signal for Agent Learning: Exploratory Studies and Algorithmic Implications
abstract
Agent learning from human interaction often relies on explicit signals, but implicit social cues, such as prosody in speech, could provide valuable information for more effective learning. This paper advocates for the integration of prosody as a teaching signal to enhance agent learning from human teachers. Through two exploratory studies—one examining voice feedback in an interactive reinforcement learning setup and the other analyzing restricted audio from human demonstrations in three Atari games—we demonstrate that prosody carries significant information about task dynamics. Our findings suggest that prosodic features, when coupled with explicit feedback, can enhance reinforcement learning outcomes. Moreover, we propose guidelines for prosody-sensitive algorithm design and discuss insights into teaching behavior. Our work underscores the potential of leveraging prosody as an implicit signal for more efficient agent learning, thus advancing human-agent interaction paradigms.
Matilda Knierim, Sahil Jain, Murat Han Aydogan, Kenneth Mitra, Kush Desai, Akanksha Saran, Kim Baraka
ICMI2
2023 Counterexample Guided Knowledge Compilation for Boolean Functional Synthesis
abstract
Abstract Given a specification as a Boolean relation between inputs and outputs, Boolean functional synthesis generates a function, called a Skolem function, for each output in terms of the inputs such that the specification is satisfied. In general, there may be many possibilities for Skolem functions satisfying the same specification, and criteria to pick one or the other may vary from specification to specification. In this paper, we develop a technique to represent the space of Skolem functions in a criteria-agnostic form that makes it possible to subsequently extract Skolem functions for different criteria. Our focus is on identifying such a form and on developing a compilation algorithm for this form. Our approach is based on a novel counter-example guided strategy for existentially quantifying a subset of variables from a specification in negation normal form. We implement this technique and compare our performance with those of other knowledge compilation approaches for Boolean functional synthesis, and show promising results.
S. Akshay 0001, Supratik Chakraborty, Sahil Jain
CAV (1)3
2023 Novel Methodology to Optimize TAT and Resource Utilization for ATPG Simulations for Large SoCs
abstract
One of the bottlenecks being observed for multi-billion gate SoC's is the overall time taken to verify various modes of operation in simulation. Analysis done with large number of testbenches identifies some tasks like compilation and elaboration of the DUT, simulation of power-on or initialization sequences, etc., being repetitive in nature. As these tasks become longer to execute the efficiency reduces and the resource utilization (compute, storage, etc.) increases accordingly. This paper proposes a methodology for improving the Turn-around-Time (TAT) and resource utilization for verification of Design-For-Test patterns.
Sudhakar Kongala, Yash Walia, Sahil Jain
ITC4
2023 Auto-pore segmentation of digital microscopic leather images for species identification
Anjli Varghese, Sahil Jain, Malathy Jawahar, A. Amalin Prince
Eng. Appl. Artif. Intell.2
2021 Demonstration of the EMPATHIC Framework for Task Learning from Implicit Human Feedback
abstract
Reactions such as gestures, facial expressions, and vocalizations are an abundant, naturally occurring channel of information that humans provide during interactions. An agent could leverage an understanding of such implicit human feedback to improve its task performance at no cost to the human. This approach contrasts with common agent teaching methods based on demonstrations, critiques, or other guidance that need to be attentively and intentionally provided. In this work, we demonstrate a novel data-driven framework for learning from implicit human feedback, EMPATHIC. This two-stage method consists of (1) mapping implicit human feedback to relevant task statistics such as reward, optimality, and advantage; and (2) using such a mapping to learn a task. We instantiate the first stage and three second-stage evaluations of the learned mapping. To do so, we collect a dataset of human facial reactions while participants observe an agent execute a sub-optimal policy for a prescribed training task. We train a deep neural network on this data and demonstrate its ability to (1) infer relative reward ranking of events in the training task from prerecorded human facial reactions; (2) improve the policy of an agent in the training task using live human facial reactions; and (3) transfer to a novel domain in which it evaluates robot manipulation trajectories. In the video, we focus on demonstrating the online learning capability of our instantiation of EMPATHIC.
Yuchen Cui, Qiping Zhang, Sahil Jain, Alessandro Allievi, Peter Stone 0001, Scott Niekum, W. Bradley Knox
AAAI3
2019 Effects of sentence structure and word complexity on intelligibility in machine-to-human communications
C. T. Justine Hui, Sahil Jain, Catherine I. Watson
Comput. Speech Lang.2