← Search

Vihari Piratla

8 accepted papers

2025

LLMs on interactive feature collections with implicit dynamic decision strategy

COLING 2025main

In real-world contexts such as medical diagnosis and business consulting, effective problem-solving often requires gathering relevant information through interactions and targeted questioning to pinpoint the root cause of a problem. However, Large Language Models (LLMs) often struggle to efficiently…

Cited by 1SourcePDFScholar
2023

Human-in-the-Loop Mixup

UAI 2023poster

Aligning model representations to humans has been found to improve robustness and generalization. However, such methods often focus on standard observational data. Synthetic data is proliferating and powering many advances in machine learning; yet, it is not always clear whether synthetic labels are…

2023

Use perturbations when learning from explanations

NeurIPS 2023poster

Machine learning from explanations (MLX) is an approach to learning that uses human-provided explanations of relevant or irrelevant features for each input to ensure that model predictions are right for the right reasons. Existing MLX approaches rely on local model interpretation methods and require…

2022

Focus on the Common Good: Group Distributional Robustness Follows

ICLR 2022poster

We consider the problem of training a classification model with group annotated training data. Recent work has established that, if there is distribution shift across different groups, models trained using the standard empirical risk minimization (ERM) objective suffer from poor performance on minor…

2021

Active Assessment of Prediction Services as Accuracy Surface Over Attribute Combinations

NeurIPS 2021poster

Our goal is to evaluate the accuracy of a black-box classification model, not as a single aggregate on a given test data distribution, but as a surface over a large number of combinations of attributes characterizing multiple test data distributions. Such attributed accuracy measures become importa…

2021

Training for the Future: A Simple Gradient Interpolation Loss to Generalize Along Time

NeurIPS 2021poster

In several real world applications, machine learning models are deployed to make predictions on data whose distribution changes gradually along time, leading to a drift between the train and test distributions. Such models are often re-trained on new data periodically, and they hence need to general…

2020

Efficient Domain Generalization via Common-Specific Low-Rank Decomposition

ICML 2020poster

Domain generalization refers to the task of training a model which generalizes to new domains that are not seen during training. We present CSD (Common Specific Decomposition), for this setting, which jointly learns a common component (which generalizes to new domains) and a domain specific componen…