跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+0新增论文
+0其中 AI 相关
+0已有论文修订
+92新增 AI 导读

arXiv 最近完成扫描:2026-11-23 01:07 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-23 01:07最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

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

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

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

找到 19 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-23 01:05(北京时间)
新论文 · v1arXiv:2611.23123

利用人类移动性推断传染病数据中的位置并校正偏差

Inferring Locations and Correcting Bias in Infectious Disease Data Using Human Mobility

Owen Tucker, Lily Wang, Ruochen Kong, Haley Stone, Jing Du, Matthew Scotch, Flora D. Salim, Taylor Anderson 等 10 位作者

AI 速读 基于摘要

作者提出将病原体基因组数据与人类移动性数据结合,用移动感知的信念传播方法推断未观测传播节点的位置,并在模拟与真实基因组监测数据上报告了交叉熵的下降。

cs.SI

查看原文摘要

Understanding and reconstructing infectious disease transmission remains challenging due to sparsely sampled and biased epidemiological case data: only a small fraction of infectious disease cases are reported to health authorities, and an even smaller fraction are sent to labs for genomic sequencing. In this work, we study the problem of inferring unobserved transmission events by integrating pathogen genomic data with human mobility information. Intuitively, even if we do not have case data for a certain region, such as a census block group, we can use massive-scale individual mobility data to understand where people may be exposed and infer where unobserved cases may be located. Assuming only a subset of cases are reported and sequenced, we reconstruct a phylogenetic tree from observed cases and transform it into a partial transmission tree using the outbreaker2 tool. This tree contains inferred transmissions based on the genetic distance of the observed cases. As these inferred nodes have unknown locations, we propose a mobility-aware belief propagation approach to estimate their locations using human mobility data. Experiments on simulated and real-world genomic surveillance data with biased sampling show that incorporating mobility data improves the reconstruction of inferred transmission trees, reducing cross-entropy relative to the observed distribution by 39.4% and 16.1%, respectively. Results on real-world COVID-19 sequence data show the promise of combining genomic and mobility data for more reliable location inference, with potential implications for outbreak analysis and public health decision-making.

版本更新 · v2arXiv:2609.36686

Where Root Cause Analysis Fails: A Retrieval-Reranking Decomposition

Hada Melino Muhammad, Luan Pham, Laure Barrière, Sachin Shetty, Leonardo Pulga, Flora D. Salim

原文摘要

Identifying the root cause of an anomaly among hundreds of sensors is critical for preventing safety incidents and costly downtime in complex monitored systems. Existing studies evaluate root cause analysis (RCA) methods using top@k accuracy. We show that this metric has a fundamental blind spot: it conflates two failure modes, retrieval failure, where the true cause is never considered, and reranking failure, where it is considered but ranked too low. In this work, we introduce a retrieval-reranking decomposition and audit four well-known benchmarks to expose this blind spot. Our experiments show that, on industrial CPS benchmarks, the statistical baseline scoring every sensor mis-ranks the true cause 79-100% of the time, and graph-based methods never clearly beat the best statistical baseline, whether their causal graphs are learned on short fault windows, on retrieved candidate pools guaranteed to contain the cause, or on multi-day normal-operation data. Meanwhile, on microservice benchmarks, where each injected fault drives the faulty service's own metric far above its baseline, retrieval is nearly solved (98-100%). Guided by the decomposition, we build a two-stage pipeline combining a multi-signal retriever with an LLM reranker that, as one fixed configuration, matches or exceeds the best baseline's top@1 accuracy on all six benchmark suites (by up to +12 points), with no causal graph or labeled data required. When all methods rank the same retrieved candidates with the true cause guaranteed present, adding a short system-description document lets the reranker lead the best baseline by +7 to +18 points on every benchmark. Code is available at https://github.com/cruiseresearchgroup/DecompRCA.

cs.LG

新论文 · v1arXiv:2611.19951

Discovering Programmatic Policies from Reinforcement Learning-Based Traffic Signal Controllers

Lindong Xie, Yang Zhang, Beiyu Song, Zeren Xing, Flora D. Salim, Edward Chung

原文摘要

