跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+1958新增论文
+1549其中 AI 相关
+212已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-17 19:15 · 全站最近入库:2026-11-17 19:15各信源进度 →

统计口径与数据新鲜度

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

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

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

25,785 已收录论文21,490 AI 相关7,724 有修订112 HF 社区发现

浏览论文库

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

找到 16 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-17 19:14(北京时间)
新论文 · v1arXiv:2611.21339

MovieRoll: A Systematic Framework for Rolling Out Long-Form Videos

Yunyang Ge, Weijie Kong, Ryan Xu, Yue Wu, Qi Tian, Jiangfeng Xiong, Bin Lin, Mingzhe Zheng 等 12 位作者

原文摘要

Streaming video generation must sustain quality beyond the training horizon while handling self-generated history and growing cache costs. To address these challenges, we present MovieRoll, a base-to-distilled framework that connects streaming fine-tuning, long-rollout distillation, and long-horizon inference. We first establish a robust multi-step base through Window-wise Teacher Forcing (WinTF), which jointly denoises chunks at progressive noise levels with bidirectional attention within each window and causal access to preceding history. To retain historical context efficiently, hierarchical KV-cache compression (HieraKV) exploits layer-wise attention patterns, retaining full history in shallow layers and sink--recent history in deeper layers. This reduces cache memory by up to 78% while improving generation quality. Building on this base, cumulative long tuning with distribution matching distillation (CuLT-DMD) holds parameters fixed throughout each long self-rollout and averages local gradients before updating. Each update therefore combines supervision across temporal positions while retaining only one local computation graph, enabling efficient long-rollout training of a few-step generator. To extend generation beyond the training horizon, KV recomputation bounds context for both models, while guidance annealing (AnnealCFG) reduces guidance toward the clean endpoint to stabilize MovieRoll-Base. Complementing these modeling advances, FBCA attention and PS-VAE decoding support efficient training and streaming output. On HeliosBench, MovieRoll-Base remains competitive at 30s after training on videos of up to 15s, and MovieRoll-Distilled achieves the highest total scores among the compared methods across single- and multi-event evaluations up to 60s, combining sustained naturalness with active motion.

cs.CV

版本更新 · v3arXiv:2610.00518

One-Step Generative Modeling via Training Dynamics Action

Zhangyong Liang, Ying Huang, Haibin Ling

原文摘要

Recent one-step generators learn to move outputs toward data by fitting sample movements. However, the optimizer updates shared parameters rather than sample positions, so the movements can differ from those prescribed. To address this issue, we propose Training Dynamics Action (TDAC), which uses the cost of fitting movements jointly to choose transport plans. For a linearized generator, local generator action is the minimum sum of parameter-update cost and a feature-fitting penalty over shared parameter increments. We derive a closed-form action and minimize a regularized version while retaining a prescribed fraction of the reference plan's predicted distributional improvement. We estimate the covariance of feature responses using random parameter directions and evaluate action with a low-rank approximation. The plan defines fixed regression targets. An execution-gap bound relates local generator action to first-order progress of the actual update. Planning occurs during training; inference requires one generator evaluation. On ImageNet 256 x 256, TDAC achieves Frechet Inception Distance (FID) below 1.1 without distillation. Furthermore, TDAC reduces optimizer-time action while maintaining distributional accuracy and full mode coverage. At comparable FID, TDAC requires approximately 100 times fewer generator evaluations than multi-step diffusion models. The code for our work will be released soon.

cs.LG

新论文 · v1arXiv:2611.20628

PixelBench: Evaluating Language Models for Pixel-Art Creation

Mutian Hong, Jianxuan Yao, Mingkun Yue, Changkai Li, Hower Yang, Haibin Ling

原文摘要

