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

Wesley Cheung

dblp:248/8060 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
2since 2021 · last 2023
0009-0000-0028-4814ORCID · reported

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

Artificial intelligence and machine learning · 4 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 since 2021Systems, architecture and hardware · 1Databases, data management, data science and information retrieval · 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
4 papers
Trustworthy machine learning · 34% Language models and text generation · 31% Knowledge representation and reasoning · 16%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation › text generation
story generation
0.922021
Automated Storytelling via Causal, Commonsense Plot Ordering · AAAI 2021
Story Realization: Expanding Plot Events into Sentences · AAAI 2020
Machine learning › Trustworthy machine learning › fairness › algorithmic fairness
advertising fairness
0.712023
Towards Fairness in Personalized Ads Using Impression Variance Aware Reinforcement Learning · KDD 2023
Machine learning › Trustworthy machine learning
fairness
0.712023
Towards Fairness in Personalized Ads Using Impression Variance Aware Reinforcement Learning · KDD 2023
Machine learning › Reinforcement learning › multi-objective reinforcement learning
fair reinforcement learning
0.712023
Towards Fairness in Personalized Ads Using Impression Variance Aware Reinforcement Learning · KDD 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning
causal reasoning
0.512021
Automated Storytelling via Causal, Commonsense Plot Ordering · AAAI 2021
Natural language and speech › Language models and text generation
chart generation
0.512021
Automated Storytelling via Causal, Commonsense Plot Ordering · AAAI 2021
Knowledge, reasoning and agents › Knowledge representation and reasoning
commonsense reasoning
0.512021
Automated Storytelling via Causal, Commonsense Plot Ordering · AAAI 2021
Robotics › Robot navigation and mapping
sensor fusion
0.412020
UNO: Uncertainty-aware Noisy-Or Multimodal Fusion for Unanticipated Input Degradation · ICRA 2020
Natural language and speech › Language models and text generation
text generation
0.412020
Story Realization: Expanding Plot Events into Sentences · AAAI 2020
Machine learning › Trustworthy machine learning › uncertainty estimation › uncertainty-aware learning
uncertainty-aware fusion
0.412020
UNO: Uncertainty-aware Noisy-Or Multimodal Fusion for Unanticipated Input Degradation · ICRA 2020
Machine learning › Trustworthy machine learning
uncertainty estimation
0.412020
UNO: Uncertainty-aware Noisy-Or Multimodal Fusion for Unanticipated Input Degradation · ICRA 2020
Information retrieval › online advertising
ad targeting
0.212023
Towards Fairness in Personalized Ads Using Impression Variance Aware Reinforcement Learning · KDD 2023
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning
narrative planning
0.112021
Automated Storytelling via Causal, Commonsense Plot Ordering · AAAI 2021
Natural language and speech › Language models and text generation › text generation
neural text generation
0.112020
Story Realization: Expanding Plot Events into Sentences · AAAI 2020

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

