arXiv subjects

Lijuan Li

Publications and source records attributed to Lijuan Li.

6 recordsLinked to original sources

arXiv2025

Robust and tunable Floquet altermagnets in sliding A-type antiferromagnetic bilayers

Arranging the stacking orders of A-type antiferromagnetic (A-AFM) bilayers offers a practical pathway to realizing two-dimensional altermagnets. Previous proposals, however, rely on stringent symmetry constraints, including layer groups and stacking registries. In this work, we demonstrate that circularly polarized light (CPL) irradiation breaks time-reversal symmetry, enabling altermagnetism without these restrictions. Our comprehensive symmetry analysis reveals that inversionsymmetric A-AFM bilayer building blocks can host altermagnetism that is robust against stacking slides and variations in illumination direction, with rich and continuously tunable symmetry representations. Using bilayer MnBi$_2$Te$_4$ as a case study, we show that out-of-plane CPL stabilizes distinct $f$-wave or $p$-wave altermagnetic states in forward stacking, while reverse stacking manifests an even-odd parity conversion of altermagnetism based upon specific sliding configurations. These revealments broaden the scope of altermagnet design in inversion-symmetric A-AFM bilayers and establish CPL as a versatile control knob for engineering altermagnetic symmetries.

cond-mat.mtrl-sci↗

arXiv2025

Floquet-engineered Valley Topology with Anisotropic Response in 1T'-WSe$_2$ and Janus WSeTe monolayers

Valley topology has emerged as a key concept for realizing new classes of quantum states. Here, we investigate Floquet-engineered topological phase transitions in anisotropic 1T'-WSe$_2$ and its Janus derivative WSeTe monolayers, which exhibit valley-degenerate and valley-polarized characteristics, respectively. In 1T'-WSe$_2$, a single topological-phase-transition (TPT) occurs from the quantum-spin-Hall state (QSH) to the quantum anomalous Hall (QAH) state, involving one spin channel at both valleys simultaneously. In contrast, Janus WSeTe undergoes a two-stage Floquet-driven TPT that occurs within a single valley and sequentially involves two spin components. The intermediate phase manifests as a valley-polarized QAH (vp-QAH) state with a finite valley Chern number, while the final phase evolves into a high-Chern-number QAH state with distinct valley gaps. Furthermore, an in-plane anisotropic response of the TPTs is predicted under oblique light incidence, reflecting the intrinsic low-symmetry nature of the lattice. These findings provide a comprehensive understanding of Floquet-engineered valley-based topological properties and offer guidance for designing light-controllable valleytronic and topological devices.

cond-mat.mes-hall↗

arXiv2024

Knowing What Not to Do: Leverage Language Model Insights for Action Space Pruning in Multi-agent Reinforcement Learning

Multi-agent reinforcement learning (MARL) is employed to develop autonomous agents that can learn to adopt cooperative or competitive strategies within complex environments. However, the linear increase in the number of agents leads to a combinatorial explosion of the action space, which may result in algorithmic instability, difficulty in convergence, or entrapment in local optima. While researchers have designed a variety of effective algorithms to compress the action space, these methods also introduce new challenges, such as the need for manually designed prior knowledge or reliance on the structure of the problem, which diminishes the applicability of these techniques. In this paper, we introduce Evolutionary action SPAce Reduction with Knowledge (eSpark), an exploration function generation framework driven by large language models (LLMs) to boost exploration and prune unnecessary actions in MARL. Using just a basic prompt that outlines the overall task and setting, eSpark is capable of generating exploration functions in a zero-shot manner, identifying and pruning redundant or irrelevant state-action pairs, and then achieving autonomous improvement from policy feedback. In reinforcement learning tasks involving inventory management and traffic light control encompassing a total of 15 scenarios, eSpark consistently outperforms the combined MARL algorithm in all scenarios, achieving an average performance gain of 34.4% and 9.9% in the two types of tasks respectively. Additionally, eSpark has proven to be capable of managing situations with a large number of agents, securing a 29.7% improvement in scalability challenges that featured over 500 agents. The code can be found in https://github.com/LiuZhihao2022/eSpark.git.

cs.MA↗

arXiv2024

Controlling Large Language Model-based Agents for Large-Scale Decision-Making: An Actor-Critic Approach

The remarkable progress in Large Language Models (LLMs) opens up new avenues for addressing planning and decision-making problems in Multi-Agent Systems (MAS). However, as the number of agents increases, the issues of hallucination in LLMs and coordination in MAS have become increasingly prominent. Additionally, the efficient utilization of tokens emerges as a critical consideration when employing LLMs to facilitate the interactions among a substantial number of agents. In this paper, we develop a modular framework called LLaMAC to mitigate these challenges. LLaMAC implements a value distribution encoding similar to that found in the human brain, utilizing internal and external feedback mechanisms to facilitate collaboration and iterative reasoning among its modules. Through evaluations involving system resource allocation and robot grid transportation, we demonstrate the considerable advantages afforded by our proposed approach.

cs.AI↗

arXiv2023

Inducing Stackelberg Equilibrium through Spatio-Temporal Sequential Decision-Making in Multi-Agent Reinforcement Learning

In multi-agent reinforcement learning (MARL), self-interested agents attempt to establish equilibrium and achieve coordination depending on game structure. However, existing MARL approaches are mostly bound by the simultaneous actions of all agents in the Markov game (MG) framework, and few works consider the formation of equilibrium strategies via asynchronous action coordination. In view of the advantages of Stackelberg equilibrium (SE) over Nash equilibrium, we construct a spatio-temporal sequential decision-making structure derived from the MG and propose an N-level policy model based on a conditional hypernetwork shared by all agents. This approach allows for asymmetric training with symmetric execution, with each agent responding optimally conditioned on the decisions made by superior agents. Agents can learn heterogeneous SE policies while still maintaining parameter sharing, which leads to reduced cost for learning and storage and enhanced scalability as the number of agents increases. Experiments demonstrate that our method effectively converges to the SE policies in repeated matrix game scenarios, and performs admirably in immensely complex settings including cooperative tasks and mixed tasks.

cs.MA↗

arXiv2023

Stackelberg Decision Transformer for Asynchronous Action Coordination in Multi-Agent Systems

Asynchronous action coordination presents a pervasive challenge in Multi-Agent Systems (MAS), which can be represented as a Stackelberg game (SG). However, the scalability of existing Multi-Agent Reinforcement Learning (MARL) methods based on SG is severely constrained by network structures or environmental limitations. To address this issue, we propose the Stackelberg Decision Transformer (STEER), a heuristic approach that resolves the difficulties of hierarchical coordination among agents. STEER efficiently manages decision-making processes in both spatial and temporal contexts by incorporating the hierarchical decision structure of SG, the modeling capability of autoregressive sequence models, and the exploratory learning methodology of MARL. Our research contributes to the development of an effective and adaptable asynchronous action coordination method that can be widely applied to various task types and environmental configurations in MAS. Experimental results demonstrate that our method can converge to Stackelberg equilibrium solutions and outperforms other existing methods in complex scenarios.

cs.MA↗