Traffic signal control (TSC) is critical for mitigating urban congestion. Deep reinforcement learning (DRL) has achieved strong performance by learning adaptive policies from traffic observations, but learned neural controllers are often opaque, structurally complex, and difficult to generalize across scenarios. We propose PPL-TSC, a programmatic policy learning framework that distills compact and human-readable TSC policies from DRL teachers. PPL-TSC formulates policy learning as an evolutionary search over phase utility functions (PUFs), which score candidate signal phases and select the highest-utility phase for execution. Each generation consists of four steps: policy generation, policy review, policy calibration, and policy evaluation. In the generation step, a large language model (LLM) acts as a semantics-aware evolutionary operator to propose and refine candidate PUFs. Generated PUFs are screened through explicit checks for syntactic validity, mathematical soundness, and consistency with TSC principles, with invalid ones repaired through iterative feedback. Valid PUFs are then calibrated to improve behavioral fidelity to the DRL teacher, and evaluated using a joint score combining teacher fidelity and traffic-control performance to select candidates for the next generation. Extensive experiments across diverse traffic scenarios and representative DRL-based controllers show that PPL-TSC produces compact and human-readable policies, achieves competitive performance for most teacher families, improves transfer generalization, and substantially reduces computational cost. Code is available at https://github.com/ForrestXie9/PPL-TSC.

cs.ET · cs.LG

新论文 · v1arXiv:2611.15097

GuardianAgentFlow: Multi-Agent Coordination for Web Privacy Protection

Ruiyi Yang, Gayathri Lihinikaduarachchi, Rahat Masood, Flora D. Salim, Salil S. Kanhere

原文摘要

Web agents need to use private context without unnecessarily disclosing it. Effective protection must distinguish between requests that may be sent after sanitization and those that must be withheld, while preserving the information needed for authorized tasks. We present GuardianAgentFlow, a multi-agent framework that mediates outgoing Web requests through an explicit release contract. A dedicated restriction check grounds permission in the user's instruction; a shared protection scope aligns rewriting with disclosure checking; and candidate-grounded feedback guides revision before transmission. Experiments on Web requests with human-reviewed intent labels show improved request-contract success, while controlled comparisons and role ablations identify the contributions of restriction handling, policy evidence, and candidate checking. Evaluations of action proposals from PrivacyLens and AgentDAM demonstrate complementary protection when mediation is composed with privacy-aware agents. Experiments with smaller mediation models show that the coordination benefit persists with reduced model capacity. Dedicated-server measurements show lower mediation latency than full-policy reasoning, while real-site browser tests quantify integration overhead.

cs.AI · cs.MA

新论文 · v1arXiv:2611.11299

EASE-KV: Diagnosing the Gap Between Memory Availability and Effective Use

Di Lu, Zechen Li, Xuanyu Yue, Jiabo Fan, Hao Xue, Flora D. Salim

原文摘要

Reusable key-value (KV) memory avoids repeatedly prefilling retrieved text, but stored and injected memories do not necessarily become usable evidence. We present EASE-KV, a controlled framework for understanding this gap under fixed candidates and a frozen language model. EASE-KV separates three interfaces: whether required relations are preserved during encoding, whether preserved memories receive appropriate influence during allocation, and whether outcome supervision can identify useful allocations. Matched experiments show that causal encoding improves compositional accuracy by 25.0 percentage points over block-diagonal encoding, while the tested inference-time bridging methods fail to recover the lost contextual information. With unchanged stored states, diagnostic evidence-guided allocation improves LongMemEval accuracy from 31.2% to 38.4%, demonstrating that memory influence can be controlled without re-encoding. However, controllability does not guarantee learnability: binary correctness provides informative reward contrast for 53.0% of sampled query groups, compared with 73.6% under the evaluated shaped-reward setting. These findings show that effective KV memory requires more than retrieval and injection: the required relations must be encoded, preserved memories must receive appropriate influence, and supervision must distinguish better allocations from worse ones.

cs.CL · cs.AI

版本更新 · v5arXiv:2607.25875

EvoST: Adapting Traffic Forecasters to Evolving Sensor Graphs

Du Yin, Xiachong Lin, Yue Tan, Ruiyi Yang, Jinliang Deng, Estrid He, Hao Xue, Flora D. Salim

原文摘要

