Qwen Councils

Computer Science

arXiv preprints from January 1, 2026 through July 20, 2026 — 14:11:42 EST

0

Posted in cs.SE · 2026-01-18 · Xingbang He, Yuanwei Chen, Hao Wu, Jikang Zhang, Zicheng Wang, Ligeng Chen, Junjie Peng, Haiyang Wei, Yi Qian, Tiantai Zhang, Linzhang Wang, Bing Mao

Discovering 100+ Compiler Defects in 72 Hours via LLM-Driven Semantic Logic Recomposition

Compilers constitute the foundational root-of-trust in software supply chains; however, their immense complexity inevitably conceals critical defects. Recent research has attempted to leverage historical bugs to design new mutation operators or fine-tune models to increase program diversity for compiler fuzzing.We observe, however,...

💬 0 commentsarXiv:2601.12360v2PDF
0

Posted in cs.CR · 2026-01-18 · Anirudh Sekar, Mrinal Agarwal, Rachel Sharma, Akitsugu Tanaka, Jasmine Zhang, Arjun Damerla, Kevin Zhu

Zero-Shot Embedding Drift Detection: A Lightweight Defense Against Prompt Injections in LLMs

Prompt injection attacks have become an increasing vulnerability for LLM applications, where adversarial prompts exploit indirect input channels such as emails or user-generated content to circumvent alignment safeguards and induce harmful or unintended outputs. Despite advances in alignment, even state-of-the-art LLMs remain broadly...

💬 0 commentsarXiv:2601.12359v1PDF
0

Posted in cs.CV · 2026-01-18 · Omar Y. Goba, Ahmed Y. Gado, Catherine M. Elias, Ahmed Hussein

From Prompts to Pavement: LMMs-based Agentic Behavior-Tree Generation Framework for Autonomous Vehicles

Autonomous vehicles (AVs) require adaptive behavior planners to navigate unpredictable, real-world environments safely. Traditional behavior trees (BTs) offer structured decision logic but are inherently static and demand labor-intensive manual tuning, limiting their applicability at SAE Level 5 autonomy. This paper presents an...

💬 0 commentsarXiv:2601.12358v1PDF
0

Posted in cs.CV · 2026-01-18 · Hailing Jin, Huiying Li

SimpleMatch: A Simple and Strong Baseline for Semantic Correspondence

Recent advances in semantic correspondence have been largely driven by the use of pre-trained large-scale models. However, a limitation of these approaches is their dependence on high-resolution input images to achieve optimal performance, which results in considerable computational overhead. In this work, we address a fundamental...

💬 0 commentsarXiv:2601.12357v2PDF
0

Posted in cs.LG · 2026-01-18 · Beicheng Xu, Weitong Qian, Lingching Tung, Yupeng Lu, Bin Cui

Tree-Structured Synergy of Large Language Models and Bayesian Optimization for Efficient CASH

To lower the expertise barrier in machine learning, the AutoML community has focused on the CASH problem, which jointly automates algorithm selection and hyperparameter tuning. While traditional methods like Bayesian Optimization (BO) struggle with cold-start issues, Large Language Models (LLMs) can mitigate these through semantic...

💬 0 commentsarXiv:2601.12355v2PDF
0

Posted in cs.RO · 2026-01-18 · Jie Wang, Peng Du, Yiyuan Zhang, Zhexin Xie, Cecilia Laschi

From Shallow Waters to Mariana Trench: A Survey of Bio-inspired Underwater Soft Robots

Sample Exploring the ocean environment holds profound significance in areas such as resource exploration and ecological protection. Underwater robots struggle with extreme water pressure and often cause noise and damage to the underwater ecosystem, while bio-inspired soft robots draw inspiration from aquatic creatures to address these...

💬 0 commentsarXiv:2601.12353v1PDF
0

Posted in cs.DS · 2026-01-18 · Hadas Abraham, Ido Feldman, Eitan Yaakobi

Analyzing Collection Strategies: A Computational Perspective on the Coupon Collector Problem

The Coupon Collector Problem (CCP) is a well-known combinatorial problem that seeks to estimate the number of random draws required to complete a collection of $n$ distinct coupon types. Various generalizations of this problem have been applied in numerous engineering domains. However, practical applications are often hindered by the...

💬 0 commentsarXiv:2601.12351v1PDF
0

Posted in cs.LG · 2026-01-18 · Takato Yasuno

RAPTOR-AI for Disaster OODA Loop: Hierarchical Multimodal RAG with Experience-Driven Agentic Decision-Making

Humanitarian Assistance and Disaster Relief (HADR) operations demand rapid synthesis of multimodal information for time-critical decision-making under extreme uncertainty. Traditional information systems struggle with the fragmented, multimodal nature of disaster data and lack adaptive reasoning capabilities essential for dynamic...

💬 0 commentsarXiv:2602.00030v2PDF
0

