跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+979新增论文
+781其中 AI 相关
+119已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-20 08:48 · 全站最近入库:2026-11-20 19:58各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-20 08:48最近发现新增版本:2026-11-20 19:58库内论文最新更新时间:2026-11-20 02:59

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

28,961 已收录论文24,030 AI 相关8,912 有修订112 HF 社区发现

浏览论文库

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

找到 13 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-20 08:46(北京时间)
新论文 · v1arXiv:2611.25780

RouteVerify: Routing Interventions for Step-Level Verification in Mixture-of-Experts Models

Yucheng Du, Ryan A. Rossi, Xiyang Hu

原文摘要

Routing states in mixture-of-experts (MoE) models can distinguish correct from erroneous reasoning steps. If changing routing also changes a model's step-level verification judgment, it is tempting to conclude that the judgment follows what routing encodes. We test this inference with RouteVerify, a controlled intervention study that replaces selected internal activations from one solution trace with activations from another, while keeping the evaluated input unchanged. Across nine MoE checkpoints, we compare three intervention interfaces: router logits, MoE outputs, and post-MoE residual states. We vary the layers and token positions at which activations are replaced. We measure changes in a verification margin that quantifies the model's preference for INCORRECT over CORRECT. We also evaluate the same input with activations from correct versus erroneous steps to test whether the resulting judgment depends on the source step's correctness. We report four linked results. First, probes on router logits separate correct from erroneous steps in eight checkpoints (AUROC 0.80-0.88). Second, replacing router logits across all routed layers changes the judgment in all nine checkpoints, and by more than a norm-matched random replacement. Third, this change rarely depends on whether the source step is correct. At one layer, routing from erroneous steps and from correct steps produces indistinguishable margins in all nine checkpoints. Under all-layer routing, their difference is resolved and positive in only one. Fourth, the same difference is positive for local residual replacements in eight of nine checkpoints, so the measure does detect such dependence where it exists. Correctness is therefore readable from routing, and routing replacements move the judgment, but the movement rarely follows correctness.

cs.LG · cs.CL

版本更新 · v2arXiv:2610.38754

Alpha-TCM: Auditable Knowledge Integration for Multimodal TCM Inference

Yucheng Liu, Everett X. Wang

原文摘要

Knowledge-guided multimodal systems need a way to measure how supplied knowledge affects predictions, including when that knowledge is wrong. Alpha-TCM addresses this problem for traditional Chinese medicine (TCM) through an implemented workflow that separates measurements, supplied knowledge, predictions, and reviewer decisions. Observations and contextual knowledge enter separately, and a replaceable prior allows controlled interventions with fixed modality encoders. Bayesian committee accounting removes the reference prior already contained in each encoder before inserting contextual knowledge. A fully simulated confirmation study uses ten paired seeds and four training sizes. Knowledge context reduces prediction error relative to knowledge-free fusion at 600 and 1,200 training cases; equal-information learned context is competitive at 600 and has lower error at larger sizes. Controlled corruption identifies overconfident and displaced priors as the most damaging challenges. Case-level conflict detection remains weak, and training-time prior regularisation shows no consistent benefit. Functional tests verify the connected workflow separately from predictive performance. The simulation demonstrates how Alpha-TCM measures knowledge dependence, separates it from gains due to additional context, and exposes harmful prior assumptions before clinical evaluation.

cs.LG

版本更新 · v2arXiv:2610.38774

Seeing Is Not Enough: Knowledge-Grounded Active Inquiry from Uncertain Visual Evidence

Yucheng Liu, Everett X. Wang

原文摘要

