跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+197新增论文
+151其中 AI 相关
+16已有论文修订
+91新增 AI 导读

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

统计口径与数据新鲜度

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

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

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

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

浏览论文库

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

找到 6 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-22 06:39(北京时间)
版本更新 · v2arXiv:2605.10093

RFAmpDesigner: A Two-Level LLM-guided Optimization Framework for Automated Differential CMOS RF Amplifier Sizing

Hang Lu, Guochang Li, Qianyu Chen, Huiyan Gao, Shaogang Wang, Xuanyu He, Yiwei Liu, Gaopeng Chen 等 12 位作者

原文摘要

Automated RF amplifier sizing is challenging because the design process is inherently hierarchical, the parameter space is high-dimensional and strongly coupled, and high-fidelity circuit simulation is expensive. Conventional optimization and reinforcement learning methods typically require many iterations and make limited use of RF domain knowledge, making them costly under tight simulation budgets. Large language models (LLMs) provide broad prior knowledge and reasoning capabilities, but are unreliable for direct numerical optimization. This paper presents RFAmpDesigner, a two-level optimization framework for automated schematic-level sizing of differential CMOS RF amplifiers. At the outer level, the circuit-parameter space is abstracted into a resource-allocation space, where LLMs make high-level allocation decisions and adjust them according to feedback from the inner level. At the inner level, RF design knowledge is used to decompose the flat sizing problem into a sequence of low-dimensional subproblems. Conventional optimizers then solve these subproblems to find circuit implementations consistent with the assigned resources. This structure allows numerical optimizers to focus on low-dimensional searches in the circuit-parameter space, while the LLM reasons and acts over a physically meaningful design space using simulation feedback. The main evaluation covers low-noise amplifier (LNA), driver amplifier (DA), and power amplifier (PA) designs within the target differential CMOS RF amplifier family. Experimental results show that it achieves a higher success rate under a limited simulation budget in both easy and hard regimes.

cs.AR

新论文 · v1arXiv:2611.21154

KuroshioVis: Hypothesis-Driven Discovery of Mesoscale Air-Sea Interaction through Coarse-to-Fine Exploration

Yuanzhi Chen, Yiwei Lin, Xi Duan, Qingqing He, Ruiliang Xu, Yucheng Wang, Qiong Zeng

原文摘要

Mesoscale air-sea interaction occurs throughout strong sea surface temperature fronts such as the the Kuroshio Extension, but its strength is highly non-uniform and can be resolved only in kilometre-scale coupled simulations. The response of any single eddy is weak relative to synoptic variability, so evidence supporting a hypothesis of systematic air-sea coupling must be accumulated across many eddies rather than inferred from individual cases. We present KuroshioVis, a hypothesis-driven, coarse-to-fine visual analytics workflow. The coarse stage extracts and aligns mesoscale eddies into composite representations of their air-sea responses, and provides a global view for exploration. The fine stage investigates these responses through three coordinated views: the composite in terface view, the cross-interface flow view, and the evidence matrix view. These coordinated views support air-sea coupling analysis from surface patterns to cross-interface dynamics and quantitative statistical evidence. We demonstrate the workflow using the coupled C1440-LLC2160 simulation of the 2026 SciVis Contest.

cs.HC · cs.GR

新论文 · v1arXiv:2611.14171

BARS: Budget-Aware Sequential Sampling with Refusal for Majority Identification under Unknown Distributions

Shenxi Liu, Yiwei Li, Mingyang Zhao, Yuhang Tian, Kan Li

原文摘要

Repeated sampling with majority selection is an effective means of enforcing self-consistency in large language models. Recently, a variant has also been introduced that terminates early to save costs when the output distribution is favorable. But it still cannot yield a correct confidence estimate from the answer distribution. For this issue, we formalize this as majority identification under an unknown distribution with a budget and a target error rate, and propose BARS, a sequential rule certifying the top-two gap and returning an early stop, a budgeted majority vote, or a refusal when feasibility cannot be established. A refusal is a statement about the rule and its budget, not a claim that a question is unanswerable, and it tells practitioners when to widen the budget or switch models. A certified mode carries proven bounds on the joint answering error and on refusing an instance the budget could handle, while a practical mode, used in our experiments, replaces them with empirical calibration. On synthetic instances drawn from known distributions over thousands of seeds, the difficulty-driven behavior is recovered and the price of the certified mode is measured.On GSM8K the practical mode draws 22.3\% fewer samples than fixed-8 sampling over the same pool, refused questions included, at the cost of declining 18.8\% of the questions. On MATH, it greatly improves the accuracy of its output answers into 82.5\% at the cost of honestly refusing to answer half of the difficult questions that the model itself is unable to solve.

