arXiv subjects

Wei Wu

Publications and source records attributed to Wei Wu.

At least 127 records · Page 7Linked to original sources

arXiv2025

Tangible Intangibles: Exploring Embodied Emotion in Mixed Reality for Art Therapy

This in-person studio explores how mixed reality (MR) and biometrics can make intangible emotional states tangible through embodied art practices. We begin with two well-established modalities, clay sculpting and free-form 2D drawing, to ground participants in somatic awareness and manual, reflective expression. Building on this baseline, we introduce an MR prototype that maps physiological signals (e.g., breath, heart rate variability, eye movement dynamics) to visual and spatial parameters (color saturation, pulsing, motion qualities), generating ''3D emotional artifacts.'' The full-day program balances theory (somatic psychology, embodied cognition, expressive biosignals), hands-on making, and comparative reflection to interrogate what analog and digital modalities respectively afford for awareness, expression, and meaning-making. Participants will (1) experience and compare analog and MR-based journaling of emotion; (2) prototype and critique mappings from biosignals to visual/spatial feedback; and (3) articulate design principles for trauma-informed, hybrid workflows that amplify interoceptive literacy without overwhelming the user. The expected contributions include a shared design vocabulary for biometric expressivity, a set of generative constraints for future TEI work on emotional archiving, and actionable insights into when automated translation supports or hinders embodied connection.

cs.HC↗

arXiv2025

Mathematical Analysis of Subwavelength Resonance in Elastic Metascreen

The aim of this paper is to provide a comprehensive and mathematically rigorous analysis on determining the existence of subwavelength resonance in elastic metascreen and resonance frequency calculation based on asymptotic analysis of quasi-periodic layer potential operators. An elastic metascreen is a thin sheet with subwavelength structures, which nevertheless has a significant effect on elastic wave propagation at specific frequencies. Periodic subwavelength elastic scatterers positioned on a reflective plane are considered in this paper. Firstly an explicit formula of quasi-periodic Green's function of Lamé system with Dirichlet boundary condition is derived for the first time. The subsequent discussion is twofold. In the first part where the shear modulus of scatterers is assumed to tend to infinity, the subwavelength resonance frequencies are given and approximated field inside inclusions and far-away from metascreen are calculated to demonstrate the dramatic change of scattered field due to subwavelength resonance. In the second part where the shear modulus of background is assumed to go to infinity, the absence of subwavelength resonance is proved. Without imposing conditions on the material parameters, the discussion in this paper provides the necessary condition for the occurrence of subwavelength resonance.

math.AP↗

arXiv2025

Disorder-mediated linear and nonlinear magnetotransport in the charge-density-wave material ${\rm Ta_2NiSe_7 }$

We report disorder-mediated first-order linear and higher-order nonlinear (magneto-)transport of Ta$_2$NiSe$_7$ (TNS) in the charge-density-wave (CDW) regime. CDW transition temperature ($T_{CDW}$) and carrier density are proportional and inversely proportional to residual resistance ratio of samples, respectively. Such relation helps to understand the unique CDW order therein. High-$T_{CDW}$ TNS exhibits negative first-harmonic magnetoresistance (MR$^{1ω}$) under a magnetic field ($B$) parallel to the direction of alternating current ($I^ω$), which may arise from the anomalous velocity induced by the Berry curvature of three-dimensional topological bands near the Fermi level. As $T_{CDW}$ drops, a positive-to-negative MR$^{1ω}$ transition is observed with decreasing perpendicular $B$, which is likely due to the contribution of Zeeman effect on current pathways in the disordered system. Moreover, interestingly, the second-harmonic nonlinear signals are suppressed, while the third-harmonic signals are significant and sensitive to both $B$ and $T_{CDW}$. Such observations, together with scaling analysis, suggest the quantum geometry quadrupole at play and the modulation of disorder on third-order nonlinearity. Our results pave an avenue for tailoring distinct-order magnetoresistive phases in disordered topological materials.

cond-mat.mtrl-sci↗

arXiv2025

Flash Multi-Head Feed-Forward Network

