Searcharxiv⌕ Search

arXiv subjects

Yang Xu

Publications and source records attributed to Yang Xu.

At least 271 records · Page 15Linked to original sources

Cautiously-Optimistic Knowledge Sharing for Cooperative Multi-Agent Reinforcement Learning

While decentralized training is attractive in multi-agent reinforcement learning (MARL) for its excellent scalability and robustness, its inherent coordination challenges in collaborative tasks result in numerous interactions for agents to learn good policies. To alleviate this problem, action advising methods make experienced agents share their knowledge about what to do, while less experienced agents strictly follow the received advice. However, this method of sharing and utilizing knowledge may hinder the team's exploration of better states, as agents can be unduly influenced by suboptimal or even adverse advice, especially in the early stages of learning. Inspired by the fact that humans can learn not only from the success but also from the failure of others, this paper proposes a novel knowledge sharing framework called Cautiously-Optimistic kNowledge Sharing (CONS). CONS enables each agent to share both positive and negative knowledge and cautiously assimilate knowledge from others, thereby enhancing the efficiency of early-stage exploration and the agents' robustness to adverse advice. Moreover, considering the continuous improvement of policies, agents value negative knowledge more in the early stages of learning and shift their focus to positive knowledge in the later stages. Our framework can be easily integrated into existing Q-learning based methods without introducing additional training costs. We evaluate CONS in several challenging multi-agent tasks and find it excels in environments where optimal behavioral patterns are difficult to discover, surpassing the baselines in terms of convergence rate and final performance.

cs.MA↗

Accelerated Gradient Algorithms with Adaptive Subspace Search for Instance-Faster Optimization

Gradient-based minimax optimal algorithms have greatly promoted the development of continuous optimization and machine learning. One seminal work due to Yurii Nesterov [Nes83a] established $\tilde{\mathcal{O}}(\sqrt{L/μ})$ gradient complexity for minimizing an $L$-smooth $μ$-strongly convex objective. However, an ideal algorithm would adapt to the explicit complexity of a particular objective function and incur faster rates for simpler problems, triggering our reconsideration of two defeats of existing optimization modeling and analysis. (i) The worst-case optimality is neither the instance optimality nor such one in reality. (ii) Traditional $L$-smoothness condition may not be the primary abstraction/characterization for modern practical problems. In this paper, we open up a new way to design and analyze gradient-based algorithms with direct applications in machine learning, including linear regression and beyond. We introduce two factors $(α, τ_α)$ to refine the description of the degenerated condition of the optimization problems based on the observation that the singular values of Hessian often drop sharply. We design adaptive algorithms that solve simpler problems without pre-known knowledge with reduced gradient or analogous oracle accesses. The algorithms also improve the state-of-art complexities for several problems in machine learning, thereby solving the open problem of how to design faster algorithms in light of the known complexity lower bounds. Specially, with the $\mathcal{O}(1)$-nuclear norm bounded, we achieve an optimal $\tilde{\mathcal{O}}(μ^{-1/3})$ (v.s. $\tilde{\mathcal{O}}(μ^{-1/2})$) gradient complexity for linear regression. We hope this work could invoke the rethinking for understanding the difficulty of modern problems in optimization.

cs.LG↗

Deep Reinforcement Learning Based Optimal Energy Management of Multi-energy Microgrids with Uncertainties

Multi-energy microgrid (MEMG) offers an effective approach to deal with energy demand diversification and new energy consumption on the consumer side. In MEMG, it is critical to deploy an energy management system (EMS) for efficient utilization of energy and reliable operation of the system. To help EMS formulate optimal dispatching schemes, a deep reinforcement learning (DRL)-based MEMG energy management scheme with renewable energy source (RES) uncertainty is proposed in this paper. To accurately describe the operating state of the MEMG, the off-design performance model of energy conversion devices is considered in scheduling. The nonlinear optimal dispatching model is expressed as a Markov decision process (MDP) and is then addressed by the twin delayed deep deterministic policy gradient (TD3) algorithm. In addition, to accurately describe the uncertainty of RES, the conditional-least squares generative adversarial networks (C-LSGANs) method based on RES forecast power is proposed to construct the scenarios set of RES power generation. The generated data of RES is used for scheduling to obtain caps and floors for the purchase of electricity and natural gas. Based on this, the superior energy supply sector can formulate solutions in advance to tackle the uncertainty of RES. Finally, the simulation analysis demonstrates the validity and superiority of the method.

