Searcharxiv⌕ Search

arXiv subjects

Bin Wang

Publications and source records attributed to Bin Wang.

At least 217 records · Page 12Linked to original sources

Complex spin-density-wave ordering in La$_4$Ni$_{3}$O$_{10}$

The discovery of high-temperature superconductivity in layered nickelates under pressure has recently triggered enormous interest. Studies of these compounds have revealed a density-wave-like transition at ambient pressure, though its connection with superconductivity is still not well understood. Here, we report a detailed \msr\ study on single crystals of trilayer nickelate \LNO\ at ambient pressure. We have identified a spin-density-wave (SDW) transition at the temperature of $T_\mathrm{N} \sim$130 K, as well as a broad crossover around 70 - 100 K. Based on the temperature dependence of the muon precession amplitudes and magnetic susceptibility, we attribute this additional crossover either to a spin reorientation, or to an inhomogeneous SDW ordering.

cond-mat.supr-con↗

Consistency of Responses and Continuations Generated by Large Language Models on Social Media

Large Language Models (LLMs) demonstrate remarkable capabilities in text generation, yet their emotional consistency and semantic coherence in social media contexts remain insufficiently understood. This study investigates how LLMs handle emotional content and maintain semantic relationships through continuation and response tasks using three open-source models: Gemma, Llama3 and Llama3.3 and one commercial Model:Claude. By analyzing climate change discussions from Twitter and Reddit, we examine emotional transitions, intensity patterns, and semantic consistency between human-authored and LLM-generated content. Our findings reveal that while both models maintain high semantic coherence, they exhibit distinct emotional patterns: these models show a strong tendency to moderate negative emotions. When the input text carries negative emotions such as anger, disgust, fear, or sadness, LLM tends to generate content with more neutral emotions, or even convert them into positive emotions such as joy or surprise. At the same time, we compared the LLM-generated content with human-authored content. The four models systematically generated responses with reduced emotional intensity and showed a preference for neutral rational emotions in the response task. In addition, these models all maintained a high semantic similarity with the original text, although their performance in the continuation task and the response task was different. These findings provide deep insights into the emotion and semantic processing capabilities of LLM, which are of great significance for its deployment in social media environments and human-computer interaction design.

cs.CL↗

Learnable Behavior Control: Breaking Atari Human World Records via Sample-Efficient Behavior Selection

The exploration problem is one of the main challenges in deep reinforcement learning (RL). Recent promising works tried to handle the problem with population-based methods, which collect samples with diverse behaviors derived from a population of different exploratory policies. Adaptive policy selection has been adopted for behavior control. However, the behavior selection space is largely limited by the predefined policy population, which further limits behavior diversity. In this paper, we propose a general framework called Learnable Behavioral Control (LBC) to address the limitation, which a) enables a significantly enlarged behavior selection space via formulating a hybrid behavior mapping from all policies; b) constructs a unified learnable process for behavior selection. We introduce LBC into distributed off-policy actor-critic methods and achieve behavior control via optimizing the selection of the behavior mappings with bandit-based meta-controllers. Our agents have achieved 10077.52% mean human normalized score and surpassed 24 human world records within 1B training frames in the Arcade Learning Environment, which demonstrates our significant state-of-the-art (SOTA) performance without degrading the sample efficiency.

cs.LG↗

LLM/Agent-as-Data-Analyst: A Survey

Large language models (LLMs) and agent techniques have brought a fundamental shift in the functionality and development paradigm of data analysis tasks (a.k.a LLM/Agent-as-Data-Analyst), demonstrating substantial impact across both academia and industry. In comparison with traditional rule or small-model based approaches, (agentic) LLMs enable complex data understanding, natural language interfaces, semantic analysis functions, and autonomous pipeline orchestration. From a modality perspective, we review LLM-based techniques for (i) structured data (e.g., NL2SQL, NL2GQL, ModelQA), (ii) semi-structured data (e.g., markup languages understanding, semi-structured table question answering), (iii) unstructured data (e.g., chart understanding, text/image document understanding), and (iv) heterogeneous data (e.g., data retrieval and modality alignment in data lakes). The technical evolution further distills four key design goals for intelligent data analysis agents, namely semantic-aware design, autonomous pipelines, tool-augmented workflows, and support for open-world tasks. Finally, we outline the remaining challenges and propose several insights and practical directions for advancing LLM/Agent-powered data analysis.