cs.AI

新论文 · v1arXiv:2611.04012

SurgEye: Instruction Tuning-Free Perception-Reasoning Framework for Surgical Scene Understanding

Qing Xu, Xiechen Shen, Xianjian He, Guqiao Liang, Zixiao Chai, Jiale Qin, Yifan Chen, Siyi Li 等 12 位作者

原文摘要

Surgical scene understanding is pivotal for computer-assisted intervention, yet demands compositional reasoning across instruments, anatomy, and workflow. Existing surgical vision-language models rely on instruction tuning with large-scale question-answer pairs, entailing laborious data curation and costly retraining. To bridge this gap, we propose SurgEye, a perception-reasoning framework that grounds reasoning in a vision foundation model without instruction tuning. Specifically, we devise Routed Multi-Task Perception (RMP) that routes the vision foundation model through task-specific pathways learned from public perception labels, producing spatial and temporal evidence. We further introduce Agentic Compositional Reasoning (ACR) that employs a frozen large language model to coordinate RMP specialists and temporal memory as callable tools, composing evidence across tasks and time into grounded answers. Moreover, we construct SurgEye-Bench spanning eight surgical procedures, pairing each question with perception labels for verifiable evaluation. Extensive experiments demonstrate that SurgEye outperforms state-of-the-arts in surgical reasoning. The source code will be available.

cs.CV

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

LLM-Powered Benchmark Factory: Reliable, Generic, and Efficient

Peiwen Yuan, Shaoxiong Feng RedNote, Yiwei Li, Xinglin Wang, Yueqi Zhang, Jiayi Shi, Chuyi Tan, Boyuan Pan 等 10 位作者

原文摘要

The rapid advancement of large language models (LLMs) has led to a surge in both model supply and application demands. To facilitate effective matching between them, generic and efficient benchmark generators that can construct high-quality benchmarks are widely needed. However, human annotators are constrained by inefficiency, and current LLM-based benchmark generators lack not only generalizability but also a comprehensive evaluation framework for validation and optimization. To fill this gap, we first establish an automated evaluation framework, structured around four dimensions and ten criteria. Under this framework, we carefully analyze the advantages and weaknesses of directly prompting LLMs as generic benchmark generators. On this basis, we introduce a series of methods to address the identified weaknesses and integrate them as BenchMaker. Experiments across multiple LLMs and tasks confirm that BenchMaker achieves comparable performance to human-annotated benchmarks on most metrics, highlighting its generalizability and validity. More importantly, it delivers highly consistent evaluation results across 21 LLMs (e.g., 0.969 Pearson correlation against MMLU-Pro on language understanding task), while incurring minimal overhead (e.g., 0.005 and 0.38 minutes per sample when using GPT-4o mini as generator).

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.2191ACL Anthology · ACL 2026

SPARD: Self-Paced Curriculum for RL Alignment via Integrating Reward Dynamics and Data Utility

Xuyang Zhi, Peilun Zhou Xiaohongshu, Chengqiang Lu Xiaohongshu, Hang Lv University of Science and Technology of China, Yiwei Liang, Rongyang Zhang, Yan Gao, Yiwu Xiaohongshu 等 13 位作者

原文摘要

The evolution of Large Language Models (LLMs) is shifting the focus from single, verifiable tasks toward complex, open-ended real-world scenarios, imposing significant challenges on the post-training phase. In these settings, the scale and complexity of reward systems have grown significantly, transitioning toward multi-objective formulations that encompass a comprehensive spectrum of model capabilities and application contexts. However, traditional methods typically rely on fixed reward weights, ignoring non-stationary learning dynamics and struggling with data heterogeneity across dimensions. To address these issues, we propose SPARD, a framework that establishes an automated, self-paced curriculum by perceiving learning progress to dynamically adjust multi-objective reward weights and data importance, thereby synchronizing learning intent with data utility for optimal performance. Extensive experiments across multiple benchmarks demonstrate that SPARD significantly enhances model capabilities across all domains. Our code is publicly available at https://github.com/USTC-StarTeam/SPARD.

cs.CL

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