Your paper timeline
Scroll AI takes the way you would scroll a great paper aggregator: quick signal first, deeper critique when something earns your attention, and challenges when a claim feels off.
1579 papers
Trending mixes fresh papers with community signal.
0
cs.CV Henglei Lv, Bailin Deng, Jianzhu Guo et al. · Oct 22, 2026

GSHeadRelight tackles real-time, 3D-consistent portrait relighting from in-the-wild images by combining a generative 3D Gaussian Splatting backbone with a lightweight Unified Neural Radiance Transfer model. It assigns per-Gaussian spherical-harmonics coefficients that are view-conditioned to model low-frequency specular effects, trains on FFHQ under a white-light assumption without costly light-stage data, and achieves roughly 240 FPS by making relighting a simple per-Gaussian linear operation after a single forward pass.

Relighting and novel view synthesis of human portraits are essential in applications such as portrait photography, virtual reality (VR), and augmented reality (AR). Despite recent progress, 3D-aware portrait relighting remains challenging due to the demands for photorealistic rendering, real-time performance, and generalization to unseen subjects. Existing works either rely on supervision from limited and expensive light stage captured data or produce suboptimal results. Moreover, many works are based on generative NeRFs, which suffer from poor 3D consistency and low real-time performance. We resort to recent progress on generative 3D Gaussians and design a lighting model based on a unified neural radiance transfer representation, which responds linearly to incident light. Using only in-the-wild images, our method achieves state-of-the-art relighting results and a significantly faster rendering speed ($\times12$) compared to previous 3D-aware portrait relighting research. Project page: http://www.geometrylearning.com/GSHeadRelight/.
0
cs.CV Wenjie Xuan, Yapeng Li, Hang Su et al. · Oct 22, 2026

Fetal congenital heart defect diagnosis is severely bottlenecked by the scarcity of positive cases, especially for rare subtypes that can occur in fewer than 1 in 10,000 births. This paper proposes Pos4CHD, a framework that synthesizes pseudo-positive echocardiography samples using only normal images and semantic masks, completely bypassing the need for real pathological training data. By combining clinically guided mask manipulation with a specialized generator called FE-Gen, the authors demonstrate that synthetically augmented models can approach or exceed real-data baselines on classification, detection, and segmentation tasks.

