跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+1680新增论文
+1333其中 AI 相关
+187已有论文修订
+59新增 AI 导读

arXiv 最近完成扫描:2026-11-18 04:28 · 全站最近入库:2026-11-17 23:35各信源进度 →

统计口径与数据新鲜度

统计 2026-11-17 07:54 — 2026-11-18 07:54(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-18 04:28最近发现新增版本:2026-11-17 23:35库内论文最新更新时间:2026-11-17 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

25,786 已收录论文21,491 AI 相关7,725 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 6 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-18 04:27(北京时间)
版本更新 · v2arXiv:2611.12961

RBLA+: Efficient Rank-Specific LoRA Adapter Extraction for Federated Fine-Tuning with Heterogeneous Clients

Shuaijun Chen, Omid Tavallaie, Xin Chen, Wentao Gao, Nguyen H. Tran, Albert Y. Zomaya

原文摘要

Federated fine-tuning with low-rank adaptation (LoRA) reduces communication and computational overhead by training and exchanging compact trainable LoRA factors. Clients may use different LoRA ranks to meet adapter communication budgets and accommodate different local adaptation needs. The server must process these differences during aggregation and construct adapters at each client's rank for local training. We distinguish pre-aggregation alignment, which handles factor dimensions and scaling conventions before aggregation and rank-specific LoRA adapter extraction, which constructs client-sized pairs from the aggregated global model. Two common approaches to rank-specific extraction are direct rank truncation and Singular Value Decomposition (SVD) of the dense update. Direct prefix truncation keeps the leading columns of one aggregated factor and the corresponding rows of the other. It is cheap but can increase reconstruction error. The dense SVD approach first forms the product of aggregated LoRA factors. It then decomposes this matrix and retains the leading singular components to construct adapters at the target rank. This gives the optimal rank-constrained approximation in Frobenius norm but incurs significant computational overhead. To address this trade-off, we propose RBLA+ as an extension of RBLA. It uses established compact QR/core-SVD decomposition to minimize Frobenius error for the extracted LoRA update without forming the dense update. It also accounts for client and server scaling conventions during upload and broadcast. Across vision and language tasks, RBLA+ improves accuracy over RBLA in multiple heterogeneous settings. In CPU benchmarks with synthetic adapters, RBLA+ has lower extraction time than the dense partial-SVD baseline. RBLA+ preserves each client's prescribed adapter size and per-round communication payload.

cs.AI · cs.DC

版本更新 · v2arXiv:2609.36724

Routing in Gradient Space: Balanced Usage Is Not Expert Specialization

Yuchen Li, Mingyu Du, Zongqi Fan, Nguyen H. Tran, Ken-Tye Yong

原文摘要

Sparse expert models can distribute traffic evenly while still grouping incompatible training signals within the same experts. We study routing as a gradient-partitioning problem and introduce gradient-aligned routing (GAR), whose load-normalized router objective rewards grouping observations with aligned gradients. On five multi-task text-classification mixtures, we compare GAR with task-loss-only routing, gradient-combination and gradient-conflict methods, and load-balancing losses. With a fully trainable RoBERTa backbone and classification-head experts, GAR has the highest aggregate validation accuracy, 1.07 percentage points above task-loss-only routing. With frozen DeBERTa and Qwen3-1.7B backbones and low-rank adapter experts, it again ranks first, 1.10 points above task-loss-only routing, with better-balanced expert load and higher gradient-mass purity, the share of each expert's gradient-norm mass from its dominant task; the load-balancing losses flatten load further but leave this purity near its task-loss-only level. Top-1 routing, trainable full-parameter feed-forward network (FFN) experts, and a larger backbone also show positive aggregate gains. In component ablations, the objective's cross-observation alignment terms alone retain GAR's accuracy, and GAR keeps its accuracy when observations are formed without task identity; supervising the router with task labels raises task-expert association without adding accuracy. The results distinguish expert-load balance from gradient-based routing organization and show the predictive value of gradient-informed routing in multi-task text classification.

cs.LG

版本更新 · v7arXiv:2610.16717

Where Is the "Self" of a Large Language Model? -- From Self-Index to Self-Reference

Yuchen Li, Xintong Li, Zongqi Fan, Ken-tye Yong, Nguyen H. Tran

原文摘要

Whether a large language model has a self is usually argued rather than measured. We introduce a quantitative test of a functional self at two levels known from biology: a self-index that marks material as one's own, and self-reference, the ability to recognize it. We place one text in an Assistant, User, or System message of the chat template, so only its source differs. In 13 of 25 open-weight models from 14 developers, internal representations set the model's own message apart, and next-token predictions and the persistence of the difference along the message follow this self-index. No model recognizes its own messages without it (chance probability 0.004). Editing a few directions per layer that carry the index removes recognition in seven models and modes and changes the role a model takes in a game that never asks who wrote a message. Self-reference is thus a readout of the self-index.

cs.CL

版本更新 · v4arXiv:2610.01425

Why Does Train-Validation Separation Emerge? Gradient-Allocation Dynamics in Pretrained Fine-Tuning

Yuchen Li, Zongqi Fan, Ken-Tye Yong, Nguyen H. Tran

原文摘要

During fine-tuning, training accuracy often keeps rising after validation accuracy has levelled off. We explain this growing train-validation gap with a support-transfer account: early updates use structure shared by many examples, whereas later fitting relies increasingly on narrow structure whose benefit transfers less to held-out data, so per-example gradient allocations differentiate as the gap grows. We measure this with two readouts computed from fixed training probes alone, the pooled dispersion $D_{\mathrm{den}}$ of normalized gradient magnitudes and its within-class part $D_{\mathrm{within}}^{\mathrm{wt}}$, and derive sufficient conditions under which allocation dispersion, cross-entropy separation, and the accuracy gap grow together. In a constructed feature hierarchy, raising the sample-private feature share from .3 to .7 raises the final accuracy gap from .185 to .527, and homogenizing per-example gradient magnitudes reduces the gap mainly after substantial fitting (median full-dose changes of -4.91 to -11.79 percentage points when it starts at the three later training stages). In 90 fine-tuning runs of three language backbones on six tasks, both readouts are positively associated with the accuracy gap in every run, and $D_{\mathrm{den}}$ remains positive in 89 of 90 runs after linear detrending; 20 vision runs show the same association.

cs.LG

版本更新 · v2arXiv:2603.26378

Generative machine learning for protein design

Senura Hansaja Wanasekara, Manoj M Wagle, Minh-Duong Nguyen, Xiaochen Liu, Nguyen H. Tran, Manolis Kellis, Ken-Tye Yong

原文摘要

Designing proteins with specific biological functions is of considerable interest for both the development of new therapeutics and the engineering of enzymes, yet achieving the intended activity remains challenging. Generative artificial intelligence (AI) has emerged as a powerful tool to explore the vast space of possible designs by learning from protein sequence and structural data. Here, we review 59 generative approaches across six protein design tasks, including sequence generation, backbone generation, structure-conditioned sequence design, joint sequence-structure design, motif scaffolding, and binder and antibody design. We outline common generative approaches and protein representations and discuss how structural constraints and functional information are utilized during generation. This is followed by a discussion of the computational and experimental approaches used to evaluate designed proteins and what such assessments reveal about their properties. Finally, we discuss current limitations in designing proteins beyond well-represented families and incorporating experimental feedback into the design process. We expect that rapid advances in generative modeling will enable more reliable design of a wider range of protein structures and functions over the coming years.

cs.LG · cs.AI

新论文 · v1arXiv:2610.34740

Networked Humanoid Intelligence: Communication, Coordination, Collaboration, and Social Interaction

Loc X. Nguyen, Huy Q. Le, Ji Su Yoon, Nguyen H. Tran, Eui-Nam Huh, Choong Seon Hong

原文摘要

Humanoid robots are moving from laboratory platforms toward connected fleets that share workspaces, infrastructure, tasks, and knowledge with other robots and humans. As deployments grow, the operation and improvement of each humanoid depend on information exchanged across the network. However, existing research has largely studied humanoids as individual systems. This survey examines networked humanoid intelligence through four functions of information exchange: communication, coordination, collaboration, and social intelligence with human interaction. We first establish the foundations of networked humanoid systems, define the question addressed by each function, and connect them through a common factory scenario. We review the literature along six dimensions: interaction architecture, exchanged information, physical coupling, operating timescale, system scale, and embodiment. We separate results obtained with physical and simulated humanoids from those based on other robotic platforms or disembodied agents, because the latter do not fully capture humanoid-specific constraints such as balance, whole-body motion, contact, and physical interaction. We examine hardware, datasets, and benchmarks, and distinguish risks handled locally from those networking introduces, such as stale information or unsafe knowledge propagation. Finally, we identify open problems in control-aware networking, compact body-centric messages, physically grounded coordination, network- and embodiment-aware knowledge sharing, fleet-level social consistency, and accountable human oversight.

cs.RO · cs.ET · cs.NI