❌

Reading view

  •  

Robot-Assisted Therapy for Upper Limb Rehabilitation After Stroke: Umbrella Review

Background: Stroke is a leading cause of long-term upper limb disability, severely impacting patients’ independence and quality of life. Robot-assisted therapy (RAT) has emerged as a promising, high-intensity rehabilitation alternative. However, conclusions from existing systematic reviews on its efficacy are inconsistent and often lack a holistic framework, limiting their use for guiding personalized clinical decisions. Objective: This study aims to systematically synthesize recent evidence on RAT for upper limb rehabilitation after stroke. Guided by the International Classification of Functioning, Disability and Health framework, it moves beyond singular outcomes to provide a multidimensional evaluation across body function, activity, and participation levels. The review aims to provide stratified guidance for clinical decision-making based on patient- and intervention-specific characteristics, thereby supporting evidence-based practice and informing future research. Methods: This study included systematic reviews and meta-analyses published from January 1, 2019, to December 26, 2025, comparing RAT with conventional therapy for upper limb rehabilitation after stroke. Overall, 6 databases, including PubMed, Web of Science, and Embase, were searched. Two reviewers (XZ and LZ) independently performed study selection, data extraction, and quality assessment using the AMSTAR 2 tool. The synthesis integrated outcome measures and subgroup analyses derived from the included studies. Results: This umbrella review included 21 meta-analyses encompassing 535 randomized controlled trials and 27,598 patients across acute, subacute, and chronic stroke stages. According to AMSTAR 2, 17 reviews were high quality, 3 moderate, and 1 critically low. The synthesis demonstrated that RAT was superior in improving upper limb motor function, but no statistically significant advantages were observed in activities of daily living compared to conventional therapy. Subgroup analyses revealed that treatment effects were influenced by stroke stage, upper limb motor impairment level, and robot type. Conclusions: RAT is an effective intervention for improving upper limb motor function after stroke. However, its benefits are primarily observed at the level of body function, with limited evidence for long-term maintenance. The current evidence is constrained by significant outcome heterogeneity and methodological limitations inherent to umbrella reviews. Future research should validate these findings in broader clinical practice, focus on translating functional gains into sustained improvements in daily activities and participation, and include cost-effectiveness evaluations. Trial Registration: PROSPERO CRD42024497183; https://www.crd.york.ac.uk/PROSPERO/view/CRD42024497183
  •  

PERMA: Benchmarking Personalized Memory Agents via Event-Driven Preference and Realistic Task Environments

arXiv:2603.23231v1 Announce Type: new Abstract: Empowering large language models with long-term memory is crucial for building agents that adapt to users' evolving needs. However, prior evaluations typically interleave preference-related dialogues with irrelevant conversations, reducing the task to needle-in-a-haystack retrieval while ignoring relationships between events that drive the evolution of user preferences. Such settings overlook a fundamental characteristic of real-world personalization: preferences emerge gradually and accumulate across interactions within noisy contexts. To bridge this gap, we introduce PERMA, a benchmark designed to evaluate persona consistency over time beyond static preference recall. Additionally, we incorporate (1) text variability and (2) linguistic alignment to simulate erratic user inputs and individual idiolects in real-world data. PERMA consists of temporally ordered interaction events spanning multiple sessions and domains, with preference-related queries inserted over time. We design both multiple-choice and interactive tasks to probe the model's understanding of persona along the interaction timeline. Experiments demonstrate that by linking related interactions, advanced memory systems can extract more precise preferences and reduce token consumption, outperforming traditional semantic retrieval of raw dialogues. Nevertheless, they still struggle to maintain a coherent persona across temporal depth and cross-domain interference, highlighting the need for more robust personalized memory management in agents. Our code and data are open-sourced at https://github.com/PolarisLiu1/PERMA.
  •  

Beyond Matching to Tiles: Bridging Unaligned Aerial and Satellite Views for Vision-Only UAV Navigation

