arXiv subjects

Bo Chen

Publications and source records attributed to Bo Chen.

At least 109 records · Page 6Linked to original sources

arXiv2026

Deformation mechanisms and compressive response of NbTaTiZr alloy via machine learning potentials

Refractory multi-principal element alloys (MPEAs) are key research focus for excellent high-temp properties and engineering potential. Deformation mechanisms/mechanical behaviors of quaternary NbTaTiZr MPEA under high strain rates/extreme temps remain unclear. We built a variable-composition ML potential for NbTaTiZr, combined with MD simulations to study effects of crystal orientation, strain rate, temp, composition on compressive mechanics. NbTaTiZr shows structural/mechanical anisotropy in compression [111] max yield strength, [110] min (prone to twinning), [100] via local disorder/dislocation slip (dominant 1/2<111> dislocations). At 10^10 s^-1, yield strength rises sharply, disordered structures increase; high strain rates suppress dislocations to promote disordering. Retains high strength at 2100 K. Higher Nb/Ta boosts yield strength, Ti/Zr reduce it. Reveals MPEA mechanical anisotropy and strain-rate-dependent disordering, guiding high-performance refractory alloy design.

cond-mat.mtrl-sci↗

arXiv2026

Steerable Instruction Following Coding Data Synthesis with Actor-Parametric Schema Co-Evolution

Interpreting and following human instructions is a critical capability of large language models (LLMs) in automatic programming. However, synthesizing large-scale instruction-paired coding data remains largely unexplored and is particularly challenging when ensuring logical compatibility among multiple constraints. In this study, we propose IFCodeEvolve, an actor-schema co-evolution framework for instruction following coding data generation. By representing instructions as parametric function schema, we construct a library that covers the vast instruction space via dynamic constraint instantiation. Building upon this, Monte Carlo Tree Search (MCTS) sampler is applied to efficiently navigate this space, utilizing actor model feedback as a dynamic termination signal. Furthermore, to progressively explore challenging problems, we introduce a co-evolving paradigm that iteratively advances both the actor model and the schema library, via schema composition and mutation, based on sampler statistics. Empirical results demonstrate that IFCodeEvolve significantly boosts base model performance, with our 32B model achieving parity with proprietary SOTA models. Additionally, we contribute IFCodeBench, a comprehensive human-verified benchmark equipped with solutions and robust AST-based verification.

cs.SE↗

arXiv2026

SMES: Towards Scalable Multi-Task Recommendation via Expert Sparsity

Industrial recommender systems typically rely on multi-task learning to estimate diverse user feedback signals and aggregate them for ranking. Recent advances in model scaling have shown promising gains in recommendation. However, naively increasing model capacity imposes prohibitive online inference costs and often yields diminishing returns for sparse tasks with skewed label distributions. This mismatch between uniform parameter scaling and heterogeneous task capacity demands poses a fundamental challenge for scalable multi-task recommendation. In this work, we investigate parameter sparsification as a principled scaling paradigm and identify two critical obstacles when applying sparse Mixture-of-Experts (MoE) to multi-task recommendation: exploded expert activation that undermines instance-level sparsity and expert load skew caused by independent task-wise routing. To address these challenges, we propose SMES, a scalable sparse MoE framework with progressive expert routing. SMES decomposes expert activation into a task-shared expert subset jointly selected across tasks and task-adaptive private experts, explicitly bounding per-instance expert execution while preserving task-specific capacity. In addition, SMES introduces a global multi-gate load-balancing regularizer that stabilizes training by regulating aggregated expert utilization across all tasks. SMES has been deployed in Kuaishou large-scale short-video services, supporting over 400 million daily active users. Extensive online experiments demonstrate stable improvements, with GAUC gain of 0.29% and a 0.31% uplift in user watch time.

cs.IR↗

arXiv2026

SPD-Faith Bench: Diagnosing and Improving Faithfulness in Chain-of-Thought for Multimodal Large Language Models