Similar tongue findings can accompany different syndromes in traditional Chinese medicine (TCM), with decisive symptoms absent from the photograph. We present a framework for tongue assessment in which image and pulse findings guide targeted symptom inquiry and acquired answers refine the syndrome shortlist before reporting. Image/pulse predictions guide selection from a sourced symptom question bank. Known answers update the assessment used to select the next question. A calibrated loss of support for the initial prediction triggers reassessment; a subsequent report requires fresh answers supporting a stable candidate. Question and answer records make these decisions inspectable. We construct 2,600 cases from distinct real tongue photographs, assigned syndromes, simulated symptom responses and rendered pulses; 2,599 enter five-fold source-disjoint evaluation and one is training-only. On clean images, image/pulse prediction alone achieves 46.4% fine-syndrome accuracy. At acquisition cost 12, inquiry without image/pulse evidence reaches 34.4%, whereas their combination reaches 65.8% accuracy and 90.8% top-three inclusion. A same-prior, training-optimized static order reaches 59.4% and 87.3%, respectively. In a 200-case visual-training intervention within the same bank, the first question changes in 46.7% of cases and the inquiry NLL-cost curve improves. Component comparisons distinguish these acquisition gains from the coverage-cost tradeoff of reassessment. These controlled results support image-guided acquisition of missing symptoms for ranked TCM decision support.

cs.LG

版本更新 · v2arXiv:2608.18903

When Candidate Pools Miss Active Constraints: Evidence from Electromagnetic and Thermal Design

Yucheng Liu, Chuncheng Zhao

原文摘要

Finite candidate pools can limit surrogate-assisted design when good designs lie near intersecting active constraints. For independent uniform candidates in a normalized box, the typical minimum sum of gaps to k active bounds scales as (k!/N)^(1/k) for a pool of size N. This geometric limitation persists even with an accurate surrogate. We examine it through a controlled synthetic study and two finite-element design problems with inexpensive analytic constraints: a seven-variable electromagnetic coil and an independent six-variable heat spreader. The budget permits 25 initial observations and 50 further evaluations. On ten matched seeds, replacing pool EI with continuous constrained EI refinement raises mean coil response from 0.9120 to 0.9745 mT and lowers mean thermal resistance from 12.688 to 11.905 K/W. Standard continuous LogEI performs better than this refinement on nine coil seeds and all ten thermal seeds, reaching 0.9770 mT and 11.860 K/W. GP-mean search has the highest nominal coil mean but exhibits a thermal outlier on one seed. Mesh and domain checks preserve the substantial continuous-search advantage over the pool; they do not establish a resolved physical ranking among the closely performing continuous policies. Together, the sampling analysis and matched simulations identify when finite-pool search restricts the use of an FEM budget. The results support continuous constrained acquisition search, with stable LogEI as an effective existing implementation, when finite pools poorly represent high-value boundary designs. Bayesian optimization; acquisition optimization; active constraints; simulation-driven design; finite-element method; Gaussian-process surrogate; electromagnetic coil design; heat conduction

cs.LG

新论文 · v1arXiv:2611.21352

Specificity-Guided Knowledge Diversion for Decomposable Generative Models

Yucheng Xie, Fu Feng, Jing Wang, Xin Geng, Yong Rui

原文摘要

Generative model pre-training typically optimizes a model as a whole without explicitly organizing its parameters for selective reuse. Decomposable pre-training instead learns reusable components for downstream adaptation while retaining strong generative performance. However, existing knowledge diversion methods incur substantial parameter overhead through weight factorization and rely on fixed component assignments to induce specialization, potentially compromising in-distribution generation quality. We therefore propose Specificity-Guided Knowledge Diversion (SGKDiv), which learns how generative knowledge is shared and specialized for effective generation and selective downstream reuse. SGKDiv constructs Knowledge Units from paired feed-forward channels, preserving native computational structure without SVD-based reparameterization. Calibrated condition-wise routing combines a shared usage prior with conditional adjustments, while complementary regularization shapes their allocation, diversity, and magnitude. Together, these designs replace predefined component assignments with adaptively learned and explicitly regulated knowledge specialization. Experiments across diverse model and training settings demonstrate better in-distribution generation than dense and MoE baselines, alongside stronger downstream adaptation than representative PEFT methods across eight datasets.

cs.LG · cs.CV

版本更新 · v2arXiv:2611.15413

MORA: Correcting Time Series Forecasts with Coarse Future Signals

Hu Li, Kenan Li, Haonan Xu, longlong, Shuqin Gao, Yucheng Zhang, Feng Dai