eess.SY↗

Room-temperature correlated states in twisted bilayer MoS$_2$

Moiré superlattices have emerged as an exciting condensed-matter quantum simulator for exploring the exotic physics of strong electronic correlations. Notable progress has been witnessed, but such correlated states are achievable usually at low temperatures. Here, we report the transport evidences of room-temperature correlated electronic states and layer-hybridized SU(4) Hubbard model simulator in AB-stacked MoS$_2$ homo-bilayer moiré superlattices. Correlated insulating states at moiré band filling factors v = 1, 2, 3 are unambiguously established in twisted bilayer MoS$_2$. Remarkably, the correlated electronic states can persist up to a record-high critical temperature of over 285 K. The realization of room-temperature correlated states in twisted bilayer MoS$_2$ can be understood as the cooperation effects of the stacking-specific atomic reconstruction and the resonantly enhanced interlayer hybridization, which largely amplify the moiré superlattice effects on electronic correlations. Furthermore, extreme large non-linear Hall responses up to room-temperature are uncovered near correlated insulating states, demonstrating the quantum geometry of moiré flat conduction band.

cond-mat.mtrl-sci↗

Semantic Segmentation of Anomalous Diffusion Using Deep Convolutional Networks

Heterogeneous dynamics commonly emerges in anomalous diffusion with intermittent transitions of diffusion states but proves challenging to identify using conventional statistical methods. To effectively capture these transient changes of diffusion states, we propose a deep learning model (U-AnDi) for the semantic segmentation of anomalous diffusion trajectories. This model is developed with the dilated causal convolution (DCC), gated activation unit (GAU), and U-Net architecture. The study addresses two key subtasks related to trajectory segmentation and changepoint detection, concentrating on variations in diffusion exponents and dynamic models. Additionally, extended analyses are conducted on the segmentation of single-model trajectories, multi-state biological trajectories, and anomalous diffusion with added long-time correlations. By rationally designing comparative models and evaluating the performance of U-AnDi against these models, we discover that U-AnDi consistently outperforms other models across all segmentation tasks, thereby affirming its superiority in the field. This performance edge also sheds light on the interpretability of U-AnDi's core components: DCC, GAU, and U-Net. The clarity with which these components contribute to U-AnDi's success underscores their congruence with the intrinsic physics underlying anomalous diffusion. Furthermore, our model is examined using real-world anomalous diffusion data: the diffusion of transmembrane proteins on cell membrane surfaces, and the segmentation results are highly consistent with experimental observations. Our findings could offer a heuristic deep learning solution for the detection of heterogeneous dynamics in single-molecule/particle tracking experiments, and have the potential to be generalized as a universal scheme for time-series segmentation.

physics.bio-ph↗

Target-based Distributionally Robust Minimum Spanning Tree Problem

Due to its broad applications in practice, the minimum spanning tree problem and its all kinds of variations have been studied extensively during the last decades, for which a host of efficient exact and heuristic algorithms have been proposed. Meanwhile, motivated by realistic applications, the minimum spanning tree problem in stochastic network has attracted considerable attention of researchers, with respect to which stochastic and robust spanning tree models and related algorithms have been continuingly developed. However, all of them would be either too restricted by the types of the edge weight random variables or computationally intractable, especially in large-scale networks. In this paper, we introduce a target-based distributionally robust optimization framework to solve the minimum spanning tree problem in stochastic graphs where the probability distribution function of the edge weight is unknown but some statistical information could be utilized to prevent the optimal solution from being too conservative. We propose two exact algorithms to solve it, based on Benders decomposition framework and a modified classical greedy algorithm of MST problem (Prim algorithm),respectively. Compared with the NP-hard stochastic and robust spanning tree problems,The proposed target-based distributionally robust minimum spanning tree problem enjoys more satisfactory algorithmic aspect and robustness, when faced with uncertainty in input data.

math.OC↗

FACE: Evaluating Natural Language Generation with Fourier Analysis of Cross-Entropy

Measuring the distance between machine-produced and human language is a critical open problem. Inspired by empirical findings from psycholinguistics on the periodicity of entropy in language, we propose FACE, a set of metrics based on Fourier Analysis of the estimated Cross-Entropy of language, for measuring the similarity between model-generated and human-written languages. Based on an open-ended generation task and the experimental data from previous studies, we find that FACE can effectively identify the human-model gap, scales with model size, reflects the outcomes of different sampling methods for decoding, correlates well with other evaluation metrics and with human judgment scores.