Chain-of-Thought reasoning is widely used to improve the interpretability of multimodal large language models (MLLMs), yet the faithfulness of the generated reasoning traces remains unclear. Prior work has mainly focused on perceptual hallucinations, leaving reasoning level unfaithfulness underexplored. To isolate faithfulness from linguistic priors, we introduce SPD-Faith Bench, a diagnostic benchmark based on fine-grained image difference reasoning that enforces explicit visual comparison. Evaluations on state-of-the-art MLLMs reveal two systematic failure modes, perceptual blindness and perception-reasoning dissociation. We trace these failures to decaying visual attention and representation shifts in the residual stream. Guided by this analysis, we propose SAGE, a train-free visual evidence-calibrated framework that improves visual routing and aligns reasoning with perception. Our results highlight the importance of explicitly evaluating faithfulness beyond response correctness. Our benchmark and codes are available at https://github.com/Johanson-colab/SPD-Faith-Bench.

cs.CV↗

arXiv2026

OpenOneRec Technical Report

While the OneRec series has successfully unified the fragmented recommendation pipeline into an end-to-end generative framework, a significant gap remains between recommendation systems and general intelligence. Constrained by isolated data, they operate as domain specialists-proficient in pattern matching but lacking world knowledge, reasoning capabilities, and instruction following. This limitation is further compounded by the lack of a holistic benchmark to evaluate such integrated capabilities. To address this, our contributions are: 1) RecIF Bench & Open Data: We propose RecIF-Bench, a holistic benchmark covering 8 diverse tasks that thoroughly evaluate capabilities from fundamental prediction to complex reasoning. Concurrently, we release a massive training dataset comprising 96 million interactions from 160,000 users to facilitate reproducible research. 2) Framework & Scaling: To ensure full reproducibility, we open-source our comprehensive training pipeline, encompassing data processing, co-pretraining, and post-training. Leveraging this framework, we demonstrate that recommendation capabilities can scale predictably while mitigating catastrophic forgetting of general knowledge. 3) OneRec-Foundation: We release OneRec Foundation (1.7B and 8B), a family of models establishing new state-of-the-art (SOTA) results across all tasks in RecIF-Bench. Furthermore, when transferred to the Amazon benchmark, our models surpass the strongest baselines with an average 26.8% improvement in Recall@10 across 10 diverse datasets (Figure 1). This work marks a step towards building truly intelligent recommender systems. Nonetheless, realizing this vision presents significant technical and theoretical challenges, highlighting the need for broader research engagement in this promising direction.

cs.IR↗

arXiv2026

Semantically Guided Dynamic Visual Prototype Refinement for Compositional Zero-Shot Learning

Compositional Zero-Shot Learning (CZSL) seeks to recognize unseen state-object pairs by recombining primitives learned from seen compositions. Despite recent progress with vision-language models (VLMs), two limitations remain: (i) text-driven semantic prototypes are weakly discriminative in the visual feature space; and (ii) unseen pairs are optimized passively, thereby inducing seen bias. To address these limitations, we present Duplex, a framework that couples dual-prototype learning with dynamic local-graph refinement of visual prototypes. For each composition, Duplex maintains a semantic prototype via prompt learning and a visual prototype for unseen pairs constructed by recombining disentangled state and object primitives from seen images. The visual prototypes are updated dynamically through lightweight aggregation on mini-batch local graphs, which incorporates unseen compositions during training without labels. This design introduces fine-grained visual evidence while preserving semantic structure. It enriches class prototypes, better disambiguates semantically similar yet visually distinct pairs, and mitigates seen bias. Experiments on MIT-States, UT-Zappos, and CGQA in closed-world and open-world settings achieve competitive performance and consistent compositional generalization. Our source code is available at https://github.com/ISPZ/Duplex-CZSL.

cs.CV↗

arXiv2026

Zero-Shot Stance Detection in the Wild: Dynamic Target Generation and Multi-Target Adaptation

Current stance detection research typically relies on predicting stance based on given targets and text. However, in real-world social media scenarios, targets are neither predefined nor static but rather complex and dynamic. To address this challenge, we propose a novel task: zero-shot stance detection in the wild with Dynamic Target Generation and Multi-Target Adaptation (DGTA), which aims to automatically identify multiple target-stance pairs from text without prior target knowledge. We construct a Chinese social media stance detection dataset and design multi-dimensional evaluation metrics. We explore both integrated and two-stage fine-tuning strategies for large language models (LLMs) and evaluate various baseline models. Experimental results demonstrate that fine-tuned LLMs achieve superior performance on this task: the two-stage fine-tuned Qwen2.5-7B attains the highest comprehensive target recognition score of 66.99%, while the integrated fine-tuned DeepSeek-R1-Distill-Qwen-7B achieves a stance detection F1 score of 79.26%.

