Searcharxiv⌕ Search

arXiv subjects

Zhe Li

Publications and source records attributed to Zhe Li.

At least 127 records · Page 7Linked to original sources

BLM$_1$: A Boundless Large Model for Cross-Space, Cross-Task, and Cross-Embodiment Learning

Multimodal large language models (MLLMs) have advanced vision-language reasoning and are increasingly deployed in embodied agents. However, significant limitations remain: MLLMs generalize poorly across digital-physical spaces and embodiments; vision-language-action models (VLAs) produce low-level actions yet lack robust high-level embodied reasoning; and most embodied large language models (ELLMs) are constrained to digital-space with poor generalization to the physical world. Thus, unified models that operate seamlessly across digital and physical spaces while generalizing across embodiments and tasks remain absent. We introduce the \textbf{Boundless Large Model (BLM$_1$)}, a multimodal spatial foundation model that preserves instruction following and reasoning, incorporates embodied knowledge, and supports robust cross-embodiment control. BLM$_1$ integrates three key capabilities -- \textit{cross-space transfer, cross-task learning, and cross-embodiment generalization} -- via a two-stage training paradigm. Stage I injects embodied knowledge into the MLLM through curated digital corpora while maintaining language competence. Stage II trains a policy module through an intent-bridging interface that extracts high-level semantics from the MLLM to guide control, without fine-tuning the MLLM backbone. This process is supported by a self-collected cross-embodiment demonstration suite spanning four robot embodiments and six progressively challenging tasks. Evaluations across digital and physical benchmarks show that a single BLM$_1$ instance outperforms four model families -- MLLMs, ELLMs, VLAs, and GMLMs -- achieving $\sim\!\textbf{6%}$ gains in digital tasks and $\sim\!\textbf{3%}$ in physical tasks.

cs.AI↗

Dual-Flow: Transferable Multi-Target, Instance-Agnostic Attacks via In-the-wild Cascading Flow Optimization

Adversarial attacks are widely used to evaluate model robustness, and in black-box scenarios, the transferability of these attacks becomes crucial. Existing generator-based attacks have excellent generalization and transferability due to their instance-agnostic nature. However, when training generators for multi-target tasks, the success rate of transfer attacks is relatively low due to the limitations of the model's capacity. To address these challenges, we propose a novel Dual-Flow framework for multi-target instance-agnostic adversarial attacks, utilizing Cascading Distribution Shift Training to develop an adversarial velocity function. Extensive experiments demonstrate that Dual-Flow significantly improves transferability over previous multi-target generative attacks. For example, it increases the success rate from Inception-v3 to ResNet-152 by 34.58\%. Furthermore, our attack method shows substantially stronger robustness against defense mechanisms, such as adversarially trained models. The code of Dual-Flow is available at: $\href{https://github.com/Chyxx/Dual-Flow}{https://github.com/Chyxx/Dual-Flow}$.

cs.CV↗

Every Step Evolves: Scaling Reinforcement Learning for Trillion-Scale Thinking Model

We present Ring-1T, the first open-source, state-of-the-art thinking model with a trillion-scale parameter. It features 1 trillion total parameters and activates approximately 50 billion per token. Training such models at a trillion-parameter scale introduces unprecedented challenges, including train-inference misalignment, inefficiencies in rollout processing, and bottlenecks in the RL system. To address these, we pioneer three interconnected innovations: (1) IcePop stabilizes RL training via token-level discrepancy masking and clipping, resolving instability from training-inference mismatches; (2) C3PO++ improves resource utilization for long rollouts under a token budget by dynamically partitioning them, thereby obtaining high time efficiency; and (3) ASystem, a high-performance RL framework designed to overcome the systemic bottlenecks that impede trillion-parameter model training. Ring-1T delivers breakthrough results across critical benchmarks: 93.4 on AIME-2025, 86.72 on HMMT-2025, 2088 on CodeForces, and 55.94 on ARC-AGI-1. Notably, it attains a silver medal-level result on the IMO-2025, underscoring its exceptional reasoning capabilities. By releasing the complete 1T parameter MoE model to the community, we provide the research community with direct access to cutting-edge reasoning capabilities. This contribution marks a significant milestone in democratizing large-scale reasoning intelligence and establishes a new baseline for open-source model performance.