原文摘要

Recent architectural advances have improved time-series forecasting. However, our analysis of forecasters with diverse architectures reveals a common pattern: a substantial share of residual energy is concentrated in a small number of low-frequency components. Simple linear probes further show that the forecasters' historical inputs still contain predictive information about errors in the forecast mean. Building on these findings, we propose Model-Output Residual Adaptation (MORA), a model-agnostic residual adapter that refines the outputs of frozen forecasters without requiring additional inputs. MORA estimates segment-wise means of the target sequence through structural extrapolation and learned estimation, rather than directly predicting backbone-specific residuals. It then converts discrepancies between these estimates and the corresponding statistics of the backbone forecast into stagewise corrections, scaling each update according to estimation reliability. Extensive experiments on twelve benchmarks with six forecasting backbones show average MSE reductions of 7.2% for long-term forecasting and 28.1% for short-term forecasting, with lower MSE in 96.2% of the 288 evaluated cases. The benefits also extend to three time-series foundation models evaluated at different context lengths. Together, these results demonstrate that predictable coarse-scale residuals can be effectively exploited to improve existing forecasts. Code repository: https://github.com/hugerli-1/MORA.

cs.LG

版本更新 · v3arXiv:2603.23994

Understanding the Challenges in Iterative Generative Optimization with LLMs

Allen Nie, Xavier Daull, Zhiyi Kuang, Abhinav Akkiraju, Anish Chaudhuri, Max Piasevoli, Ryan Rong, YuCheng Yuan 等 13 位作者

原文摘要

Generative optimization uses large language models (LLMs) to iteratively improve artifacts (such as code, workflows or prompts) using execution feedback. It is a promising approach to building self-improving agents, yet in practice remains brittle: despite active research, only 9% of surveyed agents used any automated optimization. We argue that this brittleness arises because, to set up a learning loop, an engineer must make "hidden" design choices: What can the optimizer edit and what is the ``right'' learning evidence to provide at each update? We investigate three factors that affect most applications: the starting artifact, the credit horizon for execution traces, and batching trials and errors into learning evidence. Through case studies in MLAgentBench, Atari, and BigBench Extra Hard, we find that these design decisions can determine whether generative optimization succeeds, yet they are rarely made explicit in prior work. Different starting artifacts determine which solutions are reachable in MLAgentBench, truncated traces can still improve Atari agents, and larger minibatches do not monotonically improve generalization on BBEH. We then study these factors jointly in harness optimization on TBLite, evaluated on Terminal-Bench 2.0. We also propose a batch-size and credit-horizon rule that, calibrated on TBLite, transfers to DeepSWE after adjusting to its token costs and comes within 1% of the best configuration tested at each context budget.

cs.LG · cs.AI

版本更新 · v4arXiv:2608.05466

Recursive Synthesis for Long-Horizon Terminal Tasks

Zhongzhi Li, Yucheng Shi, Zongxia Li, Ruhan Wang, Anhao Li, Jiaxi Li, Junyao Yang, Lei Ke 等 14 位作者

原文摘要

High-quality long-horizon training data for terminal agents is costly and difficult to scale, as manual authoring is expensive and direct LLM generation often produces inconsistent instructions, environments, solutions, and verifiers. We present Recursive Synthetic Terminal Tasks (RST), a recursive verified synthesis framework for constructing long-horizon terminal-agent tasks at scale. Starting from verified seed tasks, RST extends the reference solution, realigns the verifier and instruction to the new workflow, validates the result in a fresh sandbox, and reuses accepted tasks as seeds for subsequent rounds. Across fifteen recursive rounds, RST produces 37,484 synthesized terminal-agent tasks at roughly $0.05 per task. Task difficulty increases substantially over rounds: the median reference solution grows from 67 to 374 lines, the median number of executed commands grows from 40 to 244, and DeepSeek-V4-Pro pass@4 drops from 90% at R1 to 2.5% at R15. To demonstrate training utility, we collect rejection-sampled Qwen3.5 trajectories on the synthesized tasks and use them for supervised fine-tuning. Fine-tuning on these trajectories improves Qwen3.5-27B and Qwen3.5-122B-A10B by up to 10 points on Terminal-Bench 2, Terminal-Bench Hard, and Long-Horizon Terminal Bench, while agentic PPO lifts Qwen3.5-27B to 49.44%, 32.00%, and 22.07% on the three benchmarks, corresponding to relative gains of 20.0%, 41.2%, and 21.9% over the base model. Moreover, after 15 rounds, the recursion shows no ceiling: synthesis yield and validation rates remain stable as difficulty keeps climbing, indicating that the process can continue well beyond the scale reported here.