We explore Multi-Head FFN (MH-FFN) as a replacement of FFN in the Transformer architecture, motivated by the structural similarity between single-head attention and FFN. While multi-head mechanisms enhance expressivity in attention, naively applying them to FFNs faces two challenges: memory consumption scaling with the head count, and an imbalanced ratio between the growing intermediate size and the fixed head dimension as models scale, which degrades scalability and expressive power. To address these challenges, we propose Flash Multi-Head FFN (FlashMHF), with two key innovations: an I/O-aware fused kernel computing outputs online in SRAM akin to FlashAttention, and a design using dynamically weighted parallel sub-networks to maintain a balanced ratio between intermediate and head dimensions. Validated on models from 128M to 1.3B parameters, FlashMHF consistently improves perplexity and downstream task accuracy over SwiGLU FFNs, while reducing peak memory usage by 3-5x and accelerating inference by up to 1.08x. Our work establishes the multi-head design as a superior architectural principle for FFNs, presenting FlashMHF as a powerful, efficient, and scalable alternative to FFNs in Transformers.

cs.LG↗

arXiv2025

RoboScape-R: Unified Reward-Observation World Models for Generalizable Robotics Training via RL

Achieving generalizable embodied policies remains a key challenge. Traditional policy learning paradigms, including both Imitation Learning (IL) and Reinforcement Learning (RL), struggle to cultivate generalizability across diverse scenarios. While IL policies often overfit to specific expert trajectories, RL suffers from the inherent lack of a unified and general reward signal necessary for effective multi-scene generalization. We posit that the world model is uniquely capable of serving as a universal environment proxy to address this limitation. However, current world models primarily focus on their ability to predict observations and still rely on task-specific, handcrafted reward functions, thereby failing to provide a truly general training environment. Toward this problem, we propose RoboScape-R, a framework leveraging the world model to serve as a versatile, general-purpose proxy for the embodied environment within the RL paradigm. We introduce a novel world model-based general reward mechanism that generates ''endogenous'' rewards derived from the model's intrinsic understanding of real-world state transition dynamics. Extensive experiments demonstrate that RoboScape-R effectively addresses the limitations of traditional RL methods by providing an efficient and general training environment that substantially enhances the generalization capability of embodied policies. Our approach offers critical insights into utilizing the world model as an online training strategy and achieves an average 37.5% performance improvement over baselines under out-of-domain scenarios.

cs.RO↗

arXiv2025

Automatic Attack Discovery for Few-Shot Class-Incremental Learning via Large Language Models

Few-shot class incremental learning (FSCIL) is a more realistic and challenging paradigm in continual learning to incrementally learn unseen classes and overcome catastrophic forgetting on base classes with only a few training examples. Previous efforts have primarily centered around studying more effective FSCIL approaches. By contrast, less attention was devoted to thinking the security issues in contributing to FSCIL. This paper aims to provide a holistic study of the impact of attacks on FSCIL. We first derive insights by systematically exploring how human expert-designed attack methods (i.e., PGD, FGSM) affect FSCIL. We find that those methods either fail to attack base classes, or suffer from huge labor costs due to relying on huge expert knowledge. This highlights the need to craft a specialized attack method for FSCIL. Grounded in these insights, in this paper, we propose a simple yet effective ACraft method to automatically steer and discover optimal attack methods targeted at FSCIL by leveraging Large Language Models (LLMs) without human experts. Moreover, to improve the reasoning between LLMs and FSCIL, we introduce a novel Proximal Policy Optimization (PPO) based reinforcement learning to optimize learning, making LLMs generate better attack methods in the next generation by establishing positive feedback. Experiments on mainstream benchmarks show that our ACraft significantly degrades the performance of state-of-the-art FSCIL methods and dramatically beyond human expert-designed attack methods while maintaining the lowest costs of attack.

cs.LG↗

arXiv2025

Human Decision-making is Susceptible to AI-driven Manipulation

AI systems are increasingly intertwined with daily life, assisting users with various tasks and guiding decision-making. This integration introduces risks of AI-driven manipulation, where such systems may exploit users' cognitive biases and emotional vulnerabilities to steer them toward harmful outcomes. Through a randomized between-subjects experiment with 233 participants, we examined human susceptibility to such manipulation in financial (e.g., purchases) and emotional (e.g., conflict resolution) decision-making contexts. Participants interacted with one of three AI agents: a neutral agent (NA) optimizing for user benefit without explicit influence, a manipulative agent (MA) designed to covertly influence beliefs and behaviors, or a strategy-enhanced manipulative agent (SEMA) equipped with established psychological tactics, allowing it to select and apply them adaptively during interactions to reach its hidden objectives. By analyzing participants' preference ratings, we found significant susceptibility to AI-driven manipulation. Particularly across both decision-making domains, interacting with the manipulative agents significantly increased the odds of rating hidden incentives higher than optimal options (Financial, MA: OR=5.24, SEMA: OR=7.96; Emotional, MA: OR=5.52, SEMA: OR=5.71) compared to the NA group. Notably, we found no clear evidence that employing psychological strategies (SEMA) was overall more effective than simple manipulative objectives (MA) on our primary outcomes. Hence, AI-driven manipulation could become widespread even without requiring sophisticated tactics and expertise. While our findings are preliminary and derived from hypothetical, low-stakes scenarios, we highlight a critical vulnerability in human-AI interactions, emphasizing the need for ethical safeguards and regulatory frameworks to protect human autonomy.