Pixel art is widely used in games and digital content creation, requiring readable forms, coherent spatial relationships, and harmonious colors under limited resolution and palette constraints. Language models show growing promise in visual creation, yet their pixel art creation capabilities lack systematic evaluation. We introduce PixelBench, formalizing text-to-image generation and instruction-guided editing for pixel art and providing a benchmark for these tasks. We further present a creation environment in which language model agents invoke drawing tools through code to generate and edit pixel art. We assess the quality of generated artwork through human evaluation and employ a multimodal large language model as a judge, validating the agreement between its automated assessments and human preferences. We compare language models and configurations across diverse subjects and canvas sizes. In our experiments, GPT-6 Astra achieves both the highest average judge score and the best average human rank, highlighting the potential of general-purpose language models for pixel art creation. We release the tasks, all artworks, the human rankings, and the judge protocol.

cs.CV

新论文 · v1arXiv:2611.17803

Resource Management and Trajectory Optimization for UAV-IRS Assisted Maritime Edge Computing Networks

Chaoyue Zhang, Bin Lin, Xu Hu, Shuang Qi, Liping Qian, Yuan Wu

原文摘要

With the exponential growth of maritime wireless devices and the rapid development of maritime applications, traditional maritime communication networks encounter communication and computation limitations in supporting computation-intensive and latency-critical tasks. Edge computing and Intelligent Reflecting Surface (IRS) have emerged as promising techniques to improve communication and computation services for maritime devices with limited computation capabilities and battery capacity. This paper studies an IRS Mounted on Unmanned Aerial Vehicle (UIRS) assisted maritime edge computing network, in which the UIRS is deployed to assist the transmission from Unmanned Surface Vehicles (USVs) to the edge server via Non-Orthogonal Multiple Access (NOMA) protocol. We propose a resource management and trajectory optimization scheme by jointly optimizing subslot duration, offloading ratios, transmit power, edge computation capability allocation, UIRS phase shifts and UIRS trajectory, aiming at minimizing the overall energy consumption. Since the non-convex nature of the optimization problem, we propose a two-layered method by decomposing the original problem into two subproblems. The top-layered subproblem is solved by the Semi-Definite Relaxation (SDR) method and the underlying-layered subproblem is solved by the Deep Deterministic Policy Gradient (DDPG) algorithm. Numerical results demonstrate that our proposed scheme can effectively and efficiently reduce overall energy consumption.

cs.NI

新论文 · v1arXiv:2611.17779

Mobile Edge Deployment and Resource Management for Maritime Wireless Networks

Chaoyue Zhang, Bin Lin, Ziru Chen, Lin X. Cai, Jianli Duan

原文摘要

Mobile Edge Computing (MEC) has been envisioned as one of the key technologies for supplying computation and storage resources in Internet of Vessels (IoV) networks. Due to its flexible deployment, low cost and agile maneuverability, Unmanned Surface Vehicle (USV) has emerged as a promising solution, to provide communication and computation services for maritime users. In this paper, we study mobile edge deployment and resource management for MEC-assisted maritime wireless networks where USVs with diverse computation resources are deployed to provide edge computing services that complement the cloud-based services. To this end, we formulate an optimization problem to minimize the expected response time by jointly optimizing the deployment of mobile USVs and computation offloading decisions. To solve the mixed-integer nonlinear program problem, we propose a Dual-Layer Reinforcement Learning (DLRL) framework to attain a near-optimal solution. Specifically, a Deep Deterministic Policy Gradient (DDPG) algorithm is designed to obtain the best USV deployment in the outer layer learning, and a Q-learning algorithm is designed to determine the best computation offloading decisions in the inner layer learning. Numerical results demonstrate that the proposed solution outperforms some literature algorithms by effectively handling both continuous and discrete variables.

cs.NI

新论文 · v1arXiv:2611.13019

Two-Tier Task Offloading for Satellite-Assisted Marine Networks: A Hybrid Stackelberg-Bargaining Game Approach

Zhen Wang, Bin Lin, Qiang, Ye, Haixia Peng

原文摘要

