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

Naimeng Ye

dblp:386/2887 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0003-1444-1173ORCID · reported

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

Artificial intelligence and machine learning · 2 · 2 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.

Theoretical computer science
1 paper
Mathematical optimization · 100%
Artificial intelligence
1 paper
Language models and text generation · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
alignment
0.912025
PersonalLLM: Tailoring LLMs to Individual Preferences · ICLR 2025
Natural language and speech › Language models and text generation › large language model › large language model adaptation
personalization
0.912025
PersonalLLM: Tailoring LLMs to Individual Preferences · ICLR 2025
Mathematical optimization › statistical estimation
bias-variance trade-off
0.912025
Differences-in-Neighbors for Network Interference in Experiments · EC 2025
Mathematical optimization
experimental design
0.912025
Differences-in-Neighbors for Network Interference in Experiments · EC 2025
Mathematical optimization › causal inference
treatment effect estimation
0.912025
Differences-in-Neighbors for Network Interference in Experiments · EC 2025

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

reward model · 0.9meta-learning · 0.9in-context learning · 0.9horvitz-thompson estimator · 0.9difference-in-means estimator · 0.9
YearPublicationVenuePosition
2025 PersonalLLM: Tailoring LLMs to Individual Preferences
abstract
As LLMs become capable of complex tasks, there is growing potential for personalized interactions tailored to the subtle and idiosyncratic preferences of the user. We present a public benchmark, PersonalLLM, focusing on adapting LLMs to provide maximal benefits for a particular user. Departing from existing alignment benchmarks that implicitly assume uniform preferences, we curate open-ended prompts paired with many high-quality answers over which users would be expected to display heterogeneous latent preferences. Instead of persona prompting LLMs based on high-level attributes (e.g., user race or response length), which yields homogeneous preferences relative to humans, we develop a method that can simulate a large user base with diverse preferences from a set of pre-trained reward models. Our dataset and generated personalities offer an innovative testbed for developing personalization algorithms that grapple with continual data sparsity---few relevant feedback from the particular user---by leveraging historical data from other (similar) users. We explore basic in-context learning and meta-learning baselines to illustrate the utility of PersonalLLM and highlight the need for future methodological development.
Thomas P. Zollo, Andrew Wei Tung Siah, Naimeng Ye, Hongseok Namkoong
ICLR3
2025 Differences-in-Neighbors for Network Interference in Experiments
abstract
Experiments in online platforms frequently suffer from network interference, where treatments applied to one unit affect outcomes of connected ones, violating the Stable Unit Treatment Value Assumption (SUTVA) and substantially biasing treatment effect estimations. A common solution is to cluster connected units and randomize treatments at the cluster level, typically followed by estimation using either a simple difference-in-means (DM) estimator, which ignores remaining interference and suffers from O(δ) bias where δ measures interference strength; or the unbiased Horvitz-Thompson (HT) estimator, which eliminates bias through importance sampling but incurs exponentially high variance scaling with d, the maximum network degree. This fundamental limitation persists even with sophisticated clustering designs, creating narrow bias-variance tradeoffs often inadequate for practical applications.
Tianyi Peng, Naimeng Ye, Andrew Zheng
EC2