cs.AI↗

MCPGuard : Automatically Detecting Vulnerabilities in MCP Servers

The Model Context Protocol (MCP) has emerged as a standardized interface enabling seamless integration between Large Language Models (LLMs) and external data sources and tools. While MCP significantly reduces development complexity and enhances agent capabilities, its openness and extensibility introduce critical security vulnerabilities that threaten system trustworthiness and user data protection. This paper systematically analyzes the security landscape of MCP-based systems, identifying three principal threat categories: (1) agent hijacking attacks stemming from protocol design deficiencies; (2) traditional web vulnerabilities in MCP servers; and (3) supply chain security. To address these challenges, we comprehensively survey existing defense strategies, examining both proactive server-side scanning approaches, ranging from layered detection pipelines and agentic auditing frameworks to zero-trust registry systems, and runtime interaction monitoring solutions that provide continuous oversight and policy enforcement. Our analysis reveals that MCP security fundamentally represents a paradigm shift where the attack surface extends from traditional code execution to semantic interpretation of natural language metadata, necessitating novel defense mechanisms tailored to this unique threat model.

cs.CR↗

RefleXGen:The unexamined code is not worth using

Security in code generation remains a pivotal challenge when applying large language models (LLMs). This paper introduces RefleXGen, an innovative method that significantly enhances code security by integrating Retrieval-Augmented Generation (RAG) techniques with guided self-reflection mechanisms inherent in LLMs. Unlike traditional approaches that rely on fine-tuning LLMs or developing specialized secure code datasets - processes that can be resource-intensive - RefleXGen iteratively optimizes the code generation process through self-assessment and reflection without the need for extensive resources. Within this framework, the model continuously accumulates and refines its knowledge base, thereby progressively improving the security of the generated code. Experimental results demonstrate that RefleXGen substantially enhances code security across multiple models, achieving a 13.6% improvement with GPT-3.5 Turbo, a 6.7% improvement with GPT-4o, a 4.5% improvement with CodeQwen, and a 5.8% improvement with Gemini. Our findings highlight that improving the quality of model self-reflection constitutes an effective and practical strategy for strengthening the security of AI-generated code.

cs.SE↗

Beyond Single Images: Retrieval Self-Augmented Unsupervised Camouflaged Object Detection

At the core of Camouflaged Object Detection (COD) lies segmenting objects from their highly similar surroundings. Previous efforts navigate this challenge primarily through image-level modeling or annotation-based optimization. Despite advancing considerably, this commonplace practice hardly taps valuable dataset-level contextual information or relies on laborious annotations. In this paper, we propose RISE, a RetrIeval SElf-augmented paradigm that exploits the entire training dataset to generate pseudo-labels for single images, which could be used to train COD models. RISE begins by constructing prototype libraries for environments and camouflaged objects using training images (without ground truth), followed by K-Nearest Neighbor (KNN) retrieval to generate pseudo-masks for each image based on these libraries. It is important to recognize that using only training images without annotations exerts a pronounced challenge in crafting high-quality prototype libraries. In this light, we introduce a Clustering-then-Retrieval (CR) strategy, where coarse masks are first generated through clustering, facilitating subsequent histogram-based image filtering and cross-category retrieval to produce high-confidence prototypes. In the KNN retrieval stage, to alleviate the effect of artifacts in feature maps, we propose Multi-View KNN Retrieval (MVKR), which integrates retrieval results from diverse views to produce more robust and precise pseudo-masks. Extensive experiments demonstrate that RISE outperforms state-of-the-art unsupervised and prompt-based methods. Code is available at https://github.com/xiaohainku/RISE.

cs.CV↗

ReCon: Region-Controllable Data Augmentation with Rectification and Alignment for Object Detection

