跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+1865新增论文
+1473其中 AI 相关
+176已有论文修订
+95新增 AI 导读

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

统计口径与数据新鲜度

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

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

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

25,692 已收录论文21,414 AI 相关7,613 有修订112 HF 社区发现

浏览论文库

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

找到 22 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-17 04:57(北京时间)
新论文 · v1arXiv:2611.21072

Sage S2.1 Flash Technical Report

Kun Cai, Haodong Chen, Guangran Cheng, Qingxiu Cheng, Xu Dai, Guanting Dong, Qiming Ge, Lixin Gu 等 206 位作者

原文摘要

We introduce Sage S1.5 Flash, a 320-billion-parameter general-purpose mixture-of-experts model designed to reason over scientific evidence and act in interactive environments. Sage Sci-Perception uses dedicated encoders for molecular graphs and biological sequences and represents spectra as ordered patches of measurements. Modality-specific projectors map these representations into the input space of a shared backbone, which processes them alongside text and images. To develop the model's agent capabilities, we construct verifiable environments for tool use, search, and coding, as well as specialized workflows involving machine learning experiments and scientific software. Task completion is checked against execution results, changes in environment state, or submitted artifacts. We evaluate Sage S1.5 Flash on 33 benchmarks across seven domains. In the primary comparison against five baselines, it ranks first on OfficeQA Pro (72.2), MLE-bench Lite (90.3 HumanRank), Harvey LAB, and SpreadsheetBench~2, and second on OSWorld-Verified (85.2), WebArena-Verified (67.6), and DeepResearch Bench~II (54.2). These results show particular strengths in using documentary evidence, producing verifiable workbooks, and carrying out machine learning tasks, alongside competitive performance in desktop and browser workflows that require the model to act on visual feedback.

cs.AI

新论文 · v1arXiv:2611.19349

SMELL: Sparsity-aware Memory Efficient Federated Fine-tuning for Long-context LLMs

Yin Xu, Yongbo Yang, He Sun, Miao Sun, Mingjun Xiao

原文摘要

Federated fine-tuning enables Large Language Models (LLMs) to collaboratively adapt to distributed private data. However, long-context fine-tuning on resource-constrained devices faces substantial challenges arising from excessive activation memory, heterogeneous token-importance patterns across clients, and communication overhead. To address these challenges, we propose SMELL, a Sparsity-aware and Memory-Efficient federated fine-tuning framework for Long-context LLMs. SMELL integrates three complementary mechanisms: Local Sparse-Forward Adaptation (LSFA), Consensus-Anchored Sparsity Coordination (CASC), and Communication-Efficient Progressive Update Recovery (CPUR). These mechanisms jointly enable memory-efficient local adaptation, heterogeneity-aware sparsity coordination, and lightweight model-update transmission. Experiments on OPT-350M and LLaMA2-7B demonstrate that SMELL reduces peak memory consumption by up to 88.35% compared with conventional fine-tuning and 13.25% compared with forward-only LoRA fine-tuning at a 16K context length. Furthermore, SMELL improves fine-tuning performance under certain non-IID settings and supports compact update transmission with progressive reconstruction, demonstrating its potential for resource-efficient federated long-context LLM adaptation.

cs.LG · cs.AI · cs.DC

版本更新 · v2arXiv:2510.22622

DeepfakeBench-MM: A Comprehensive Benchmark for Multimodal Deepfake Detection

Kangran Zhao, Xiaoyu Zhang, Yupeng Chen, Yize Chen, Weinan Guan, Bo Zheng, Yufan Liao, Chengzhe Sun 等 12 位作者

原文摘要

Audio-visual deepfakes can spread misinformation and enable impersonation, undermining trust in digital media. However, existing datasets provide limited coverage of forgery operations and their combinations, constraining detector development and systematic evaluation. We introduce Mega-MMDF, containing 100,000 real and 1.2 million forged clips across 22 pipelines spanning modality-specific manipulations, stacked forgeries, and joint audio-video generation. To assess its training value and enable fair comparisons, we develop DeepfakeBench-MM, which standardizes training and evaluation across 8 datasets and 10 detectors. Training-based detectors achieve their highest mean AUC when trained on Mega-MMDF, with gains of up to 0.0784 over the best alternative training dataset for each detector. Experiments on data scale and pipeline coverage further support the value of large, diverse training data. Cross-pipeline evaluations reveal bidirectional and asymmetric generalization. Training on composite forgeries does not necessarily enable detection of their constituent operations in isolation. Our analysis of altered inputs shows that modality masking can increase false alarms and missed detections, and temporal misalignment can raise mean predicted forgery probabilities. Together, these resources provide a foundation for understanding and improving multimodal deepfake detection, with publicly available code and dataset access subject to application and usage terms.

