Searcharxiv⌕ Search

arXiv subjects

Chunxiao Liu

Publications and source records attributed to Chunxiao Liu.

At least 55 records · Page 3Linked to original sources

Theory of topological defects and textures in two-dimensional quantum orders with spontaneous symmetry breaking

We consider two-dimensional (2d) quantum many-body systems with long-range orders, where the only gapless excitations in the spectrum are Goldstone modes of spontaneously broken continuous symmetries. To understand the interplay between classical long-range order of local order parameters and quantum order of long-range entanglement in the ground states, we study the topological point defects and textures of order parameters in such systems. We show that the universal properties of point defects and textures are determined by the remnant symmetry enriched topological order in the symmetry-breaking ground states with a non-fluctuating order parameter, and provide a classification for their properties based on the inflation-restriction exact sequence. We highlight a few phenomena revealed by our theory framework. First, in the absence of intrinsic topological orders, we show a connection between the symmetry properties of point defects and textures to deconfined quantum criticality. Second, when the symmetry-breaking ground state have intrinsic topological orders, we show that the point defects can permute different anyons when braided around. They can also obey projective fusion rules in the sense that multiple vortices can fuse into an Abelian anyon, a phenomena for which we coin "defect fractionalization". Finally, we provide a formula to compute the fractional statistics and fractional quantum numbers carried by textures (skyrmions) in Abelian topological orders.

cond-mat.str-el↗

Structure of domain walls in chiral spin liquids

The chiral spin liquid is one of the canonical examples of a topological state of quantum spins coexisting with symmetry-breaking chiral order; its experimental realization has been actively discussed in the past few years. Here, motivated by the interplay between topology and symmetry breaking, we examine the physics of the interface between two chiral spin liquid domains with opposite chiralities. We show that a self-consistent mean-field description for the spinons exists that describes both the change of chirality at the domain wall and the gapless edge modes living on it. A Ginzburg--Landau theory for the domain wall is formulated based on the mean-field picture, from which we obtain the non-universal properties of the domain wall such as the wall width and tension. We show that the velocity of the topologically protected domain wall edge states can be accessed through the Jackiw-Rebbi mechanism. We further argue that the gapless modes at the edge contribute an extra, non-analytic $|ϕ^3|$ term to the domain wall theory, and find numerical evidence for this non-analyticity.

cond-mat.str-el↗

Universal Entanglement Transitions of Free Fermions with Long-range Non-unitary Dynamics

Non-unitary evolution can give rise to novel steady states classified by their entanglement properties. In this work, we aim to understand its interplay with long-range hopping that decays with $r^{-α}$ in free-fermion systems. We first study two solvable Brownian models with long-range non-unitary dynamics: a large-$N$ SYK$_2$ chain and a single-flavor fermion chain and we show that they share the same phase diagram. When $α>0.5$, we observe two critical phases with subvolume entanglement scaling: (i) $α>1.5$, a logarithmic phase with dynamical exponent $z=1$ and logarithmic subsystem entanglement, and (ii) $0.5<α<1.5$, a fractal phase with $z=\frac{2α-1}{2}$ and subsystem entanglement $S_A\propto L_A^{1-z}$, where $L_A$ is the length of the subsystem $A$. These two phases cannot be distinguished by the purification dynamics, in which the entropy always decays as $L/T$. We then confirm that the results are also valid for the static SYK$_2$ chain, indicating the phase diagram is universal for general free-fermion systems. We also discuss phase diagrams in higher dimensions and the implication in measurement-induced phase transitions.

cond-mat.str-el↗

Learning to Simulate Self-Driven Particles System with Coordinated Policy Optimization

Self-Driven Particles (SDP) describe a category of multi-agent systems common in everyday life, such as flocking birds and traffic flows. In a SDP system, each agent pursues its own goal and constantly changes its cooperative or competitive behaviors with its nearby agents. Manually designing the controllers for such SDP system is time-consuming, while the resulting emergent behaviors are often not realistic nor generalizable. Thus the realistic simulation of SDP systems remains challenging. Reinforcement learning provides an appealing alternative for automating the development of the controller for SDP. However, previous multi-agent reinforcement learning (MARL) methods define the agents to be teammates or enemies before hand, which fail to capture the essence of SDP where the role of each agent varies to be cooperative or competitive even within one episode. To simulate SDP with MARL, a key challenge is to coordinate agents' behaviors while still maximizing individual objectives. Taking traffic simulation as the testing bed, in this work we develop a novel MARL method called Coordinated Policy Optimization (CoPO), which incorporates social psychology principle to learn neural controller for SDP. Experiments show that the proposed method can achieve superior performance compared to MARL baselines in various metrics. Noticeably the trained vehicles exhibit complex and diverse social behaviors that improve performance and safety of the population as a whole. Demo video and source code are available at: https://decisionforce.github.io/CoPO/