Web-based navigation and traffic information services depend on accurate forecasts as sensor networks evolve. On checkpoints reused years later, updating only shared weights or adding a low-rank node prompt leaves substantial degradation, whereas, in the evaluated architectures, refreshing node identities recovers most of it while the shared spatio-temporal weights are reused. We propose EvoST, a framework that maintains traffic forecasters by refreshing node identities while keeping shared weights fixed. EvoST updates existing identities using recently released labels and initializes new sensors with identities borrowed from behaviorally similar established sensors. Once enough delayed labels arrive, it jointly refits all identities, and a per-sensor recursive least-squares calibrator corrects forecasts as labels become available. Across twelve PeMS region-year settings, identity refresh reduces the relative one-hour MAE gap between five-year-old STAEFormer checkpoints and target-year models from 17.7% to 2.5%, with all forecasters calibrated, and its MAE is 0.7% above that of full-parameter fine-tuning on the same data. In Graph WaveNet, identity refresh recovers 88% of the five-year MAE gap to calibrated target-year models. Similar recovery holds for STAEFormer checkpoints up to fifteen years old, while refreshing STID recovers 67% of its five-year gap. On an annual benchmark covering nine EvoXXLTraffic districts and Transport for NSW, EvoST has the lowest average MAE, RMSE, and MAPE among the reported non-foundation methods on all ten networks, and calibration accounts for most of its Avg-MAE reduction from the matched frozen checkpoints. Code and the extended version: https://github.com/lixus7/EvoST

cs.LG · cs.AI

新论文 · v1arXiv:2611.09472

ENGRAM: From Agent Experience to Weights through Verified Consolidation

Ruiyi Yang, Zechen Li, Lihuan Li, Du Yin, Hao Xue, Flora D. Salim

原文摘要

Language-model agents use experience through external retrieval and parameter learning. Consolidating stored experience into model weights requires deciding both which experience to train on and when its external records can leave retrieval. Admission based solely on student mastery can exclude useful teacher demonstrations, while removal immediately after training can discard guidance that the model still needs. We introduce ENGRAM, a framework that separates training admission from memory release. A demonstration-aware gate admits skills based on student mastery or sufficient successful teacher demonstrations. The student learns from selected action traces with context from an Engram Trace Graph (ETG). A verification gate then compares the updated model without episodic retrieval against the base model with retrieval on reserved probes. Release requires valid training participation and scores meeting both relative and absolute criteria; records for skills that fail verification remain retrievable. Experiments across interactive and reasoning benchmarks show consistent gains over frozen-weight ETG controls, with ablations supporting demonstration-aware admission and selective adapter activation. A controlled held-out comparison shows that verified release substantially reduces the retrievable footprint while remaining close to retain-all performance and outperforming immediate and budget-matched random release. ENGRAM also improves task performance while reducing input-token usage and model calls. Skill-level verification further reduces retrievable experience through selective archival, retaining external guidance for skills that do not meet the release criteria. Code is available in anonymous.4open.science/r/engram-anonymous.

cs.AI · cs.IR

新论文 · v1arXiv:2611.08912

SSF-Net: A Spatial-Spectral Fusion Network for Accurate PDE Operator Learning

Siqi Zhao, Flora D. Salim

原文摘要

Machine learning methods for solving partial differential equations (PDEs) significantly improve computational efficiency over traditional numerical solvers such as finite element method (FEM). However, PDE dynamics inherently span both local and global dynamics: disturbances propagate and decay gradually through the domain, while global coupling effects can influence the whole system simultaneously. Capturing both types of dynamics with a low complexity model remains a key challenge. To address this, we propose the Spatial-Spectral Fusion Network (SSF-Net), built around a dual-branch Spatial-Spectral Fusion (SSF) block comprising a spatial branch and a spectral branch. The spatial branch employs a multi-directional Mamba, which mitigates its inherent causal, single-direction scanning bias and capture local interactions with reduced directional bias at linear complexity. The spectral branch leverages a Fourier transform with a block-diagonal MLP to efficiently capture global spectral features with reduced parameter count and complexity. The SSF block is embedded in a multiresolution convolutional encoder-decoder, which extracts multi-scale features. We evaluate SSF-Net on a comprehensive PDE benchmark spanning multiple task types and assess its long-horizon stability. Compared with attention-based and convolution-based baselines, SSF-Net achieves lower prediction error with fewer parameters while retaining near-linear asymptotic complexity in the number of spatial tokens.