The proliferation of maritime activities has spurred the emergence of numerous computation-intensive and delay-sensitive marine applications and services. Given the inherent rationality, selfish nature, and limited computational abilities of marine devices, devising effective strategies to incentivize their participation in task processing become a critical challenge. In this paper, we investigate the satellite-assisted marine multi-access edge computing (MEC) and propose a two-tier task offloading scheme through a hybrid Stackelberg-Bargaining game approach to enhance offloading efficiency and maximize the utility of marine devices. Specifically, for the underwater acoustic communication, we consider the scenario where multiple autonomous underwater vehicles (AUVs), managed by maritime autonomous surface ships (MASSs), upload their collected data using non-orthogonal multiple access(NOMA) to optimize channel utilization. For the data transmission above the sea surface, we consider the scenario where a low earth orbit satellite (LEOS) functions as a space edge server to provide computing services, and MASS offloads workloads to LEOS through frequency division multiple access(FDMA) to prevent co-channel interference. we define the utility of AUVs, MASSs and LEOSs, and model the offloading process between AUVs and MASSs as a Stackelberg game, while representing the offloading interaction between MASSs and LEOSs as a Bargaining game. Additionally, we propose efficient algorithms to optimize AUV offloading strategies and MASS pricing strategies, while refining the bidding strategies for both MASSs and LEOSs. Simulation results demonstrate that the proposed algorithms significantly outperform benchmark schemes in achieving optimal solutions.

cs.DC

新论文 · v1arXiv:2611.09290

Safety-Focused Reinforcement Learning Using Risk-Sensitive Coupled Control

Jiabin Lin, Shana Moothedath, Vivek S. Borkar

原文摘要

This paper investigates the coupled control problem within safety-focused reinforcement learning, addressing the essential challenge of achieving optimal performance while ensuring safety in systems operating within complex environments. We define safety as the requirement to prevent the system from reaching undesirable or hazardous states. We propose a coupled control approach that prioritizes safety by employing effective methods to prevent the system from entering unsafe states while optimizing the performance metric, defined as the average cost. We propose a novel problem transformation that reformulates it into a risk-sensitive problem combined with an average reward criterion. We present a two-timescale Q-learning algorithm where in the faster timescale, the algorithm solves a risk-sensitive control problem to ensure safety, while on a slower timescale, the algorithm focuses on average cost control. We provide theoretical guarantees for the convergence of our algorithms, establishing their significance in ensuring safe, optimal control in dynamic environments. We validated the performance of our approach using GridWorld and CarGoal task in Safety Gymnasium.

cs.LG

新论文 · v1arXiv:2611.09205

Computation-Efficient Aerial-Marine Integrated Networks for Search and Rescue via Cooperative HAPS, UAVs, and MASSs

Zhen Wang, Bin Lin, Qiang Ye

原文摘要

In this paper, we propose an aerial-marine integrated network architecture tailored for maritime search and rescue (MSAR) operations, where a high altitude platform station (HAPS) and maritime autonomous surface ships (MASSs) are equipped with edge servers, providing computing services for surveillance uncrewed aerial vehicles (UAVs). These UAVs generate substantial volumes of computation-intensive and delay sensitive tasks, some of which can be strategically offloaded to both MASSs and HAPSs for distributed processing. We formulate the joint task offloading and resource allocation as a mixed-integer nonlinear program (MINLP) to minimize the system computation overhead (CO), quantified by a weighted sum of task completion time and energy consumption. Given the stochastic nature of task arrivals from UAVs and the dynamic characteristics of marine channel conditions, we employ a two-stage optimization to decompose the problem into four tractable subproblems, i.e., 1) edge server selection, 2) transmission power allocation, 3) edge computing resource allocation, and 4) local computation resource allocation. In stage I, we optimize the edge server selection via many-to-one matching. In stage II, we determine the transmission power of each UAV with quasi-convex optimization and solve the edge computing and local computing resource allocation subproblems via a projected gradient descent method and convex optimization, respectively. Simulation results validate that the proposed scheme can achieve superior system performance over benchmark schemes.

cs.NI

新论文 · v1arXiv:2611.09154

Learning When to Think: Dual-Reference Offline Optimization for Adaptive VLM Reasoning