cs.LG↗

Realization of Quantum Dipoles in Triangular Lattice Crystal Ba3Yb(BO3)3

We investigate the thermodynamic properties of the ytterbium-based triangular lattice compound Ba3Yb(BO3)3. The results demonstrate the absence of any long-range ordering down to 56 mK. Analysis of the magnetization, susceptibility and specific heat measurements suggests that Ba3Yb(BO3)3 may realize a S = 1/2 quantum dipole lattice, in which the dominant interaction is the long range dipole-dipole coupling on the geometrically frustrated triangular lattice, and exchange interactions are subdominant or negligible.

cond-mat.str-el↗

Safe Driving via Expert Guided Policy Optimization

When learning common skills like driving, beginners usually have domain experts standing by to ensure the safety of the learning process. We formulate such learning scheme under the Expert-in-the-loop Reinforcement Learning where a guardian is introduced to safeguard the exploration of the learning agent. While allowing the sufficient exploration in the uncertain environment, the guardian intervenes under dangerous situations and demonstrates the correct actions to avoid potential accidents. Thus ERL enables both exploration and expert's partial demonstration as two training sources. Following such a setting, we develop a novel Expert Guided Policy Optimization (EGPO) method which integrates the guardian in the loop of reinforcement learning. The guardian is composed of an expert policy to generate demonstration and a switch function to decide when to intervene. Particularly, a constrained optimization technique is used to tackle the trivial solution that the agent deliberately behaves dangerously to deceive the expert into taking over. Offline RL technique is further used to learn from the partial demonstration generated by the expert. Safe driving experiments show that our method achieves superior training and test-time safety, outperforms baselines with a substantial margin in sample efficiency, and preserves the generalizabiliy to unseen environments in test-time. Demo video and source code are available at: https://decisionforce.github.io/EGPO/

cs.AI↗

Emergent Replica Conformal Symmetry in Non-Hermitian SYK$_2$ Chains

Recently, the steady states of non-unitary free fermion dynamics are found to exhibit novel critical phases with power-law squared correlations and a logarithmic subsystem entanglement. In this work, we theoretically understand the underlying physics by constructing solvable static/Brownian quadratic Sachdev-Ye-Kitaev chains with non-Hermitian dynamics. We find the action of the replicated system generally shows (one or infinite copies of) ${O(2)\times O(2)}$ symmetries, which is broken to ${O(2)}$ by the saddle-point solution. This leads to an emergent conformal field theory of the Goldstone modes. We derive the effective action and obtain the universal critical behaviors of squared correlators. Furthermore, the entanglement entropy of a subsystem ${A}$ with length ${L_A}$ corresponds to the energy of the half-vortex pair ${S\sim ρ_s \log L_A}$, where ${ρ_s}$ is the total stiffness of the Goldstone modes. We also discuss special limits with more than one branch of Goldstone modes and comment on interaction effects.

cond-mat.str-el↗

SYK meets non-Hermiticity II: measurement-induced phase transition

We construct Brownian Sachdev-Ye-Kitaev (SYK) chains subjected to continuous monitoring and explore possible entanglement phase transitions therein. We analytically derive the effective action in the large-$N$ limit and show that an entanglement transition is caused by the symmetry breaking in the enlarged replica space. In the noninteracting case with SYK$_2$ chains, the model features a continuous $O(2)$ symmetry between two replicas and a transition corresponding to spontaneous breaking of that symmetry upon varying the measurement rate. In the symmetry broken phase at low measurement rate, the emergent replica criticality associated with the Goldstone mode leads to a log-scaling entanglement entropy that can be attributed to the free energy of vortices. In the symmetric phase at higher measurement rate, the entanglement entropy obeys area-law scaling. In the interacting case, the continuous $O(2)$ symmetry is explicitly lowered to a discrete $C_4$ symmetry, giving rise to volume-law entanglement entropy in the symmetry-broken phase due to the enhanced linear free energy cost of domain walls compared to vortices. The interacting transition is described by $C_4$ symmetry breaking. We also verify the large-$N$ critical exponents by numerically solving the Schwinger-Dyson equation.

cond-mat.str-el↗

Autonomous Underwater Vehicle-Manipulator Systems Path Planning with RRTAUVMS Algorithm

Autonomous Underwater Vehicle-Manipulator systems (AUVMS) is a new tool for ocean exploration, the AUVMS path planning problem is addressed in this paper. AUVMS is a high dimension system with a large difference in inertia distribution, also it works in a complex environment with obstacles. By integrating the rapidly-exploring random tree(RRT) algorithm with the AUVMS kinematics model, the proposed RRTAUVMS algorithm could randomly sample in the configuration space(C-Space), and also grow the tree directly towards the workspace goal in the task space. The RRTAUVMS can also deal with the redundant mapping of workspace planning goal and configuration space goal. Compared with the traditional RRT algorithm, the efficiency of the AUVMS path planning can be significantly improved.