cs.AI↗

arXiv2025

Every Token Counts: Generalizing 16M Ultra-Long Context in Large Language Models

This work explores the challenge of building ``Machines that Can Remember'', framing long-term memory as the problem of efficient ultra-long context modeling. We argue that this requires three key properties: \textbf{sparsity}, \textbf{random-access flexibility}, and \textbf{length generalization}. To address ultra-long-context modeling, we leverage Hierarchical Sparse Attention (HSA), a novel attention mechanism that satisfies all three properties. We integrate HSA into Transformers to build HSA-UltraLong, which is an 8B-parameter MoE model trained on over 8 trillion tokens and is rigorously evaluated on different tasks with in-domain and out-of-domain context lengths to demonstrate its capability in handling ultra-long contexts. Results show that our model performs comparably to full-attention baselines on in-domain lengths while achieving over 90\% accuracy on most in-context retrieval tasks with contexts up to 16M. This report outlines our experimental insights and open problems, contributing a foundation for future research in ultra-long context modeling.

cs.CL↗

arXiv2025

Towards Comprehensive Sampling of SMT Solutions

This work focuses on effectively generating diverse solutions for satisfiability modulo theories (SMT) formulas, targeting the theories of bit-vectors, arrays, and uninterpreted functions, which is a critical task in software and hardware testing. Generating diverse SMT solutions helps uncover faults and detect safety violations during the verification and testing process, resulting in the SMT sampling problem, i.e., constructing a small number of solutions while achieving comprehensive coverage of the constraint space. While high coverage is crucial for exploring system behaviors, reducing the number of solutions is of great importance, as excessive solutions increase testing time and resource usage, undermining efficiency. In this work, we introduce PanSampler, a novel SMT sampler that achieves high coverage with a small number of solutions. It incorporates three novel techniques, i.e., diversity-aware SMT algorithm, abstract syntax tree (AST)-guided scoring function and post-sampling optimization technology, enhancing its practical performance. It iteratively samples solutions, evaluates candidates, and employs local search to refine solutions, ensuring high coverage with a small number of samples. Extensive experiments on practical benchmarks demonstrate that PanSampler exhibits a significantly stronger capability to reach high target coverage, while requiring fewer solutions than current samplers to achieve the same coverage level. Furthermore, our empirical evaluation on practical subjects, which are collected from real-world software systems, shows that PanSampler achieves higher fault detection capability and reduces the number of required test cases from 32.6\% to 76.4\% to reach the same fault detection effectiveness, leading to a substantial improvement in testing efficiency. PanSampler advances SMT sampling, reducing the cost of software testing and hardware verification.

cs.SE↗

arXiv2025

DynaAct: Large Language Model Reasoning with Dynamic Action Spaces

In modern sequential decision-making systems, the construction of an optimal candidate action space is critical to efficient inference. However, existing approaches either rely on manually defined action spaces that lack scalability or utilize unstructured spaces that render exhaustive search computationally prohibitive. In this paper, we propose a novel framework named \textsc{DynaAct} for automatically constructing a compact action space to enhance sequential reasoning in complex problem-solving scenarios. Our method first estimates a proxy for the complete action space by extracting general sketches observed in a corpus covering diverse complex reasoning problems using large language models. We then formulate a submodular function that jointly evaluates candidate actions based on their utility to the current state and their diversity, and employ a greedy algorithm to select an optimal candidate set. Extensive experiments on six diverse standard benchmarks demonstrate that our approach significantly improves overall performance, while maintaining efficient inference without introducing substantial latency. The implementation is available at https://github.com/zhaoxlpku/DynaAct.

cs.LG↗

arXiv2025

AgentPRM: Process Reward Models for LLM Agents via Step-Wise Promise and Progress

