跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+1084新增论文
+883其中 AI 相关
+130已有论文修订
+94新增 AI 导读

arXiv 最近完成扫描:2026-11-18 04:28 · 全站最近入库:2026-11-18 19:45各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-18 04:28最近发现新增版本:2026-11-18 19:45库内论文最新更新时间:2026-11-18 08:00

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

26,870 已收录论文22,374 AI 相关8,156 有修订112 HF 社区发现

浏览论文库

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

找到 8 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-18 04:27(北京时间)
版本更新 · v2arXiv:2610.13547

MOSAIC: Learning Object-Centric Structural Representations for Remote Sensing Image Super-Resolution

Liuqian Wang, Hanyu Xie, Rongzhen Zhao, Qi Ming, Chunjie Ma, Wentao Chao, Yufei Gao, Chengming Liu 等 9 位作者

原文摘要

Remote sensing image super-resolution (RSISR) requires faithfully reconstructing small foreground objects, multi-scale structures, and repetitive spatial patterns from degraded observations. Despite recent advances in generative super-resolution, existing methods often rely on dense low-resolution (LR) conditioning, which can entangle salient foreground structures with dominant backgrounds and insufficiently exploit complementary structural evidence across scales and samples. To address these limitations, we propose MOSAIC, an object-centric structural representation learning framework that complements dense spatial conditioning with compact structural guidance for generative RSISR. Specifically, MOSAIC extracts object-centric structural slots to emphasize salient foreground evidence, adaptively integrates stable cross-scale structures with fine-grained details to address substantial scale variation, and exploits recurring spatial patterns through image-guided retrieval from a shared prototype memory. The resulting representations combine image-specific evidence with shared structural priors to provide scene-level guidance for faithful reconstruction. Extensive experiments on UCMerced, AID, and RSSCN7 demonstrate consistent PSNR improvements across $\times 2$ and $\times 4$ settings, with gains of 2.07, 4.54, and 1.49 dB over DiT4SR at $\times 4$, respectively, alongside favorable LPIPS results and improved structural preservation. The code will be publicly released.

cs.CV

新论文 · v1arXiv:2611.22898

You Only Encode Once: Sub-Pixel-Shifted Frames for Arbitrary-Scale Remote Sensing Super-Resolution with 2D Gaussian Splatting

Canjie Liu, Liuqian Wang, Qi Ming, Wei Lu, Xiaohan Hao, Yuefei Wu, Wentao Chao, Lei Shi

原文摘要

Arbitrary-scale super-resolution (ASSR) of remote sensing images remains challenging due to the limited high-frequency information in a single low-resolution (LR) observation. While multi-frame SR can exploit complementary sub-pixel information, existing approaches often require real multi-frame training sequences and repeated feature encoding, increasing data acquisition demands and computational costs. To address these limitations, we propose SPS-GS (Sub-Pixel-Shifted Gaussian Splatting), an encode-once framework that learns from multi-phase LR observations synthesized from individual high-resolution images, without requiring real multi-frame training sequences. Specifically, Phase-Coherent Aliasing Demodulation (PCAD) exploits shift-dependent aliasing through Fourier-based alignment, phase-aware residual fusion, and least-squares aliasing estimation, enabling multi-frame information to be integrated before a single deep encoding pass. Gaussian Projection Alignment (GPA) then iteratively refines Gaussian centers and colors using multi-observation back-projection to promote observation consistency. The refined Gaussians support continuous rendering at arbitrary scales. Extensive experiments on five remote sensing datasets demonstrate strong reconstruction performance against single-image and multi-frame SR baselines, while maintaining competitive inference efficiency at common scales. The code will be publicly released.

cs.CV

版本更新 · v2arXiv:2611.01074

Grounding Across Views: Cross-View Referring Reasoning for Visual Grounding

Hao Gan, Liuqian Wang, Zhuping Hu, Yufei Gao, Wentao Chao, Chong Fu, Shuang Li, Chengming Liu 等 9 位作者

原文摘要