cs.RO↗

Quantum error as an emergent magnetic field

We investigate the effect of quantum errors on a monitored Brownian Sachdev-Ye-Kitaev (SYK) model featuring a measurement-induced phase transition that can be understood as a symmetry-breaking transition of an effective $Z_4$ magnet in the replica space. The errors describe the loss of information about the measurement outcomes and are applied during the non-unitary evolution or at the end of the evolution. In the former case, we find that this error can be mapped to an emergent magnetic field in the $Z_4$ magnet, and as a consequence, the symmetry is explicitly broken independent of the measurement rate. Rényi entropies computed by twisting boundary conditions now generate domain walls even in the would-be symmetric phase at a high measurement rate. The entropy is therefore volume-law irrespective of the measurement rate. In the latter case, the error-induced magnetic field only exists near the boundary of the magnet. Varying the magnetic field leads to a pinning transition of domain walls, corresponding to error threshold of the quantum code prepared by the non-unitary SYK dynamics.

quant-ph↗

Learning a Decision Module by Imitating Driver's Control Behaviors

Autonomous driving systems have a pipeline of perception, decision, planning, and control. The decision module processes information from the perception module and directs the execution of downstream planning and control modules. On the other hand, the recent success of deep learning suggests that this pipeline could be replaced by end-to-end neural control policies, however, safety cannot be well guaranteed for the data-driven neural networks. In this work, we propose a hybrid framework to learn neural decisions in the classical modular pipeline through end-to-end imitation learning. This hybrid framework can preserve the merits of the classical pipeline such as the strict enforcement of physical and logical constraints while learning complex driving decisions from data. To circumvent the ambiguous annotation of human driving decisions, our method learns high-level driving decisions by imitating low-level control behaviors. We show in the simulation experiments that our modular driving agent can generalize its driving decision and control to various complex scenarios where the rule-based programs fail. It can also generate smoother and safer driving trajectories than end-to-end neural policies.

cs.AI↗

Improving the Generalization of End-to-End Driving through Procedural Generation

Over the past few years there is a growing interest in the learning-based self driving system. To ensure safety, such systems are first developed and validated in simulators before being deployed in the real world. However, most of the existing driving simulators only contain a fixed set of scenes and a limited number of configurable settings. That might easily cause the overfitting issue for the learning-based driving systems as well as the lack of their generalization ability to unseen scenarios. To better evaluate and improve the generalization of end-to-end driving, we introduce an open-ended and highly configurable driving simulator called PGDrive, following a key feature of procedural generation. Diverse road networks are first generated by the proposed generation algorithm via sampling from elementary road blocks. Then they are turned into interactive training environments where traffic flows of nearby vehicles with realistic kinematics are rendered. We validate that training with the increasing number of procedurally generated scenes significantly improves the generalization of the agent across scenarios of different traffic densities and road networks. Many applications such as multi-agent traffic simulation and safe driving benchmark can be further built upon the simulator. To facilitate the joint research effort of end-to-end driving, we release the simulator and pretrained models at https://decisionforce.github.io/pgdrive

cs.RO↗

Network Pruning via Resource Reallocation

Channel pruning is broadly recognized as an effective approach to obtain a small compact model through eliminating unimportant channels from a large cumbersome network. Contemporary methods typically perform iterative pruning procedure from the original over-parameterized model, which is both tedious and expensive especially when the pruning is aggressive. In this paper, we propose a simple yet effective channel pruning technique, termed network Pruning via rEsource rEalLocation (PEEL), to quickly produce a desired slim model with negligible cost. Specifically, PEEL first constructs a predefined backbone and then conducts resource reallocation on it to shift parameters from less informative layers to more important layers in one round, thus amplifying the positive effect of these informative layers. To demonstrate the effectiveness of PEEL , we perform extensive experiments on ImageNet with ResNet-18, ResNet-50, MobileNetV2, MobileNetV3-small and EfficientNet-B0. Experimental results show that structures uncovered by PEEL exhibit competitive performance with state-of-the-art pruning algorithms under various pruning settings. Our code is available at https://github.com/cardwing/Codes-for-PEEL.

cs.CV↗

Understanding the wiring evolution in differentiable neural architecture search