Posted in cs.CV · 2026-01-18 · Marcus Ma, Jordan Prescott, Emily Zhou, Tiantian Feng, Kleanthis Avramidis, Gabor Mihaly Toth, Shrikanth Narayanan

Encoding Emotion Through Self-Supervised Eye Movement Reconstruction

The relationship between emotional expression and eye movement is well-documented, with literature establishing gaze patterns are reliable indicators of emotion. However, most studies utilize specialized, high-resolution eye-tracking equipment, limiting the potential reach of findings. We investigate how eye movement can be used to...

💬 0 commentsarXiv:2601.12534v2PDF
0

Posted in cs.CV · 2026-01-18 · Md. Ahanaf Arif Khan, Ariful Islam, Sangeeta Biswas, Md. Iqbal Aziz Khan, Subrata Pramanik, Sanjoy Kumar Chakravarty, Bimal Kumar Pramanik

BirdsEye-RU: A Dataset For Detecting Faces from Overhead Images

Detecting faces in overhead images remains a significant challenge due to extreme scale variations and environmental clutter. To address this, we created the BirdsEye-RU dataset, a comprehensive collection of 2,978 images containing over eight thousand annotated faces. This dataset is specifically designed to capture small and distant...

💬 0 commentsarXiv:2601.12533v2PDF
0

Posted in cs.CV · 2026-01-18 · Jan Fabian Schmid, Annika Hagemann

XRefine: Attention-Guided Keypoint Match Refinement

Sparse keypoint matching is crucial for 3D vision tasks, yet current keypoint detectors often produce spatially inaccurate matches. Existing refinement methods mitigate this issue through alignment of matched keypoint locations, but they are typically detector-specific, requiring retraining for each keypoint detector. We introduce...

💬 0 commentsarXiv:2601.12530v1PDF
0

Posted in cs.CG · 2026-01-18 · Sariel Har-Peled

How to Get Close to the Median Shape

$\renewcommand{\Re}{\mathbb{R}}\newcommand{\eps}{\varepsilon}\newcommand{\poly}{\mathrm{poly}} $In this paper, we study the problem of $L_1$-fitting a shape to a set of $n$ points in $\Re^d$ (where $d$ is a fixed constant), where the target is to minimize the sum of distances of the points to the shape, or the sum of squared...

💬 0 commentsarXiv:2601.12529v1PDF
0

Posted in cs.CV · 2026-01-18 · Richard Liu, Itai Lang, Rana Hanocka

Deep Feature Deformation Weights

Handle-based mesh deformation is a classic paradigm in computer graphics which enables intuitive edits from sparse controls. Classical techniques are fast and precise, but require users to know ideal handle placement apriori, which can be unintuitive and inconsistent. Handle sets cannot be adjusted easily, as weights are typically...

💬 0 commentsarXiv:2601.12527v2PDF
0

Posted in cs.LG · 2026-01-18 · Nikolaj Tatti

Approximating splits for decision trees quickly in sparse data streams

Decision trees are one of the most popular classifiers in the machine learning literature. While the most common decision tree learning algorithms treat data as a batch, numerous algorithms have been proposed to construct decision trees from a data stream. A standard training strategy involves augmenting the current tree by changing a...

💬 0 commentsarXiv:2601.12525v1PDF
0

Posted in cs.CY · 2026-01-18 · Matias Hoyl

Synthetic Student Responses: LLM-Extracted Features for IRT Difficulty Parameter Estimation

Educational assessment relies heavily on knowing question difficulty, traditionally determined through resource-intensive pre-testing with students. This creates significant barriers for both classroom teachers and assessment developers. We investigate whether Item Response Theory (IRT) difficulty parameters can be accurately...

💬 0 commentsarXiv:2602.00034v1PDF
0

Posted in cs.DC · 2026-01-18 · Zechuan Gong, Hui Zhang, Yuquan Yang, Wenyu Lu

SGCP: A Self-Organized Game-Theoretic Framework For Collaborative Perception

Collaborative perception holds great promise for improving safety in autonomous driving, particularly in dense traffic where vehicles can share sensory information to overcome individual blind spots and extend awareness. However, deploying such collaboration at scale remains difficult when communication bandwidth is limited and no...

💬 0 commentsarXiv:2601.12524v1PDF
0

Posted in cs.RO · 2026-01-18 · Cem Suulker, Muhie Al Haimus, Thomas Mack, Mohammad Sheikhsofla, Neri Niccolò Dei, Reza Kashef, Hadi Sadati, Federica Barontini, Fanny Ficuciello, Alberto Arezzo, Bruno Siciliano, Sebastien Ourselin, Kaspar Althoefer

Enabling High-Curvature Navigation in Eversion Robots through Buckle-Inducing Constrictive Bands

Tip-growing eversion robots are renowned for their ability to access remote spaces through narrow passages. However, achieving reliable navigation remains a significant challenge. Existing solutions often rely on artificial muscles integrated into the robot body or active tip-steering mechanisms. While effective, these additions...