arXiv:2603.22153v2 Announce Type: replace-cross Abstract: Recent advances in cross-view geo-localization (CVGL) methods have shown strong potential for supporting unmanned aerial vehicle (UAV) navigation in GNSS-denied environments. However, existing work predominantly focuses on matching UAV views to onboard map tiles, which introduces an inherent trade-off between accuracy and storage overhead, and overlooks the importance of the UAV's heading during navigation. Moreover, the substantial discrepancies and varying overlaps in cross-view scenarios have been insufficiently considered, limiting their generalization to real-world scenarios. In this paper, we present Bearing-UAV, a purely vision-driven cross-view navigation method that jointly predicts UAV absolute location and heading from neighboring features, enabling accurate, lightweight, and robust navigation in the wild. Our method leverages global and local structural features and explicitly encodes relative spatial relationships, making it robust to cross-view variations, misalignment, and feature-sparse conditions. We also present Bearing-UAV-90k, a multi-city benchmark for evaluating cross-view localization and navigation. Extensive experiments show encouraging results that Bearing-UAV yields lower localization error than previous matching/retrieval paradigm across diverse terrains. Our code and dataset will be made publicly available.
  •  

Large language models show fragile cognitive reasoning about human emotions

arXiv:2508.05880v2 Announce Type: replace-cross Abstract: Affective computing seeks to support the holistic development of artificial intelligence by enabling machines to engage with human emotion. Recent foundation models, particularly large language models (LLMs), have been trained and evaluated on emotion-related tasks, typically using supervised learning with discrete emotion labels. Such evaluations largely focus on surface phenomena, such as recognizing expressed or evoked emotions, leaving open whether these systems reason about emotion in cognitively meaningful ways. Here we ask whether LLMs can reason about emotions through underlying cognitive dimensions rather than labels alone. Drawing on cognitive appraisal theory, we introduce CoRE, a large-scale benchmark designed to probe the implicit cognitive structures LLMs use when interpreting emotionally charged situations. We assess alignment with human appraisal patterns, internal consistency, cross-model generalization, and robustness to contextual variation. We find that LLMs capture systematic relations between cognitive appraisals and emotions but show misalignment with human judgments and instability across contexts.
  •  

MeanFlowSE: one-step generative speech enhancement via conditional mean flow

arXiv:2509.14858v3 Announce Type: replace-cross Abstract: Multistep inference is a bottleneck for real-time generative speech enhancement because flow- and diffusion-based systems learn an instantaneous velocity field and therefore rely on iterative ordinary differential equation (ODE) solvers. We introduce MeanFlowSE, a conditional generative model that learns the average velocity over finite intervals along a trajectory. Using a Jacobian-vector product (JVP) to instantiate the MeanFlow identity, we derive a local training objective that directly supervises finite-interval displacement while remaining consistent with the instantaneous-field constraint on the diagonal. At inference, MeanFlowSE performs single-step generation via a backward-in-time displacement, removing the need for multistep solvers; an optional few-step variant offers additional refinement. On VoiceBank-DEMAND, the single-step model achieves strong intelligibility, fidelity, and perceptual quality with substantially lower computational cost than multistep baselines. The method requires no knowledge distillation or external teachers, providing an efficient, high-fidelity framework for real-time generative speech enhancement. The proposed method is open-sourced at https://github.com/liduojia1/MeanFlowSE.
  •  

No Need For Real Anomaly: MLLM Empowered Zero-Shot Video Anomaly Detection

arXiv:2602.19248v1 Announce Type: cross Abstract: The collection and detection of video anomaly data has long been a challenging problem due to its rare occurrence and spatio-temporal scarcity. Existing video anomaly detection (VAD) methods under perform in open-world scenarios. Key contributing factors include limited dataset diversity, and inadequate understanding of context-dependent anomalous semantics. To address these issues, i) we propose LAVIDA, an end-to-end zero-shot video anomaly detection framework. ii) LAVIDA employs an Anomaly Exposure Sampler that transforms segmented objects into pseudo-anomalies to enhance model adaptability to unseen anomaly categories. It further integrates a Multimodal Large Language Model (MLLM) to bolster semantic comprehension capabilities. Additionally, iii) we design a token compression approach based on reverse attention to handle the spatio-temporal scarcity of anomalous patterns and decrease computational cost. The training process is conducted solely on pseudo anomalies without any VAD data. Evaluations across four benchmark VAD datasets demonstrate that LAVIDA achieves SOTA performance in both frame-level and pixel-level anomaly detection under the zero-shot setting. Our code is available in https://github.com/VitaminCreed/LAVIDA.
  •  
❌