The scale and quality of datasets are crucial for training robust perception models. However, obtaining large-scale annotated data is both costly and time-consuming. Generative models have emerged as a powerful tool for data augmentation by synthesizing samples that adhere to desired distributions. However, current generative approaches often rely on complex post-processing or extensive fine-tuning on massive datasets to achieve satisfactory results, and they remain prone to content-position mismatches and semantic leakage. To overcome these limitations, we introduce ReCon, a novel augmentation framework that enhances the capacity of structure-controllable generative models for object detection. ReCon integrates region-guided rectification into the diffusion sampling process, using feedback from a pre-trained perception model to rectify misgenerated regions within diffusion sampling process. We further propose region-aligned cross-attention to enforce spatial-semantic alignment between image regions and their textual cues, thereby improving both semantic consistency and overall image fidelity. Extensive experiments demonstrate that ReCon substantially improve the quality and trainability of generated data, achieving consistent performance gains across various datasets, backbone architectures, and data scales. Our code is available at https://github.com/haoweiz23/ReCon .

cs.CV↗

InternVLA-M1: A Spatially Guided Vision-Language-Action Framework for Generalist Robot Policy

We introduce InternVLA-M1, a unified framework for spatial grounding and robot control that advances instruction-following robots toward scalable, general-purpose intelligence. Its core idea is spatially guided vision-language-action training, where spatial grounding serves as the critical link between instructions and robot actions. InternVLA-M1 employs a two-stage pipeline: (i) spatial grounding pre-training on over 2.3M spatial reasoning data to determine ``where to act'' by aligning instructions with visual, embodiment-agnostic positions, and (ii) spatially guided action post-training to decide ``how to act'' by generating embodiment-aware actions through plug-and-play spatial prompting. This spatially guided training recipe yields consistent gains: InternVLA-M1 outperforms its variant without spatial guidance by +14.6% on SimplerEnv Google Robot, +17% on WidowX, and +4.3% on LIBERO Franka, while demonstrating stronger spatial reasoning capability in box, point, and trace prediction. To further scale instruction following, we built a simulation engine to collect 244K generalizable pick-and-place episodes, enabling a 6.2% average improvement across 200 tasks and 3K+ objects. In real-world clustered pick-and-place, InternVLA-M1 improved by 7.3%, and with synthetic co-training, achieved +20.6% on unseen objects and novel configurations. Moreover, in long-horizon reasoning-intensive scenarios, it surpassed existing works by over 10%. These results highlight spatially guided training as a unifying principle for scalable and resilient generalist robots. Code and models are available at https://github.com/InternRobotics/InternVLA-M1.

cs.RO↗

PiCo: Jailbreaking Multimodal Large Language Models via Pictorial Code Contextualization

Multimodal Large Language Models (MLLMs), which integrate vision and other modalities into Large Language Models (LLMs), significantly enhance AI capabilities but also introduce new security vulnerabilities. By exploiting the vulnerabilities of the visual modality and the long-tail distribution characteristic of code training data, we present PiCo, a novel jailbreaking framework designed to progressively bypass multi-tiered defense mechanisms in advanced MLLMs. PiCo employs a tier-by-tier jailbreak strategy, using token-level typographic attacks to evade input filtering and embedding harmful intent within programming context instructions to bypass runtime monitoring. To comprehensively assess the impact of attacks, a new evaluation metric is further proposed to assess both the toxicity and helpfulness of model outputs post-attack. By embedding harmful intent within code-style visual instructions, PiCo achieves an average Attack Success Rate (ASR) of 84.13% on Gemini-Pro Vision and 52.66% on GPT-4, surpassing previous methods. Experimental results highlight the critical gaps in current defenses, underscoring the need for more robust strategies to secure advanced MLLMs.

cs.CR↗

RA-Gen: A Controllable Code Generation Framework Using ReAct for Multi-Agent Task Execution

