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

Fuhua Ji

dblp:313/1825 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none

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

Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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 · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational finance and economics · 100%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › multi-armed bandit
delayed feedback bandit
0.612022
Adaptive Experimentation with Delayed Binary Feedback · WWW 2022
Machine learning › Reinforcement learning
multi-armed bandit
0.612022
Adaptive Experimentation with Delayed Binary Feedback · WWW 2022
Computational finance and economics
online advertising
0.612022
Adaptive Experimentation with Delayed Binary Feedback · WWW 2022
Recommender systems
conversion rate prediction
0.212022
Adaptive Experimentation with Delayed Binary Feedback · WWW 2022

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

multi-armed bandit · 1.7delayed feedback estimation · 1.7
YearPublicationVenuePosition
2022 Adaptive Experimentation with Delayed Binary Feedback
abstract
Conducting experiments with objectives that take significant delays to materialize (e.g. conversions, add-to-cart events, etc.) is challenging. Although the classical “split sample testing” is still valid for the delayed feedback, the experiment will take longer to complete, which also means spending more resources on worse-performing strategies due to their fixed allocation schedules. Alternatively, adaptive approaches such as “multi-armed bandits” are able to effectively reduce the cost of experimentation. But these methods generally cannot handle delayed objectives directly out of the box. This paper presents an adaptive experimentation solution tailored for delayed binary feedback objectives by estimating the real underlying objectives before they materialize and dynamically allocating variants based on the estimates. Experiments show that the proposed method is more efficient for delayed feedback compared to various other approaches and is robust in different settings. In addition, we describe an experimentation product powered by this algorithm. This product is currently deployed in the online experimentation platform of JD.com, a large e-commerce company and a publisher of digital ads.
Carlos Carrion, Xiliang Lin, Fuhua Ji, Yongjun Bao, Weipeng Yan
WWW4