reinforcement learning · 1.3reranking · 0.7re-ranking · 0.7human-participant study · 0.5commonsense reasoning · 0.5spatial temperature scaling · 0.4noisy-or fusion · 0.4neural language generation · 0.4human subjects study · 0.4ensemble learning · 0.4deep learning · 0.4
YearPublicationVenuePosition
2023 Towards Fairness in Personalized Ads Using Impression Variance Aware Reinforcement Learning
abstract
Variances in ad impression outcomes across demographic groups are increasingly considered to be potentially indicative of algorithmic bias in personalized ads systems. While there are many definitions of fairness that could be applicable in the context of personalized systems, we present a framework which we call the Variance Reduction System (VRS) for achieving more equitable outcomes in Meta's ads systems. VRS seeks to achieve a distribution of impressions with respect to selected protected class (PC) attributes that more closely aligns the demographics of an ad's eligible audience (a function of advertiser targeting criteria) with the audience who sees that ad, in a privacy-preserving manner. We first define metrics to quantify fairness gaps in terms of ad impression variances with respect to PC attributes including gender and estimated race. We then present the VRS for re-ranking ads in an impression variance-aware manner. We evaluate VRS via extensive simulations over different parameter choices and study the effect of the VRS on the chosen fairness metric. We finally present online A/B testing results from applying VRS to Meta's ads systems, concluding with a discussion of future work. We have deployed the VRS to all users in the US for housing ads, resulting in significant improvement in our fairness metric. VRS is the first large-scale deployed framework for pursuing fairness for multiple PC attributes in online advertising.
Aditya Srinivas Timmaraju, Mehdi Mashayekhi, Mingliang Chen 0001, Quintin Fettes, Wesley Cheung, Yihan Xiao, Manojkumar Rangasamy Kannadasan, Pushkar Tripathi, Sean Gahagan, Miranda Bogen, Rob Roudani
KDD6
2021 Automated Storytelling via Causal, Commonsense Plot Ordering
abstract
Automated story plot generation is the task of generating a coherent sequence of plot events. Causal relations between plot events are believed to increase the perception of story and plot coherence. In this work, we introduce the concept of soft causal relations as causal relations inferred from commonsense reasoning. We demonstrate C2PO, an approach to narrative generation that operationalizes this concept through Causal, Commonsense Plot Ordering. Using human-participant protocols, we evaluate our system against baseline systems with different commonsense reasoning reasoning and inductive biases to determine the role of soft causal relations in perceived story quality. Through these studies we also probe the interplay of how changes in commonsense norms across storytelling genres affect perceptions of story quality.
Prithviraj Ammanabrolu, Wesley Cheung, William Broniec, Mark O. Riedl
AAAI2
2020 Story Realization: Expanding Plot Events into Sentences
abstract
Neural network based approaches to automated story plot generation attempt to learn how to generate novel plots from a corpus of natural language plot summaries. Prior work has shown that a semantic abstraction of sentences called events improves neural plot generation and and allows one to decompose the problem into: (1) the generation of a sequence of events (event-to-event) and (2) the transformation of these events into natural language sentences (event-to-sentence). However, typical neural language generation approaches to event-to-sentence can ignore the event details and produce grammatically-correct but semantically-unrelated sentences. We present an ensemble-based model that generates natural language guided by events. We provide results—including a human subjects study—for a full end-to-end automated story generation system showing that our method generates more coherent and plausible stories than baseline approaches 1.
Prithviraj Ammanabrolu, Ethan Tien, Wesley Cheung, Zhaochen Luo, William Ma, Lara J. Martin, Mark O. Riedl
AAAI3
2020 UNO: Uncertainty-aware Noisy-Or Multimodal Fusion for Unanticipated Input Degradation
abstract
The fusion of multiple sensor modalities, especially through deep learning architectures, has been an active area of study. However, an under-explored aspect of such work is whether the methods can be robust to degradation across their input modalities, especially when they must generalize to degradation not seen during training. In this work, we propose an uncertainty-aware fusion scheme to effectively fuse inputs that might suffer from a range of known and unknown degradation. Specifically, we analyze a number of uncertainty measures, each of which captures a different aspect of uncertainty, and we propose a novel way to fuse degraded inputs by scaling modality-specific output softmax probabilities. We additionally propose a novel data-dependent spatial temperature scaling method to complement these existing uncertainty measures. Finally, we integrate the uncertainty-scaled output from each modality using a probabilistic noisy-or fusion method. In a photo-realistic simulation environment (AirSim), we show that our method achieves significantly better results on a semantic segmentation task, as compared to state-of-art fusion architectures, on a range of degradation (e.g. fog, snow, frost, and various other types of noise), some of which are unknown during training.
Junjiao Tian, Wesley Cheung, Nathaniel Glaser, Yen-Cheng Liu, Zsolt Kira
ICRA2