Code generation models based on large language models (LLMs) have gained wide adoption, but challenges remain in ensuring safety, accuracy, and controllability, especially for complex tasks. Existing methods often lack dynamic integration of external tools, transparent reasoning, and user control over safety. To address these issues, we propose a controllable code generation framework utilizing the ReAct paradigm for multi-agent task execution. This framework is a multi-agent system designed to enable efficient, precise, and interpretable code generation through dynamic interactions between LLMs and external resources. The framework adopts a collaborative architecture comprising four specialized agents: a Planner for task decomposition, a Searcher that leverages the ReAct framework for reasoning and tool integration, a CodeGen agent for accurate code generation, and an Extractor for structured data retrieval. The ReAct-based Searcher alternates between generating reasoning traces and executing actions, facilitating seamless integration of internal knowledge with external tools (such as search engines) to enhance accuracy and user control. Experimental results show the framework's effectiveness across multiple languages, achieving a 94.8% security rate on the SVEN dataset with CodeQL, outperforming existing approaches. Its transparent reasoning process fosters user trust and improves controllability.

cs.SE↗

Time-relaxation structure-preserving explicit low-regularity integrators for the nonlinear Schrödinger equation

We propose and rigorously analyze a novel family of explicit low-regularity exponential integrators for the nonlinear Schrödinger (NLS) equation, based on a time-relaxation framework. The methods combine a resonance-based scheme for the twisted variable with a dynamically adjusted relaxation parameter that guarantees exact mass conservation. Unlike existing symmetric or structure-preserving low-regularity integrators, which are typically implicit and computationally expensive, the proposed methods are fully explicit, mass-conserving, and well-suited for solutions with low regularity. Furthermore, the schemes can be naturally extended to a broad class of evolution equations exhibiting the structure of strongly continuous contraction semigroups. Numerical results demonstrate the accuracy, robustness, and excellent long-time behavior of the methods under low-regularity conditions.

math.NA↗

Efficient Multi-modal Large Language Models via Progressive Consistency Distillation

Visual tokens consume substantial computational resources in multi-modal large models (MLLMs), significantly compromising their efficiency. Recent works have attempted to improve efficiency by compressing visual tokens during training, either through modifications to model components or by introducing additional parameters. However, they often overlook the increased learning difficulty caused by such compression, as the model's parameter space struggles to quickly adapt to the substantial perturbations in the feature space induced by token compression. In this work, we propose to develop Efficient MLLMs via Progressive Consistency Distillation (EPIC), a progressive learning framework. Specifically, by decomposing the feature space perturbations introduced by token compression along the token-wise and layer-wise dimensions, we introduce token consistency distillation and layer consistency distillation, respectively, aiming to reduce the training difficulty by leveraging guidance from a teacher model and following a progressive learning trajectory. Extensive experiments demonstrate the superior effectiveness, robustness, and generalization capabilities of our proposed framework.

cs.CV↗

Typhoon Tracks Regulated by Feedbacks of Fine-Scale Clouds to Environment

Accurate tropical cyclone (TC) track prediction is crucial for mitigating the catastrophic impacts of TCs on human life and the environment. Despite decades of research on tropical cyclone (TC) track prediction, large errors known as track forecast busts (TFBs) occur frequently, and their causes remain poorly understood. Here, we examine a few dozens of TCs using a unique TC downscaling strategy that can quantitatively assess the sensitivity of TC track on the strength of feedbacks of fine-scale clouds to environment. We show that as TFBs have a weaker environmental steering that favors scattering cumulonimbus clouds, capturing asymmetric distribution of planetary vorticity advection induced by such fine-scale clouds corrects TFBs by 60 percent. Our clear identification of such important TC track predictability source promises continuous improvement of TC track prediction as finer-scale TC clouds and their interactions with environment are better resolved as model larger-scale behaviors have improved.

physics.ao-ph↗

Electromagnetically driven, environmentally adaptive, and functionally switchable hydrodynamic devices