cs.CL↗

Proton-mediated reversible switching of metastable ferroelectric phases with low operation voltages

The exploration of ferroelectric phase transitions enables an in-depth understanding of ferroelectric switching and promising applications in information storage. However, controllably tuning the dynamics of ferroelectric phase transitions remains challenging owing to inaccessible hidden phases. Here, using protonic gating technology, we create a series of metastable ferroelectric phases and demonstrate their reversible transitions in van der Waals ferroelectric α-In2Se3 transistors. By varying the gate bias, protons can be incrementally injected or extracted, achieving controllable tuning of the ferroelectric α-In2Se3 protonic dynamics across the channel and obtaining numerous intermediate phases. Combining piezoelectric force microscopy and electrical hysteresis measurements, we surprisingly discover that the gate tuning of α-In2Se3 protonation is volatile, unlike the conventional gating effect, and the created new phases remain polar. Their origin, revealed by first-principles calculations, is related to the formation of metastable hydrogen-stabilized α-In2Se3 phases with switchable dipoles. Furthermore, our approach enables ultralow gate-voltage switching of different phases (below 0.4 V), and easy integration with transistor components. This work provides fundamental insights into the interactions between protons and ferroelectric phase transitions, providing a possible avenue for accessing hidden phases in ferroelectric switching and for developing energy-efficient, multilevel-switching memory devices.

cond-mat.mtrl-sci↗

Absence of topological Hall effect in Fe$_x$Rh$_{100-x}$ epitaxial films: revisiting their phase diagram

A series of Fe$_x$Rh$_{100-x}$ ($30 \leq x \leq 57$) films were epitaxially grown using magnetron sputtering, and were systematically studied by magnetization-, electrical resistivity-, and Hall resistivity measurements. After optimizing the growth conditions, phase-pure Fe$_{x}$Rh$_{100-x}$ films were obtained, and their magnetic phase diagram was revisited. The ferromagnetic (FM) to antiferromagnetic (AFM) transition is limited at narrow Fe-contents with $48 \leq x \leq 54$ in the bulk Fe$_x$Rh$_{100-x}$ alloys. By contrast, the FM-AFM transition in the Fe$_x$Rh$_{100-x}$ films is extended to cover a much wider $x$ range between 33 % and 53 %, whose critical temperature slightly decreases as increasing the Fe-content. The resistivity jump and magnetization drop at the FM-AFM transition are much more significant in the Fe$_x$Rh$_{100-x}$ films with $\sim$50 % Fe-content than in the Fe-deficient films, the latter have a large amount of paramagnetic phase. The magnetoresistivity (MR) is rather weak and positive in the AFM state, while it becomes negative when the FM phase shows up, and a giant MR appears in the mixed FM- and AFM states. The Hall resistivity is dominated by the ordinary Hall effect in the AFM state, while in the mixed state or high-temperature FM state, the anomalous Hall effect takes over. The absence of topological Hall resistivity in Fe$_{x}$Rh$_{100-x}$ films with various Fe-contents implies that the previously observed topological Hall effect is most likely extrinsic. We propose that the anomalous Hall effect caused by the FM iron moments at the interfaces nicely explains the hump-like anomaly in the Hall resistivity. Our systematic investigations may offer valuable insights into the spintronics based on iron-rhodium alloys.

cond-mat.mtrl-sci↗

CARE: Confidence-rich Autonomous Robot Exploration using Bayesian Kernel Inference and Optimization

In this paper, we consider improving the efficiency of information-based autonomous robot exploration in unknown and complex environments. We first utilize Gaussian process (GP) regression to learn a surrogate model to infer the confidence-rich mutual information (CRMI) of querying control actions, then adopt an objective function consisting of predicted CRMI values and prediction uncertainties to conduct Bayesian optimization (BO), i.e., GP-based BO (GPBO). The trade-off between the best action with the highest CRMI value (exploitation) and the action with high prediction variance (exploration) can be realized. To further improve the efficiency of GPBO, we propose a novel lightweight information gain inference method based on Bayesian kernel inference and optimization (BKIO), achieving an approximate logarithmic complexity without the need for training. BKIO can also infer the CRMI and generate the best action using BO with bounded cumulative regret, which ensures its comparable accuracy to GPBO with much higher efficiency. Extensive numerical and real-world experiments show the desired efficiency of our proposed methods without losing exploration performance in different unstructured, cluttered environments. We also provide our open-source implementation code at https://github.com/Shepherd-Gregory/BKIO-Exploration.