cs.CR · cs.CV · cs.MM

新论文 · v1arXiv:2611.14364

ARE-bench:在真实研究者会话与工作区中评测智能体的研究能力

ARE-bench: Benchmarking Agents' Research Ability in Real-World Researcher Sessions and Workspaces

Jiahang Lin, Wanying Ren, Wanghan Xu, Huayu Sha, Yang Shu, Zhonghang Lu, Chengjun Pan, Yi Dong 等 27 位作者

AI 速读 基于摘要

ARE-bench 用真实研究者的会话与未清理工作区构建 75 个任务,检验研究智能体能否在延续项目时遵守先前决策与工作区状态。

cs.CL

查看原文摘要

Research agents achieve increasingly strong benchmark scores, yet these scores do not necessarily translate into reliable delivery in ongoing research projects. Many research-agent benchmarks emphasize standalone tasks and relatively self-contained workflows in clean or curated workspaces. However, researchers ask agents to complete one step within an ongoing project, where requests depend on earlier session decisions and workspaces contain unfinished files, outdated versions, and failed attempts. We introduce ARE-bench to evaluate whether research agents advance ongoing projects while respecting prior decisions and existing workspace state, grounded in real session context and in-progress workspaces. ARE-bench includes 75 tasks built on agent sessions and full workspaces from recruited researchers' own projects, spanning seven research stages, 33 requirements, and 150 sub-requirements, with 1,173 binary checklist items in total. Each task is anchored at a real user request, preserves its requirements, and summarizes the earlier requests still in effect as background. The complete workspace is replayed to that boundary without cleanup, preserving artifacts from earlier turns. Each checklist is compiled from an intent-aligned rubric and credits any valid solution. Across seven frontier models, the strongest passes every checklist item on only 66.2% of tasks, and Design and Execution rank among the hardest stages for every model. Three models pass about 69% of tasks when only delivery contracts and general norms are checked, but just 28.4% to 40.0% once historical and material or workspace requirements are also checked. Evaluating delivery without these contextual requirements can therefore overestimate research agents and mask differences between them.

版本更新 · v2arXiv:2511.14521

A Generative Data Framework with Reliable Supervision for Underwater Image Restoration and Enhancement

Yufeng Tian, Yifan Chen, Zhe Sun, Libang Chen, Mingyu Dou, Jijun Lu, Ye Zheng, Xuelong Li

原文摘要

Learning-based underwater image restoration and enhancement rely heavily on high-quality paired training data. However, obtaining clear reference images for real underwater scenes remains challenging. Existing datasets often use the outputs of enhancement algorithms as references, which may introduce uncertainty into supervision targets. To address this issue, we propose a generative data framework that preserves clear source images as restoration references and synthesizes corresponding underwater inputs through unpaired image-to-image translation. Using representative underwater appearances to guide the translation, we construct UWNature from natural photographs. We systematically examine the reliability of the generated supervision through its agreement with real underwater appearances, structural consistency, and depth-related degradation characteristics. Experiments across 6 restoration architectures and 3 test sets evaluate its effectiveness through objective metrics, human perceptual assessment, and the correspondence between synthetic degradation and learned restoration behavior. The results demonstrate competitive restoration performance and favorable perceptual quality on real underwater images. Further analysis reveals that greater spatial plausibility of synthetic degradation does not necessarily improve restoration performance, highlighting the importance of evaluating both the intrinsic properties of synthetic data and their effectiveness for model learning. These findings support a scalable framework for constructing and evaluating reliable paired supervision for underwater image restoration and enhancement. The generated datasets are available at: https://github.com/tianyufengcn/SynUIEDatasets.

cs.CV

新论文 · v1arXiv:2611.13687

AURA: Auditory Spatial Intelligence via a Unified Representation from a General-Audio Encoder through Complete Alignment

