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

Joy He-Yueya

dblp:312/9579 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
4since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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.

Artificial intelligence
1 paper
Reinforcement learning · 87% Learning theory · 13%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › bandit
contextual bandit
0.912025
Cost-Aware Near-Optimal Policy Learning · AAAI 2025
Machine learning › Reinforcement learning › policy learning
near-optimal policy learning
0.912025
Cost-Aware Near-Optimal Policy Learning · AAAI 2025
Machine learning › Learning theory › PAC learning
PAC bounds
0.312025
Cost-Aware Near-Optimal Policy Learning · AAAI 2025

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

regret minimization · 0.9contextual bandit · 0.9PAC bounds · 0.9
YearPublicationVenuePosition
2025 Cost-Aware Near-Optimal Policy Learning
abstract
It is often of interest to learn a context-sensitive decision policy, such as in contextual multi-armed bandit processes. To quantify the efficiency of a machine learning algorithm for such settings, probably approximately correct (PAC) bounds, which bound the number of samples required, or cumulative regret guarantees, are typically used. However, real-world settings often have limited resources for experimentation, and decisions/interventions may differ in the amount of resources required (e.g., money or time). Therefore, it is of interest to consider how to design an experiment strategy that reduces the experimental budget needed to learn a near-optimal contextual policy. Unlike reinforcement learning or bandit approaches that embed costs into the reward function, we focus on reducing resource use in learning a near-optimal policy without resource constraints. We introduce two resource-aware algorithms for the contextual bandit setting and prove their soundness. Simulations based on real-world datasets demonstrate that our algorithms significantly reduce the resources needed to learn a near-optimal decision policy compared to previous resource-unaware methods.
Joy He-Yueya, Jonathan Lee 0002, Matthew Jörke, Emma Brunskill
AAAI1
2024 Evaluating and Optimizing Educational Content with Large Language Model Judgments
Joy He-Yueya, Noah D. Goodman, Emma Brunskill
EDM1
2022 Inventory Purchase Recommendation for Merchants in Traditional FMCG Retail Business
abstract
Small and micro merchants in the traditional FastMoving Consumer Goods (FMCG) retail business play a vital role in developing economies. In Indonesia, 82% of the population gets their day-to-day groceries from traditional trade merchants. Our work aims to help these grocery merchants prosper by increasing their sales and improving their inventory turnover cycle. To this end, we conduct an in-depth analysis of merchants’ inventory-buying behaviors from a transaction record dataset and propose several item recommendation methods for merchants’ inventory based on insights gathered from the data. For analysis, we investigate the stock-keeping unit (SKU) coverage, the SKU selling speed, merchant repeat purchase patterns, the growth rate of monthly spending, as well as their correlations with total monetary spending by merchants. Our recommendation methods consider recency and utility of SKU selling speed, and are implemented using popular item-based recommendation and content-based filtering algorithms. The inventory recommendation system was deployed and tested in production. Initial results show a lift in click-through rate (CTR) and also show that merchants are accepting the recommendations of SKU items for their inventory that they had never bought before.
Ying Li 0040, Muhammad Daffa Robani, Victor Suciu 0002, Joy He-Yueya
DSAA4
2021 Quizzing Policy Using Reinforcement Learning for Inferring the Student Knowledge State
Joy He-Yueya, Adish Singla
EDM1