cs.CL↗

arXiv2026

NegoCollab: A Common Representation Negotiation Approach for Heterogeneous Collaborative Perception

Collaborative perception improves task performance by expanding the perception range through information sharing among agents. . Immutable heterogeneity poses a significant challenge in collaborative perception, as participating agents may employ different and fixed perception models. This leads to domain gaps in the intermediate features shared among agents, consequently degrading collaborative performance. Aligning the features of all agents to a common representation can eliminate domain gaps with low training cost. However, in existing methods, the common representation is designated as the representation of a specific agent, making it difficult for agents with significant domain discrepancies from this specific agent to achieve proper alignment. This paper proposes NegoCollab, a heterogeneous collaboration method based on the negotiated common representation. It introduces a negotiator during training to derive the common representation from the local representations of each modality's agent, effectively reducing the inherent domain gap with the various local representations. In NegoCollab, the mutual transformation of features between the local representation space and the common representation space is achieved by a pair of sender and receiver. To better align local representations to the common representation containing multimodal information, we introduce structural alignment loss and pragmatic alignment loss in addition to the distribution alignment loss to supervise the training. This enables the knowledge in the common representation to be fully distilled into the sender.

cs.CV↗

arXiv2026

Adversarial Alignment: Ensuring Value Consistency in Large Language Models for Sensitive Domains

With the wide application of large language models (LLMs), the problems of bias and value inconsistency in sensitive domains have gradually emerged, especially in terms of race, society and politics. In this paper, we propose an adversarial alignment framework, which enhances the value consistency of the model in sensitive domains through continued pre-training, instruction fine-tuning and adversarial training. In adversarial training, we use the Attacker to generate controversial queries, the Actor to generate responses with value consistency, and the Critic to filter and ensure response quality. Furthermore, we train a Value-Consistent Large Language Model, VC-LLM, for sensitive domains, and construct a bilingual evaluation dataset in Chinese and English. The experimental results show that VC-LLM performs better than the existing mainstream models in both Chinese and English tests, verifying the effectiveness of the method. Warning: This paper contains examples of LLMs that are offensive or harmful in nature.

cs.CL↗

arXiv2026

Deceptive Sequential Decision-Making via Regularized Policy Optimization

Autonomous systems are increasingly expected to operate in the presence of adversaries, though adversaries may infer sensitive information simply by observing a system. Therefore, present a deceptive sequential decision-making framework that not only conceals sensitive information, but actively misleads adversaries about it. We model autonomous systems as Markov decision processes, with adversaries using inverse reinforcement learning to recover reward functions. To counter them, we present three regularization strategies for policy synthesis problems that actively deceive an adversary about a system's reward. ``Diversionary deception'' leads an adversary to draw any false conclusion about the system's reward function. ``Targeted deception'' leads an adversary to draw a specific false conclusion about the system's reward function. ``Equivocal deception'' leads an adversary to infer that the real reward and a false reward both explain the system's behavior. We show how each form of deception can be implemented in policy optimization problems and analytically bound the loss in total accumulated reward induced by deception. Next, we evaluate these developments in a multi-agent setting. We show that diversionary, targeted, and equivocal deception all steer the adversary to false beliefs while still attaining a total accumulated reward that is at least 98% of its optimal, non-deceptive value.

cs.LG↗

arXiv2026

Unleashing the Native Recommendation Potential: LLM-Based Generative Recommendation via Structured Term Identifiers