cs.RO↗

Orthogonal Spatial Coding with Stimulated Parametric Down-Conversion

Orthogonal optical coding is widely used in classical multiuser communication networks. Using the phase conjugation property of stimulated parametric down-conversion, we extend the current orthogonal optical coding scheme to the spatial domain to encode and decode image information. In this process, the idler beam inherits the complex conjugate of the field information encoded in the seed beam. An encoding phase mask introduced to the input seed beam blurs the image transferred to the idler. The original image is restored by passing the coded transferred image through a corrective phase mask placed in the momentum space of the idler beam. We expect that this scheme can also inspire new techniques in aberration cancellation and frequency conversion imaging.

physics.optics↗

OSP: Boosting Distributed Model Training with 2-stage Synchronization

Distributed deep learning (DDL) is a promising research area, which aims to increase the efficiency of training deep learning tasks with large size of datasets and models. As the computation capability of DDL nodes continues to increase, the network connection between nodes is becoming a major bottleneck. Various methods of gradient compression and improved model synchronization have been proposed to address this bottleneck in Parameter-Server-based DDL. However, these two types of methods can result in accuracy loss due to discarded gradients and have limited enhancement on the throughput of model synchronization, respectively. To address these challenges, we propose a new model synchronization method named Overlapped Synchronization Parallel (OSP), which achieves efficient communication with a 2-stage synchronization approach and uses Local-Gradient-based Parameter correction (LGP) to avoid accuracy loss caused by stale parameters. The prototype of OSP has been implemented using PyTorch and evaluated on commonly used deep learning models and datasets with a 9-node testbed. Evaluation results show that OSP can achieve up to 50\% improvement in throughput without accuracy loss compared to popular synchronization models.

cs.DC↗

SDT: A Low-cost and Topology-reconfigurable Testbed for Network Research

Network experiments are essential to network-related scientific research (e.g., congestion control, QoS, network topology design, and traffic engineering). However, (re)configuring various topologies on a real testbed is expensive, time-consuming, and error-prone. In this paper, we propose \emph{Software Defined Topology Testbed (SDT)}, a method for constructing a user-defined network topology using a few commodity switches. SDT is low-cost, deployment-friendly, and reconfigurable, which can run multiple sets of experiments under different topologies by simply using different topology configuration files at the controller we designed. We implement a prototype of SDT and conduct numerous experiments. Evaluations show that SDT only introduces at most 2\% extra overhead than full testbeds on multi-hop latency and is far more efficient than software simulators (reducing the evaluation time by up to 2899x). SDT is more cost-effective and scalable than existing Topology Projection (TP) solutions. Further experiments show that SDT can support various network research experiments at a low cost on topics including but not limited to topology design, congestion control, and traffic engineering.

cs.NI↗

Numerical study of the splashing wave induced by a seaplane using mesh-based and particle-based methods

In recent years, forest fires and maritime accidents have occurred frequently, which have had a bad impact on human production and life. Thus, the development of seaplanes is an increasingly urgent demand. It is important to study the taxiing process of seaplanes for the development of seaplanes, which is a strong nonlinear fluid-structure interaction problem. In this paper, the Smoothed Particle Hydrodynamics (SPH) method based on the Lagrangian framework is utilized to simulate the taxiing process of seaplanes, and the SPH results are compared with those of the Finite Volume Method (FVM) based on the Eulerian method. The results show that the SPH method can not only give the same accuracy as the FVM but also have a strong ability to capture the splashing waves in the taxiing process, which is quite meaningful for the subsequent study of the effect of a splash on other parts of the seaplane.

physics.flu-dyn↗

Collaborative Optimization of Multi-microgrids System with Shared Energy Storage Based on Multi-agent Stochastic Game and Reinforcement Learning