Hongbin Lin, Sizhe Zou, Juangui Xu, Xinyue Xu, Zhuoli Ouyang, Stanislav Kolchin, Chengwei Qin, Zhongxiang Dai 等 9 位作者

原文摘要

Reasoning traces improve vision-language models on complex multimodal tasks, but forcing every input to follow a long reasoning process leads to overthinking and unnecessary inference cost. We study adaptive fast/slow thinking for VLMs, where one model answers directly for simple inputs and reasons step by step when needed. Fast answers and slow traces often come from distinct behavior policies, making a single-reference offline objective misweight one mode. We propose DUAL-REFERENCE BOLT (DR-BOLT), which distinguishes the desired fast/slow mixture reference from the sampling distribution and corrects their mismatch in reward-weighted training. Fast/slow partition competition explains routing in the optimal target; an efficient source-wise correction approximates the exact objective when response formats are well separated. Matched Qwen3-VL comparisons use identical candidate banks to isolate the objective from slow-teacher quality. DR-BOLT improves score-length trade-offs over the evaluated offline and online baselines on ScienceQA and three held-out transfer benchmarks, with a 24.1% cross-benchmark slow ratio and a 2.90-fold end-to-end training speedup over reproduced GRPO. These results support adaptive reasoning in the studied two-reference setting, while broader robustness remains open. Our code is available at https://github.com/HongbinLin3589/DR-BOLT.

cs.AI

新论文 · v1arXiv:2611.07374

Design of Multi-UAV Cooperative Deep Semantic Autoencoders for Communication Networks

Xiaoling Han, Bin Lin, Nan Wu, Tony Q. S. Quek

原文摘要

Driven by the rapid development of the low-altitude economy, Uncrewed Aerial Vehicle (UAV) networks have become increasingly important for executing tasks such as search, rescue, and monitoring. However, under bandwidth-constrained scenarios, UAV networks still face significant challenges in task execution efficiency and intelligent processing capabilities. To address these issues, we propose Multi-UAV Cooperative Deep Semantic Autoencoders (MC-DSA) for communication networks. The architecture comprises one Task UAV (T-UAV) and multiple Support UAVs (S-UAVs), which jointly enhance communication efficiency and data-processing capability via semantic communication and cooperation. Specifically, we introduce a semantic matching and source selection mechanism, enabling the proposed MC-DSA to handle low-quality images while ensuring effective utilization of high-quality images. The T-UAV broadcasts a task query, and each S-UAV computes the semantic similarity between its local image and the query. Communication links are established only when the similarity exceeds a predefined threshold. The training algorithm optimizes network parameters through gradient descent, improving semantic feature extraction accuracy. The testing algorithm evaluates UAV collaboration efficiency and communication quality. Experimental results demonstrate that, compared with benchmarks, the proposed MC-DSA improves image semantic segmentation accuracy while maintaining task execution efficiency. As a result, it reduces redundant transmissions and offers an effective solution for multi-UAV communication networks.

cs.MA

新论文 · v1arXiv:2611.07361

Design of a Speech Enhancement-Based Deep Semantic Autoencoder for Wireless Communications

Xiaoling Han, Bin Lin, Nan Wu, Tony Q. S. Quek

原文摘要

Speech communication plays a crucial role in the Internet of Things and autonomous networks. However, traditional communication systems suffer from insufficient semantic extraction and limited noise suppression capability. To address these issues, we propose a Speech enhancement-based Deep Semantic Autoencoder (S-DSA) communication system for wireless communications. It consists of a dual-branch semantic encoder, a channel encoder, a channel decoder, and two semantic decoders, enabling joint source-channel coding for robust transmission. A key novelty lies in an adaptive semantic noise decoupling mechanism that disentangles target speech semantics from noise representations through an interaction module, thus maintaining semantic consistency under low SNR conditions. Furthermore, a joint training strategy optimizes speech reconstruction and noise estimation, while a lightweight testing strategy reduces complexity by disabling the noise-decoding path. The proposed S-DSA enables more effective separation between speech and noise, and yields higher robustness as well as better reconstruction quality. These findings highlight the potential of the proposed S-DSA as a practical solution for next-generation intelligent wireless communications.