cs.LG

版本更新 · v2arXiv:2606.22911

ThermoLLM: LLM-Based Multi-Zone HVAC Control with a Spatiotemporal Context

Kirtan Bhatt, Xiachong Lin, Matthew Amos, Flora D. Salim, Wen Hu

原文摘要

Multi-zone HVAC control is a spatial decision problem in which indoor thermal evolution and control decisions depend not only on outdoor conditions and internal heat gains but also on zone layout, physical adjacency, and delayed thermal interactions across the building. Recent LLM-based HVAC controllers have shown that prompt-based control is feasible. However, these methods produce inconsistent results, are difficult to generalize, and experience control-latency issues. Their performance also relies heavily on numeric reward values, textual feedback, or unstructured retrieval, which limits their ability to make control decisions that account for zone dynamics and thermodynamics. No existing LLM-based methods have used building semantics and dynamics, together with rolling history, as the centre of the LLM context while testing and comparing HVAC control performance with existing LLM-based HVAC approaches. This paper presents ThermoLLM, an LLM-based HVAC control framework tested in a multi-zone building environment. Spatiotemporal context grounding is a main component of ThermoLLM, which uses a spatial knowledge graph derived from Brick-style building semantics and linked with recent observations from a rolling history. We evaluate ThermoLLM against standard control methods and recent state-of-the-art baselines in a five-zone building environment across six climate-season scenarios. ThermoLLM consistently achieves the best energy-comfort trade-offs and outperforms all evaluated baselines in the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) rankings across all six scenarios.

cs.AI · cs.LG · eess.SY

版本更新 · v5arXiv:2505.12006

SOCIA-$\nabla$: Textual Gradient Meets Multi-Agent Orchestration for Automated Simulator Generation

Yuncheng Hua, Sion Weatherhead, Mehdi Jafari, Hao Xue, Flora D. Salim

原文摘要

In this paper, we present SOCIA-$\nabla$, a diagnosis-driven multi-agent framework for automated simulator-code construction. SOCIA-$\nabla$ iteratively refines executable simulator code within a textual computation graph, where LLM-driven agents synthesize, execute, evaluate, diagnose, and repair simulators. A grounded simulator blueprint attributes behavioral residuals to candidate mechanisms and their spatial or interaction contexts, which are then converted into localized textual repair signals with history-aware memory and constraint projection. We evaluate SOCIA-$\nabla$ on the real-world LLMob personal-mobility benchmark and a controlled semi-synthetic geo-social mask-adoption benchmark. Across in-distribution simulation, out-of-distribution what-if generation, and geo-social diffusion, SOCIA-$\nabla$ achieves the strongest overall simulator fidelity. SOCIA-$\nabla$'s code and data are publicly available at https://github.com/cruiseresearchgroup/SOCIA-Nabla.

cs.AI

版本更新 · v2arXiv:2605.10020

TrajDLM: Topology-Aware Block Diffusion Language Model for Trajectory Generation

Wilson Wongso, Lihuan Li, Arian Prabowo, Xiachong Lin, Baiyu Chen, Hao Xue, Flora D. Salim

原文摘要

Generating high-fidelity synthetic Web of Things (WoT) telemetry, such as GPS trajectories, is increasingly important for transportation, urban planning, and location-aware services, particularly when privacy concerns restrict access to real-world mobility data. Existing trajectory generation methods face a trade-off between efficiency and road network fidelity: continuous-space methods generate trajectories efficiently but ignore road topology, while topology-aware methods rely on search-based autoregressive decoding that limits generation speed. We propose TrajDLM, a topology-aware trajectory generation framework based on block diffusion language models. TrajDLM represents trajectories as sequences of discrete road segments, combining a block diffusion backbone, graph-based road network representations, and topology-constrained sampling to generate realistic trajectories with topologically valid road transitions. To address the tendency of supervised models to favor near-shortest routes, we introduce TrajRFT, a rejection-sampling fine-tuning stage that improves route fidelity by training on self-generated routes selected for their similarity to real trajectories. Across three city-scale vehicle telemetry datasets, TrajDLM closely matches real-world mobility in population-level distributions, local route similarity, and route diversity, while generating trajectories up to $7.5\times$ faster than the strongest baseline. It also demonstrates zero-shot transfer to unseen transport modes. These results establish block diffusion with topology-constrained sampling and rejection-sampling fine-tuning as an efficient approach to generating realistic synthetic mobility telemetry for location-aware Web services and WoT applications.

