Autonomous research agents must acquire and reason over evidence within a limited budget. Yet relevant sources can remain uninspected or unused, leaving a gap between retrieval coverage and the evidence that informs research. The challenge is to align fast local judgments with changing evidence needs and feed their fin...
Ya-Sheng Sun, Yan Dai, Yi-Meng Chen et al.· 0 citations
This work evaluates Caesar and layered variants across eight models and 139 injection-task pairs, separating instruction recovery from attack success, and highlights the risk of promoting decoded, untrusted content into actionable instructions.
Wearable fall detection is hampered by rare fall events, scarce labeled IMU data, and the cost of training deep models on large, imbalanced corpora. Existing methods either rely on hand-crafted features with shallow classifiers, which limits learning from raw signals, or train deep networks on full datasets that requir...
Given the growing global burden of liver tumors and diffuse liver diseases, non-contrast computed tomography (NCCT) is increasingly used for opportunistic screening because of its low cost and favorable safety profile. However, downstream tasks such as tumor detection and fine-grained disease diagnosis remain challengi...
Hao Zhang, Yi Huang, Wei Liu et al.· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
Vision-language models (VLMs) have been widely adopted for document parsing and optical character recognition (OCR), as they can accurately extract page-level elements. However, downstream applications such as retrieval-augmented generation (RAG) also require coherent document-level structure. Although these models ind...
Qian Chen, Xianyin Zhang, Lifan Guo et al.· 0 citations
While AI agents are useful for many tasks, they regularly misbehave in destructive ways, such as deleting important data. While prior work has focused on preventing such misbehavior, we consider how to recover after an agent misbehaves. We propose verifiable agent insurance (VAI), a framework for agent providers to com...
Hua Cheng, Taro Tsuchiya, Nicolas Christin et al.· 0 citations
Domain-specific curvature is an appealing idea for domain generalization (DG), but curvature learning can denote substantially different computations. This paper evaluates one deliberately narrow implementation: the code calls it HyperDG, but it rescales Euclidean encoder features during training by learned positive sc...
LLM agents can adapt to task feedback by revising the textual context that guides their behavior, without changing their model parameters. However, turning execution rewards into reusable context updates is challenging: individual trajectories offer limited comparative evidence about what to change, while task-specific...
Connection-tableau provers typically construct closed tableaux by backtracking search. This gives lightweight proof procedures, but their low-memory search state leaves little derived information to reuse after a failed attempt. SATCoP addresses this by retaining grounded tableau clauses in an incremental SAT solver, a...
Martin S. Fixman, Fredrik R{\o}mming, Sean B. Holden· 0 citations
Soil organic carbon (SOC) is an indicator of agricultural soil condition and carbon storage, but numerical outputs from large language models (LLMs) require validation before use in monitoring or management. We evaluated seven general-purpose LLM configurations on three direct-response tasks: estimating 0--10 cm SOC co...
Yingxuan Cheng, Tong Li, Yayong Li et al.· 0 citations
Parallel generation is widely regarded as an inherent advantage of diffusion large language models. Yet our fixed-quota evaluation of four representative models reveals severe degradation across mathematics and code, with all scores below 15% at 16 tokens per step. Token-level probes identify local predictive potential...
Jiahao Kuang, Yangfan Gao, Tao Gui et al.· 0 citations
This work proposes QRR (Quotient Recurrent Reasoner), a gauge-equivariant recurrent architecture with an exact per-token phase-rotation symmetry that achieves stable and faster convergence to solution roots in quotient space, while matching or surpassing recent recurrent reasoning models on Sudoku, Maze, and Mini-ARC.