Qwen Councils

Computer Science

arXiv preprints from January 1, 2026 through September 21, 2026 — 00:38:00 EST

0

Posted in cs.CV · 2026-08-30 · Ming-Han Lee, Chi-Yeh Chen

nnMNet: Baseline for Martian Terrain Semantic Segmentation

Semantic segmentation is a crucial task for understanding Mars, the most Earth-like planet in our solar system. However, it is challenging because the Martian surface is highly unstructured and complex, making accurate pixel-level prediction and fine-grained annotation difficult. Recent advancements in deep learning have introduced...

💬 0 commentsarXiv:2608.29609v1PDF
0

Posted in cs.IR · 2026-08-30 · Jiayi Tuo, Hehan Li, Dongjun Fu, Xin Lu, Ling Zhuang, Fuwei Zhang, Meifang Li, Peizhi Xu, Hanmeng Liu, Shuanglong Li, Liwei Qian, Yanbiao Ma, Fuzhen Zhuang

ICEGR: An Intent-Coherent End-to-End Generative Retrieval Framework for E-commerce Search

Generative Retrieval (GR) is promising for e-commerce search, yet existing methods struggle to maintain query-intent consistency throughout the training pipeline. First, semantic ID (SID) construction based on static product information limits the ability of SIDs to encode product-intent associations. Second, although supervised...

💬 0 commentsarXiv:2608.29652v1PDF
0

Posted in cs.LG · 2026-08-30 · Hoseong Hwang, Woorim Han, Joungin Chun, Jinseong Park, Jaewoong Choi

Reward-guided Fine-Tuning of One-Step Generative Models via Wasserstein Gradient Flow

To mitigate the time complexity of generative models, one-step generative models have recently emerged through direct mapping from noise to data in a single forward pass. However, the reward-guided fine-tuning method of one-step generative models remains largely unexplored. To address this, we consider one-step generators from an...

💬 0 commentsarXiv:2608.29647v1PDF
0

Posted in cs.AI · 2026-08-30 · Jiayi Zhang, Zexin Wang, Degang Sun, Changhua Pei, Fei Sun, Gaogang Xie, Jingjing Li

Detect Before You Attribute: Cascade Failure Attribution for Multi-Agent Systems

Large language model (LLM)-based agents have shown strong potential in solving complex tasks through multi-step reasoning, yet they remain vulnerable to execution failures. Accurate failure attribution is therefore critical for improving agent reliability. Existing topology- and spectrum-based methods exploit trajectory structures but...

💬 0 commentsarXiv:2608.29646v1PDF
0

Posted in cs.CV · 2026-08-30 · Marc S. Walton, Astrid Harth

Conducting Stylistic Analysis of Paintings through an Art-History Agent

Attributing an artwork to an artist has traditionally relied on detailed visual observations and descriptions, known as stylistic analysis in art history. By contrast, current artificial intelligence (AI) models used in the field offer only unexplained probabilistic classifications. To bridge this methodological gap, we present an AI...

💬 0 commentsarXiv:2608.29644v1PDF
0

Posted in cs.MA · 2026-08-30 · Xinke Jiang, Zhixin Zhang, Zhibang Yang, Jiaran Gao, Rihong Qiu, Shijin Chen, Xu Chu, Junfeng Zhao, Yasha Wang

Harness-RL: Black-Box Reinforcement Learning with Action-Args Decoupling for Central-Agent Multi-Agent Harnesses

Large language model agents increasingly solve long-horizon tasks through multi-agent harnesses in which a central agent coordinates specialized sub-agents, tools, and environments. Training the central policy in such a harness raises two challenges. First, an action label is a low-cardinality decision, whereas its args form a...

💬 0 commentsarXiv:2608.29641v1PDF
0

Posted in cs.LG · 2026-08-30 · Di Zhang, Jingyang Zhang, Ziqian Wang, Chi Zhang, Yikun Ban, Ziwei Zhang, Ruijie Wang

LLMODE: Aligning ODEs with LLMs via Gated Token Injection for Irregular Spatio-Temporal Forecasting

Large language models (LLMs) have shown promise for spatio-temporal forecasting, but existing approaches often rely on regularly sampled token sequences and struggle with irregular observations because of temporal asynchrony, representation-space misalignment, and limited context windows. We propose LLMODE, a token-efficient framework...

💬 0 commentsarXiv:2608.29640v1PDF
0

Posted in cs.FL · 2026-08-30 · Takayuki Kuriyama

Finite-Monoid Compression in Syntactic Concept Lattices: Arity Hierarchies and a Pseudovariety Trichotomy

Clark's syntactic concept lattice (SCL) records two-sided distributional structure, and Wurm extended it to tuples of arbitrary finite arity. We study \(\operatorname{cmp}_f(L)\), the minimum image size of a finite-monoid observation that preserves guarded tuple substitution through arity \(f\) on the principal layer. For regular...