Boyan Han, Xiaoyan Wang, Zhe Sun, Ziqi Wang, Yujun Cai, Hongli Cao, Yiwei Wang, Ming-Hsuan Yang 等 9 位作者

原文摘要

Answering spatial questions about multi-source scenes requires a model both to identify each sound and to locate it. Existing spatial audio-language models obtain spatial information from a dedicated encoder, which separates spatial and semantic processing into distinct feature spaces. We study whether a general-audio codec trained without spatial supervision can serve both purposes. A controlled layer-wise analysis shows that the frozen codec retains spatial information, with lateral cues carried by the difference between the two ear channels. This information, however, is not readily accessible: in dual-source scenes, a model trained on these features predicts left/right at chance and, on the remaining axes, assigns the detected direction to the queried and the non-queried source equally often. We attribute this failure to an audio--text information asymmetry, in which the audio contains both sources while the answer describes only the queried one. A controlled $2\times2$ experiment shows that either completing the scene description or exposing the inter-channel difference lifts left/right accuracy above chance, whereas binding directions to the queried source requires both. Building on these findings, AURA keeps the codec and the language model frozen and exceeds the strongest dedicated system on SpatialSoundQA by 10.31 points in dual-source direction accuracy, with about 40\% of its trainable parameters.

cs.SD · cs.AI

版本更新 · v2arXiv:2609.39164

Quantum-Inspired Score-Based Variational Inference

Yuchen Cong, Zerui Tao, Chao Li, Zhe Sun, Qibin Zhao

原文摘要

Score-based variational inference (SBVI) provides an alternative to classical Kullback--Leibler (KL)-based variational inference by learning a distribution using only score queries of the target. EigenVI~\cite{cai2024eigenvi} formulates SBVI as an eigenvalue problem, but faces two limitations: the number of variational parameters grows exponentially with the data dimension, and the single-eigenvector formulation cannot represent the full minimum-eigenvalue eigenspace. We propose QuanVI, a quantum-inspired SBVI algorithm that addresses both limitations. Rather than selecting a single eigenvector, QuanVI captures a learned subspace through a density-operator formulation. To enable scalable computation, \model{} employs a matrix-product-operator (MPO) structure parameterized by a quantum tensor network (QTN) with unitary-constrained local tensors and auxiliary ancilla wires. Numerical experiments demonstrate the scalability of QuanVI beyond EigenVI and competitive performance on synthetic distributions and Bayesian posterior-approximation benchmarks, including challenging non-Gaussian targets. The code is available at https://github.com/ChaoLiAtRIKEN/quanvi.

cs.LG

版本更新 · v2arXiv:2606.26289

Augmentation with Dilution? A Large-Scale Empirical Study of Human Contributor Ecosystems After AI Coding Agent Adoption

Weixing Zhang, Bowen Jiang, Tianhai Liu, Jialong Li, Anne Koziolek

原文摘要

AI coding agents are rapidly proliferating in open-source software development, and the long-term sustainability of open-source projects is closely tied to the health of their human contributor ecosystems. Yet most existing studies treat human contributors as a static backdrop, and the available evidence on human participation after agent adoption mainly concerns newcomer outcomes. This paper takes the human contributor ecosystem as its dependent variable. To the best of our knowledge, it is the first study to estimate how agent adoption changes the number of distinct humans behind each pull request, and to relate this change to agent pull requests recorded under developer accounts. Using the AIDev dataset, GitHub API scanning, agent-trace screening, and two-stage propensity score matching, we construct a balanced panel of 2,246 treated and 3,798 control repositories from January 2023 to May 2026, and estimate effects with the Sun-Abraham estimator for staggered difference-in-differences, event studies, and HonestDiD sensitivity analysis. AI agent adoption is associated with a decline in human contributor density of 0.019 to 0.048, about 4-10% of its pre-adoption level, depending on the reference month (both p < 0.01); because this estimate tolerates only small violations of parallel trends, we regard it as suggestive evidence. The share of newcomers shows no detectable change (ATT = -0.009, p = 0.28), with the 95% confidence interval ruling out a decrease of more than 2.4 percentage points. Whether the decline in density is associated with agent pull requests recorded under developer accounts remains inconclusive (high minus low share: -0.013, 95% CI [-0.083, 0.057]). These findings are consistent with a pattern of augmentation with dilution: we detect no decrease in the share of newcomers, but each human contributor appears to correspond to more pull requests.

