跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+479新增论文
+361其中 AI 相关
+63已有论文修订
+93新增 AI 导读

arXiv 最近完成扫描:2026-11-16 01:34 · 全站最近入库:2026-11-16 13:44各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-16 01:34最近发现新增版本:2026-11-16 13:44库内论文最新更新时间:2026-11-14 02:59

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

23,827 已收录论文19,941 AI 相关6,921 有修订112 HF 社区发现

浏览论文库

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

找到 3 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-16 01:33(北京时间)
版本更新 · v2arXiv:2605.15729

Constructing Generalizable Parallel Algorithm Portfolios for Multi-Objective Binary Optimization via General-Purpose Instance Generation

Zhiyuan Wang, Shengcai Liu, Shaofeng Zhang, Ke Tang

原文摘要

Despite progress in constructing generalizable parallel algorithm portfolios~(PAPs), no general-purpose method is yet available for multi-objective binary optimization problems~(MOBOPs) without problem-specific customization. To fill this gap, this work proposes domain-agnostic co-evolution of parameterized search for multi-objective binary optimization~(DACMO), the first general-purpose method for automatic PAP construction on MOBOPs. Its core, Unified Instance Representation~(UIR), represents and generates MOBOP instances with varying dimensions without knowledge of problem-specific instance structures. UIR separates common features of the target class from instance-specific features, preserving the common features learned from real instances during generation. DACMO co-evolves the training instances and PAP by alternating UIR-based instance augmentation with PAP updates. Experiments cover four structurally different MOBOP classes, including two black-box classes from real-world applications. Starting from five real training instances per class, DACMO constructs high-performance PAPs without problem-specific customization. On unseen instances from all four classes, these PAPs outperform portfolios of tuned classical multi-objective evolutionary algorithms and those constructed by the recent automatic PAP construction method EoH-S. DACMO also achieves overall performance comparable to the strong CEPS baseline and significantly outperforms it on two classes, without the substantial expert effort CEPS requires for problem-specific instance generator design.

cs.NE

版本更新 · v2arXiv:2608.02391

Cooperative Coevolution for Resource-Constrained Agentic LLM Post-Training

Zhiyuan Wang, Shengcai Liu, Jiahao Wu, Ning Lu, Hui Ouyang, Shaofeng Zhang, Haoze Lv, Ke Tang

原文摘要

Tool-using large language model (LLM) agents produce long, multi-turn trajectories, making gradient-based post-training memory-intensive. Evolution strategies (ES) enable memory-efficient full-parameter post-training without backpropagation and can eventually match the performance of gradient-based reinforcement learning (RL). However, resource-constrained settings typically offer only a few GPUs, so the high GPU-hour requirements of ES translate into prohibitively long training times. To address this, we introduce Cooperative Parameter-subspace Evolution Strategy (CoPES), a cooperative coevolutionary method that decomposes the full parameter space into lower-dimensional subspaces and searches over them cooperatively to improve optimization efficiency. On Qwen3.5-4B math, CoPES recovers 92% of full-parameter GRPO's validation-accuracy gain within the GPU-hour budget of GRPO's best validation checkpoint, versus 67% for standard ES. Its theoretical GPU memory requirement is less than one-eighth that of full-parameter GRPO. It consistently outperforms standard ES and LoRA-based GRPO on all evaluated pass@k metrics across five math benchmarks. CoPES's gains extend to Qwen3.5-9B with unchanged optimization hyperparameters and to multi-hop QA. These results demonstrate an improved trade-off between memory requirements and training time for agentic LLM post-training under resource constraints. The code is open-sourced in https://github.com/MetaronWang/CoPES

cs.AI · cs.LG

版本更新 · v3arXiv:2605.18599

Resolving Representation Ambiguity in Feedforward Novel View Synthesis Transformer via Semantic-Spatial Decoupling

Yihang Wu, Yihang Sun, Shaofeng Zhang, Zuxuan Wu, Junchi Yan, Xiaosong Jia, Yu-gang Jiang

原文摘要

Transformer-based models have advanced feedforward novel view synthesis (NVS). Current architectures such as GS-LRM and LVSM mix semantic information (e.g., RGB) and spatial information (e.g., Plücker rays) into a shared feature space. Since Plücker rays naturally carry lattice-like spatial structure, these designs can make the spatial bias interfere with appearance representation and degrade rendering fidelity. To this end, we propose to decouple the representation of feedforward NVS transformers into separate semantic and spatial tokens. The decoupled design keeps semantic and spatial information explicit in their branches while preserving cross-branch interaction through shared attention routing. Built on this design, we introduce optional categorized supervision and bidirectional modulation: the former provides branch-specific training signals, while the latter improves interaction between the two branches. Notably, the base decoupled design introduces virtually zero additional inference latency due to its architectural design. The proposed designs achieve consistent improvements, demonstrating effectiveness across decoder-only and encoder-decoder feedforward NVS models.

cs.CV