cs.LG

版本更新 · v3arXiv:2506.19391

Generate the Forest before the Trees - A Hierarchical Diffusion model for Climate Downscaling

Declan J. Curran, Sanaa Hobeichi, Hira Saleem, Hao Xue, Flora D. Salim

原文摘要

Downscaling is essential for generating the high-resolution climate data needed for local planning, but traditional methods remain computationally demanding. Recent years have seen impressive results from AI downscaling models, particularly diffusion models, which have attracted attention due to their ability to generate ensembles and overcome the smoothing problem common in other AI methods. However, these models typically remain computationally intensive. We introduce a Hierarchical Diffusion Downscaling (HDD) model, which introduces an easily-extensible hierarchical sampling process to the diffusion framework. A coarse-to-fine hierarchy is imposed via a simple downsampling scheme. HDD achieves competitive accuracy on ERA5 reanalysis datasets and CMIP6 models, significantly reducing computational load by running on up to half as many pixels with competitive results. Additionally, a single model trained at 0.25° resolution transfers seamlessly across multiple CMIP6 models with much coarser resolution. HDD thus offers a lightweight alternative for probabilistic climate downscaling, facilitating affordable large-ensemble high-resolution climate projections. See a full code implementation at: https://github.com/HDD-Hierarchical-Diffusion-Downscaling/HDD-Hierarchical-Diffusion-Downscaling.

cs.CV

新论文 · v1arXiv:2610.38218

HotPOT: Operator Transformer with Heterogeneous Physics Experts for Large-Scale PDE Pre-training

Jiayi Li, Guancheng Zhou, Yisi Luo, Ruihua Chen, Penghao Jiang, Deyu Meng, Flora D. Salim, Piotr Koniusz

原文摘要

Large-scale PDE pre-training trains a single model on the data from multiple partial differential equations (PDEs). However, adding heterogeneous PDEs with different governing equations, physical variables, and variable interactions does not always improve predictive performance across tasks. Existing PDE mixture-of-experts models mitigate cross-task interference through learned routing, but typically use homogeneous expert architectures, making it difficult to directly reflect differences in state evolution across equations. We introduce HotPOT, an operator transformer with heterogeneous physics experts for large-scale PDE pre-training. HotPOT uses a shared encoder to capture information common across PDEs, while each PDE family uses a neural-numerical expert that pairs a learnable predictor with a fixed numerical update containing no trainable parameters. Each predictor outputs the quantities required by its paired numerical update, which then computes the next state. This design allows different PDEs to share a common encoder while retaining their own learnable predictors and numerical updates. Experiments across five PDE families and six settings show that HotPOT outperforms MoE-POT in all 24 matched-scale comparisons before and after fine-tuning, reducing rollout error by 50.7% on average. Notably, the 17M model also surpasses substantially larger MoE-POT models, and the performance gains extend to zero-shot prediction under unseen physical conditions. Code is available at https://github.com/cruiseresearchgroup/HotPOT-code.

cs.LG

版本更新 · v3arXiv:2602.18801

SGNO: Spectral Generator Neural Operator for Long-Horizon PDE Prediction

Jiayi Li, Penghao Jiang, Baiyu Chen, Yifan Duan, Hira Saleem, Zhaonan Wang, Piotr Koniusz, Flora D. Salim

原文摘要