cs.CL↗

Towards Straggler-Resilient Split Federated Learning: An Unbalanced Update Approach

Split Federated Learning (SFL) enables scalable training on edge devices by combining the parallelism of Federated Learning (FL) with the computational offloading of Split Learning (SL). Despite its great success, SFL suffers significantly from the well-known straggler issue in distributed learning systems. This problem is exacerbated by the dependency between Split Server and clients: the Split Server side model update relies on receiving activations from clients. Such synchronization requirement introduces significant time latency, making straggler a critical bottleneck to the scalability and efficiency of the system. To mitigate this problem, we propose MU-SplitFed, a straggler-resilient SFL algorithm in zeroth-order optimization that decouples training progress from straggler delays via a simple yet effective unbalanced update mechanism. By enabling the server to perform $τ$ local updates per client round, MU-SplitFed achieves a convergence rate of $O(\sqrt{d/(τT)})$ for non-convex objectives, demonstrating a linear speedup of $τ$ in communication rounds. Experiments demonstrate that MU-SplitFed consistently outperforms baseline methods with the presence of stragglers and effectively mitigates their impact through adaptive tuning of $τ$. The code for this project is available at https://github.com/Johnny-Zip/MU-SplitFed.

cs.DC↗

On-shell Matrix Elements of the EMT Trace in Gauge Theories and Heavy Quark Masses

We present a novel diagrammatic proof of the identity between the forward matrix element of the energy-momentum-tensor (EMT) trace operator over a single particle's on-shell state and its perturbative pole mass to any loop orders in perturbative gauge theories (with gauge bosons and fermions), without appealing to any pre-laid operator renormalization conditions or Ward identities. The proof is based on the equation of mass-dimensional analysis in dimensional regularization, the topological properties of contributing Feynman diagrams and the on-shell renormalization condition. Considering for definiteness perturbative QED and QCD with at most one fermion kept massive, we have verified the aforementioned identity, up to three loops, for all elementary particles through direct computation of dimensionally-regularized matrix elements of the relevant bare operators. We observe interestingly that the trace-anomaly contribution seemingly contains all leading-renormalon effects (explicitly verified up to three loops), and we propose accordingly a new scheme- and scale-independent trace-anomaly-subtracted mass definition for heavy $t$-,$\,b$-,$\,c$-quarks and electrons. A list of amusing numbers is subsequently presented for the composition of their perturbative pole masses.

hep-ph↗

From Language to Locomotion: Retargeting-free Humanoid Control via Motion Latent Guidance

Natural language offers a natural interface for humanoid robots, but existing language-guided humanoid locomotion pipelines remain cumbersome and untrustworthy. They typically decode human motion, retarget it to robot morphology, and then track it with a physics-based controller. However, this multi-stage process is prone to cumulative errors, introduces high latency, and yields weak coupling between semantics and control. These limitations call for a more direct pathway from language to action, one that eliminates fragile intermediate stages. Therefore, we present RoboGhost, a retargeting-free framework that directly conditions humanoid policies on language-grounded motion latents. By bypassing explicit motion decoding and retargeting, RoboGhost enables a diffusion-based policy to denoise executable actions directly from noise, preserving semantic intent and supporting fast, reactive control. A hybrid causal transformer-diffusion motion generator further ensures long-horizon consistency while maintaining stability and diversity, yielding rich latent representations for precise humanoid behavior. Extensive experiments demonstrate that RoboGhost substantially reduces deployment latency, improves success rates and tracking precision, and produces smooth, semantically aligned locomotion on real humanoids. Beyond text, the framework naturally extends to other modalities such as images, audio, and music, providing a universal foundation for vision-language-action humanoid systems.

cs.RO↗

OmniMotion: Multimodal Motion Generation with Continuous Masked Autoregression

Whole-body multi-modal human motion generation poses two primary challenges: creating an effective motion generation mechanism and integrating various modalities, such as text, speech, and music, into a cohesive framework. Unlike previous methods that usually employ discrete masked modeling or autoregressive modeling, we develop a continuous masked autoregressive motion transformer, where a causal attention is performed considering the sequential nature within the human motion. Within this transformer, we introduce a gated linear attention and an RMSNorm module, which drive the transformer to pay attention to the key actions and suppress the instability caused by either the abnormal movements or the heterogeneous distributions within multi-modalities. To further enhance both the motion generation and the multimodal generalization, we employ the DiT structure to diffuse the conditions from the transformer towards the targets. To fuse different modalities, AdaLN and cross-attention are leveraged to inject the text, speech, and music signals. Experimental results demonstrate that our framework outperforms previous methods across all modalities, including text-to-motion, speech-to-gesture, and music-to-dance. The code of our method will be made public.