Leveraging the vast open-world knowledge and understanding capabilities of Large Language Models (LLMs) to develop general-purpose, semantically-aware recommender systems has emerged as a pivotal research direction in generative recommendation. However, existing methods face bottlenecks in constructing item identifiers. Text-based methods introduce LLMs' vast output space, leading to hallucination, while methods based on Semantic IDs (SIDs) encounter a semantic gap between SIDs and LLMs' native vocabulary, requiring costly vocabulary expansion and alignment training. To address this, this paper introduces Term IDs (TIDs), defined as a set of semantically rich and standardized textual keywords, to serve as robust item identifiers. We propose GRLM, a novel framework centered on TIDs, employs Context-aware Term Generation to convert item's metadata into standardized TIDs and utilizes Integrative Instruction Fine-tuning to collaboratively optimize term internalization and sequential recommendation. Additionally, Elastic Identifier Grounding is designed for robust item mapping. Extensive experiments on real-world datasets demonstrate that GRLM significantly outperforms baselines across multiple scenarios, pointing a promising direction for generalizable and high-performance generative recommendation systems.

cs.IR↗

arXiv2026

NextFlow: Unified Sequential Modeling Activates Multimodal Understanding and Generation

We present NextFlow, a unified decoder-only autoregressive transformer trained on 6 trillion interleaved text-image discrete tokens. By leveraging a unified vision representation within a unified autoregressive architecture, NextFlow natively activates multimodal understanding and generation capabilities, unlocking abilities of image editing, interleaved content and video generation. Motivated by the distinct nature of modalities - where text is strictly sequential and images are inherently hierarchical - we retain next-token prediction for text but adopt next-scale prediction for visual generation. This departs from traditional raster-scan methods, enabling the generation of 1024x1024 images in just 5 seconds - orders of magnitude faster than comparable AR models. We address the instabilities of multi-scale generation through a robust training recipe. Furthermore, we introduce a prefix-tuning strategy for reinforcement learning. Experiments demonstrate that NextFlow achieves state-of-the-art performance among unified models and rivals specialized diffusion baselines in visual quality.

cs.CV↗

arXiv2025

Smooth solutions to the Schrödinger flow for maps from smooth bounded domains in Euclidean spaces into $\mathbb{S}^2$

The results of this paper are twofold. One is that we show the local existence and uniqueness of very regular or smooth solution to the initial-Neumann boundary value problem of the Schrödinger flow for maps from a smooth bounded domain $Ω\subset \mathbb{R}^m$ with $m=1,2,3$ into $\mathbb{S}^2$ in the scale of Sobolev spaces. In this part, we provide a precise description of the compatibility conditions at the boundary for the initial data. The other is that we further prove that the locally smooth solution to the initial-Neumann boundary value problem of the 1-dimensional Schrödinger flow can be extended to a global smooth one.

math.AP↗

arXiv2025

Citizen CATE 2024: Extending Totality During the 8 April 2024 Total Solar Eclipse with a Distributed Network of Community Participants

The Citizen CATE 2024 next-generation experiment placed 43 identical telescope and camera setups along the path of totality during the total solar eclipse (TSE) on 8 April 2024 to capture a 60-minute movie of the inner and middle solar corona in polarized visible light. The 2024 TSE path covered a large geographic swath of North America and we recruited and trained 36 teams of community participants ("citizen scientists") representative of the various communities along the path of totality. Afterwards, these teams retained the equipment in their communities for ongoing education and public engagement activities. Participants ranged from students (K12, undergraduate, and graduate), educators, and adult learners to amateur and professional astronomers. In addition to equipment for their communities, CATE 2024 teams received hands-on telescope training, educational and learning materials, and instruction on data analysis techniques. CATE 2024 used high-cadence, high-dynamic-range (HDR) polarimetric observations of the solar corona to characterize the physical processes that shape its heating, structure, and evolution at scales and sensitivities that cannot be studied outside of a TSE. Conventional eclipse observations do not span sufficient time to capture changing coronal topology, but the extended observation from CATE 2024 does. Analysis of the fully calibrated dataset will provide deeper insight and understanding into these critical physical processes. We present an overview of the CATE 2024 project, including how we engaged local communities along the path of totality, and the first look at CATE 2024 data products from the 2024 TSE.

astro-ph.SR↗

arXiv2025

Multiframe Detection via Graph Neural Networks: A Link Prediction Approach