💬 0 commentsarXiv:2608.29639v1PDF
0

Posted in cs.LG · 2026-08-30 · Lutz Oettershagen, Honglian Wang, Aristides Gionis

Unsupervised Multi-Scale Gromov-Wasserstein Hypergraph Alignment

We study unsupervised hypergraph alignment, where the goal is to infer node correspondences between two hypergraphs using only structural information, without node features, labels, seed matches, or side information. Direct higher-order formulations can represent hyperedge interactions faithfully, but they can be computationally...

💬 0 commentsarXiv:2608.29635v1PDF
0

Posted in cs.CE · 2026-08-30 · Liangji Zhu, Scott Klasky, Jaemoon Lee, Qian Gong, Anand Rangarajan, Sanjay Ranka

QoI-Aware Provisional Rollout and Retrospective Reconciliation for Reduced-State Scientific Twins

Scientific twins may need to continue operating when updates from an authoritative primary system are temporarily unavailable. Once synchronization resumes, the new boundary can also be used to revise the intervening history. We distinguish an immediately available causal provisional trajectory from a delayed, future-conditioned...

💬 0 commentsarXiv:2608.29633v1PDF
0

Posted in cs.SE · 2026-08-30 · Jiaze Li, Aocheng Shen, Bing Liu, Boyu Zhang, Xiaoxuan Fan, Qiankun Zhang, Xianjun Deng

InteractBench: Benchmarking LLMs on Competitive Programming under Unrevealed Information

Competitive programming is increasingly being used to evaluate the algorithmic reasoning capabilities of large language models (LLMs). However, existing benchmarks primarily focus on full-information tasks where all problem inputs are provided upfront. This overlooks a critical dimension of algorithmic reasoning: the ability of...

💬 0 commentsarXiv:2608.29632v1PDF
0

Posted in cs.IT · 2026-08-30 · Antonio Jesús Lorite-López, Daniel Camazón-Portela, Juan Antonio López-Ramos

Efficient Polynomial-Time Decoding of Simplicial Anticodes with Near-Optimal Performance

In this work, we propose an efficient decoding algorithm for codes arising from simplicial complexes, a family of binary linear codes for which no decoding method of this type was previously known. Although the algorithm does not always attain the maximum theoretical error-correcting capability, it provides an explicit bound that...

💬 0 commentsarXiv:2608.29631v1PDF
0

Posted in cs.CL · 2026-08-28 · Emily Cheng, Ryan Cotterell

A Formal Limitation on Learning Human Language From Textual Corpora

Can a listener recover what a speaker means from the form of an utterance alone? We answer this question information-theoretically, and for a listener given by any featurizer of text, including the hidden states of contemporary large language models. Modeling language use as a joint distribution over meanings, contexts, and...

💬 0 commentsarXiv:2608.28560v1PDF
0

Posted in cs.LG · 2026-08-28 · Ruoran Xu

Blog: Survey of Optimizers

Neural-network optimization in 2025-2026 is no longer well described as a succession of new Adam variants. The design space has expanded from coordinates to matrices and layers, from fixed training horizons to policies over time, and from mathematical update rules to state representations that must survive sharding and low-precision...

💬 0 commentsarXiv:2608.28557v1PDF
0

Posted in cs.IR · 2026-08-28 · Maria Vlachou, Anna Murphy Høgenhaug, Mohammad N. S. Jahromi, Galadrielle Humblot-Renaux, Thomas Gammeltoft-Hansen, Thomas B. Moeslund, Desmond Elliott

QUEST: A Query and Extraction System for Topics in Asylum Law Application Decisions

Legal decisions on asylum applications consist of long, complex, and heterogeneous documents, covering narrative applicant interviews, original decisions, and additional supporting materials. If an application is rejected, a critical question in processing an appeal is whether the credibility of the information in the original...

💬 0 commentsarXiv:2608.28555v1PDF
0

Posted in cs.AI · 2026-08-28 · Hanzhang Jia, Liheng Zeng, Hao Cheng, Yi Gao, Bo Ma

Logos: An Agent Harness on a Cross-Process Bus

Modern agent systems assemble capabilities at runtime, and this dynamic composition has recently received a complete formal treat ment in the spatiotemporal-composability calculus, in which a capability is a component carrying a tracked inverse, and agents are assembled as plugins. This plugin form is carried by a single process...

💬 0 commentsarXiv:2608.28553v1PDF
0

Posted in cs.LG · 2026-08-28 · Kia Kazemi-Nia, Harsh Bandhey, Philip J. Freda, Ryan J. Urbanowicz