cs.SE

版本更新 · v3arXiv:2511.18811

Adaptive Test-Time Memory Allocation for Long-Tailed Human-Object Interaction Detection

Yuqiu Jiang, Xiaozhen Qiao, Yifan Chen, Ye Zheng, Zhe Sun, Xuelong Li

原文摘要

Long-tailed human-object interaction (HOI) detection remains challenging because rare interactions are sparsely represented in training data. Although test observations provide additional visual evidence, existing cache-based methods typically assign uniform memory capacity across classes, limiting their ability to capture informative features of underrepresented interactions. To address this issue, we propose Adaptive Diversity Cache (ADC), a training-free, plug-and-play framework that adaptively constructs test-time caches through frequency-aware capacity allocation and confidence-diversity joint sample selection. Specifically, Frequency-Aware Cache Adaptation assigns larger capacities to underrepresented interactions using frequency-dependent priorities and a weighted logarithmic allocation objective, and fills remaining slots with selected augmented views. Confidence-Diversity Joint Cache Selection further combines prediction confidence with local feature diversity to retain informative cache entries. Cache retrieval then refines the predictions of the frozen detector. Experiments on HICO-DET and V-COCO across three base detectors demonstrate consistent improvements. On HICO-DET, ADC improves mean average precision (mAP) for rare interactions by 4.02--8.57 percentage points, while also improving performance on non-rare interactions. Online adaptation further achieves gains of 2.87--7.36 percentage points on rare interactions. These results demonstrate that adaptive test-time memory effectively complements existing HOI detectors and improves long-tailed detection performance.

cs.CV · cs.AI

版本更新 · v4arXiv:2608.00137

RPL-UIE: Reference-Guided Prior Learning for Content-Preserving Underwater Image Enhancement

Yifan Chen, Jijun Lu, Ye Zheng, Kaichen Chi, Zhe Sun, Tao Chen

原文摘要

Underwater image enhancement (UIE) aims to recover clear images from observations degraded by wavelength-dependent absorption, scattering, and spatially nonuniform degradation. Although existing generative methods can handle complex degradations, they may still generate visually appealing results while compromising content preservation, thereby degrading downstream visual perception. To improve content preservation, we extract spatial priors characterizing appearance and photometric properties from ground-truth images to provide stable guidance for enhancement. To bridge the gap between training with ground-truth references and inference without references, we propose reference-guided prior learning for underwater image enhancement (RPL-UIE), a two-stage teacher-student framework. The teacher network extracts stable priors from ground-truth images, while the student network takes only degraded images as input and learns to mimic the teacher's prior extraction capability. We further design Residual Prior Refinement Diffusion (RPRD) and Frequency-Aware Prior Residual Calibration (FPRC) to reduce the prior discrepancy between the teacher and student. RPRD progressively predicts corrections in the residual space, while FPRC preserves stable low-frequency residuals and selectively modulates high-frequency details. Experiments on multiple underwater image datasets show that RPL-UIE achieves competitive enhancement performance. For the engineering application of underwater visual perception, downstream object detection and instance segmentation experiments show that RPL-UIE improves visual quality while better preserving object structures and semantic content needed for reliable perception. Tests on real-world data collected by a custom-built remotely operated vehicle (ROV) further demonstrate its effectiveness and practical applicability.

eess.IV · cs.CV

新论文 · v1arXiv:2611.06364

Estimating the Volume of a Union of Convex Bodies

Eeshan Banerjee, Aranya Kumar Bal, Debabrota Basu, Sourav Chakraborty, Debarshi Chanda, Uddalok Sarkar

原文摘要