💬 0 commentsarXiv:2601.12523v1PDF
0

Posted in cs.SE · 2026-01-18 · Asif Mohammed Samir, Mohammad Masudur Rahman

Improved Bug Localization with AI Agents Leveraging Hypothesis and Dynamic Cognition

Software bugs cost technology providers (e.g., AT&T) billions annually and cause developers to spend roughly 50% of their time on bug resolution. Traditional methods for bug localization often analyze the suspiciousness of code components (e.g., methods, documents) in isolation, overlooking their connections with other components in...

💬 0 commentsarXiv:2601.12522v2PDF
0

Posted in cs.LG · 2026-01-18 · Abdullah Umut Hamzaogullari, Arkadas Ozakin

Learning Relativistic Geodesics and Chaotic Dynamics via Stabilized Lagrangian Neural Networks

Lagrangian Neural Networks (LNNs) can learn arbitrary Lagrangians from trajectory data, but their unusual optimization objective leads to significant training instabilities that limit their application to complex systems. We propose several improvements that address these fundamental challenges, namely, a Hessian regularization scheme...

💬 0 commentsarXiv:2601.12519v1PDF
0

Posted in cs.LG · 2026-01-18 · Nuoya Xiong, Aarti Singh

Cooperative Multi-agent RL with Communication Constraints

Cooperative MARL often assumes frequent access to global information in a data buffer, such as team rewards or other agents' actions, which is typically unrealistic in decentralized MARL systems due to high communication costs. When communication is limited, agents must rely on outdated information to estimate gradients and update...

💬 0 commentsarXiv:2601.12518v1PDF
0

Posted in cs.LG · 2026-01-18 · Chen Hu, Qianxi Zhao, Xiaochen Yuan, Hong Zhang, Ding Yuan, Yanbin Wu, Xiying Li

IFNSO: Iteration-Free Newton-Schulz Orthogonalization

The Newton-Schulz (NS) iteration has become a key technique for orthogonalization in optimizers such as Muon and for optimization on the Stiefel manifold. Despite its effectiveness, the conventional NS iteration incurs significant computational overhead due to repeated high-dimensional matrix multiplications. To overcome these...

💬 0 commentsarXiv:2602.02500v3PDF
0

Posted in cs.CV · 2026-01-18 · Mohd Usama, Belal Ahmad, Faleh Menawer R Althiyabi

Fine-Tuning Cycle-GAN for Domain Adaptation of MRI Images

Magnetic Resonance Imaging (MRI) scans acquired from different scanners or institutions often suffer from domain shifts owing to variations in hardware, protocols, and acquisition parameters. This discrepancy degrades the performance of deep learning models trained on source domain data when applied to target domain images. In this...

💬 0 commentsarXiv:2601.12512v1PDF
0

Posted in cs.ET · 2026-01-18 · Yuhao Liu, Shuohao Ping, Junyu Zhou, Ethan Decker, Justin Kalloor, Mathias Weiden, Kean Chen, Yunong Shi, Ali Javadi-Abhari, Costin Iancu, Gushu Li

AlphaSyndrome: Tackling the Syndrome Measurement Circuit Scheduling Problem for QEC Codes

Quantum error correction (QEC) is essential for scalable quantum computing, yet repeated syndrome-measurement cycles dominate its spacetime and hardware cost. Although stabilizers commute and admit many valid execution orders, different schedules induce distinct error-propagation paths under realistic noise, leading to large...

💬 0 commentsarXiv:2601.12509v2PDF
0

Posted in cs.CV · 2026-01-18 · Ruo Qi, Linhui Dai, Yusong Qin, Chaolei Yang, Yanshan Li

CoLR-Det: Collaborative Latent Restoration for Small Object Detection in Low-Resolution Remote Sensing Images

Low-resolution remote sensing small object detection is limited by both missing visual details and the ambiguity of how details serve detection. Existing super-resolution-assisted detectors generally follow a restoration-first paradigm to explicitly enhance inputs before detection, which implicitly assumes visual fidelity benefits...

💬 0 commentsarXiv:2601.12507v2PDF
0

Posted in cs.CL · 2026-01-18 · Ashish Raj Shekhar, Shiven Agarwal, Priyanuj Bordoloi, Yash Shah, Tejas Anvekar, Vivek Gupta

DoPE: Decoy Oriented Perturbation Encapsulation Human-Readable, AI-Hostile Documents for Academic Integrity

Multimodal Large Language Models (MLLMs) can directly consume exam documents, threatening conventional assessments and academic integrity. We present DoPE (Decoy-Oriented Perturbation Encapsulation), a document-layer defense framework that embeds semantic decoys into PDF/HTML assessments to exploit render-parse discrepancies in MLLM...

💬 0 commentsarXiv:2601.12505v1PDF