arXiv subjects

Yang Xu

Publications and source records attributed to Yang Xu.

At least 271 records · Page 15Linked to original sources

arXiv2024

The elliptical invariant tori of nearly integrable Hamiltonian system through symplectic algorithms

In this paper we apply symplectic algorithms to nearly integrable Hamiltonian system, and prove it can maintain lots of elliptic lower dimensional invariant tori. We are committed to consider the elliptic lower dimensional invariant tori for symplectic mapping with a small twist under the Rüssmann's non-degenerate condition, and focus on its measure estimation. And then apply it to the nearly integrable Hamiltonian system to obtain lots of elliptic lower dimensional invariant tori.

math.DS↗

arXiv2024

Stability of solutions to contact Hamilton-Jacobi equation on the circle

Combing the weak KAM method for contact Hamiltonian systems and the theory of viscosity solutions for Hamilton-Jacobi equations, we study the Lyapunov stability and instability of viscosity solutions for evolutionary contact Hamilton-Jacobi equation in the first part. In the second part, we study the existence and multiplicity of time-periodic solutions.

math.AP↗

arXiv2024

First-principles methodology for studying magnetotransport in narrow-gap semiconductors: an application to Zirconium Pentatelluride ZrTe5

The origin of anomalous resistivity peak and accompanied sign reversal of Hall resistivity of ZrTe$_5$ has been under debate for a long time. Although various theoretical models have been proposed to account for these intriguing transport properties, a systematic study from first principles view is still lacking. In this work, we present a first principles calculation combined with Boltzmann transport theory to investigate the transport properties in narrow-gap semiconductors at different temperatures and doping densities within the relaxation time approximation. Regarding the sensitive temperature-dependent chemical potential and relaxation time of semiconductors, we take proper approximation to simulate these two variables, and then comprehensively study the transport properties of ZrTe$_5$ both in the absence and presence of an applied magnetic field. Without introducing topological phases and correlation interactions, we qualitatively reproduced crucial features observed in experiments, including zero-field resistivity anomaly, nonlinear Hall resistivity with sign reversal, and non-saturating magnetoresistance at high temperatures. Our calculation allows a systematic interpretation of the observed properties in terms of multi-carrier and Fermi surface geometry. Our method can be extended to other narrow-gap semiconductors and further pave the way to explore interesting and novel transport properties of this field.

cond-mat.mtrl-sci↗

arXiv2023

Rethinking the Instruction Quality: LIFT is What You Need

Instruction tuning, a specialized technique to enhance large language model (LLM) performance via instruction datasets, relies heavily on the quality of employed data. Existing quality improvement methods alter instruction data through dataset expansion or curation. However, the expansion method risks data redundancy, potentially compromising LLM performance, while the curation approach confines the LLM's potential to the original dataset. Our aim is to surpass the original data quality without encountering these shortcomings. To achieve this, we propose LIFT (LLM Instruction Fusion Transfer), a novel and versatile paradigm designed to elevate the instruction quality to new heights. LIFT strategically broadens data distribution to encompass more high-quality subspaces and eliminates redundancy, concentrating on high-quality segments across overall data subspaces. Experimental results demonstrate that, even with a limited quantity of high-quality instruction data selected by our paradigm, LLMs not only consistently uphold robust performance across various tasks but also surpass some state-of-the-art results, highlighting the significant improvement in instruction quality achieved by our paradigm.

cs.CL↗

arXiv2023

Inkjet-Printed High-Yield, Reconfigurable, and Recyclable Memristors on Paper

Reconfigurable memristors featuring neural and synaptic functions hold great potential for neuromorphic circuits by simplifying system architecture, cutting power consumption, and boosting computational efficiency. Their additive manufacturing on sustainable substrates offers unique advantages for future electronics, including low environmental impact. Here, exploiting structure-property relationship of MoS2 nanoflake-based resistive layer, we present paper-based, inkjet-printed, reconfigurable memristors. With >90% yield from a 16x65 device array, our memristors demonstrate robust resistive switching, with $>10^5$ ON-OFF ratio and <0.5 V operation in non-volatile state. Through modulation of compliance current, the devices transition into volatile state, with only 50 pW switching power consumption, rivalling state-of-the-art metal oxide-based counterparts. We show device recyclability and stable, reconfigurable operation following disassembly, material collection and re-fabrication. We further demonstrate synaptic plasticity and neuronal leaky integrate-and-fire functionality, with disposable applications in smart packaging and simulated medical image diagnostics. Our work shows a sustainable pathway towards printable, high-yield, reconfigurable neuromorphic devices, with minimal environmental footprint.

cs.ET↗

arXiv2023

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↗

arXiv2023

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↗

arXiv2023

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↗

arXiv2023

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↗

arXiv2023

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↗

arXiv2023

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↗

arXiv2023

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↗

arXiv2023

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↗

arXiv2023

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↗

arXiv2023

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↗

arXiv2023

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↗

arXiv2023

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↗

arXiv2023

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↗