Neural operators efficiently simulate dynamical systems by repeatedly predicting the next state. However, small errors at each step can accumulate, causing long-term predictions to drift from the true trajectory. Long-term error reflects both the propagation of earlier prediction errors and new errors introduced at each step. How to reduce these errors is therefore a critical question. We propose the Spectral Generator Neural Operator (SGNO), which combines a linear estimate of the next state with a learned correction. The linear component uses consecutive states in the training data to fit a map from the current state to the next. A neural network corrects this prediction by learning changes that the linear model does not capture, including nonlinear interactions. Both components are trained jointly toward the same next-state target. Experiments across 13 periodic PDE configurations in one to three dimensions show that SGNO accurately learns state evolution on linear tasks and reduces 100-step rollout error by 13-74% over the strongest baseline under the main comparison protocol on each nonlinear task. Longer-horizon extrapolation tests show lower late-window prediction errors on several nonlinear tasks. These results show that combining fitted propagation with learned state-dependent correction can improve long-horizon autoregressive prediction on the evaluated PDE tasks. Code is available at https://github.com/cruiseresearchgroup/SGNO.

cs.LG

版本更新 · v2arXiv:2605.30865Google Research

GlucoFM:面向连续血糖监测的双流基础模型

GlucoFM: A Dual-Stream Foundation Model for Continuous Glucose Monitoring

Zechen Li, Keerthana Natarajan, Weizhi Zhang, Menglian Zhou, Simon A. Lee, Yuwei Zhang, Maxwell A. Xu, Zeinab Esmaeilpour 等 14 位作者

AI 速读 基于摘要

提出轻量级CGM基础模型GlucoFM,将血糖动态分解为慢变趋势与短期偏差双流,并在大规模无标签CGM数据上预训练,用于代谢表型分类与餐后血糖响应预测。

cs.LG

查看原文摘要

Continuous glucose monitoring (CGM) provides a dense view of daily metabolic physiology, yet existing generic time-series and CGM-specific foundation models often encode glucose traces as entangled single-stream sequences, leaving their multiscale temporal structure only implicitly modeled. We present GlucoFM, a lightweight CGM foundation model that aligns irregular recordings to a 24-hour chronological grid, preserves observation masks, and decomposes glucose dynamics into slow-varying glycemic trend and short-term deviation streams. GlucoFM is pretrained on 109,066 hours of unlabeled CGM recordings from 477 subjects with masked contextual latent prediction over fused daily representations and temporal dynamics prediction over the two streams. Frozen pre-fusion probes confirm distinct temporal emphasis: state tokens preferentially preserve hourly glucose level, whereas event tokens better retain short-term change. Across four diverse cohorts and seven phenotype-classification tasks, GlucoFM achieves the strongest subject-disjoint linear-probing performance among evaluated baselines, improving average PR-AUC by 4.1 points over the best CGM-specific foundation model, while also supporting strong cross-dataset transfer and few-shot adaptation. Its gains are most pronounced on core metabolic outcomes, leading PR-AUC on all diabetes-risk and $β$-cell dysfunction tasks and on 3 of 4 insulin-resistance tasks. Beyond phenotyping, when combined with recent CGM, meal nutrition, and subject context, the same frozen encoder achieves the lowest two-hour postprandial glycemic response errors among evaluated methods for trajectory, incremental area under the curve, peak rise, and peak timing. Together, these results demonstrate that GlucoFM learns reusable frozen CGM representations spanning metabolic phenotyping and context-conditioned glucose-response prediction.

首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-long.1274ACL Anthology · ACL 2026

SOCIA-EVO: Automated Simulator Construction via Dual-Anchored Bi-Level Optimization

Yuncheng Hua, Sion Weatherhead University of New South Wales, Mehdi Jafari, Hao Xue The Hong Kong University of Science and Technology, Flora D. Salim

原文摘要

Automated simulator construction requires distributional fidelity, distinguishing it from generic code generation. We identify two failure modes in long-horizon LLM agents: contextual drift and optimization instability arising from conflating structural and parametric errors. We propose SOCIA-EVO, a dual-anchored evolutionary framework. SOCIA-EVO introduces: (1) a static blueprint to enforce empirical constraints; (2) a bi-level optimization to decouple structural refinement from parameter calibration; and (3) a self-curating Strategy Playbook that manages remedial hypotheses via Bayesian-weighted retrieval. By falsifying ineffective strategies through execution feedback, SOCIA-EVO achieves robust convergence, generating simulators that are statistically consistent with observational data. SOCIA-EVO’s code and data are available here: https://github.com/cruiseresearchgroup/SOCIA/tree/evo.