cs.AI · cs.LG

新论文 · v1arXiv:2611.07593

TACT-KV: Tri-Axis Cosine Transform for Compressing Volumetric KV Caches in Medical VLMs

Chongyu Qu, Ritchie Zhao, Yufan He, Dong Yang, Zhengyi Lu, Junchao Zhu, Tianyuan Yao, Juming Xiong 等 15 位作者

原文摘要

Vision-language models (VLMs) applied to 3D medical scans face a structural memory wall. A single CT or MRI volume produces tens of thousands of vision tokens, and the resulting key-value (KV) cache scales linearly with both batch and context. Existing KV compression methods operate on the cache's feature or token statistics, or apply 1D and 2D transforms, leaving the three-axis spatial structure in the cache unexploited. We propose TACT-KV (Tri-Axis Cosine Transform), a calibration-free KV compression method that exploits strong spatial correlations in visual KV states along all three anatomical axes of 3D scans. This correlation concentrates the KV cache energy under a frequency-domain transform. TACT-KV applies a separable 3D discrete cosine transform to the KV cache, allocates a per-layer bit budget across frequency bins via reverse water-filling (more bits to high-energy components), and quantizes each bin with a fixed scalar codebook. We derive a close-form relation: the distortion reduction from adaptive bit allocation is dominated by the spectral concentration of the transformed cache. Across six medical VLMs and two 3D CT benchmarks, TACT-KV achieves the lowest 1-bit prediction-flip rate on eleven of twelve model and dataset pairs in our main comparison. The same advantage reproduces on four general-purpose VLMs evaluated on video tasks, indicating that the benefit of exploiting three-axis structure generalizes beyond medical imaging. At equal high-bandwidth memory (HBM), TACT-KV scales the decoding batch size on a single GPU by up to $8\times$.

cs.CV · cs.LG

版本更新 · v2arXiv:2605.16392

Bridging the Modality Bottleneck in Pathology MIL through Molecularly Guided Feature Adaptation

Yucheng Xing, Pei Liu, Jingying Ma, Ruping Hong, Jiangdong Qiu, Tianyu Liu, Kai He, Ling Huang 等 9 位作者

原文摘要

Multiple instance learning (MIL) is the dominant framework for whole-slide image analysis in computational pathology, typically combining a frozen patch encoder, a projection layer, and a slide-level aggregator. While encoders and aggregators have been extensively studied, the projection layer remains a largely morphology-only bottleneck. This limits endpoints such as biomarker status and survival, which are governed by a molecular state that is not fully captured by H&E morphology. We introduce Molecularly Informed Staining Transform (MIST), a plug-in replacement for the MIL projection layer that uses paired spatial transcriptomics only during training to construct virtual molecular stains. MIST clusters gene expression profiles into cross-modal prototypes, anchors them in the frozen foundation model feature space, and uses them to reorganize H&E patch features along molecularly guided axes. It requires no transcriptomics at inference and can be inserted before standard MIL aggregators. We evaluate MIST across 23 downstream tasks and 8 MIL aggregators. MIST improves 240 of 256 configurations over the standard projection layer, with an average gain of +3.5%, observed consistently across endpoint types: +5.2% on survival prediction, +3.3% on tissue subtyping, and +2.6% on biomarker prediction. Ablations confirm that gene-derived prototypes are the primary source of the gains, while spatial, biological, and pathological analyses show that cross-modal prototype affinities capture spatially coherent molecular programs from H&E alone.