The scarcity of positive cases remains a major bottleneck in developing automated diagnostic systems for fetal Congenital Heart Defects~(CHDs), particularly for rare subtypes. Although normal cases are accessible with effort, positive cases are hard to collect due to low incidence rates and privacy concerns, causing severe class imbalance or absence of positive training samples. Existing works resort to synthesizing positives with conditional generative models, but they are task-specific and require positive training samples, hindering application for fetal CHDs. To this end, we propose a positive-free mask-guided counterfactual generation framework for fetal echocardiography, namely Pos4CHD, which enables realistic, high-quality synthesis of pseudo-positive samples from semantic masks, with only normal samples at hand. Technically, we first develop FE-Gen, a mask-guided generative model tailored for fetal heart ultrasound synthesis that mitigates histogram drift and enhances image-mask spatial alignment. Building on FE-Gen, Pos4CHD employs a mask-to-image generation paradigm for CHD synthesis. It first manipulates semantic masks to simulate fetal-heart structural anomalies and then renders anatomically consistent images. Extensive experiments on in-house datasets, together with expert evaluations, demonstrate the visual fidelity~($-12.97$ FID) and anatomical consistency~($+3.96\%$ DSC) of synthesized images. Further validations across diverse real-world CHD diagnosis tasks exhibit promising results and consistent increments, including zero-shot classification~(achieving $93.25\%$ ACC on EbA and $72.92\%$ ACC on TAPVC), lesion detection~($+6.95\%$ mAP50 on VSD), and anatomy segmentation~($+10.49\%$ DSC on fetal heart) compared with baselines. Codes and models are publicly available on \href{https://github.com/DREAMXFAR/Pos4CHD}{GitHub}.
0
cs.CRcs.LG Jaishnoor Kaur, Josef Hor\'a\v{c}ek, Ian Waskom et al. · Oct 22, 2026

ReDence tackles the problem of detecting modern social engineering scams that go beyond credential phishing by performing adaptive, multimodal investigations of websites and their artifacts. Its core idea is a hybrid architecture that pairs a fine-tuned 4B-parameter agentic Investigator (Qwen3.5-4B) for reasoning and reporting with a specialized 4B-parameter Decider (Tev1) for fast binary and multiple-choice decisions, cutting latency while preserving depth. This matters because SE scams caused billions in losses in 2025 and existing detectors either lack interactive evidence gathering or are too slow to operate at scale.

Detecting online social engineering (SE) scams often requires examining website workflows, verifying claims against external sources, and connecting evidence across multiple pages. Existing detectors provide limited support for these investigations, leaving analysts to manually gather and validate evidence, which inevitably delays detection and subsequent takedown of these attacks. To address this gap, we present ReDence, an open-source hybrid framework for adaptive, evidence-grounded detection across diverse SE scam categories. ReDence combines two locally hosted models with complementary responsibilities: a fine-tuned multimodal agentic Investigator (Qwen3.5-4B) that performs investigative planning, evidence interpretation, and reporting, and a specialized Decider (Tev1) that handles binary and multiple-choice tasks, including browser-action selection, evidence assessment, and decisions about whether to continue an investigation. By delegating discrete decisions to a specialized model, ReDence reduces reliance on lengthy language-model responses, while preserving the reasoning capabilities required for complex investigations. Our evaluation demonstrates that ReDence achieves 96\% accuracy in detecting scams across twelve SE scam categories, substantially outperforming existing detectors while being at least four times faster than comparable agentic models without compromising investigative depth. ReDence also produces structured, evidence-grounded reports that document investigative actions, supporting and contradictory evidence, and collected artifacts, which allow analysts to independently audit detection decisions and utilize the collected evidence to support subsequent mitigation and takedown efforts.
0
cs.CV Advait Gupta, Sachin Konan, Tom Yin et al. · Oct 22, 2026

AgentVQA unifies 23 fragmented agentic datasets into 1,000 manually verified multiple-choice questions across five domains. By doing so, it provides a scalable offline complement to costly interactive simulator evaluations for vision-language models. The paper shows that even top models achieve only 58.5% accuracy and that failures stem primarily from grounded visual perception rather than reasoning mistakes.

Vision-language models (VLMs) can perform a broad range of tasks across diverse settings, yet their performance in agentic contexts remains poorly understood. Although online evaluations in simulators and real-world environments are essential for measuring interactive agent performance, they are costly and challenging to scale. Complementary offline VQA benchmarks can enable faster and more reliable comparisons across agentic domains, yet existing benchmarks remain limited and fragmented. To address this gap, we introduce AgentVQA, an offline benchmark for evaluating VLMs on realistic agentic scenarios across five agent domains: Web Agents, Robotics, Egocentric Videos, Games, and Spatial Planning. We build AgentVQA by manually selecting 1000 challenging, real-world agent examples from 23 source datasets and adapting them for reliable offline evaluation. The resulting benchmark preserves realistic scenarios from interactive environments across diverse domains, and its model rankings track those from corresponding online evaluations. Across the 22 evaluated models, the best achieves only 58.5% accuracy. Our cross-domain analysis shows that errors are driven primarily by failures to ground and maintain accurate representations of the current and evolving visual state, including localizing relevant UI elements, interpreting motion, tracking state changes over time, and inferring 3D spatial relationships, rather than by task misinterpretation or downstream logical reasoning.
0
cs.CV Changseon Yu, Hyeokjun Kweon · Oct 22, 2026

Training-free personalization of vision-language models usually builds a database of isolated concept descriptions, which fails when user concepts are fine-grained and confusable. ReCoG argues that recognition is inherently relational: it constructs a Concept Graph whose directed edges store pairwise discriminative cues elicited from a frozen VLM, then retrieves by having candidates compete in explicit pairwise comparisons aggregated via round-robin voting. This yields large gains on fine-grained benchmarks and consistent improvements on standard ones, with strong ablations showing the edge content—not just the voting scheme—drives performance.

Training-free personalization adapts a frozen vision-language model (VLM) to recognize user-defined concepts from only a few exemplars by retrieving concept entries at inference time. While recent retriever-based methods enrich each concept with descriptive evidence, they largely treat concepts in isolation, so the retrieved information can be plausible yet non-discriminative, especially when the personalized concept set contains highly confusable, fine-grained categories. We argue that personalization is inherently relational: correct recognition depends on the specific distinctions between a concept and its nearest alternatives. To this end, we propose ReCoG, a Relational Concept Graph for retrieval-augmented personalization. ReCoG represents concepts as nodes and augments them with directed edges that explicitly capture discriminative cues between concept pairs, elicited by a frozen VLM during database construction. At inference, ReCoG retrieves a shortlist and resolves ambiguity via explicit pairwise comparisons conditioned on the corresponding relational edges, selecting the concept that consistently wins against competing candidates. We also introduce FINGER benchmark to test personalized recognition on confusable concept sets. Across FINGER, ReCoG substantially outperforms prior methods, with the largest gains in the most confusable regimes. ReCoG also achieves consistently best performance on established personalization benchmarks including captioning and VQA, confirming that relational evidence is broadly beneficial beyond fine-grained settings. Project Page: https://csy-98.github.io/ReCoG/
0
cs.CV Wenhao Zheng, Xianggen Liu, Li Yue et al. · Oct 22, 2026

GraphCAD tackles generative modeling for CAD by replacing command sequences with Edge-Adjacency Graphs (EAGs), where wireframe edges are nodes and shared B-rep vertices define adjacency. It trains a hybrid graph diffusion model that jointly denoises discrete curve types and topology along with continuous geometric parameters, grounding the denoising network via an SE(3)-equivariant point-cloud backbone that renders latent edge parameters into sampled 3D curves. The work matters because sequence-based CAD generators propagate topological errors, while prior graph methods relied on complex face-centric surfaces that are hard to constrain.

Generative modeling for Computer-Aided Design (CAD) remains fundamentally challenged by the need to capture the intricate interplay between discrete topological connectivity and precise spatial geometry inherent in Boundary Representations (B-reps). Existing generative approaches largely formulate CAD construction as a sequence modeling problem, but consequently lack an explicit topological inductive bias. In this work, we present GraphCAD, a geometry-aware generative framework that centers modeling on the Edge-Adjacency Graph (EAG), a novel graph-based CAD representation tailored for generative tasks. GraphCAD adopts a hybrid graph diffusion formulation to jointly model the discrete and continuous components of EAG and introduces a geometry-aware denoising mechanism that renders node attributes into spatial point sets. These point sets are encoded by an SE(3)-equivariant backbone and fused into the node representations, thereby grounding the generative process in physical geometry. To support this study, we construct EAGBench, a large-scale dataset of engineering CAD models. Extensive experiments show that GraphCAD can generate complex CAD models with more than 50 faces and achieves state-of-the-art performance in geometric fidelity and distributional alignment compared with sequence-based baselines.
0
cs.CV Wencheng Ye, Anning Hu, Hongye Fang et al. · Oct 22, 2026

Vision-Language Models typically encode an image in a single, task-agnostic pass before reasoning, which creates a bottleneck: the model can think longer but cannot refine the visual evidence itself. LoopLook addresses this by inserting lightweight recurrent loops into a middle-to-late window of the vision encoder, conditioning each loop on the question and adaptively deciding when to stop. The result is anencoder-side recurrent perception mechanism that improves accuracy on demanding perception benchmarks with minimal inference-time overhead.

Visual perception should be iterative and task-directed, with representations refined in response to the question and the need for further processing. While Vision-Language Models (VLMs) increasingly support extended reasoning, their visual tokens are still typically acquired in a single, task-agnostic encoder pass. This creates an evidence-acquisition bottleneck: models may reason longer without refining the visual evidence needed to answer the question. We propose LoopLook, a lightweight encoder-side recurrent perception framework that equips pretrained VLMs with adaptive visual depth. LoopLook recurrently revisits a middle-to-late window of the vision encoder, injecting question representations at each loop to guide visual refinement. A learned stopping mechanism adaptively determines the recurrent depth, while a token-wise Mixture-of-Looks (MoL) combines representations from different loops, allowing each visual token to selectively integrate information acquired across recurrent steps. Across four backbones and eight benchmarks, LoopLook consistently improves performance over the baseline, yielding gains of up to 8.6% on MMStar and 8.1% on HallusionBench. Our analysis shows that LoopLook progressively refines visual attention and adaptively allocates depth according to task difficulty. It also better preserves task-relevant visual information under reduced input resolution, while increasing time to first token (TTFT) by only 5.1-6.5%. By bringing recurrence from reasoning back into perception, LoopLook transforms visual perception from a one-shot glimpse into an adaptive process of recurrent refinement.
0
cs.CV Jianrong Lu, Zhiyu Zhu, Hui Liu et al. · Oct 22, 2026

This paper challenges the prevailing FID/CLIP-based evaluation of training-free diffusion samplers, showing that step-shortening methods collapse on complex generation benchmarks despite appearing lossless. The authors propose ParaLin++, a step-parity parallel integrator that preserves the full $N$-step discretization while accelerating solver iterations via a partially linear formulation with adaptive nonlinearization and successive over-relaxation. Experiments on FLUX and Ming-Flash-Omni 2.0 demonstrate that keeping the trajectory intact preserves semantic composition, dense instruction following, and long-text rendering where few-step solvers fail.

Training-free few-step samplers are often described as nearly quality-lossless under conventional FID/CLIP-style evaluation. It remains unclear whether that conclusion transfers to more realistic and complex generation-quality benchmarks. We first systematize the quality metrics used to evaluate training-free sampling acceleration for diffusion and flow-matching models. We find that representative training-free step-shortening methods often remain nearly lossless under FID/CLIP-class metrics, yet can suffer substantial quality degradation when evaluated with semantic-composition, dense-instruction, and long-text-rendering benchmarks such as GenEval, DPG-Bench, and LongTextBench. Parallel sampling is a notable exception: by retaining the full-step discretization and removing only the solver's temporal dependency, it can preserve near-lossless quality while accelerating sampling. Building on this observation, we propose \textit{ParaLin++}, a step-parity parallel sampler that preserves the full-step discretization while accelerating the solver iterations. Experiments across Stable Diffusion-v2, LSUN Church, FLUX.1-dev, and Ming-Flash-Omni 2.0 show that ParaLin++ preserves the full-step Euler quality profile at $2.6\times$--$4.8\times$, $1.68\times$ on FLUX, and $1.21\times$ on Ming. Project page: https://paralinplus.github.io/.
0
cs.CL Siddhesh Pawar, Arnav Arora, Dustin Wright et al. · Oct 22, 2026

Most cultural evaluations of LLMs reduce user identity to a single country label, ignoring that real users hold multi-layered identities. This paper introduces a composite-identity setup where a system-prompt persona names one country while a user turn signals a second identity, either explicitly by naming a country or implicitly through query language. By probing three open-weight models with WVS multiple-choice questions and 1.6 million open-ended responses, the authors show that language and country cues shift model values in different, non-interchangeable ways—a finding with direct implications for how multilingual and multicultural personalization should be engineered.

Large language models (LLMs) serve users whose cultural identities are multi-layered, yet cultural evaluations commonly reduce identity to one label. In this work, we study LLMs under simultaneous identity cues, with a country persona in the system prompt and a second identity signaled in the user turn, either by naming a country (explicit cue) or through the query language (implicit cue). We test World Values Survey (WVS) multiple-choice probing and open-ended sociopolitical generation. In multiple-choice probing, language cues shift answers about three times more than explicit cues but away from the associated country's distribution, and explicit cues do not consistently move answers toward the named country. Across 1.6 million open-ended responses, naming a country closes 30-44% of the gap to the model's own responses for that country, and explicit cues produce more differentiated value changes than language cues. Our results suggest that country and language cues should be evaluated as distinct signals rather than interchangeable proxies for culture.
0
cs.CV Sidhart Sami, Ali Sharjeel, Sri Atluri et al. · Oct 22, 2026

Intra-operative CT imaging of the liver often shows poor contrast for hepatocellular carcinoma, making tumour localisation difficult and curating labelled datasets expensive. This paper proposes guiding an RL-based search on intra-operative CT using weak supervision from a tumour-presence classifier trained on pre-operative MR images, eliminating the need for paired cross-modal data. The core idea is that an MR-trained classifier still assigns higher tumour probabilities to cancerous windows on CT, and these probabilities drive an agent to explore and aggregate a tumour score map. The work matters because it offers a way to transfer pre-operative appearance knowledge into the operating room without deformable registration or manual CT segmentations.

Limited tumour visibility on intra-operative images complicates surgical navigation, including liver hepatocellular carcinoma (HCC) targeting on computed tomography (CT) imaging. This makes labelled datasets difficult to curate for deep learning, and transferring pre-operative delineations through registration remains challenging due to intra-operative deformation and lack of paired pre- and intra-operative data. We propose to transfer tumour appearances learned from pre-operative magnetic resonance (MR) images to guide localisation on intra-operative CT through weak supervision. A classifier is trained to classify tumour presence on pre-operative images. This is applied to windows on intra-operative images, and despite the domain gap, it assigns higher tumour-presence probabilities on average to tumour-containing windows. These weak cross-domain signals guide a reinforcement learning agent to localise tumours on intra-operative images. We compare direct transfer, few-shot adaptation and synthetic transfer (trained using unpaired MR and CT), which translates CT into synthetic MR before localisation. On an external HCC cohort, synthetic transfer outperformed other tested methods and CT-only baselines. Our framework enables cross-modality tumour localisation without paired MR-CT training images.
0
eess.IVcs.CVeess.SP Zixin Wang, James Hopgood, Mike Davies · Oct 22, 2026

Multibeam imaging sonar is widely used for underwater perception, but its intensity images are degraded by coupled coherent speckle and system-induced blur, and clean reflectivity ground truth is almost never available. This paper derives the conditional-mean forward operator $A x = x * |h|^2$ from a stochastic coherent image-formation model and uses it to train a self-supervised reconstruction network from registered multi-frame observations. By projecting one frame's latent reconstruction through $A$ and matching it to a second registered frame, then regularizing with an adapted robust equivariant imaging loss, the framework targets joint despeckling and deblurring without any clean targets. The work matters because it replaces ad hoc intensity-domain speckle models with a physics-consistent inverse problem for real sonar platforms.

Multibeam imaging sonar produces intensity images degraded by coherent speckle and system-induced blur, while clean reflectivity targets are rarely available. Existing despeckling methods often rely on simplified intensity-domain noise models, synthetic clean targets, or blind-spot self-supervision, and typically do not jointly model deblurring and speckle suppression. We propose a physics-consistent self-supervised framework for joint despeckling and deblurring of multibeam imaging sonar. A stochastic coherent image-formation model yields a conditional-mean forward operator that relates latent scene reflectivity to expected intensity through the squared magnitude of the system point spread function. We then use registered multi-frame sonar sequences to train without clean ground truth images, showing that, under an idealized inter-frame conditional-mean condition, the expected paired loss equals the corresponding forward-prediction loss up to a network-independent constant. To stabilize the ill-conditioned inverse problem, we further adapt robust equivariant imaging using stochastic coherent simulation and introduce a paired forward prediction error metric for ground-truth-free evaluation. Experiments on two real multibeam sonar datasets demonstrate a favourable balance between forward-prediction agreement, homogeneous-region speckle suppression, and preservation of visible structural boundaries compared with representative baselines.
0
cs.LG Maedeh Saberi, Amir Barati Farimani, Safa Jamali · Oct 22, 2026

RheOPT addresses the data bottleneck in non-Newtonian flow simulation by pretraining a transformer-based neural operator on inexpensive Newtonian simulations before fine-tuning on a handful of complex-fluid examples. The core hypothesis is that geometry-conditioned momentum transport—not the Newtonian constitutive law itself—transfers across the rheological boundary. In geometry-matched settings, the authors show that a model fine-tuned on as few as four non-Newtonian samples can match or exceed one trained from scratch on sixteen.

Despite advances in numerical methods, non-Newtonian flow simulations remain computationally expensive because velocity and stress must be advanced together through rate- and history-dependent constitutive dynamics. Neural-operator surrogates reduce inference cost after training, but their training data require the same expensive simulations they aim to replace, making data-efficient learning essential when only a few non-Newtonian simulations can be afforded. Here, we introduce the Rheological Operator Pretrained Transformer (RheOPT), which pretrains a transformer-based neural operator on inexpensive Newtonian simulations and fine-tunes it on a small number of non-Newtonian samples. Rather than transferring the Newtonian constitutive response itself, RheOPT reuses geometry-conditioned transport structure that remains useful after the stress model changes. We evaluate RheOPT in two geometry-matched settings: a $4{:}1$ contraction channel for Giesekus, Oldroyd-B, and Bingham fluids, and the oscillatory wake behind a triangular obstacle for Oldroyd-B flow. In the contraction, Newtonian pretraining substantially improves few-shot prediction, and a model fine-tuned on four target samples can match or exceed a from-scratch model trained on four times as many. This benefit is reliable under reversible instance normalization (RevIN) but dataset dependent under Global normalization, a difference we trace to the dynamic range of each fluid's velocity and stress fields. In the wake, where relative $L_2$ error alone cannot verify that vortex shedding is recovered, phase-insensitive diagnostics show that pretraining recovers the shedding frequency and wake fluctuation amplitude that are suppressed by the from-scratch model in the few-shot regime. Overall, RheOPT establishes Newtonian simulation as a physically grounded pretraining source for data-efficient non-Newtonian operator learning.
0
cs.ROcs.CVcs.LG Chenyuan Chen, Ran Ding, Lechen Zhang et al. · Oct 22, 2026

Whole-body vision-language-action (VLA) policies for humanoid loco-manipulation usually condition only on the current view, so they fail when brief object cues vanish before the robot must act. This paper proposes WholeBodyMem, which uses a frozen SAM3 to track task objects, detects object events (appear, disappear, move, change shape) to causally select up to $B_{\max}=7$ key frames, and feeds those native tokens together with mask-pooled object tokens into a flow-matching action expert via cross-attention and FiLM. On the new HuMeGo benchmark and standard SIMPLE tasks, the method raises the $\Psi_0$ base policy's simulated success from $29.1\%$ to $72.6\%$ and real-world Unitree G1 success from $36.7\%$ to $88.3\%$, while also improving reactive tasks to $86.9\%$.

Humanoid loco-manipulation in dynamic scenes is non-Markovian: cues vanish as objects change or are hidden, or leave the view as the robot turns and walks, yet whole-body vision-language-action (VLA) policies see only the present. We present WholeBodyMem, an object-guided perceptual memory that keeps the pre-history of object events seen before the robot acts on its goal. SAM3 tracks the task objects, and their events causally select key frames within an adaptive budget, which the action expert reads by cross-attention together with object tokens encoding appearance, geometry and time. We also contribute HuMeGo, a humanoid memory benchmark with six simulated and six real-world Unitree G1 tasks. Keeping the right frames rather than more frames, WholeBodyMem surpasses memoryless and uniform-memory baselines, raising its base policy's success from 29.1% to 72.6% in simulation and from 36.7% to 88.3% on the real robot, while also improving the standard SIMPLE tasks (70.2% to 86.9%).
0
cs.CL Haeun Yu, Geert Heyman, Pepa Atanasova et al. · Oct 22, 2026

Context augmentation methods are widely used to improve large language model performance at inference time, yet it remains unclear whether reported accuracy gains reflect genuine reasoning improvements or mere statistical noise. This paper introduces a systematic sentence-level evaluation framework spanning five intervention types—from blank filler tokens to teacher-generated explanations—across seven models and three question-answering datasets. By decomposing accuracy into correct flips ($\mathrm{Corr}$) and broken predictions ($\mathrm{Brk}$) and applying a sign-randomisation test, the authors show that many gains are undirected perturbations rather than directed progress, especially for methods that add computation without new information.

Large language models (LLMs) often fail to utilise the context given in the input, resulting in hallucinations or a fallback to parametric knowledge. Context augmentation methods aim to improve model performance by modifying the input, from inserting filler tokens that add computational time to adding relevant content such as elaboration of a context during inference. However, these methods have been evaluated in isolation and only by their performance gains, leaving it unclear how they compare and whether they reliably improve performance. In this paper, we present an evaluation framework spanning five methods that differ in how informative the inserted content is and apply them at the sentence level across seven models spanning multiple sizes on three datasets. We find that accuracy gains are not always genuine improvements but undirected perturbations: the methods correct some predictions while breaking others, particularly when the inserted text allows only for more computational time. Our analysis reveals that methods that bring no additional content primarily change model predictions near the decision boundary. Our findings highlight the need to evaluate the reliability of the accuracy gains before adopting them in practice.
0
cs.CL Shin Yamaguchi, Masaya Taniguchi, Tatsuki Kuribayashi et al. · Oct 22, 2026

The paper asks whether language models can transfer hierarchical syntactic generalizations across languages. It introduces a cross-lingual poverty-of-stimulus (CPOS) design where positive evidence for hierarchical subject-verb agreement is present only in the source language (L1), and tests transfer to an ambiguous target language (L2). The core finding is that transfer is weak and only reliably detectable when the two languages share vocabulary tokens, challenging the view that models abstract language-universal hierarchical rules independently of lexical overlap.

Language models (LMs) often exhibit successful cross-lingual transfer through continued (pre)training, still their underlying process remains unclear. One possibility is that LMs can leverage the evidence toward language-universal principles, namely, hierarchical structure, from a source language (L1) to a new language (L2), while many other non-linguistic explanations, e.g., improved initialization of position embeddings, can be potentially possible. In this study, to quantify the cross-linguistic transferability of linguistic evidence in cross-lingual LM training, we introduce a new experimental design, namely, a cross-lingual poverty-of-stimulus (CPOS) setting that ablates how LMs' hierarchical generalization in L2 can be led by structural evidence provided in L1. We contrast counterfactual L1 and L2 learning scenarios where the L2 corpus is ambiguous between linear and hierarchical grammar rules, while the amount of positive evidence for the hierarchical rule is controlled on the L1 side. Our experimental results show that LMs can partially, yet not perfectly, transfer L1 structural evidence to L2, yielding only a small but detectable hierarchical bias, while the strength of transfer depends on language pairs. We further ablate the conditions for successful transfer, motivated by recent reports on the substantial impact of vocabulary overlap. We indeed find that vocabulary overlap is crucial even for the cross-lingual transfer of hierarchical syntactic generalization. This suggests that this also explains the language-pair-dependent tendencies in the main experiments and suggests that the transfer of linguistic evidence in continued new-language learning is only conditionally achievable.
0
cs.CV Chenyao Yang, Peijin Wang, Yingchao Feng et al. · Oct 22, 2026

Existing UAV vision-language navigation benchmarks generate trajectories without kinodynamic constraints, leading to jerky, collision-prone flight. KinoUAV introduces a dataset built from acceleration-driven, kinodynamically feasible trajectories with directional free-space distance labels and a two-stage Cruise–Seek task. The proposed KinoUAV-Agent hierarchically plans waypoints and predicts continuous accelerations, reporting state-of-the-art success and stability on the benchmark.

Unmanned aerial vehicles (UAVs) have recently emerged as important remote sensing platforms, and UAV navigation has shown great potential in remote sensing applications. However, existing methods do not explicitly incorporate kinodynamic modeling or safety distances into trajectory generation, resulting in high absolute yaw rates, frequent collisions, and low navigation success rates, which limit safety and motion stability. To address this challenge, we introduce KinoUAV, a kinodynamic benchmark comprising a dataset and KinoUAV-Agent. First, we develop a hierarchical kinodynamic trajectory generation pipeline that drives UAV through acceleration actions. It uses waypoint chains from global planning and generates trajectories segment by segment under velocity, acceleration, and jerk constraints, reducing oscillations and improving trajectory stability. Furthermore, we introduce directional free-space distance (DFD) labels into the constructed dataset to describe the available clearance for safe motion decisions. The proposed KinoUAV-Agent predicts DFDs and uses them to generate safe actions, decoupling perception from action decision-making. This design enables autonomous obstacle avoidance and improves navigation safety. The benchmark incorporates the proposed Cruise-Seek task, in which the UAV first enters the target region and then searches for the target, reducing the difficulty of target search and improving navigation success. Experiments on KinoUAV show that KinoUAV-Agent outperforms existing methods, achieving the highest success rate while maintaining lower absolute yaw rates and collision rates. These results demonstrate the effectiveness of kinodynamic modeling for safe and stable UAV navigation.
0
cs.CV Xiaowen Liang, H\'el\`ene Cazier, Aur\'elie Beaufr\`ere et al. · Oct 22, 2026

Diagnosing combined hepatocellular-cholangiocarcinoma (cHCC-CCA) is difficult because tumors contain mixed hepatocellular and cholangiocellular morphology. This work attacks the problem with weakly supervised multiple-instance learning: it classifies HES-stained whole-slide images into HCC, CCA, and cHCC-CCA, and introduces an attention-supervision loss and a dual-branch model to force heatmaps onto tumor regions and separate HCC-like from CCA-like components. The clinical aim is to improve both slide-level diagnosis and characterization of intratumoral heterogeneity without costly patch-level annotations.

Combined hepatocellular-cholangiocarcinomas (cHCC-CCA) are a type of cancer that share components of two other primary liver cancers: hepatocellular carcinoma (HCC) and cholangiocarcinoma (CCA). Accurate diagnosis of cHCC-CCA, of which the behavior may resemble that of either HCC or CCA, remains a challenge due to strong intratumoral heterogeneity. Since the prognoses differ between liver cancer types, it is necessary to improve their morphological characterization and recognition in order to accurately identify cHCC-CCA. In this work, we use whole slide images (WSIs) of the two main types of liver cancer (HCC and CCA) and cHCC-CCA, stained with Hematoxylin-Eosin-Safran (HES), to train a classification model that can distinguish between these subtypes and provides a potential solution for localizing different types of tumors in the combined liver cancer images.
0
cs.CL A. Jian Yang, An Huang, Bo Dan et al. · Oct 22, 2026

IQuest-Q1 is a 320-billion-parameter sparse Mixture-of-Experts foundation model (15 billion activated) optimized for agentic command-line interaction. It merges Stable SplitNorm, the Muon optimizer, and $\mu$P parameterization within a three-stage pipeline—progressive pre-training, context-extending mid-training, and multi-scaffold post-training using reinforcement learning and multi-teacher distillation—to advance open-weight CLI agent capabilities. While the paper integrates several validated training techniques and releases model weights openly, benchmark results reveal it still trails frontier proprietary systems on the hardest coding and reasoning tasks.

We present IQuest-Q1, a sparse Mixture-of-Experts (MoE) agentic foundation model with 320B total parameters (15B activated). IQuest-Q1 is developed through a three-stage process: (1) stable and efficient pre-training, combining Stable SplitNorm, Muon, and muP with a two-stage curriculum whose second stage increases the coding-data mixture, preserving a wide stability margin between safe and optimal learning rates; (2) fine-grained mid-training, expanding the data mixture across domains and formats and progressively extending the context; and (3) multi-scaffold with multi-version post-training, combining SFT, domain-specialized RL, and MOPD across various scaffolds to integrate complementary training signals and strengthen agentic coding capabilities. Furthermore, model merging combines different experts and checkpoints from different stages while mitigating conflicts among their parameter updates. The resulting IQuest-Q1 demonstrates capabilities in both coding and general tasks. We release IQuest-Q1 as an open-source model to support community research and development.
0
cs.CV Vu Minh Tran, Thuc Huynh, Son Thanh Luu et al. · Oct 22, 2026

Current chest X-ray report generators that concatenate all available patient records into the decoder prompt produce long, variable-length inputs that can dilute attention and introduce image-irrelevant details. ICGF-CXRMate tackles this by conditioning learnable queries on the current radiograph to compress heterogeneous patient data into a fixed number of clinically relevant tokens, then selectively fusing them into the visual stream via gated cross-attention. On linked MIMIC-CXR and MIMIC-IV-ED examinations, this yields shorter prompts and stronger clinical metrics, offering a practical way to embed emergency-department context without overwhelming the language model.

Auxiliary patient data can improve chest X-ray report generation, but directly concatenating heterogeneous clinical information with visual tokens produces long, variable-length decoder prompts and may expose the model to redundant or image-irrelevant context. We propose ICGF-CXRMate, an image-conditioned clinical context compression and gated fusion framework. Learnable queries are first conditioned on the current chest X-ray representations and then attend to the patient-data sequence, compressing it into a fixed number of clinical context tokens. Gated cross-attention selectively integrates these tokens into the visual stream, while the compressed tokens are retained in the decoder prompt as a direct clinical pathway. Experiments on linked MIMIC-CXR and MIMIC-IV-ED examinations show that ICGF-CXRMate improves report quality while reducing the average prompt length. In Stage~2, it improves RadGraph-F1 from 24.00 to 28.86, CXR-BERT similarity from 56.86 to 62.80, and BLEU-4 from 5.14 to 7.96 compared with CXRMate-ED, while reducing the average prompt length from 373.89 to 288.37 tokens, corresponding to a 22.9\% reduction. After self-critical sequence training, ICGF-CXRMate outperforms CXRMate-ED on six of eight report-quality metrics in Stage~3. Ablation studies confirm the complementary contributions of image-conditioned compression, gated fusion, and direct retention of the compressed clinical tokens.
0
cs.LG Yuhang Xie, Cheng Li, Chenliang Li et al. · Oct 22, 2026

High-quality presentation generation remains labor-intensive, and existing agentic frameworks rely mostly on foundation-model priors without task-specific training. This paper presents a unified training pipeline integrating cross-validated data synthesis, guided teacher enhancement for supervised fine-tuning, and verifiable aesthetic rewards via GRPO-based reinforcement learning. Experiments on PresentBench and GDPVal show that the pipeline improves both content quality and visual design, with compact models surpassing larger zero-shot baselines.

PowerPoint presentations (PPTs) are a dominant medium for communication across diverse domains, yet high-quality PPT generation still depends heavily on labor-intensive human effort. Recent advances in large language models (LLMs) for agentic tasks have created both new opportunities and challenges (Chen et al., 2026) for automatic PPT generation. In this work, we present a unified training framework for automatic PPT generation toward presentation intelligence, integrating cross-validated data synthesis, guided teacher enhancement, and verifiable reward optimization. We first construct a cross-validated pipeline for data synthesis, with explicit control over both difficulty and validity. We then develop a teacher-enhancement framework grounded in rules and prior knowledge to substantially strengthen the instructional capacity of teacher models. Building on this, we further improve supervised fine-tuning (SFT) through a mixed-teacher strategy and a lightweight outcome-driven trajectory filtering method. Finally, based on the resulting SFT models, we introduce a suite of verifiable aesthetic metrics together with a GRPO-based reinforcement learning framework to optimize slide-level visual attributes beyond text-only supervision. Experiments show that our enhanced SFT pipeline improves Qwen-3.6-27B and Qwen-3.6-35B-A3B by 7.45 and 9.35 points on PresentBench, respectively, surpassing GLM-5.2 while maintaining strong generalization. Reinforcement learning further improves performance across five aesthetic dimensions, compensating for the limitations of SFT in visual refinement. Overall, the results demonstrate the effectiveness of our framework for high-quality PPT generation.