Controversy exists on whether differentiable neural architecture search methods discover wiring topology effectively. To understand how wiring topology evolves, we study the underlying mechanism of several existing differentiable NAS frameworks. Our investigation is motivated by three observed searching patterns of differentiable NAS: 1) they search by growing instead of pruning; 2) wider networks are more preferred than deeper ones; 3) no edges are selected in bi-level optimization. To anatomize these phenomena, we propose a unified view on searching algorithms of existing frameworks, transferring the global optimization to local cost minimization. Based on this reformulation, we conduct empirical and theoretical analyses, revealing implicit inductive biases in the cost's assignment mechanism and evolution dynamics that cause the observed phenomena. These biases indicate strong discrimination towards certain topologies. To this end, we pose questions that future differentiable methods for neural wiring discovery need to confront, hoping to evoke a discussion and rethinking on how much bias has been enforced implicitly in existing NAS methods.

cs.LG↗

Non-unitary dynamics of Sachdev-Ye-Kitaev chain

We construct a series of one-dimensional non-unitary dynamics consisting of both unitary and imaginary evolutions based on the Sachdev-Ye-Kitaev model. Starting from a short-range entangled state, we analyze the entanglement dynamics using the path integral formalism in the large $N$ limit. Among all the results that we obtain, two of them are particularly interesting: (1) By varying the strength of the imaginary evolution, the interacting model exhibits a first order phase transition from the highly entangled volume law phase to an area law phase; (2) The one-dimensional free fermion model displays an extensive critical regime with emergent two-dimensional conformal symmetry.

cond-mat.str-el↗

Frustrated Heisenberg $J_1-J_2$ model within the stretched diamond lattice of LiYbO2

We investigate the magnetic properties of LiYbO$_2$, containing a three-dimensionally frustrated, diamond-like lattice via neutron scattering, magnetization, and heat capacity measurements. The stretched diamond network of Yb$^{3+}$ ions in LiYbO$_2$ enters a long-range incommensurate, helical state with an ordering wave vector ${\bf{k}} = (0.384, \pm 0.384, 0)$ that "locks-in" to a commensurate ${\bf{k}} = (1/3, \pm 1/3, 0)$ phase under the application of a magnetic field. The spiral magnetic ground state of LiYbO$_2$ can be understood in the framework of a Heisenberg $J_1-J_2$ Hamiltonian on a stretched diamond lattice, where the propagation vector of the spiral is uniquely determined by the ratio of $J_2/|J_1|$. The pure Heisenberg model, however, fails to account for the relative phasing between the Yb moments on the two sites of the bipartite lattice, and this detail as well as the presence of an intermediate, partially disordered, magnetic state below 1 K suggests interactions beyond the classical Heisenberg description of this material.

cond-mat.str-el↗

Overcoming Language Priors with Self-supervised Learning for Visual Question Answering

Most Visual Question Answering (VQA) models suffer from the language prior problem, which is caused by inherent data biases. Specifically, VQA models tend to answer questions (e.g., what color is the banana?) based on the high-frequency answers (e.g., yellow) ignoring image contents. Existing approaches tackle this problem by creating delicate models or introducing additional visual annotations to reduce question dependency while strengthening image dependency. However, they are still subject to the language prior problem since the data biases have not been even alleviated. In this paper, we introduce a self-supervised learning framework to solve this problem. Concretely, we first automatically generate labeled data to balance the biased data, and propose a self-supervised auxiliary task to utilize the balanced data to assist the base VQA model to overcome language priors. Our method can compensate for the data biases by generating balanced data without introducing external annotations. Experimental results show that our method can significantly outperform the state-of-the-art, improving the overall accuracy from 49.50% to 57.59% on the most commonly used benchmark VQA-CP v2. In other words, we can increase the performance of annotation-based methods by 16% without using external annotations.

cs.CV↗

Channel-wise Alignment for Adaptive Object Detection

Generic object detection has been immensely promoted by the development of deep convolutional neural networks in the past decade. However, in the domain shift circumstance, the changes in weather, illumination, etc., often cause domain gap, and thus performance drops substantially when detecting objects from one domain to another. Existing methods on this task usually draw attention on the high-level alignment based on the whole image or object of interest, which naturally, cannot fully utilize the fine-grained channel information. In this paper, we realize adaptation from a thoroughly different perspective, i.e., channel-wise alignment. Motivated by the finding that each channel focuses on a specific pattern (e.g., on special semantic regions, such as car), we aim to align the distribution of source and target domain on the channel level, which is finer for integration between discrepant domains. Our method mainly consists of self channel-wise and cross channel-wise alignment. These two parts explore the inner-relation and cross-relation of attention regions implicitly from the view of channels. Further more, we also propose a RPN domain classifier module to obtain a domain-invariant RPN network. Extensive experiments show that the proposed method performs notably better than existing methods with about 5% improvement under various domain-shift settings. Experiments on different task (e.g. instance segmentation) also demonstrate its good scalability.

cs.CV↗