Despite rapid development, large language models (LLMs) still encounter challenges in multi-turn decision-making tasks (i.e., agent tasks) like web shopping and browser navigation, which require making a sequence of intelligent decisions based on environmental feedback. Previous work for LLM agents typically relies on elaborate prompt engineering or fine-tuning with expert trajectories to improve performance. In this work, we take a different perspective: we explore constructing process reward models (PRMs) to evaluate each decision and guide the agent's decision-making process. Unlike LLM reasoning, where each step is scored based on correctness, actions in agent tasks do not have a clear-cut correctness. Instead, they should be evaluated based on their proximity to the goal and the progress they have made. Building on this insight, we propose a re-defined PRM for agent tasks, named AgentPRM, to capture both the interdependence between sequential decisions and their contribution to the final goal. This enables better progress tracking and exploration-exploitation balance. To scalably obtain labeled data for training AgentPRM, we employ a Temporal Difference-based (TD-based) estimation method combined with Generalized Advantage Estimation (GAE), which proves more sample-efficient than prior methods. Extensive experiments across different agentic tasks show that AgentPRM is over $8\times$ more compute-efficient than baselines, and it demonstrates robust improvement when scaling up test-time compute. Moreover, we perform detailed analyses to show how our method works and offer more insights, e.g., applying AgentPRM to the reinforcement learning of LLM agents.

cs.CL↗

arXiv2025

Introducing LongCat-Flash-Thinking: A Technical Report

We present LongCat-Flash-Thinking, an efficient 560-billion-parameter open-source Mixture-of-Experts (MoE) reasoning model. Its advanced capabilities are cultivated through a meticulously crafted training process, beginning with long Chain-of-Thought (CoT) data cold-start and culminating in large-scale Reinforcement Learning (RL). We first employ a well-designed cold-start training strategy, which significantly enhances the reasoning potential and equips the model with specialized skills in both formal and agentic reasoning. Then, a core innovation is our domain-parallel training scheme, which decouples optimization across distinct domains (e.g., STEM, Code, Agentic) and subsequently fuses the resulting expert models into a single, nearly Pareto-optimal model. This entire process is powered by our Dynamic ORchestration for Asynchronous rollout (DORA) system, a large-scale RL framework that delivers a greater than threefold training speedup over synchronous methods on tens of thousands of accelerators. As a result, LongCat-Flash-Thinking achieves state-of-the-art performance among open-source models on a suite of complex reasoning tasks. The model exhibits exceptional efficiency in agentic reasoning, reducing average token consumption by 64.5% (from 19, 653 to 6, 965) on AIME-25, without degrading task accuracy. We release LongCat-Flash-Thinking to promote further advances in reasoning systems and agentic AI research.

cs.AI↗

arXiv2025

Uniqueness for phaseless inverse elastic scattering problem for periodic structures

This paper establishes uniqueness results of inverse elastic scattering problem with phaseless near-field data in periodic structures in $\mathbb{R}^2$ and periodic/biperiodic structures in $\mathbb{R}^3$. We use a superposition of two point sources in each periodic unit with different positions as the incident field, and measures the phaseless near-field data on a line parallel to $x_1$-axis in 2D, or on a plane parallel to $(x_1,x_2)$-plane in 3D. We first calculate the explicit formula of quasi-periodic/biperiodic Green's functions of Lamé system in $\mathbb{R}^3$. Then, to establish the uniqueness results, the reciprocity relations for point sources, scattered fields, and total fields are derived. Finally, with the help of Rayleigh's expansion, the uniqueness results are proved. The quasi-periodic/biperiodic Green's functions of Lamé system in $\mathbb{R}^3$, the reciprocity relations, and Rayleigh's expansion in $\mathbb{R}^3$ are novel results as important by-products in the proof process.

math.AP↗

arXiv2025

Lithium Niobate Vertical Cavity Electro-Optic Modulator

Electro-optic modulators (EOMs) are vital for optical imaging and information processing, with free-space devices enabling LiDAR and beam control. Lithium niobate (LN), powered by the strong Pockels effect and scalable LN-on-insulator (LNOI) platform, has become a leading material for high-performance EOMs. Here we realize a vertical-cavity EOM in which an LN membrane is sandwiched between two photonic crystal (PhC) mirrors with integrated electrodes. The cavity supports sharp defect-mode resonances that shift efficiently under the Pockels effect, enabling strong modulation of transmission. Experiments show a depth of 43 % at 50 V and a bandwidth of 5 MHz. This architecture combines free-space compatibility with fabrication simplicity, opening new routes to compact electro-optic platforms for ranging, holography, and beam steering.