cs.SD · cs.IT

新论文 · v1arXiv:2611.03963

ProteoCraft: Protein Design as Proposal-Verification Search

Fang Wu, Hongbin Lin, Bingchen Duan, Yuchen Wang, Li Erran Li, Yanjie Huang, Mingxuan Cao, Yijun Ma 等 27 位作者

原文摘要

Protein-protein interactions underpin nearly all biological processes. Yet, designing proteins with desired interactions remains challenging due to the structural complexity governing molecular recognition. This study views protein design as a search optimization problem over a combinatorial sequence space under expensive structural evaluation. Toward this goal, we introduce a novel tree-based search framework, ProteoCraft, that employs approximate structural gradients from diffusion-based structure predictors as effective proposal policies to specify where the search should explore. Complete no-gradient inference of folding models separately assigns values to the resulting sequences, determining what is good. ProteoCraft allocates this verification budget through a coarse-to-fine paradigm: multi-site edits first explore distinct sequence basins, then verified promising states undergo strict single-site refinement. Across fourteen de novo binder-design settings spanning eight target proteins, five immune-relevant TCR-facing targets, and four localized CDR redesign tasks, ProteoCraft improves design quality and high-confidence yield. These improvements persist under independent AF2-IG and Rosetta-based interface evaluation. Prospective experimental validation further yielded an 82.9% binding hit rate for PD-L1 miniproteins, with a best measured KD of 0.879 nM, and confirmed binding of designed IFNAR2 VHH. Our code is available at https://github.com/smiles724/ProteoCraft_v1.

cs.CE · cs.AI · q-bio.BM

版本更新 · v2arXiv:2609.15334

Concept-Grounded Reasoning with Prompt-Driven Localization for Interpretable Structured Report Generation

Xinyue Xu, Hongbin Lin, Juangui Xu, Hualiang Wang, Lehan Wang, Lijie Hu, Adrian Weller, Xiaomeng Li

原文摘要

Medical imaging modalities such as ultrasound and X-ray are widely used in clinical practice, where diagnosis follows a structured, evidence-driven workflow aligned with standardized criteria. While multimodal large language models (MLLMs) show promise for automated medical report generation, most existing systems rely on end-to-end multimodal fusion without modeling clinically defined intermediate attributes, leading to limited grounding and interpretability. To address this issue, we propose CORAL (COncept-grounded ReAsoning with Localization), a multimodal framework that integrates spatial grounding and concept-level supervision into a unified reasoning process. CORAL employs a prompt-driven medical segmentation model to localize lesions and predicts multi-class clinical attributes through a Concept Bottleneck module. The resulting textual concept tokens are combined with mask-modulated visual features within an MLLM to enable structured report generation and diagnostic prediction. Experiments on BUS-CoT and IU X-ray datasets demonstrate consistent improvements in diagnostic accuracy, concept consistency, and report quality over strong general-purpose and medical MLLMs, indicating that concept-grounded reasoning better aligns generation with clinical decision processes.

cs.CV · cs.AI · cs.LG

版本更新 · v3arXiv:2409.17509

BioZero: Privacy-Preserving and Publicly Verifiable On-Chain Biometric Authentication via Homomorphic Commitments and Zero-Knowledge Proofs

Zibin Lin, Taotao Wang, Junhao Lai, Shengli Zhang, Qing Yang, Soung Chang Liew

原文摘要

