paper.dinq.meAI 与前沿科学顶会 · 学术新星雷达
登录 DINQ
返回新星榜
ZX

Zheng Xu

COLM 2026×2ICML 2026安全数据与预训练强化学习与后训练对齐与偏好社会与人本
新星分贡献者
49
一作贡献0
核心/参与15
方向广度13
合作网络9
0 一作 · 3 篇 · COLM 2026 / ICML 2026

获取完整研究档案

首次获取该候选人的完整档案及 StartLux 评估共 20 积分;每位用户单独解锁,之后查看免费。主动刷新 20 积分。

联系方式

实时查找电子邮箱,费用不超过20积分;未找到邮箱不扣费。

2026 顶会论文

3
作者位次 #5/6COLM 2026Poster· Poster Session 5· Franciscan B· #89

MAPLE: Metadata Augmented Private Language Evolution

Eli Chien · Yuzheng Hu · Ryan McKenna · Shanshan Wu · Zheng Xu · Peter Kairouz

We propose MAPLE, a framework that leverages metadata-conditioning and in-context examples to improve the initialization and final quality of private evolution algorithms.

摘要

Differentially private (DP) fine-tuning of large language models (LLMs) requires massive compute and full model access, which rules out state-of-the-art proprietary APIs for general users. Generating DP synthetic data offers a practical workaround. This approach also allows for transparent exploratory data analysis and arbitrary reuse across downstream tasks, sidestepping the rigid constraints of a model's parameter space. Private Evolution (PE) provides a promising API-based framework for generating this data, but its success relies heavily on initialization. If the private data distribution falls too far outside the foundation model's pre-training priors -- a common issue in highly specialized domain -- PE struggles to align with the target data. This misalignment causes poor convergence, degraded utility, and wasted API calls. To solve this initialization bottleneck, we introduce Metadata Augmented Private Language Evolution (MAPLE). MAPLE extracts DP tabular metadata and uses in-context learning to firmly ground the initial synthetic distribution in the target domain. Our evaluations on domain-specific text generation tasks show that MAPLE yields a strictly better privacy-utility trade-off, converges significantly faster, and sharply reduces API costs compared to baseline PE methods.

数据与预训练对齐与偏好安全synthetic datadifferential privacyprivate evolutionmetadataOpenReview
作者位次 #8/9COLM 2026Poster· Poster Session 2· Grand Ballroom· #108

Memorization Dynamics in Knowledge Distillation for Language Models

Jaydeep Borkar · Karan Chadha · Niloofar Mireshghallah · Yuchen Zhang · Irina-Elena Veliche · Archi Mitra · David A. Smith · Zheng Xu · Diego Garcia-Olano

Knowledge distillation in language models can simultaneously improve generalization and reduce memorization.

摘要

Knowledge Distillation (KD) is increasingly adopted to transfer capabilities from large language models to smaller ones, offering significant improvements in efficiency and utility while often surpassing standard fine-tuning. Beyond performance, KD is also explored as a privacy-preserving mechanism to mitigate the risk of training data leakage. While training data memorization has been extensively studied in standard pre-training and fine-tuning settings, its dynamics in a knowledge distillation setup remain poorly understood. In this work, we study memorization across the KD pipeline using three large language model (LLM) families (Pythia, OLMo-2, Qwen-3) and three datasets (FineWeb, Wikitext, Nemotron-CC-v2). We find: (1) distilled models memorize significantly less training data than standard fine-tuning (reducing memorization by more than 50%); (2) some examples are inherently easier to memorize and account for a large fraction of memorization during distillation (over ~95%); (3) student memorization is predictable prior to distillation using features based on zlib entropy, KL divergence, and perplexity; and (4) while soft and hard distillation have similar overall memorization rates, hard distillation poses a greater risk: it inherits 2.7 times more teacher-specific examples than soft distillation. Overall, we demonstrate that distillation can provide both improved generalization and reduced memorization risks compared to standard fine-tuning.

强化学习与后训练数据与预训练安全memorizationknowledge distillationlanguage modelsOpenReview

常见合作者