Advancing Interaction-Sensitive Feature Selection: Novel Relief-Based Algorithms, Expanded Comparisons, and Recommendations for Biomedical Data Mining

As a precursor to high-dimensional biomedical data modeling, reliable feature selection can reduce computational expense, improve modeling performance, and yield simpler, more interpretable models. However, most filter-based feature selection methods struggle to detect feature interactions, while wrapper or embedded feature selection...

💬 0 commentsarXiv:2608.28552v1PDF
0

Posted in cs.CV · 2026-08-28 · Haosen Yang, Jifei Song, Zhensong Zhang, Xiatian Zhu, Jiankang Deng

Video Generative Models as Geometry Learner

Recent generative approaches to geometry estimation adapt pretrained image diffusion models and treat the task as image-conditioned generation. Leveraging off-the-shelf image diffusion models, they either (i) train task-specific geometry models (for depth and surface normal estimation) independently, losing the opportunity of...

💬 0 commentsarXiv:2608.28549v1PDF
0

Posted in cs.LG · 2026-08-28 · Aaryan Ajay Sharma, Sai Nishanth Padala, Seganrasan Subramanian

DARTS: Decoder-Aware Representation Tuning via Surgery for Model Merging

Model merging combines multiple task-specific fine-tuned LLMs into a single multi-task model without additional training. However, merged models are known to suffer from representation bias: systematic drift between the merged model's hidden states and those of each individual source model. Prior work (Yang et al., 2024a) study and...

💬 0 commentsarXiv:2608.28547v1PDF
0

Posted in cs.CR · 2026-08-28 · Adil Alshammari, Hayretdin Bahsi

Offline-Verifiable Accountability for Cross-Organization Agent Messaging: A Preserved Evidence-Bundle Approach

Cross-organization agent workflows require preserved evidence that remains independently verifiable during later audit or dispute review. They may involve multiple organizations, delegated actions, policy-relevant events, and disputed accountability claims. This is difficult when live systems are unavailable, controlled by one party,...

💬 0 commentsarXiv:2608.28542v1PDF
0

Posted in cs.LG · 2026-08-28 · Javier Aguilar Martín

An Enclosed Mode Is a Gauge Choice: Topology Relative to Reach in Certified Code World Models

A code world model accepted by a sampling gate can be exactly right on everything the gate can see and arbitrarily wrong beyond it. We characterize what a certified model can know, and what its errors can cost, when the omission is an annular freeze mode enclosing an unreachable interior. The gate quotient makes the question precise:...

💬 0 commentsarXiv:2608.28541v1PDF
0

Posted in cs.AI · 2026-08-28 · Faraz Faruqi, Ahmed Katary, Demircan Tas, Theresa Hradilak, Ning Zhang, Jiaji Li, Fabian Manhardt, Martin Nisser, Vrushank Phadnis, Ruofei Du, Federico Tombari, Megan Hofmann, Stefanie Mueller

InstructMesh: Selective Refinement of Generative 3D Models for Fabrication

Recent advances in generative AI allow users to create 3D models from text or images. However, these models prioritize visual plausibility over geometric accuracy, often generating results with flaws that compromise their intended use post-fabrication. We present InstructMesh, an interactive post-generation refinement tool that...

💬 0 commentsarXiv:2608.28534v1PDF
0

Posted in cs.CR · 2026-08-28 · Pietro Tiberi, Gabriele Marcelli, Vitangelo Lasorella

Relaxed Sender Anonymity for CBDC Interbank Settlement: A Zero-Knowledge Approach on Permissioned EVM

Central Bank Digital Currency (CBDC) interbank settlement systems operating on Distributed Ledger Technology (DLT) face a fundamental trade-off: blockchain transparency enables trustless verification but exposes commercially sensitive bilateral transaction flows to all network participants. We propose a confidential interbank...

💬 0 commentsarXiv:2608.28529v1PDF
0

Posted in cs.SI · 2026-08-28 · Liheng Tan, Zhengkai Tu, Prasanna Karhade

Understanding Venture Capital Syndication in Information Technology Sectors: A Network Formation Perspective

Venture capital syndication enables investors to pool diligence, share risk, and signal venture quality, while shaping the relationships through which investment networks develop. We examine how prior relationships, network embeddedness, and organizational similarity structure annual co-investment link formation in U.S. information...

💬 0 commentsarXiv:2608.28526v1PDF
0

Posted in cs.CV · 2026-08-28 · Arun D. Kulkarni

Texture Image Classification Using DWT AlexNet Feature Fusion and Deep Neural Networks

Texture image classification plays a significant role in computer vision applications, including industrial inspection, medical image analysis, remote sensing, and object recognition. Handcrafted features can capture local texture characteristics but may have limited capability to represent complex visual patterns. In contrast, deep...

💬 0 commentsarXiv:2608.28524v1PDF