physics.optics↗

arXiv2025

Mermin-Wagner theorem for dimers, monomer double-dimers, and spatial random permutations

We study a generalisation of the double-dimer model that encompasses several models of interest, including the monomer double-dimer model, spatial random permutations, the dimer model, and the spin $O(N)$ model, and which is also related to the loop $O(N)$ model. We show that on two-dimensional-like graphs (such as slabs), both the correlation function and the probability that a loop visits two vertices decay to zero as the distance between the vertices diverges. Our approach is based on the introduction of a new complex spin representation for all models in this class, together with a new proof of the Mermin-Wagner theorem that does not require positivity of the Gibbs measure. Even for the well-studied dimer and double-dimer models our results are new: since they do not rely on exact solvability or Kasteleyn's theorem, they apply beyond the planar-graph setting.

math.PR↗

arXiv2025

Hardware-aligned Hierarchical Sparse Attention for Efficient Long-term Memory Access

A key advantage of Recurrent Neural Networks (RNNs) over Transformers is their linear computational and space complexity enables faster training and inference for long sequences. However, RNNs are fundamentally unable to randomly access historical context, and simply integrating attention mechanisms may undermine their efficiency advantages. To overcome this limitation, we propose Hierarchical Sparse Attention (HSA), a novel attention mechanism that enhances RNNs with long-range random access flexibility while preserving their merits in efficiency and length generalization. HSA divides inputs into chunks, selects the top-$k$ chunks and hierarchically aggregates information. The core innovation lies in learning token-to-chunk relevance based on fine-grained token-level information inside each chunk. This approach enhances the precision of chunk selection across both in-domain and out-of-domain context lengths. To make HSA efficient, we further introduce a hardware-aligned kernel design. By combining HSA with Mamba, we introduce RAMba, which achieves perfect accuracy in passkey retrieval across 64 million contexts despite pre-training on only 4K-length contexts, and significant improvements on various downstream tasks, with nearly constant memory footprint. These results show RAMba's huge potential in long-context modeling.

cs.CL↗

arXiv2025

Absence of magnetic order and magnetic fluctuations in RuO$_{2}$

A novel magnetic class blending ferromagnetism and antiferromagnetism, termed altermagnetism, has gained significant attention for its staggered order in coordinate and momentum spaces, time-reversal symmetry-breaking phenomena, and promising applications in spintronics. Ruthenium dioxide (RuO$_{2}$) has been considered a candidate material for altermagnetism, yet the presence of magnetic moments on Ru atoms remains a subject of debate. In this study, we systematically investigated the magnetic properties of RuO$_{2}$ powder using nuclear quadrupole resonance (NQR) measurements. The NQR spectra show that there is no internal magnetic field. Furthermore, the temperature independence of spin-lattice relaxation rate, $1/T_1T$, proves that there are no magnetic fluctuations. Our results unambiguously demonstrate that Ru atoms in RuO$_{2}$ possess neither static magnetic moments nor fluctuating magnetic moments, and thus RuO$_{2}$ does not possess the magnetic characteristics essential for altermagnetism.

cond-mat.str-el↗

arXiv2025

Experimental Proposal on Scalable Radio-Frequency Magnetometer with Trapped Ions

Quantum magnetometry represents a fundamental component of quantum metrology, where trapped-ion systems have achieved $\rm{pT}/\sqrt{\rm{Hz}}$ sensitivity in single-ion radio-frequency magnetic field measurements via dressed states based dynamical decoupling. Here we propose a scalable trapped-ion magnetometer utilizing the mixed dynamical decoupling method, combining dressed states with periodic sequences to suppress decoherence and spatial magnetic field inhomogeneity. With numerical simulations for a $10^4$ ion system with realistic experimental parameters, we demonstrate that a sensitivity of 13 $\rm{fT}/\sqrt{\rm{Hz}}$ for the radio-frequency field could be reached. Such a sensitivity could be obtained via robust resilience to magnetic field drift noise and inhomogeneity, where coherence time could be extended to the order of several minutes on average. This method enables scalable trapped-ion magnetometry, demonstrating its potential as a robust and practical solution for advancing quantum sensing applications.

quant-ph↗