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

Yanfang Ye

COLM 2026×3ICLR 2026检索与知识效率与系统推理评测与基准理论与学习动力学
新星分资深
15
一作贡献0
核心/参与0
方向广度13
合作网络3
0 一作 · 4 篇 · COLM 2026 / ICLR 2026

获取完整研究档案

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

联系方式

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

2026 顶会论文

4
作者位次 #4/4COLM 2026Poster· Poster Session 1· Imperial Ballroom· #46

MegaTrain: Full Precision Training of 100B+ Parameter Large Language Models on a Single GPU

Zhengqing Yuan · Ryan Sun · Lichao Sun · Yanfang Ye

Trains 100B+ full-precision LLMs on a single GPU by streaming parameters from CPU memory with overlapped execution and stateless computation, achieving significant throughput gains over ZeRO-3.

摘要

We present MegaTrain, a CPU-memory-centric system that efficiently trains 100B+ parameter large language models at full precision on a single GPU. Unlike traditional GPU-centric systems, MegaTrain stores parameters and optimizer states in host memory and treats GPUs as transient compute engines. For each layer, we stream parameters in and compute gradients out, minimizing persistent GPU state. To battle the CPU-GPU bandwidth bottleneck, we adopt two key optimizations. 1) We introduce a pipelined double-buffered execution engine that overlaps parameter prefetching, computation, and gradient offloading across multiple CUDA streams, enabling continuous GPU execution. 2) We replace persistent autograd graphs with stateless layer templates, binding weights dynamically as they stream in, eliminating persistent graph metadata while providing flexibility in scheduling. On a single H200 GPU with 1.5TB host memory, MegaTrain reliably trains models up to 120B parameters. It also achieves 1.84$\times$ the training throughput of DeepSpeed ZeRO-3 with CPU offloading when training 14B models. MegaTrain also enables 7B model training with 256k token context on a single H100.

效率与系统检索与知识Large Language ModelsFull-Precision TrainingMemory-Efficient TrainingCPU-GPU Heterogeneous SystemsOpenReview
作者位次 #8/8COLM 2026Poster· Poster Session 1· Imperial Ballroom· #63

PreScam: A Benchmark for Predicting Scam Progression from Early Conversations

Weixiang Sun · Shang Ma · Yiyang Li · Tianyi Ma · Zehong Wang · Colby Nelson · Xusheng Xiao · Yanfang Ye

PRESCAM is a benchmark for modeling scam progression in real-world multi-turn conversations. It shows that current LLMs recognize scam cues but still struggle to model the latent psychological structure behind scam escalation.

摘要

Conversational scams, such as romance and investment scams, are emerging as a major form of online fraud. Unlike one-shot scam lures such as fake lottery or unpaid toll messages, conversational scams unfold through multi-turn conversations in which scammers gradually manipulate victims using evolving psychological techniques. However, existing research mainly focuses on static scam detection or synthetic scams, leaving open whether language models can understand how real-world scams progress over time. We introduce PreScam, a benchmark for modeling scam progression from early conversations. Built from real victim-submitted scam reports, PreScam converts 177,989 raw reports into 11,573 conversational scam instances spanning 20 scam categories. Each instance is hierarchically structured according to the scam lifecycle defined by the proposed scam kill chain, and further annotated at the turn level with scammer psychological actions and victim responses. Furthermore, we present two benchmark tasks motivated by real-world anti-scam needs: real-time termination prediction, which estimates whether a conversation is approaching the termination stage, and scammer action prediction, which forecasts the scammer's subsequent actions. Results show a clear gap between surface-level fluency and progression modeling: supervised encoders substantially outperform zero-shot LLMs on real-time termination prediction, while next-action prediction remains only moderately successful even for strong LLMs. Taken together, these results show that current models can capture some scam-related cues, yet still struggle to track how risk escalates and how manipulation unfolds across turns.

推理评测与基准检索与知识BenchmarkConversational scamsLLMOpenReview
作者位次 #6/6COLM 2026Poster· Poster Session 6· Imperial Ballroom· #6

DepthSSD: Rethinking Residual Connections via State Space Models on the Depth Axis

Zhengqing Yuan · Xiaoyu Ma · Yunhong He · Zhengtao Yao · Lichao Sun · Yanfang Ye

We accelerate attention residuals by sparsely retrieving only the most relevant historical representations, reducing memory and computation without sacrificing performance.

摘要

Residual connections are fundamental to deep transformer training, yet their theoretical relationship to more expressive alternatives, such as attention-based depth mixing (AttnRes), remains poorly understood. We show that the depth-axis mixing matrix in transformers is semiseparable, and its rank precisely controls the expressiveness of inter-layer information flow. Standard residual connections correspond to rank-1 semiseparable matrices; attention residuals to full rank. We introduce DEPTHSSD (Depth State Space Duality), which applies the structured state space duality framework from Mamba-2 to the depth axis, yielding a depth mixing matrix of controllable rank N with O(L · N) parameters per sub-layer. We evaluate DEPTHSSD at three model scales (125M, 455M, and 1B parameters) against four depth-mixing baselines: standard residuals, BLOCKATTNRES, DENSEFORMER, and Hyper-Connections. At 1B, DEPTHSSD-N=8 achieves the best validation loss (3.124, perplexity 22.7), a 2.4-point perplexity reduction over standard residuals (PPL 25.1) and outperforming DENSEFORMER (PPL 24.1), while running 1.72× faster (16.5 vs. 9.6 TFLOPS). At 455M, DEPTHSSD-N=8 again leads (PPL 29.4 vs. 30.1 for DENSEFORMER and 31.2 for standard) at 1.88× the throughput of DENSEFORMER. At 125M, DEPTHSSD matches the validation quality of all baselines while maintaining 1.3–1.6× higher throughput than the other depth-mixing methods.

检索与知识理论与学习动力学长上下文与架构attention residualssparse attentiondepth-wise aggregationOpenReview

常见合作者