cs.CV↗

Graph Conditioned Diffusion for Controllable Histopathology Image Generation

Recent advances in Diffusion Probabilistic Models (DPMs) have set new standards in high-quality image synthesis. Yet, controlled generation remains challenging, particularly in sensitive areas such as medical imaging. Medical images feature inherent structure such as consistent spatial arrangement, shape or texture, all of which are critical for diagnosis. However, existing DPMs operate in noisy latent spaces that lack semantic structure and strong priors, making it difficult to ensure meaningful control over generated content. To address this, we propose graph-based object-level representations for Graph-Conditioned-Diffusion. Our approach generates graph nodes corresponding to each major structure in the image, encapsulating their individual features and relationships. These graph representations are processed by a transformer module and integrated into a diffusion model via the text-conditioning mechanism, enabling fine-grained control over generation. We evaluate this approach using a real-world histopathology use case, demonstrating that our generated data can reliably substitute for annotated patient data in downstream segmentation tasks. The code is available here.

cs.CV↗

Exact and Linear Convergence for Federated Learning under Arbitrary Client Participation is Attainable

This work tackles the fundamental challenges in Federated Learning (FL) posed by arbitrary client participation and data heterogeneity, prevalent characteristics in practical FL settings. It is well-established that popular FedAvg-style algorithms struggle with exact convergence and can suffer from slow convergence rates since a decaying learning rate is required to mitigate these scenarios. To address these issues, we introduce the concept of stochastic matrix and the corresponding time-varying graphs as a novel modeling tool to accurately capture the dynamics of arbitrary client participation and the local update procedure. Leveraging this approach, we offer a fresh decentralized perspective on designing FL algorithms and present FOCUS, Federated Optimization with Exact Convergence via Push-pull Strategy, a provably convergent algorithm designed to effectively overcome the previously mentioned two challenges. More specifically, we provide a rigorous proof demonstrating that FOCUS achieves exact convergence with a linear rate regardless of the arbitrary client participation, establishing it as the first work to demonstrate this significant result.

cs.LG↗

Where Did It Go Wrong? Attributing Undesirable LLM Behaviors via Representation Gradient Tracing

Large Language Models (LLMs) have demonstrated remarkable capabilities, yet their deployment is frequently undermined by undesirable behaviors such as generating harmful content, factual inaccuracies, and societal biases. Diagnosing the root causes of these failures poses a critical challenge for AI safety. Existing attribution methods, particularly those based on parameter gradients, often fall short due to prohibitive noisy signals and computational complexity. In this work, we introduce a novel and efficient framework that diagnoses a range of undesirable LLM behaviors by analyzing representation and its gradients, which operates directly in the model's activation space to provide a semantically meaningful signal linking outputs to their training data. We systematically evaluate our method for tasks that include tracking harmful content, detecting backdoor poisoning, and identifying knowledge contamination. The results demonstrate that our approach not only excels at sample-level attribution but also enables fine-grained token-level analysis, precisely identifying the specific samples and phrases that causally influence model behavior. This work provides a powerful diagnostic tool to understand, audit, and ultimately mitigate the risks associated with LLMs. The code is available at https://github.com/plumprc/RepT.

cs.CL↗

BEM-Assisted Low-Complexity Channel Estimation for AFDM Systems over Doubly Selective Channels

In this paper, we propose a low-complexity channel estimation scheme of affine frequency division multiplexing (AFDM) based on generalized complex exponential basis expansion model (GCE-BEM) over doubly selective channels. The GCE-BEM is used to solve fractional Doppler dispersion.Then, the closed-form expression of channel estimation error is derived for the minimum mean square error (MMSE) estimation algorithm. Based on the estimated channel, the MMSE detection is adopt to characterize the impacts of estimated channel on bit error rate (BER) by deriving the theoretical lower bound. Finally, numerical results demonstrate that the proposed scheme effectively mitigates severe inter-Doppler interference (IDoI). Our theoretical performance analysis can perfectly match the Monte-Carlo results, validating the effectiveness of our proposed channel estimation based on GCE-BEM.