The \textit{Union Volume Estimation problem}, i.e. yielding an $(\varepsilon, δ)$-approximation of the volume of the union of convex bodies, is a classical problem in computational geometry and formal methods. In this paper, we first detect where and why the efficient union volume estimators with approximate sampling and PAC volume estimation oracles fail. Specifically, we show that having only TV-distance guarantees on the approximate sampler does not suffice, and demonstrate this bottleneck by constructing the sunflower families of convex bodies. In this context, we propose the concept of \textit{tail-controlled samplers} that can yield with high-probability almost-$\ell_{\infty}$ closeness. Secondly, we leverage this concept to propose a generic algorithmic framework \texttt{Alpona} that properly combines a PAC volume computation and approximate point sampling oracles with tail-controls to yield an $(\varepsilon, δ)$-estimate of the union volume for any collection of convex bodies. We show that \texttt{Alpona} needs only linear (in number of convex bodies) oracle calls to be $(\varepsilon, δ)$-correct. Finally, we provide a tail-controlled analysis of the Hit-and-Run sampler~\citep{lovasz2006fast}. We further provide a novel geometric analysis to improve the required walk length of Hit-and-Run. We further instantiate \texttt{Alpona}'s correctness for the sparse frequency streams of convex bodies: a special case of the union volume estimation problem where no convex body intersects more than $τ$ many other bodies.

cs.DS

新论文 · v1arXiv:2611.06008

Faster Cluster Decomposition with Stronger Bi-Criteria Guarantee

He Sun, Yong Zhang, Yacong Zhou

原文摘要

Partitioning the vertex set of a graph $G=(V,E)$ into clusters is a classical problem in computer science. As vertices within clusters should be well connected and cuts between clusters sparse, Oveis Gharan and Trevisan (SODA 2014, [OGT14]) proposed to measure the partition quality using inner and outer conductance, i.e., the bi-criteria guarantee. Specifically, when partitioning $V$ into vertex-disjoint subsets $P_1,\ldots, P_k$, every subgraph induced by $P_i$ should have high conductance, while the conductance of $P_i$ in $G$ should be low. They studied the existence of such a partition and designed a polynomial-time algorithm achieving this guarantee. For more than a decade, their algorithm remained the only one achieving this guarantee on its output clusters. In this paper, we study faster cluster decomposition algorithms under the same setup as [OGT14] and prove three results: 1. We make their existential result algorithmic: Our algorithms run in nearly-linear time, and achieve the same bi-criteria guarantee as the one in [OGT14] up to constant factors, including the asymptotically tight dependence on $k$. 2. We prove that their existential result holds algorithmically under a much weaker condition on the initial disjoint subsets. To achieve this, we develop a general algorithm framework that boosts the approximation guarantee of a solution: given an $α$-approximate solution to the $k$-way conductance problem, if $ρ_G(k+1)/ρ_G(k)=Ω\left(α/\varepsilon\right)$, then a $(1+\varepsilon)$-approximate solution can be obtained using only $O(k(1+\logα))$ minimum $s$-$t$ cut computations. 3. We present a nearly-linear time algorithm that finds clusters with the bi-criteria guarantee. Our algorithm has the same guarantee as the one in [OGT14], which, for any unweighted graph of $n$ vertices and $m$ edges, runs in $\widetilde{O}(knm^2)$ time.

cs.DS

新论文 · v1arXiv:2611.04226

DiMuRe: Diagnosis-Guided Multilevel Recovery for Robotic Task Execution

Renkai Yi, Yuwei Wu, Haoyu Zhang, Penghao Dai, Zhi Gao, Jin Chen, Che Sun

原文摘要

Disturbances can invalidate the conditions required by a robot's next action even when much of its task program remains useful. A recovery system must therefore choose a response suited to the current state. We present DiMuRe (diagnosis-guided multilevel recovery), a framework for robot-use agents that uses phase-specific evidence and method preconditions to select program reuse or predefined recovery skills, including bounded vision-language-action (VLA) grasping. After the original program exits, a multimodal large language model (MLLM) can generate corrective code from images and execution feedback. Local verification checks the outcome of each recovery attempt. We also introduce LIBERO-Disturb, a benchmark for robustness and recovery under mid-execution disturbances, supporting program-based agents and VLA policies. On 801 scheduled disturbed Encore development cases, Local DiMuRe (program reuse and recovery skills) achieves 77.65% complete-task success, compared with 58.68% for the original program under the same physical-step allowance. Full DiMuRe achieves 81.90% with terminal replanning, an additional step allowance, and early handoff. Local DiMuRe also uses fewer physical steps per scheduled episode than the original program.

cs.RO · cs.AI

新论文 · v1arXiv:2611.03729

Learning to read residual images for single-pixel photography

Hongjun An, Shuaizhe An, Tong Tian, Zhe Sun

原文摘要

