← Search

Chenheng Zhang

7 accepted papers

2026

Any-Order Any-Subset AutoRegressive Model

ICLR 2026poster

We propose Any-order Any-subset Autoregressive modeling (A3), a novel sequence generation framework that generalizes standard autoregressive (AR) factorization to support the prediction of arbitrary token groups in any order. A3 overcomes the limitations of conventional left-to-right decoding by ena…

Cited by 0SourcecodeScholar
2026

GRASP: Graph Reasoning via Agentic Solving and Probing of LLMs

ICML 2026poster

Integrating graph knowledge into Large Language Models (LLMs) via passive representation faces critical bottlenecks: limited context windows, unreliable numerical computation, and structural hallucinations. To solve this, we propose **GRASP** (Graph Reasoning via Agentic Solving and Probing), shifti…

Cited by 0SourceScholar
2026

Rethinking Personalization in Large Language Models at the Token Level

ICML 2026poster

With large language models (LLMs) now performing strongly across diverse tasks, there is growing demand for them to personalize outputs for individual users. Personalization is typically framed as an additional layer on top of a base NLP task, requiring model responses to meet user-specific needs wh…

Cited by 0SourceScholar
2026

SSL4RL: Revisiting Self-supervised Learning as Intrinsic Reward for Visual-Language Reasoning

ICML 2026poster

Vision-language models (VLMs) have shown remarkable abilities by integrating large language models with visual inputs. However, they often fail to utilize visual evidence adequately, either depending on linguistic priors in vision-centric tasks or resorting to textual shortcuts during reasoning. Alt…

Cited by 0SourceScholar
2025

Improving Model Representation and Reducing KV Cache via Skip Connections with First Value Heads

NeurIPS 2025poster

Transformer models have driven breakthroughs across various language tasks by their strong capability to learn rich contextual representations. Scaling them to improve representation, however, often demands substantial memory and compute costs, such as the Key-Value (KV) cache used during auto-regre…

Cited by 0SourcecodeScholar
2025

Language Ranker: A Lightweight Ranking framework for LLM Decoding

NeurIPS 2025poster

Conventional research on large language models (LLMs) has primarily focused on refining output distributions, while paying less attention to the decoding process that transforms these distributions into final responses. Recent advances, such as scaling the computation of inference time with reward m…

Cited by 0SourceScholar
2025

What is Wrong with Perplexity for Long-context Language Modeling?

ICLR 2025poster

Handling long-context inputs is crucial for large language models (LLMs) in tasks such as extended conversations, document summarization, and many-shot in-context learning. While recent approaches have extended the context windows of LLMs and employed perplexity (PPL) as a standard evaluation metric…