Metamaterials provide exceptional control over physical phenomena, enabling many disruptive technologies. However, researches in hydrodynamic meta-devices have mainly used intrusive methods to manipulate material structures, limited by material properties and specific environmental conditions. Each design serves a single function, reducing versatility. This study introduces a meta-hydrodynamics theory using applied force fields to avoid physical contact with the fluid and eliminate the need for inhomogeneous and anisotropic metamaterials, allowing continuous switching between cloaking, shielding, and Venturi amplification. The force field operates independently of the fluid's physical properties, making it adaptable to various fluids and environmental conditions. We derive volumetric force distributions for hydrodynamic devices based on fluid properties and forces equivalence, using the integral median theorem to homogenize these forces for practical applications. The effectiveness of the proposed hydrodynamic devices is validated through numerical simulations and quantitative analyses. By utilizing the electromagnetic forces produced by the interaction between a conducting fluid and an electromagnetic field, we experimentally verified the validity of our theoretical simulations. Our research offers different insights into hydrodynamic meta-devices design, enhancing practical applications and opening avenues for innovative flow manipulation.

physics.flu-dyn↗

The BINGO/ABDUS Project: Forecast for cosmological parameters from a mock Fast Radio Bursts survey

There are various surveys that will provide excellent data to search for and localize Fast Radio Bursts (FRBs). The BINGO project will be one such survey, and this collaboration has already estimated a FRB detection rate that the project will yield. We present a forecast of the future constraints on our current cosmological model that the BINGO FRB detections and localizations will have when added to other current cosmological datasets. We quantify the dispersion measure (DM) as a function of redshift ($z$) for the BINGO FRB mock sample. Furthermore, we use current datasets (Supernovae, Baryonic Acoustic Oscillations, and Cosmic Microwave Background data) prior to assessing the efficacy of constraining dark energy models using Monte Carlo methods. Our results show that spatially localized BINGO FRB dataset will provide promising constraints on the population of host galaxies intrinsic DM and be able to measure the nuisance parameters present within a FRB cosmological analysis. They will also provide alternative estimates on other parameters such as the Hubble constant and the dark energy equation of state. In particular, we should see that BINGO FRB data can put constraints on the degenerate $w-H_0$ plane, which the CMB is incapable of measuring, allowing FRBs to be a viable alternative to BAO to constrain the dark energy equation of state. We conclude that FRBs remain a promising future probe for cosmology and that the FRBs localized by the BINGO project will contribute significantly to our knowledge of the current cosmological model.

astro-ph.CO↗

Beyond Classification: Towards Speech Emotion Reasoning with Multitask AudioLLMs

Audio Large Language Models (AudioLLMs) have achieved strong results in semantic tasks like speech recognition and translation, but remain limited in modeling paralinguistic cues such as emotion. Existing approaches often treat emotion understanding as a classification problem, offering little insight into the underlying rationale behind predictions. In this work, we explore emotion reasoning, a strategy that leverages the generative capabilities of AudioLLMs to enhance emotion recognition by producing semantically aligned, evidence-grounded explanations. To support this in multitask AudioLLMs, we introduce a unified framework combining reasoning-augmented data supervision, dual-encoder architecture, and task-alternating training. This approach enables AudioLLMs to effectively learn different tasks while incorporating emotional reasoning. Experiments on IEMOCAP and MELD show that our approach not only improves emotion prediction accuracy but also enhances the coherence and evidential grounding of the generated responses. Experiments on two out-of-domain datasets demonstrate the generalization capabilities of the resulting model.

cs.CL↗

MinerU2.5: A Decoupled Vision-Language Model for Efficient High-Resolution Document Parsing

We introduce MinerU2.5, a 1.2B-parameter document parsing vision-language model that achieves state-of-the-art recognition accuracy while maintaining exceptional computational efficiency. Our approach employs a coarse-to-fine, two-stage parsing strategy that decouples global layout analysis from local content recognition. In the first stage, the model performs efficient layout analysis on downsampled images to identify structural elements, circumventing the computational overhead of processing high-resolution inputs. In the second stage, guided by the global layout, it performs targeted content recognition on native-resolution crops extracted from the original image, preserving fine-grained details in dense text, complex formulas, and tables. To support this strategy, we developed a comprehensive data engine that generates diverse, large-scale training corpora for both pretraining and fine-tuning. Ultimately, MinerU2.5 demonstrates strong document parsing ability, achieving state-of-the-art performance on multiple benchmarks, surpassing both general-purpose and domain-specific models across various recognition tasks, while maintaining significantly lower computational overhead.

cs.CV↗