activity
20152026
most citedRecommendations as Treatments: Debiasing Learning and Evaluation

138 citations · 494 across the 31 of their papers we have counts for

collaborators
Showing cs.LGShow all

19 papers · 1 filter

cs.LG2026

Understanding the Challenges in Iterative Generative Optimization with LLMs

Allen Nie, Xavier Daull, Zhiyi Kuang +10

Generative optimization uses large language models (LLMs) to iteratively improve artifacts (such as code, workflows or prompts) using execution feedback. It is a promising approach…

cs.LG2025

Formalizing Learning from Language Feedback with Provable Guarantees

Wanqiao Xu, Allen Nie, Ruijie Zheng +3

Interactively learning from observation and language feedback is an increasingly studied area driven by the emergence of large language model (LLM) agents. Despite impressive empir…

cs.LG2024

Combining Open-box Simulation and Importance Sampling for Tuning Large-Scale Recommenders

Kaushal Paneri, Michael Munje, Kailash Singh Maurya +2

Growing scale of recommender systems require extensive tuning to respond to market dynamics and system changes. We address the challenge of tuning a large-scale ads recommendation…

cs.LG2024

How to Solve Contextual Goal-Oriented Problems with Offline Datasets?

Ying Fan, Jingling Li, Adith Swaminathan +2

We present a novel method, Contextual goal-Oriented Data Augmentation (CODA), which uses commonly available unlabeled trajectories and context-goal pairs to solve Contextual Goal-O…

cs.LG2022★ 4 cited

Hindsight Learning for MDPs with Exogenous Inputs

Sean R. Sinclair, Felipe Frujeri, Ching-An Cheng +6

Many resource management problems require sequential decision-making under uncertainty, where the only uncertainty affecting the decision outcomes are exogenous variables outside t…

cs.LG2021★ 14 cited

Heuristic-Guided Reinforcement Learning

Ching-An Cheng, Andrey Kolobov, Adith Swaminathan

We provide a framework for accelerating reinforcement learning (RL) algorithms by heuristics constructed from domain knowledge or offline data. Tabula rasa RL algorithms require en…

cs.LG2021★ 2 cited

Improving Long-Term Metrics in Recommendation Systems using Short-Horizon Reinforcement Learning

Bogdan Mazoure, Paul Mineiro, Pavithra Srinath +3

We study session-based recommendation scenarios where we want to recommend items to users during sequential interactions to improve their long-term utility. Optimizing a long-term…

cs.LG2020★ 35 cited

Provably Good Batch Reinforcement Learning Without Great Exploration

Yao Liu, Adith Swaminathan, Alekh Agarwal +1

Batch reinforcement learning (RL) is important to apply RL algorithms to many high stakes tasks. Doing batch RL in a way that yields a reliable new policy in large domains is chall…

cs.LG2020★ 9 cited

Improved Image Wasserstein Attacks and Defenses

Edward J. Hu, Adith Swaminathan, Hadi Salman +1

Robustness against image perturbations bounded by a ball have been well-studied in recent literature. Perturbations in the real-world, however, rarely exhibit the pixel in…

cs.LG2019★ 1 cited

Working Memory Graphs

Ricky Loynd, Roland Fernandez, Asli Celikyilmaz +2

Transformers have increasingly outperformed gated RNNs in obtaining new state-of-the-art results on supervised tasks involving text sequences. Inspired by this trend, we study the…

cs.LG2019★ 1 cited

Learning Calibratable Policies using Programmatic Style-Consistency

Eric Zhan, Albert Tseng, Yisong Yue +2

We study the problem of controllable generation of long-term sequential behaviors, where the goal is to calibrate to multiple behavior styles simultaneously. In contrast to the wel…

cs.LG2019

Metareasoning in Modular Software Systems: On-the-Fly Configuration using Reinforcement Learning with Rich Contextual Representations

Aditya Modi, Debadeepta Dey, Alekh Agarwal +4

Assemblies of modular subsystems are being pressed into service to perform sensing, reasoning, and decision making in high-stakes, time-critical tasks in such areas as transportati…

cs.LG2019

Multi-Preference Actor Critic

Ishan Durugkar, Matthew Hausknecht, Adith Swaminathan +1

Policy gradient algorithms typically combine discounted future rewards with an estimated value function, to compute the direction and magnitude of parameter updates. However, for m…

cs.LG2019★ 44 cited

Off-Policy Policy Gradient with State Distribution Correction

Yao Liu, Adith Swaminathan, Alekh Agarwal +1

We study the problem of off-policy policy optimization in Markov decision processes, and develop a novel off-policy policy gradient method. Prior off-policy policy gradient approac…

cs.LG2017

Submodular Mini-Batch Training in Generative Moment Matching Networks

Jun Qi

This article was withdrawn because (1) it was uploaded without the co-authors' knowledge or consent, and (2) there are allegations of plagiarism.

cs.LG2016★ 26 cited

Large-scale Validation of Counterfactual Learning Methods: A Test-Bed

Damien Lefortier, Adith Swaminathan, Xiaotao Gu +2

The ability to perform effective off-policy learning would revolutionize the process of building better interactive systems, such as search engines and recommendation systems for e…

cs.LG2016★ 39 cited

Off-policy evaluation for slate recommendation

Adith Swaminathan, Akshay Krishnamurthy, Alekh Agarwal +4

This paper studies the evaluation of policies that recommend an ordered set of items (e.g., a ranking) based on some context---a common scenario in web search, ads, and recommendat…

cs.LG2016★ 138 cited

Recommendations as Treatments: Debiasing Learning and Evaluation

Tobias Schnabel, Adith Swaminathan, Ashudeep Singh +2

Most data for evaluating and training recommender systems is subject to selection biases, either through self-selection by the users or through the actions of the recommendation sy…

cs.LG2015★ 127 cited

Counterfactual Risk Minimization: Learning from Logged Bandit Feedback

Adith Swaminathan, Thorsten Joachims

We develop a learning principle and an efficient algorithm for batch learning from logged bandit feedback. This learning setting is ubiquitous in online systems (e.g., ad placement…