Search Results for author: Ya Le

Found 7 papers, 0 papers with code

Reward Shaping for User Satisfaction in a REINFORCE Recommender

no code implementations30 Sep 2022 Konstantina Christakopoulou, Can Xu, Sai Zhang, Sriraj Badam, Trevor Potter, Daniel Li, Hao Wan, Xinyang Yi, Ya Le, Chris Berg, Eric Bencomo Dixon, Ed H. Chi, Minmin Chen

How might we design Reinforcement Learning (RL)-based recommenders that encourage aligning user trajectories with the underlying user satisfaction?

Imputation Reinforcement Learning (RL)

Recency Dropout for Recurrent Recommender Systems

no code implementations26 Jan 2022 Bo Chang, Can Xu, Matthieu Lê, Jingchen Feng, Ya Le, Sriraj Badam, Ed Chi, Minmin Chen

Recurrent recommender systems have been successful in capturing the temporal dynamics in users' activity trajectories.

Data Augmentation Recommendation Systems

Towards Content Provider Aware Recommender Systems: A Simulation Study on the Interplay between User and Provider Utilities

no code implementations6 May 2021 Ruohan Zhan, Konstantina Christakopoulou, Ya Le, Jayden Ooi, Martin Mladenov, Alex Beutel, Craig Boutilier, Ed H. Chi, Minmin Chen

We then build a REINFORCE recommender agent, coined EcoAgent, to optimize a joint objective of user utility and the counterfactual utility lift of the provider associated with the recommended content, which we show to be equivalent to maximizing overall user utility and the utilities of all providers on the platform under some mild assumptions.

counterfactual Recommendation Systems

Some Theory For Practical Classifier Validation

no code implementations9 Oct 2015 Eric Bax, Ya Le

WAG withholds a validation set, trains a holdout classifier on the remaining data, uses the validation data to validate that classifier, then adds the rate of disagreement between the holdout classifier and one trained using all in-sample data, which is an upper bound on the difference in error rates.

Validation of Matching

no code implementations31 Oct 2014 Ya Le, Eric Bax, Nicola Barbieri, David Garcia Soriano, Jitesh Mehta, James Li

We introduce a technique to compute probably approximately correct (PAC) bounds on precision and recall for matching algorithms.

Entity Resolution

Sparse Quadratic Discriminant Analysis and Community Bayes

no code implementations17 Jul 2014 Ya Le, Trevor Hastie

We develop a class of rules spanning the range between quadratic discriminant analysis and naive Bayes, through a path of sparse graphical models.

General Classification

Cannot find the paper you are looking for? You can Submit a new open access paper.