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

Zhuoen Chen

dblp:415/0993 · DBLP profile ↗
← Back
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
Language models and text generation · 77% Efficient and distributed learning · 23%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation › large language model inference
long-context inference
1.012026
Dynamic Long Context Reasoning over Compressed Memory via End-to-End Reinforcement Learning · ACL (1) 2026
Machine learning › Efficient and distributed learning › memory optimization
memory compression
0.312026
Dynamic Long Context Reasoning over Compressed Memory via End-to-End Reinforcement Learning · ACL (1) 2026

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

retrieval-augmented generation · 1.0reinforcement learning · 1.0KV cache compression · 1.0
YearPublicationVenuePosition
2026 Dynamic Long Context Reasoning over Compressed Memory via End-to-End Reinforcement Learning
abstract
Large Language Models (LLMs) face severe challenges in long-context processing, including quadratic computational costs, information forgetting, and the context fragmentation inherent in Retrieval-Augmented Generation (RAG).We introduce LycheeMemory, a cognitively inspired framework that enables efficient long-context inference via chunk-wise compression and selective memory recall, rather than processing all raw tokens.LycheeMemory segments the input into chunks and encodes each into compressed KV-cache-style representations using a Compressor.A Gate then dynamically selects relevant memory blocks, which a Reasoner iteratively processes with an evolving working memory to solve downstream tasks.The Compressor and Reasoner are jointly optimized via end-to-end reinforcement learning, while the Gate is trained separately as a classifier.Experimental results demonstrate that LycheeMemory achieves competitive accuracy (up to 82% in ablation variants) on multi-hop reasoning benchmarks (e.g., RULER-HQA), successfully extrapolates context length from 7K to 1.75M, and provides a favorable accuracy-efficiency trade-off against strong long-context baselines.Notably, compared to MemAgent, LycheeMemory achieves an average 2× reduction in peak GPU memory usage and a 6× speedup during inference.
Zhuoen Chen, Dongfang Li 0002, Meishan Zhang, Baotian Hu, Min Zhang 0005
ACL (1)1