eess.SP↗

Laser-engineered $Γ$-point Topology in Trigonal Bismuthene

The $Γ$-point topology represents a significant segment in the family of topological insulators. Here we provide a comprehensive prediction of light-induced $Γ$-point-based topological manipulation in trigonal bismuthene and its derivatives. Our findings unveil a two-stage process of topological phase transitions (TPT) as the laser intensity increases. Initially, a quantum-spin-Hall or metallic state transitions to a quantum-anomalous-Hall (QAH) state ($C$ = $\pm$3), followed by another TPT that yields a compensated Chern-insulating state ($C$ = 0). The trigonal warping model accounts for these states, describing the $C_{3z}$-rotational band-inversion process, which is determined by $\pm$1 orders of replica bands. Notably, this high Chern-number QAH state persists over a broad range of laser parameters, maintaining functionality beyond room temperature as evidenced by the large global gaps ($\geq$ 60 meV). Our work provides a comprehensive roadmap towards the designer $Γ$-point topology under laser excitation, facilitating applications of artificial topological materials.

cond-mat.mes-hall↗

Thickness-Induced Topological Phase Transition Investigated by Helicity Dependent Photocurrent in $α$-Sn/CdTe(110)

$α$-Sn exhibits a rich topological phase diagram, yet experimental methods to tune and distinguish these phases remain limited. Here, we investigated the helicity-dependent photocurrent (HDPC) in $α$-Sn films of varying thickness grown on CdTe(110) by molecular beam epitaxy. The HDPC of the 5 nm $α$-Sn film shows an odd-function dependence on incident angle, whereas that of the 10 and 30 nm films exhibit an even-function dependence. Combined with high-resolution transmission electron microscopy (HR-TEM), point-group symmetry analysis, and first-principles calculations, it is revealed that a thickness-driven topological phase transition from a two dimensional (2D) to a three dimensional (3D) topological insulator occurs between 5 and 10 nm. These results demonstrate that HDPC serves as a sensitive diagnostic tool for topological phase transitions. The tunable electronic properties of $α$-Sn(110) films enable thickness- and strain-mediated control of topological states, establishing a versatile platform for exploring emerging topological phenomena and developing spin-based devices.

cond-mat.mtrl-sci↗

Highly tunable band structure in ferroelectric R-stacked bilayer WSe$_2$

Transition metal dichalcogenide homobilayers unite two frontiers of quantum materials research: sliding ferroelectricity, arising from rhombohedral (R) stacking, and moiré quantum matter, emerging from small-angle twisting. The spontaneous polarization of ferroelectric R-stacked homobilayers produces a highly tunable band structure, which, together with strain-induced piezoelectricity, governs the topology and correlated electronic phases of twisted bilayers. Here we present a systematic low-temperature optical spectroscopy study of R-stacked bilayer WSe$_2$ to quantitatively establish its fundamental electronic and ferroelectric properties. Exciton and exciton-polaron spectroscopy under doping reveals a pronounced electron-hole asymmetry that confirms type-II band alignment, with the conduction and valence band edges located at the $Λ$ and K valleys, respectively. Through distinct excitonic responses and tunable interlayer-intralayer exciton hybridization under displacement fields, we uncover the coexistence of AB and BA ferroelectric domains. Using exciton-polarons as a probe, we directly measure the intrinsic polarization field and extract the interlayer potential. Finally, we demonstrate electric-field-driven symmetric switching of the valence band maximum, attributed to ferroelectric domain switching. These results provide a complete experimental picture of the band alignment, spontaneous polarization field, and domain dynamics of R-stacked WSe$_2$, establishing key parameters to understand twisted bilayers and enabling new ferroelectric and excitonic device opportunities.

cond-mat.mtrl-sci↗

TrInk: Ink Generation with Transformer Network