Achieving the economical and stable operation of Multi-microgrids (MMG) systems is vital. However, there are still some challenging problems to be solved. Firstly, from the perspective of stable operation, it is necessary to minimize the energy fluctuation of the main grid. Secondly, the characteristics of energy conversion equipment need to be considered. Finally, privacy protection while reducing the operating cost of an MMG system is crucial. To address these challenges, a Data-driven strategy for MMG systems with Shared Energy Storage (SES) is proposed. The Mixed-Attention is applied to fit the conditions of the equipment, additionally, Multi-Agent Soft Actor-Critic(MA-SAC) and (Multi-Agent Win or Learn Fast Policy Hill-Climbing)MA-WoLF-PHC are proposed to solve the partially observable dynamic stochastic game problem. By testing the operation data of the MMG system in Northwest China, following conclusions are drawn: the R-Square (R2) values of results reach 0.999, indicating the neural network effectively models the nonlinear conditions. The proposed MMG system framework can reduce energy fluctuations in the main grid by 1746.5kW in 24 hours and achieve a cost reduction of 16.21% in the test. Finally, the superiority of the proposed algorithms is verified through their fast convergence speed and excellent optimization performance.

eess.SY↗

Scale-Rotation-Equivariant Lie Group Convolution Neural Networks (Lie Group-CNNs)

The weight-sharing mechanism of convolutional kernels ensures translation-equivariance of convolution neural networks (CNNs). Recently, rotation-equivariance has been investigated. However, research on scale-equivariance or simultaneous scale-rotation-equivariance is insufficient. This study proposes a Lie group-CNN, which can keep scale-rotation-equivariance for image classification tasks. The Lie group-CNN includes a lifting module, a series of group convolution modules, a global pooling layer, and a classification layer. The lifting module transfers the input image from Euclidean space to Lie group space, and the group convolution is parameterized through a fully connected network using Lie-algebra of Lie-group elements as inputs to achieve scale-rotation-equivariance. The Lie group SIM(2) is utilized to establish the Lie group-CNN with scale-rotation-equivariance. Scale-rotation-equivariance of Lie group-CNN is verified and achieves the best recognition accuracy on the blood cell dataset (97.50%) and the HAM10000 dataset (77.90%) superior to Lie algebra convolution network, dilation convolution, spatial transformer network, and scale-equivariant steerable network. In addition, the generalization ability of the Lie group-CNN on SIM(2) on rotation-equivariance is verified on rotated-MNIST and rotated-CIFAR10, and the robustness of the network is verified on SO(2) and SE(2). Therefore, the Lie group-CNN can successfully extract geometric features and performs equivariant recognition on images with rotation and scale transformations.

cs.CV↗

Word sense extension

Humans often make creative use of words to express novel senses. A long-standing effort in natural language processing has been focusing on word sense disambiguation (WSD), but little has been explored about how the sense inventory of a word may be extended toward novel meanings. We present a paradigm of word sense extension (WSE) that enables words to spawn new senses toward novel context. We develop a framework that simulates novel word sense extension by first partitioning a polysemous word type into two pseudo-tokens that mark its different senses, and then inferring whether the meaning of a pseudo-token can be extended to convey the sense denoted by the token partitioned from the same word type. Our framework combines cognitive models of chaining with a learning scheme that transforms a language model embedding space to support various types of word sense extension. We evaluate our framework against several competitive baselines and show that it is superior in predicting plausible novel senses for over 7,500 English words. Furthermore, we show that our WSE framework improves performance over a range of transformer-based WSD models in predicting rare word senses with few or zero mentions in the training data.

cs.CL↗

Language Anisotropic Cross-Lingual Model Editing

Multilingual pre-trained language models can learn task-specific abilities or memorize facts across multiple languages but inevitably make undesired predictions with specific inputs. Under similar observation, model editing aims to post-hoc calibrate a model targeted to specific inputs with keeping the model's raw behavior. However, existing work only studies the monolingual scenario, which lacks the cross-lingual transferability to perform editing simultaneously across languages. In this work, we focus on cross-lingual model editing. Firstly, we define the cross-lingual model editing task and corresponding metrics, where an edit in one language propagates to the others. Next, we propose a framework to naturally adapt monolingual model editing approaches to the cross-lingual scenario using parallel corpus. Further, we propose language anisotropic editing to improve cross-lingual editing by amplifying different subsets of parameters for each language. On the newly defined cross-lingual model editing task, we empirically demonstrate the failure of monolingual baselines in propagating the edit to multiple languages and the effectiveness of the proposed language anisotropic model editing. Our code is publicly available at https://github.com/franklear/LiME.

cs.CL↗