Multi-frame detection algorithms can effectively utilize the correlation between consecutive echoes to improve the detection performance of weak targets. Existing efficient multi-frame detection algorithms are typically based on three sequential steps: plot extraction via a relative low primary threshold, track search and track detection. However, these three-stage processing algorithms may result in a notable loss of detection performance and do not fully leverage the available echo information across frames. As to applying graph neural networks in multi-frame detection, the algorithms are primarily based on node classification tasks, which cannot directly output target tracks. In this paper, we reformulate the multi-frame detection problem as a link prediction task in graphs. First, we perform a rough association of multi-frame observations that exceed the low threshold to construct observation association graphs. Subsequently, a multi-feature link prediction network is designed based on graph neural networks, which integrates multi-dimensional information, including echo structure, Doppler information, and spatio-temporal coupling of plots. By leveraging the principle of link prediction, we unifies the processes of track search and track detection into one step to reduce performance loss and directly output target tracks. Experimental results indicate that, compared with traditional single-frame and multi-frame detection algorithms, the proposed algorithm improves the detection performance of weak targets while suppressing false alarms. Additionally, interpretable analysis shows that the designed network effectively integrates the utilized features, allowing for accurate associations between targets and false alarms.

eess.SP↗

arXiv2025

MSME: A Multi-Stage Multi-Expert Framework for Zero-Shot Stance Detection

LLM-based approaches have recently achieved impressive results in zero-shot stance detection. However, they still struggle in complex real-world scenarios, where stance understanding requires dynamic background knowledge, target definitions involve compound entities or events that must be explicitly linked to stance labels, and rhetorical devices such as irony often obscure the author's actual intent. To address these challenges, we propose MSME, a Multi-Stage, Multi-Expert framework for zero-shot stance detection. MSME consists of three stages: (1) Knowledge Preparation, where relevant background knowledge is retrieved and stance labels are clarified; (2) Expert Reasoning, involving three specialized modules-Knowledge Expert distills salient facts and reasons from a knowledge perspective, Label Expert refines stance labels and reasons accordingly, and Pragmatic Expert detects rhetorical cues such as irony to infer intent from a pragmatic angle; (3) Decision Aggregation, where a Meta-Judge integrates all expert analyses to produce the final stance prediction. Experiments on three public datasets show that MSME achieves state-of-the-art performance across the board.

cs.CL↗

arXiv2025

Design and dynamics experiment of filter wheel mechanism of space coronagraph

In order to realize multi-spectral imaging of space coronagraph, a compact filter wheel mechanism is designed. The filters with different spectral transmittance can be cut into the optical path at different times by this mechanism. Because the image contrast of space coronagraph is very high, the high stability requirement for the optical unit of coronagraph is put forward. Small modulus worm gear and worm are taken by the mechanism, in order to realize compact structure, high stiffness, the unidirectional 360 degrees rotation and reverse self-locking function. The precision, stiffness, mechanical properties and reliability of the mechanism are analyzed in the paper. The results show that the position accuracy of the filter wheel can meet the requirement of 0.5mm. The first order modal of the mechanism is 313Hz. The results of vibration test indicate that stiffness, dynamic performance and reliability of the mechanism can be meet. Therefore, the design of filter wheel in this paper can ensure the multi-spectral imaging requirements under complex spatial conditions.

astro-ph.IM↗

arXiv2025

Ultrafast Optical Evidence of Coexisting Density Waves in Bilayer Nickelate La$_3$Ni$_2$O$_7$

Utilizing ultrafast optical pump-probe spectroscopy, we investigate the coexistence and competition of electronic orders in the bilayer nickelate La$_3$Ni$_2$O$_7$. Our results reveal two coexisting density waves that can be selectively manipulated with light. We directly identify a spin-density wave (SDW) with electronic nematicity emerging below $T_{\rm SDW}$ $\approx$ 140 K by measuring its spin dynamics, and discover a distinct, nonmagnetic charge order appearing below $T_{\rm DW}$ $\approx$ 115 K. The central finding is the demonstration of differential optical control: the charge order is fragile, completely suppressed by a pump fluence of approximately 40 $μ$J/cm$^2$, while the SDW is remarkably robust, persisting to 200 $μ$J/cm$^2$. This work establishes a clear hierarchy in the stability of competing electronic orders and provides a powerful method for disentangling their interplay in quantum materials.

cond-mat.str-el↗