Continuous video scales in cost with camera count, resolution and recording duration, yet many monitoring tasks seek events rather than complete images and can operate on a compact single-pixel measurement stream. Recovering a chosen interval as video is then desirable, but at 0.24\% of the pixel count the scene correlation image looks like noise and per-clip optimization takes minutes. Correlating the residual of an estimate with the coding patterns nevertheless gives a residual image, the gradient of a centered measurement loss. Lifted through a pretrained video decoder, its agreement with the true error exceeds that of control decoders. Video-latent inversion (VLI) then outperforms frame-wise image-latent reconstruction at 1{,}000 bucket values. Measurement-Gradient-Conditioned Video Flow (MGV-Flow), trained once to read the lifted residual image with preceding frames, reconstructs five frames in 1.55\,s at 22.9\,dB median PSNR, against 398\,s and 18.1\,dB for VLI, with the largest gains in high-motion scenes. Directional fidelity ranks 30 coding configurations and selects one needing a third fewer bucket values. On a physical system, MGV-Flow outperforms per-frame reconstruction without retraining. A sliding window over the bucket-value stream yields 3.2 frames per second on one RTX~4090 and, in theory, 20 frames per second on a data-centre accelerator. Demonstrations are available at https://cavedweller509.github.io/MGV-Flow.

eess.IV · cs.AI

新论文 · v1arXiv:2610.37927

Machine learning applications in the heliosphere

Vishal Upendran, Banafsheh Ferdousi

原文摘要

Space weather is the study of the near-Earth impact of the processes on the Sun. In a this era of technology, space weather emerges as a crucial area of study wherein the state of the near-Earth conditions need to be modeled and forecasted. Crucially, the advent of machine learning provides us with opportunities to study this subject in a rather comprehensive manner. In this chapter, we treat the the processes arising from Sun to the impact on the ground as a set of coupled systems, which can be studied in isolation or in a coupled manner. We define these individual systems in terms of their state vector $\vec{S}$, which provides us with an opportunity to define the physical variables determining the system. This also allows us to consider the systems in terms of their observables, obtained through the action of operators as $\vec{O}[\vec{S}]$. In such a formalism, the machine learning algorithms serve as {\it learned operators}, defined generally as inference ($\mathcal{I}$), propagation ($\mathcal{P}$), and emulation ($\mathcal{E}$). Through such a formalism, we present how machine learning helps advance our understanding of the physical systems under study, while also accelerating the development of operational models for space weather forecasting.

astro-ph.SR · cs.LG · physics.space-ph

新论文 · v1arXiv:2610.37640

Partially Edited Audio: Generation, Defense, and Open Problems

Lin Zhang, You Zhang, Nicholas Evans, Xin Wang, David Harwath, Abhinav Dhall, Bowen Shi, Chengzhe Sun 等 10 位作者

原文摘要

Recent advances in generative audio models facilitate increasingly flexible and selective editing of linguistic content and paralinguistic, extralinguistic, and other attributes. This paradigm, named partially edited audio, differs from full audio generation as only portions of the real recording are edited. This technique can serve both beneficial and harmful applications. We therefore present a concise survey from both generation and defense perspectives, focusing on audio, as a contribution to the ICASSP 2027 special session entitled "Partially Edited Media: Perspectives from Synthesis and Defense." We first define partially edited audio and argue that what counts as ``fake'' or harmful is an application-dependent judgment, not a fixed property of the edit. We then survey audio editing by editing target, approaches, and evaluation, and then defense methods by detection, localization, diarization, and interpretability, summarizing representative benchmarks and toolkits. Finally, we discuss future directions and open problems.

cs.SD · eess.AS

新论文 · v1arXiv:2610.37080

Tessera: Structure-Completed Evidence Units for Web Retrieval-Augmented Generation

Peichun Hua, He Sun, Zirui Zhuang, Qi Qi, Yiming Qiu, Shinan Liu, Yunming Xiao

原文摘要