q-bio.QM · cs.CV · cs.LG

版本更新 · v2arXiv:2610.09737

Mosquito acoustic identification at unseen recording sites: practical limits of common transfer remedies for vector surveillance

Yucheng Gong, Rui Zhou, Binbin Zeng, Qiang Ren, Hongjin Hui

原文摘要

Passive acoustic monitoring could widen mosquito surveillance, but a classifier trained under one set of recording conditions often fails when moved to a new site, device or enclosure. On a nine-species, five-condition corpus of about 271,000 recordings, the published baseline identifies species at 0.881 balanced accuracy under conditions it has seen and 0.175 under held-out ones. Using that corpus's leave-domain protocol, we asked which transfer strategy is most reliable when a program brings a new site online. Using fixed features from a pre-trained bioacoustic model and a small classifier improved held-out-condition balanced accuracy to 0.305, without updating backbone weights and in minutes of training per site. Four widely used additions did not improve transfer: rebalancing training across recording conditions, fine-tuning the backbone and fusing a weaker second modality each reduced accuracy, and a six-term objective reduced to a single alignment term. Rebalancing reversed direction across four encoders, helping weak representations and harming strong ones. Genus-level aggregation was more accurate than species-level classification (about 0.50 against 0.30), suggesting genus-level screening may be the more realistic operating point here. These results come from one corpus under one protocol, and are dataset-bounded guidance rather than validated general rules.

eess.AS · cs.LG

新论文 · v1arXiv:2611.01426

FlyWheel: Attention Kernels Built for the TPU

Zishuo Bao, Zeshen Zhang, Linkun Chen, Yucheng Lu

原文摘要

Attention kernels on Tensor Processing Units (TPUs) often underutilize their matrix units (MXUs) because of repeated matrix operand loads, vector-intensive computation, and dependencies that leave MXUs idle. We present FlyWheel, a set of fast TPU kernels for both softmax and linear attention. FlyWheel reformulates softmax and triangular inversion to reduce vector work, while coordinating data layouts to improve matrix operand reuse. It then overlaps independent computation to hide execution latency. We apply these techniques to both softmax attention and Gated DeltaNet on TPU v6e and v7x. FlyWheel speeds up softmax attention by up to $4.14\times$ over the state-of-the-art RPA kernel and $1.80\times$ over Splash Attention, reaching 81% of peak BF16 throughput on v6e. It also speeds up Gated DeltaNet prefill by up to $3.61\times$. Integrated into vLLM serving Qwen3.8-27B, FlyWheel improves prefill throughput by up to $1.56\times$ while maintaining comparable accuracy.

cs.CL · cs.LG

版本更新 · v2arXiv:2605.08960

CrystalREPA: Transferring Physical Priors from Universal MLIPs to Crystal Generative Models

Chengqian Zhang, Yucheng Jin, Duo Zhang, Tiejun Li, Han Wang

原文摘要

Crystal generative models mainly learn what stable crystals look like, with little explicit supervision for what makes them stable. We reveal a substantial representation gap between state-of-the-art crystal generative models and pretrained universal machine learning interatomic potentials (MLIPs) via energy probing, and show this gap can be closed by a simple training-time alignment. We propose Crystal REPresentation Alignment (CrystalREPA), a plug-and-play framework that aligns the atom-wise hidden states of generative encoders with frozen MLIP representations through an element-aware contrastive objective, transferring stability-aware atomistic priors with marginal training overhead and no additional inference cost. Across three generative frameworks, ten MLIP teachers, and two benchmark datasets, CrystalREPA consistently improves the thermodynamic stability, structural validity, and structural fidelity of generated crystals. Equally important, we find that an MLIP's transfer effectiveness is poorly predicted by its accuracy on standard leaderboards (e.g., Matbench Discovery) but strongly predicted by the distinguishability of its atom-wise representation space, yielding a practical, accuracy-independent criterion for selecting MLIP teachers for generative transfer. Code is available at https://github.com/Chengqian-Zhang/CrystalREPA.

cs.LG