Cross-view object geo-localization (CVOGL) aims to identify a query-view target in a satellite image, yet reliable instance grounding remains challenging under substantial viewpoint discrepancies. Although recent methods incorporate multimodal prompts, they insufficiently address the varying transferability of linguistic and visual evidence across views. Viewpoint-dependent descriptions (e.g., building facades visible in oblique UAV views but not in top-down satellite images) may become unreliable for satellite grounding, while visually similar instances further complicate target identification. To address these challenges, we rethink CVOGL from a visual grounding perspective and propose GAV (Grounding Across Views), a view-aware framework for constructing target-centered evidence and establishing discriminative cross-view correspondence. Specifically, view-aware referring reasoning mitigates viewpoint-dependent ambiguity, multi-token exemplar prompting and contrastive alignment strengthen visual-semantic correspondence, and scene-level supervision with alignment-based verification distinguishes competing satellite instances. We further introduce CVOGL-Text, a street- and drone-to-satellite benchmark with query-derived expressions. GAV achieves state-of-the-art performance on MoP-UAV with 62.55% Acc@0.5 (+18.19 percentage points) and outperforms evaluated click-point baselines on CVOGL-Text.

cs.CV

新论文 · v1arXiv:2611.22195

Haptic Probing for Subsurface-Aware Force Distribution on Layered Soft Tissue

Lei Shi, Xiaoyu Wang, Cheng Zhou, Yongjian Liu, Jing Wang, Dongsheng Zhang, Yonghui Zhu, Xiong Li

原文摘要

Force-regulated contact with layered soft tissue fails most often where the subsurface composition changes: controllers infer the substrate from the loading signal alone, so the estimate guiding them lags the change---more acutely, we argue, over compliant than over bone-backed tissue. We remove that lag with a separate haptic channel. Under a light preload, a brief low-amplitude excitation lets the local dynamic admittance discriminate muscle from bone-backed tissue relative to a per-subject baseline, before task force is applied---active haptic sensing used to commit a control decision rather than to characterise tissue. A force- and tactile-driven distribution law then consumes that regime throughout execution: an instantaneous allocation equalises pressure across the engaged fingertips, while the regime sets the admissible pressure and hence the area the hand must recruit to deliver the target force---making patch area a controlled variable rather than a by-product. Probing, switches and recruitment are priced in a partitioned passivity budget, so safety monitoring cannot suppress the probe and a refused recruitment forfeits force tracking rather than the pressure bound. We report force tracking and pressure uniformity over curved, migrating contact on three human subjects, with regime labels from anatomical landmarks.

cs.RO

新论文 · v1arXiv:2611.13784

Marrying Capacity and Precision for Efficient 2D Gaussian Image Representation

Lin Dong, Qi Ming, Liuqian Wang, Wentao Chao, Yufei Gao, Chengming Liu, Lei Shi

原文摘要

2D Gaussian representations provide an explicit and efficient way to represent images, but their rate-distortion performance under limited budgets depends critically on how Gaussian capacity and parameter precision are allocated. Existing methods typically optimize these two resources separately, overlooking content-dependent capacity demands and heterogeneous quantization sensitivity. We present CP-GS, a capacity-precision coupled Gaussian splatting framework for budget-aware 2D Gaussian image representation that jointly optimizes capacity allocation and attribute precision under a shared rate constraint. CP-GS first constructs a content-adaptive Gaussian representation by dynamically reallocating a fixed Gaussian budget from redundant regions to areas with higher representation demand. It then introduces hierarchical distortion-aware representation quantization, using efficient rendering-based calibration to allocate precision across Gaussian attributes and further refine it within heterogeneous attribute groups. Finally, it jointly optimizes Gaussian capacity and attribute precision by constructing candidate representations with different Gaussian counts and precision configurations and selecting operating points according to decoded distortion and actual serialized size. Experiments on DIV2K and Kodak show that CP-GS achieves improved rate-distortion performance over representative 2D Gaussian and implicit neural representations across a range of budgets, while maintaining a fixed overall representation budget and low optimization cost. These results demonstrate the benefit of jointly optimizing spatial capacity and parameter precision for compact Gaussian image representation.

cs.CV

新论文 · v1arXiv:2611.02644

Coati: Host-Grounded Execution for Installable Mobile GUI Agents

Yudou Ying, Pu Shi, Hanlei Shi, Yuhua Zheng

原文摘要