Web retrieval-augmented generation (RAG) splits a page into fixed-size text chunks or, in recent visual pipelines, screenshot tiles, and the retrieved item serves at once as the unit of indexing, ranking, and reading. We trace answer evidence from source HTML to reader input over the full English Wikipedia and find that this coupling loses evidence in text and screenshot pipelines alike: evidence present in the source page often fails to reach the reader intact, particularly structured content such as tables and infoboxes, which chunking separates from the headers and context that give it meaning. Stronger extraction, context expansion, and larger reader budgets leave the loss in place. We present Tessera, a training-free evidence delivery layer that decouples what a pipeline retrieves from what its reader reads. Given the pages behind any ranked list, Tessera rebuilds their HTML into fine-grained evidence units, each completed with its page title, section path, and table headers, selects the units relevant to the query, and packs them into the reader context at an unchanged token budget. The index, the retriever, and the reader stay as they are, so Tessera applies to text, screenshot, and agentic pipelines. Across three question answering benchmarks, Tessera improves answer accuracy by 5 to 6 points on text and screenshot pipelines, consistently across readers, retrievers, and reader budgets, and outperforms strong HTML-aware and structure-aware RAG baselines under matched budgets. The gains carry over to multi-step agentic search. Our code is publicly available at https://github.com/sarendis56/Tessera.

cs.IR

新论文 · v1arXiv:2610.36639

Whether Is Not When: Separating Occurrence from Timing in Polymarket Prices

Sizheng Fan, Yinghe Sun, Rong Zhao

原文摘要

Prices formed by Web users on Polymarket, a blockchain-based prediction market, are now cited in the news and in a U.S. Army intelligence bulletin as early warnings of geopolitical events. However, it remains unclear whether these prices can serve as such warnings. This cannot be judged from accuracy, because most markets resolve No and accuracy can remain high even when many of the events that did happen are missed. In this paper, we study this question from two aspects, using all 1.24 billion on-chain trades in 2.37 million Polymarket markets through September 2026. First, from 3,686 markets on geopolitical conflicts, we derive 208 unscheduled events that did happen and measure how far in advance prices move before the first Web report of each event. Second, we separate the information in prices about whether an event happens from the information about when it happens. To do so, we group 1,551 contracts into 338 deadline ladders and read each ladder as one forecast of the event date. We then split its log score, and the profit of 9.3 million trades by 491,000 accounts, exactly into these two parts. We find that one day before they were reported, prices correctly predicted only 56% of the geopolitical events but all 51 scheduled central-bank decisions. Separating the two parts shows that only about one eighth of the information in prices concerns timing. A small group of large accounts earns timing profits, but beyond current prices, no group of accounts helps predict an event within days. A high price is therefore a sign that an event is likely rather than imminent. Near-term warnings read from the whole ladder are more often right than those read from a single contract. Platforms should report recall alongside accuracy, and show near-term probabilities read from the whole ladder.

cs.CY

版本更新 · v2arXiv:2610.19746

One-shot Human Video-Guided Adaptation for Vision-Language-Action Models

Qi Chen, Yuwei Wu, Quan Chen, Kunpeng Gao, Jin Chen, Che Sun, Zhi Gao, Yunde Jia

原文摘要

Vision-language-action (VLA) models have recently achieved remarkable progress by leveraging large-scale robot datasets and foundation models for general-purpose robot manipulation. However, their ability to rapidly adapt to novel manipulation tasks beyond the training distribution remains limited. Existing approaches often require task-specific robot demonstrations and additional training, which are labor- and compute-intensive, limiting the scalability of VLA adaptation to open-world scenarios. To reduce this dependence on target-task robot data, we propose CapPro, a framework that enables a VLA policy to adapt to previously unseen manipulation tasks using only a single human demonstration video. CapPro consists of two components. First, a phase-aware human video representation module constructs a compact video representation through learned visual token selection and learns task-relevant query representations under phase-caption supervision. Second, a video-conditioned adaptation module jointly incorporates the compact video and query-derived representations into the action-conditioning context of the pretrained VLA policy. % This design introduces task-specific guidance while largely preserving the original VLA action-generation backbone. In this way, the human demonstration provides task-specific execution guidance rather than an embodiment-aligned trajectory to imitate, without requiring target-task robot demonstrations or target-task fine-tuning. Experiments across source and unseen target tasks show that CapPro improves average performance across unseen target groups while maintaining comparable performance on the source tasks. These results demonstrate the effectiveness of human-video guidance for cross-task VLA adaptation.

cs.RO

新论文 · v1arXiv:2610.34687

Machine Learning Applications in the Solar Interior and Atmosphere

Vishal Upendran, Carlos J. Díaz Baso