In this paper, we propose TrInk, a Transformer-based model for ink generation, which effectively captures global dependencies. To better facilitate the alignment between the input text and generated stroke points, we introduce scaled positional embeddings and a Gaussian memory mask in the cross-attention module. Additionally, we design both subjective and objective evaluation pipelines to comprehensively assess the legibility and style consistency of the generated handwriting. Experiments demonstrate that our Transformer-based model achieves a 35.56\% reduction in character error rate (CER) and an 29.66% reduction in word error rate (WER) on the IAM-OnDB dataset compared to previous methods. We provide an demo page with handwriting samples from TrInk and baseline models at: https://akahello-a11y.github.io/trink-demo/

cs.CL↗

DanceEditor: Towards Iterative Editable Music-driven Dance Generation with Open-Vocabulary Descriptions

Generating coherent and diverse human dances from music signals has gained tremendous progress in animating virtual avatars. While existing methods support direct dance synthesis, they fail to recognize that enabling users to edit dance movements is far more practical in real-world choreography scenarios. Moreover, the lack of high-quality dance datasets incorporating iterative editing also limits addressing this challenge. To achieve this goal, we first construct DanceRemix, a large-scale multi-turn editable dance dataset comprising the prompt featuring over 25.3M dance frames and 84.5K pairs. In addition, we propose a novel framework for iterative and editable dance generation coherently aligned with given music signals, namely DanceEditor. Considering the dance motion should be both musical rhythmic and enable iterative editing by user descriptions, our framework is built upon a prediction-then-editing paradigm unifying multi-modal conditions. At the initial prediction stage, our framework improves the authority of generated results by directly modeling dance movements from tailored, aligned music. Moreover, at the subsequent iterative editing stages, we incorporate text descriptions as conditioning information to draw the editable results through a specifically designed Cross-modality Editing Module (CEM). Specifically, CEM adaptively integrates the initial prediction with music and text prompts as temporal motion cues to guide the synthesized sequences. Thereby, the results display music harmonics while preserving fine-grained semantic alignment with text descriptions. Extensive experiments demonstrate that our method outperforms the state-of-the-art models on our newly collected DanceRemix dataset. Code is available at https://lzvsdy.github.io/DanceEditor/.

cs.GR↗

A particle view of many-body electronic structure with neural network wavefunction

In the study of electronic structure, the wavefunction view dominates the current research landscape and forms the theoretical foundation of modern quantum mechanics. In contrast, Valence Bond (VB) theory represents chemical bonds as shared electron-pairs and can provide an intuitive, particle-based insight into chemical bonding. In this work, using a newly developed Periodic Dynamic Voronoi Metropolis Sampling (PDVMS) method, we project classical many-body electronic configurations from the neural network wavefunction, and apply VB theory to construct a complementary particle-view paradigm. The powerful neural network wavefunction can achieve near-exact ab initio solutions for the ground state of both molecular and solid systems. It allows us to definitively characterize the ground state of benzene by reassessing the competition between its two VB structures. Extending PDVMS to solids for the first time, we also predict a spin-staggered VB structure in graphene, which explains emergent magnetic properties in graphene-based nanostructures. Furthermore, this particle view provides insight into the optimization process of the neural network wavefunction itself. Our work thus introduces a novel framework for analyzing many-body electronic structure in molecules and solids, opening new avenues for investigating this complex problem and its associated exotic phenomena.

physics.chem-ph↗

Learning to control inexact Benders decomposition via reinforcement learning

Benders decomposition (BD), along with its generalized version (GBD), is a widely used algorithm for solving large-scale mixed-integer optimization problems that arise in the operation of process systems. However, the off-the-shelf application to online settings can be computationally inefficient due to the repeated solution of the master problem. An approach to reduce the solution time is to solve the master problem to local optimality. However, identifying the level of suboptimality at each iteration that minimizes the total solution time is nontrivial. In this paper, we propose the application of reinforcement learning to determine the best optimality gap at each GBD iteration. First, we show that the inexact GBD can converge to the optimal solution given a properly designed optimality gap schedule. Next, leveraging reinforcement learning, we learn a policy that minimizes the total solution time, balancing the solution time per iteration with optimality gap improvement. In the resulting RL-iGBD algorithm, the policy adapts the optimality gap at each iteration based on the features of the problem and the solution progress. In numerical experiments on a mixed-integer economic model predictive control problem, we show that the proposed RL-enhanced iGBD method achieves substantial reductions in solution time.

math.OC↗