الباحثون

Nanyun Peng

المنشورات 8

نسخة أولية وصول مفتوح

Continual Graph Memory for Mathematical Research Agents

Junyi Zhang, Jinxi Yu, Eric Hanchen Jiang وآخرون · 2026

Using frontier agent harnesses to tackle mathematical research problems has emerged as an effective means of advancing mathematics. However, solving frontier problems in mathematics may require a massive number of agents working in parallel for extended periods to construct proofs, thereby generating an enormous volume …

نسخة أولية وصول مفتوح

SEER: Self-Evolving Event Reasoning and Retrieval for Time Series Forecasting

Mingtian Tan, Palash Goyal, Mihir Parmar وآخرون · 2026

Real-world time series are frequently driven by exogenous events and structural shifts, rendering conventional forecasting based solely on historical numerical observations insufficient. While language models can retrieve external news, standard retrieval-augmented approaches struggle with high noise, missing signals, …

نسخة أولية وصول مفتوح

Multilinguality in Hybrid Attention LLMs

Lucas Bandarkar, Junlin Hu, Chenyuan Yang وآخرون · 2026

In response to the growing demand for long sequences in agentic and reasoning use cases, many state-of-the-art LLMs combine multiple variants of attention to mitigate the quadratic complexity of traditional softmax attention. These hybrid attention LLMs aim to balance the strengths and limitations of full attention and …

نسخة أولية وصول مفتوح

Overwhelmed by Choice: Studying LLM Decision Making at Scale

Yu-Chi Lin, Aryan Seth, Anshul Aravind وآخرون · 2026

Multiple-choice and candidate-selection evaluations are widely used to assess LLM reasoning and decision-making, yet most benchmarks contain relatively small candidate sets. It remains unclear whether conclusions drawn from these settings remain valid as the candidate space scales. We systematically evaluate LLMs as th …

نسخة أولية وصول مفتوح

Planned Test-Time Scaling with Coordinated Reasoning Paths

Xueqing Wu, Langxing Bai, Hritik Bansal وآخرون · 2026

Test-time scaling with parallel branches is widely adopted to improve performance on challenging reasoning tasks. The predominant approach, repeated sampling, draws branches independently from a single policy, which can produce redundant attempts and thereby limit the gains from additional inference compute. To address …

المؤلفون المشاركون