cs.CL

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · 2026 · 正式发表

首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-long.1393ACL Anthology · ACL 2026

Why Supervised Fine-Tuning Fails to Learn: A Systematic Study of Incomplete Learning in Large Language Models

Chao Xue, Yao Wang, Mengqiao Liu, Di Liang, Xingsheng Han, Peiyang Liu, Xianjie Wu Beijing Information Science & Technology University, Chenyao Lu Tencent AI Lab 等 14 位作者

原文摘要

Supervised Fine-Tuning (SFT) is the standard approach for adapting large language models (LLMs) to downstream tasks. However, we observe a persistent failure mode: even after convergence, models often fail to correctly reproduce a subset of their own supervised training data. We refer to this behavior as the Incomplete Learning Phenomenon (ILP). This paper presents the first systematic study of ILP in LLM fine-tuning. We formalize ILP as post-training failure to internalize supervised instances and demonstrate its prevalence across multiple model families, domains, and datasets. Through controlled analyses, we identify five recurrent sources of incomplete learning: (1) missing prerequisite knowledge in the pre-trained model, (2) conflicts between SFT supervision and pre-training knowledge, (3) internal inconsistencies within SFT data, (4) left-side forgetting during sequential fine-tuning, and (5) insufficient optimization for rare or complex patterns. We introduce a diagnostic-first framework that maps unlearned samples to these causes using observable training and inference signals, and study several targeted mitigation strategies as causal interventions. Experiments on Qwen, LLaMA, and OLMo2 show that incomplete learning is widespread and heterogeneous, and that improvements in aggregate metrics can mask persistent unlearned subsets. The findings highlight the need for fine-grained diagnosis of what supervised fine-tuning fails to learn, and why.

cs.CL

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · 2026 · 正式发表

首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-long.162ACL Anthology · ACL 2026

Long Context Modeling with Ranked Memory-Augmented Retrieval

Ghadir Alselwi, Hao Xue The Hong Kong University of Science and Technology, Shoaib Jameel University of Southampton, Basem Suleiman University of New South Wales, Flora D. Salim, Imran Razzak Mohamed bin Zayed University of Artificial Intelligence

原文摘要

Effective long-term memory management is crucial for language models handling extended contexts. We introduce the Enhanced Ranked Memory Augmented Retrieval ERMAR framework, which dynamically ranks memory entries based on relevance. Unlike prior models, ERMAR employs a novel relevance scoring mechanism and a pointwise re-ranking model for key-value embeddings, inspired by learning-to-rank techniques in information retrieval. By integrating historical usage patterns and adaptive retrieval, ERMAR achieves state-of-the-art results on standard benchmarks, demonstrating superior scalability and performance in long-context tasks.

cs.CL

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · 2026 · 正式发表

首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-long.684ACL Anthology · ACL 2026

ZARA: Training-Free Motion Time-Series Reasoning via Evidence-Grounded LLM Agents

Zechen Li Google, Baiyu Chen University of New South Wales, Hao Xue The Hong Kong University of Science and Technology, Flora D. Salim

原文摘要

Motion sensor time-series are central to Human Activity Recognition (HAR), yet conventional approaches are constrained to fixed activity sets and typically require costly parameter retraining to adapt to new behaviors. While Large Language Models (LLMs) offer promising open-set reasoning capabilities, applying them directly to numerical time-series often leads to hallucinations and weak grounding. To address this challenge, we propose ZARA (Zero-training Activity Reasoning Agents), a knowledge- and retrieval-augmented agentic framework for motion time-series reasoning in a training-free inference setting. Rather than relying on black-box projections, ZARA distills reference data into a statistically grounded textual knowledge base that transforms implicit signal patterns into verifiable natural-language priors. Guided by retrieved evidence, ZARA iteratively selects discriminative cues and performs grounded reasoning over candidate activities. Extensive experiments on eight benchmarks show that ZARA generalizes robustly to unseen subjects and across datasets, demonstrating strong transferability across heterogeneous sensor domains. These results mark a step toward trustworthy, plug-and-play motion understanding beyond dataset-specific artifacts. Our code is available at https://github.com/zechenli03/ZARA.

cs.CL · cs.AI

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · 2026 · 正式发表