Blockchain-based identity services let applications across administrative domains verify biometric authentication results without sharing a trusted biometric server. BioZero evaluates how to protect private templates while limiting on-chain execution and submitted transaction-data costs under explicit cryptographic assumptions. FullCheck provides knowledge soundness for the modular distance relation, but exhaustive coordinate checks cost 22.1 million gas at N=128 in a threshold-stand-in benchmark. SpotCheck tests a natural optimization: sampling checks within the same homomorphic structure. Checking seven coordinates saves 81.3% gas, reducing it to 4.1 million, but retains 127,844 bytes of calldata. We prove that changing one product commitment can shift the reconstructed distance to any chosen residue and evade a uniform sample of t among N coordinates with probability 1-t/N. Negligible attack success therefore requires nearly exhaustive checking, limiting the scope for coordinate-check savings. CircuitCheck changes the verification structure, proving commitment openings, coordinate ranges, and the integer distance threshold in one circuit. Its complete reference transaction costs 255 thousand gas with 356 bytes of calldata. At N=128, median proving time and process peak memory are 0.63 s and 822 MiB on the evaluated workstation. On two face datasets, every tested width of at least 6 bits stays within 0.46 percentage points of float accuracy, supporting the shared integer-input front end. These results favor CircuitCheck for the evaluated integer matching task in blockchain-backed cross-domain identity services, provided that committed probes are separately bound to authenticated live captures.

cs.CR

新论文 · v1arXiv:2610.35650

FLOWSTEP: A Framework for Learning to Predict GitHub Actions Workflow STEPs

Jiangnan Huang, Bin Lin, Yutaro Kashiwa

原文摘要

Continuous Integration and Delivery (CI/CD) are fundamental to modern software development, yet configuring pipelines such as GitHub Actions (GHA) workflows remains complex and error-prone. Recent work has explored Transformer-based models for GHA workflow recommendation, but existing approaches typically model workflow steps as a single homogeneous generation task. This formulation overlooks a key distinction: reusable Actions are structured, ecosystem-level components, whereas project-specific Scripts encode local build, test, and deployment semantics. Consequently, current models struggle to capture the different forms of knowledge required for accurate workflow completion. In this work, we present FLOWSTEP, a framework for GHA workflow step completion that explicitly distinguishes between Action and Script generation. FLOWSTEP combines large language models (LLMs) with contrastive learning to better capture semantic relationships among workflow contexts, Actions, and Scripts. Evaluated on established benchmarks, FLOWSTEP improves end-to-end workflow step prediction accuracy from 38.23% to 51.09%. Beyond prediction accuracy, we further study whether LLM-as-a-judge can provide a more semantic evaluation of generated workflow steps. By comparing LLM-based assessments with human annotations, we find that the best-performing model configuration reaches substantial agreement with human ground truth (Krippendorff's alpha = 0.701), suggesting that LLM-as-a-judge can serve as a scalable complement to manual evaluation.

cs.SE

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

JurisBench: A Deep Benchmark for Assessing Large Language Models in Professional Legal Practice

Ziang Chen Tsinghua University, Guannan Li, Fanlin Ji, Yipeng Kang National Key Laboratory of General Artificial Intelligence, Jiaqi Li Beijing Institute for General Artificial Intelligence, Muhan Zhang Peking University, Yangtao Zhang, Li Tianjiao 等 12 位作者

原文摘要

Large Language Models (LLMs) have demonstrated strong cross-domain capabilities, yet their competence in specialized professional tasks remains underexamined. Existing legal benchmarks evaluate isolated tasks or exam-style questions, failing to capture the procedural interdependencies and adjudicative rigor inherent in professional practice. To bridge this gap, we construct JurisBench, a vertical, depth-oriented, domain-specific benchmark designed to evaluate LLMs across key stages of Chinese civil litigation. JurisBench introduces a Linear Depth Simulation track that mirrors the cognitive workflow of professional judges through four sequential, dependency-aware phases: Cause of Action prediction, Focus of Disputes identification, Rationale of the Judgment generation, and Result of the Judgment determination. Results reveal an “illusion of competence”: state-of-the-art models exhibit marked performance degradation in end-to-end pipelines due to cascading error propagation. We identify precise statutory grounding as a persistent bottleneck, highlighting a critical gap between fluent linguistic output and judicial reliability. JurisBench shifts evaluation from isolated legal knowledge to workflow-level task execution, providing a diagnostic framework for legal AI and a template for benchmark design in specialized domains.

cs.CL

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