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

Roy Xie

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

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

Artificial intelligence and machine learning · 3 · 2 first-author · 3 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
3 papers
Language models and text generation · 62% Multi-agent systems · 19% Trustworthy machine learning · 19%
Network and information security
1 paper
Security and privacy of machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
alignment
0.912025
Improving Model Alignment Through Collective Intelligence of Open-Source Models · ICML 2025
Machine learning › Trustworthy machine learning › interpretability
attention analysis
0.912025
Knowing When to Stop: Efficient Context Processing via Latent Sufficiency Signals · NeurIPS 2025
Natural language and speech › Language models and text generation › LLM agents › LLM collaboration
mixture of agents
0.912025
Improving Model Alignment Through Collective Intelligence of Open-Source Models · ICML 2025
Knowledge, reasoning and agents › Multi-agent systems
multi-agent collaboration
0.912025
Improving Model Alignment Through Collective Intelligence of Open-Source Models · ICML 2025
Security and privacy of machine learning
membership inference
0.812024
ReCaLL: Membership Inference via Relative Conditional Log-Likelihoods · EMNLP 2024
Natural language and speech › Language models and text generation › text provenance
pre-training data detection
0.212024
ReCaLL: Membership Inference via Relative Conditional Log-Likelihoods · EMNLP 2024

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

ensemble methods · 1.5conditional log-likelihood · 1.5synthetic data generation · 0.9supervised fine-tuning · 0.9probing classifier · 0.9preference optimization · 0.9
YearPublicationVenuePosition
2025 Improving Model Alignment Through Collective Intelligence of Open-Source Models
abstract
Building helpful and harmless large language models (LLMs) requires effective model alignment approach based on human instructions and feedback, which necessitates high-quality human-labeled data. Constructing such datasets is often expensive and hard to scale, and may face potential limitations on diversity and generalization. To address these challenges, we introduce Mixture of Agents Alignment (MoAA), that leverages the collective strengths of various language models to provide high-quality data for model alignment. By employing MoAA, we enhance both supervised fine-tuning and preference optimization, leading to improved performance compared to using a single model alone to generate alignment data (e.g. using GPT-4o alone). Evaluation results show that our approach can improve win rate of LLaMA-3.1-8B-Instruct from 19.5 to 48.3 on Arena-Hard and from 22.33 to 57.23 on AlpacaEval2, highlighting a promising direction for model alignment through this new scalable and diverse synthetic data recipe. Furthermore, we demonstrate that MoAA enables a self-improvement pipeline, where models fine-tuned on MoA-generated data surpass their own initial capabilities, providing evidence that our approach can push the frontier of open-source LLMs without reliance on stronger external supervision. Data and code will be released.
Roy Xie, Shang Zhu, Ben Athiwaratkun, Bhuwan Dhingra, Shuaiwen Song, Ce Zhang 0001, James Zou 0001
ICML2
2025 Knowing When to Stop: Efficient Context Processing via Latent Sufficiency Signals
abstract
Large language models (LLMs) process entire input contexts indiscriminately, which is inefficient when the information required to answer a query is localized within the context. We present dynamic context cutoff, a novel method enabling LLMs to self-terminate processing upon acquiring sufficient task-relevant information. Through analysis of model internals, we discover that specific attention heads inherently encode "sufficiency signals" -- detectable through lightweight classifiers -- that predict when critical information has been processed. This reveals a new efficiency paradigm: models' internal understanding naturally dictates processing needs rather than external compression heuristics. Comprehensive experiments across six QA datasets (up to 40K tokens) with three model families (LLaMA/Qwen/Mistral, 1B-70B) demonstrate 3.4% accuracy improvement while achieving 1.33x token reduction on average. Furthermore, our method demonstrates superior performance compared to other context efficiency methods at equivalent token reduction rates. Additionally, we observe an emergent scaling phenomenon: while smaller models require probing for sufficiency detection, larger models exhibit intrinsic self-assessment capabilities through prompting.
Roy Xie, Paul Rosu, Chunyuan Deng, Bolun Sun, Bhuwan Dhingra
NeurIPS1
2024 ReCaLL: Membership Inference via Relative Conditional Log-Likelihoods
abstract
The rapid scaling of large language models (LLMs) has raised concerns about the transparency and fair use of the data used in their pretraining.Detecting such content is challenging due to the scale of the data and limited exposure of each instance during training.We propose RECALL, (Relative Conditional Log-Likelihood), a novel membership inference attack (MIA) to detect LLMs' pretraining data by leveraging their conditional language modeling capabilities.RECALL examines the relative change in conditional log-likelihoods when prefixing target data points with non-member context.Our empirical findings show that conditioning member data on non-member prefixes induces a larger decrease in log-likelihood compared to non-member data.We conduct comprehensive experiments and show that RE-CALL achieves state-of-the-art performance on WikiMIA dataset, even with random and synthetic prefixes, and can be further improved using an ensemble approach.Moreover, we conduct an in-depth analysis of LLMs' behavior with different membership contexts, providing insights into how LLMs leverage membership information for effective inference at both the sequence and token level.
Roy Xie, Ruomin Huang, Minxing Zhang, Jian Pei 0001, Neil Zhenqiang Gong, Bhuwan Dhingra
EMNLP1