Demo Data from EDBT 2026 / reviewers in the wild / expert
Yujan Ting
dblp:391/4119
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 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 |
Efficient and distributed learning · 44% Language models and text generation · 44% Reinforcement learning · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning › inference efficiency
context compression |
1.0 | 1 | 2026 | Bridging the Memorization-Utilization Gap: Near-Lossless Context Compression via Reinforcement Learning · ACL (1) 2026 |
Natural language and speech › Language models and text generation › language modeling
long-context language modeling |
1.0 | 1 | 2026 | Bridging the Memorization-Utilization Gap: Near-Lossless Context Compression via Reinforcement Learning · ACL (1) 2026 |
Machine learning › Reinforcement learning
outcome-based reinforcement learning |
0.3 | 1 | 2026 | Bridging the Memorization-Utilization Gap: Near-Lossless Context Compression via Reinforcement Learning · ACL (1) 2026 |
Methods — techniques the papers use, named apart from their topics
outcome-based reinforcement learning · 1.0instruction tuning · 1.0average pooling · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Bridging the Memorization-Utilization Gap: Near-Lossless Context Compression via Reinforcement LearningabstractDespite recent progress in context compression, we identify a fundamental memorizationutilization gap where models can compress context with near-perfect fidelity yet fail to effectively utilize these compressed representations for downstream tasks.We address this with a holistic training paradigm spanning pretraining, instruction tuning, and reinforcement learning, built upon an average pooling compression.Our key innovation uses outcomebased RL to enable implicit expansion: the model learns to adaptively unfold task-relevant details during generation, interleaving reconstruction with reasoning.We achieve nearlossless 16× context compression (≈5.3× decoder sequence-length reduction in our current implementation) across 7B and 32B models, recovering over 98% of full-context QA performance and outperforming prior methods by 11 points.Our 32B model demonstrates strong out-of-distribution and length generalization, robustly scaling to 120k-token contexts despite training on no more than 4k tokens, matching full-context performance on NIAH, Long-Bench v2, and multi-hop reasoning.We verify the implicit expansion behavior in experiments. Yujan Ting, Terrence Chen, Weijing Huang |
ACL (1) | 1 |