Mobile GUI agents can carry out tasks across apps, yet most run on a separate computer that drives a phone over the Android Debug Bridge (ADB), out of reach of ordinary users and of the apps through which most people reach Web services. We present Coati, a source-available agent that users install as an Android app. Its runtime on the phone, the host, records what a model alone cannot see: the effect of each action at its target, result screens across apps, and the progress of repeated steps. VerifyLoop checks action outcomes and completion claims against host evidence and reports a completion it cannot audit as unverified. AppMemory builds per-app procedural memory from observations that the interface supports and reuses it on later visits. A routed fast executor lets a lightweight selection model take simple, confident steps and lets the host repeat loops of simple steps that the large model plans once. On all 116 AndroidWorld tasks, with Gemini 3.8 Flash as every agent's backbone, Coati succeeds on 86.5% of the tasks over three trials, ahead of the strongest open-source agent Artemis (77.6% with the same accessibility-only access, 76.5% even when allowed ADB) and far ahead of FinalRun and Midscene (about 59%), and VerifyLoop cuts false completion claims by about a third at comparable success. In everyday use, the fast executor cuts the median time of phone tasks by 39% at comparable success and runs three of four loop tasks 2.8-5.4x faster with 6-9x fewer model tokens, while AppMemory shortens a repeated deep route in an unfamiliar app from 18.5 steps to 6-7. On an Android 16 phone, routed execution completes all 27 benchmark runs with 76% fewer Reasoning calls on the critical path. Host evidence, not model self-assessment, makes an installable agent reliable and fast.

cs.MA

新论文 · v1arXiv:2610.36854

Boundary Geometry Determines Optimal Shallow ReLU Approximation under Weighted Coefficient Constraints

Jia-Qi Yang, Lei Shi

原文摘要

We study how boundary geometry affects $L^q$ approximation by shallow ReLU neural networks on convex bodies $K\subset\mathbb R^d$. The target classes are unit balls of weighted variation spaces that can enlarge classical spaces by incorporating domain geometry into constraints on output coefficients. We establish upper and lower bounds for arbitrary convex bodies and determine the optimal polynomial approximation exponents for all planar convex bodies and their products with polytopes, including cubes and circular cylinders. For $C^2$ convex bodies, we determine the optimal exponents in a dimension-dependent range of $q$ extending beyond $2$. When all principal curvatures are positive, the result extends to every finite $q\ge2$. For these classes, the dependence of the optimal exponent on the domain is captured by a single geometric growth exponent associated with small boundary caps. We also identify sharp weight thresholds for retaining the classical approximation exponent and improve previous weights on Euclidean balls while preserving the classical $L^2$ approximation rate. When the target is given as a finite ReLU network, the upper bounds can be realized by a compressed network using only the original neurons, without increasing the weighted coefficient sum. These results show that boundary geometry can change the optimal exponent even when dimension, error norm, and weighting rule are fixed.

stat.ML · cs.LG · math.FA · math.MG

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

GeoRA: Geometry-Aware Low-Rank Adaptation for RLVR

Jiaying Zhang, Lei Shi Meituan, Jiguo Li, Jun Xu Meituan, Jiuchong Gao, Jinghua Hao, Renqing He

原文摘要

Reinforcement Learning with Verifiable Rewards (RLVR) is a key paradigm for improving large-scale reasoning models. Unlike supervised fine-tuning (SFT), RLVR exhibits distinct optimization dynamics and are sensitive to the preservation of pre-trained geometric structures. However, existing parameter-efficient methods face key limitations in this regime. Low-rank adaptation methods, such as PiSSA, are primarily designed for Supervised Fine-Tuning (SFT) and do not account for the distinct optimization dynamics and geometric structures of RLVR. Conversely, directly fine-tuning the unstructured sparse parameter subspace favored by RLVR encounters efficiency bottlenecks on modern hardware. To address these challenges, we propose GeoRA (Geometry-Aware Low-Rank Adaptation), a low-rank adaptation method tailored for RLVR. Specifically, GeoRA exploits the anisotropic and compressible structure of RL update subspace, and extracts its principal directions via Singular Value Decomposition (SVD) to initialize low-rank adapters, while freezing residual components as a structural anchor during training. This design preserves the pre-trained structure and enables efficient dense computation. Experiments on Qwen and Llama models from 1.5B to 32B parameters show that GeoRA consistently outperforms strong low-rank baselines across RLVR settings in mathematics, medicine, and coding, while showing stronger generalization and less forgetting on out-of-domain tasks.

cs.CL

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