原文摘要

The solar interior and atmosphere constitute a strongly coupled, multiscale dynamical system defined by continuous temporal evolution. Predicting the state of this system requires modeling physical interactions that span disparate spatial and temporal scales, constrained by heterogeneous and sparse data. This chapter formalizes the Sun within the mathematical framework of dynamical systems theory, defining a global state vector ($\vec{S}$) governed by thermodynamical, kinetic, and magnetic properties. Because solar observations represent projected, multi-modal, and partially observable measurements ($\vec{O}[\vec{S}]$) of this hidden state, pure physics-based deduction is fundamentally constrained. We present a unifying thesis: the primary role of machine learning in heliophysics is to act as a structured family of mathematical operators---specifically Inference ($\mathcal{I}$), Emulation ($\mathcal{E}$), Propagation ($\mathcal{P}$), and Control ($\mathcal{C}$)---that reconstruct, simulate, and couple this global state vector across disparate physical layers. By framing the vast, multi-disciplinary literature within this unified state-space taxonomy, we demonstrate how data-driven techniques bridge observational gaps to resolve hidden multiscale couplings and dramatically accelerate the simulation of non-linear processes, establishing a rigorous pathway to predict the global evolution of the Sun.

astro-ph.SR · astro-ph.IM · cs.LG

新论文 · v1arXiv:2605.16191Google Research

Optimized Three-Dimensional Photovoltaic Structures with LLM guided Tree Search

Michael P. Brenner, Lizzie Dorfman, John C. Platt

原文摘要

We present a case study for how AI coding systems can be used to generate novel scientific hypotheses. We combine a generic coding agent (Google's AntiGravity) with an LLM-driven tree search algorithm (Empirical Research Assistance / ERA) to autonomously generate high-efficiency three-dimensional photovoltaic (3DPV) structures that overcome losses limiting flat solar panels at mid-latitudes. These structures operate by presenting favorable angles to the sun throughout the day, and for illustrative purposes we focus on optimizing performance for a single solar day. Our workflow begins by using AntiGravity to reproduce calculations \cite{bernardi2012solar} showing that 3DPV can have energy densities much higher than stationary flat PV panels. We use these initial designs as the starting point for large scale tree search, where we seek improved solutions and score them for their diurnal yield. The initial tree search leads to nominally more efficient solutions, yet they are caused by algorithmic reward hacking, arising from non-physical design features such as structurally levitating disconnected tiers and exploitations of the discretizations in the optics solver. To counteract this, we develop a workflow where the coding agent iteratively patches the physics engine with constraints to eliminate reward hacking. With reward-hacking eliminated, ERA discovers a series of designs with various constraints and improved performance, including optimal designs with different fixed collector areas, optimizing zenith tracking and avoiding self shadowing. Combining coding agents with tree search (ERA) provides a powerful platform for scientific discovery, for problems whose solutions can be empirically evaluated with a score function.

cs.CL · cond-mat.other · physics.comp-ph

首次观测 · 记录 #1CVF · CVPR 2026:cvf:dda52b9acb5b95c11ee00d522885e78aCVF · CVPR 2026

Global Underwater Geolocation from Time-Lapse Polarization Imagery

Aghajanzadeh, Sara, Bai, Xiaoyang, Zhu, Zhongmin, Forsyth, David, Gruev, Viktor

原文摘要

It is extremely hard for an underwater agent to know where it is. Satellite signals disappear within centimeters of the surface; acoustic baselines require heavy infrastructure to instrument small regions. The polarization of the sky, visible underwater, reveals the elevation of the sun. The pattern of elevation over the day reveals location to an agent with a clock. However, recovering elevation from polarization images is very difficult. State-of-the-art (SOTA) geolocalization methods can localize well for locations where they have seen data, but accuracy collapses when the data comes from a new location. Our physics-guided synthesis pipeline expands a huge library of polarization images from a small set of sites to 2.8 million solar-elevation-matched training sequences spanning latitudes, seasons, and water types. A compact two-stage transformer reconstructs the solar-elevation curve and predicts geolocation. Under leave-one-site-out tests, the site averaged median geodesic error is 500km--about an eightfold improvement over previous deep-learning baselines; with limited target-site data, the median error contracts to single-digit kilometers.

cs.CV

Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition · 2026 · 正式发表