Searcharxiv⌕ Search

arXiv subjects

Chao Yang

Publications and source records attributed to Chao Yang.

At least 253 records · Page 14Linked to original sources

Using Diffusion Maps to Analyze Reaction Dynamics for a Hydrogen Combustion Benchmark Dataset

We use local diffusion maps to assess the quality of two types of collective variables (CVs) for a recently published hydrogen combustion benchmark dataset~\cite{guan2022benchmark} that contains ab initio molecular dynamics trajectories and normal modes along minimum energy paths. This approach was recently advocated in~\cite{tlldiffmap20} for assessing CVs and analyzing reactions modeled by classical molecular dynamics simulations. We report the effectiveness of this approach to molecular systems modeled by quantum ab initio molecular dynamics. In addition to assessing the quality of CVs, we also use global diffusion maps to perform committor analysis as proposed in~\cite{tlldiffmap20}. We show that the committor function obtained from the global diffusion map allows us to identify transition regions of interest in several hydrogen combustion reaction channels.

physics.chem-ph↗

Stochastic Real-Time Second-Order Green's Function Theory for Neutral Excitations in Molecules and Nanostructures

We present a real-time second-order Green's function (GF) method for computing excited states in molecules and nanostructures, with a computational scaling of $O(N_{\rm e}^3$), where $N_{\rm e}$ is the number of electrons. The cubic scaling is achieved by adopting the stochastic resolution of the identity to decouple the 4-index electron repulsion integrals (ERI). To improve the time-propagation and the spectral resolution, we adopt the dynamic mode decomposition (DMD) technique and assess the accuracy and efficiency of the combined approach for a chain of hydrogen dimer molecules of different lengths. We find that the stochastic implementation accurately reproduces the deterministic results for the electronic dynamics and excitation energies. Furthermore, we provide a detailed analysis of the statistical errors, bias, and long-time extrapolation. Overall, the approach offers an efficient route to investigate excited states in extended systems with open or closed boundary conditions.

physics.chem-ph↗

Four dimensional hypersurfaces with proper mean curvature vector field in pseudo-Riemannian space forms

In this paper, we study four dimensional hypersurface M^4_r with proper mean curvature vector field (i.e. Δ\vec{H} is proportional to \vec{H}) in pseudo-Riemannian space form N^5_s(c), and show that it has constant mean curvature, and give the range of this constant. As an application, we get that biharmonic hypersurfaces in N^5_s(c) are minimal in some specific cases, which partially confirms B.-Y. Chen's conjecture.

math.DG↗

TA-MoE: Topology-Aware Large Scale Mixture-of-Expert Training

Sparsely gated Mixture-of-Expert (MoE) has demonstrated its effectiveness in scaling up deep neural networks to an extreme scale. Despite that numerous efforts have been made to improve the performance of MoE from the model design or system optimization perspective, existing MoE dispatch patterns are still not able to fully exploit the underlying heterogeneous network environments. In this paper, we propose TA-MoE, a topology-aware routing strategy for large-scale MoE trainging, from a model-system co-design perspective, which can dynamically adjust the MoE dispatch pattern according to the network topology. Based on communication modeling, we abstract the dispatch problem into an optimization objective and obtain the approximate dispatch pattern under different topologies. On top of that, we design a topology-aware auxiliary loss, which can adaptively route the data to fit in the underlying topology without sacrificing the model accuracy. Experiments show that TA-MoE can substantially outperform its counterparts on various hardware and model configurations, with roughly 1.01x-1.61x, 1.01x-4.77x, 1.25x-1.54x improvements over the popular DeepSpeed-MoE, FastMoE and FasterMoE.

cs.LG↗

Orbifold theory for vertex algebras and Galois correspondence

Let $V$ be a simple vertex algebra of countable dimension, $G$ be a finite automorphism group of $V$ and $σ$ be a central element of $G$. Assume that ${\cal S}$ is a finite set of inequivalent irreducible $σ$-twisted $V$-modules such that ${\cal S}$ is invariant under the action of $G$. Then there is a finite dimensional semisimple associative algebra ${\cal A}_α(G,{\cal S})$ for a suitable $2$-cocycle $α$ naturally determined by the $G$-action on ${\cal S}$ such that $({\cal A}_α(G,{\cal S}),V^G)$ form a dual pair on the sum $\cal M$ of $σ$-twisted $V$-modules in ${\cal S}$ in the sense that (1) the actions of ${\cal A}_α(G,{\cal S})$ and $V^G$ on $\cal M$ commute, (2) each irreducible ${\cal A}_α(G,{\cal S})$-module appears in $\cal M,$ (3) the multiplicity space of each irreducible ${\cal A}_α(G,{\cal S})$-module is an irreducible $V^G$-module, (4) the multiplicitiy spaces of different irreducible ${\cal A}_α(G,{\cal S})$-modules are inequivalent $V^G$-modules. As applications, every irreducible $σ$-twisted $V$-module is a direct sum of finitely many irreducible $V^G$-modules and irreducible $V^G$-modules appearing in different $G$-orbits are inequivalent. This result generalizes many previous ones. We also establish a bijection between subgroups of $G$ and subalgebras of $V$ containing $V^G.$

math.QA↗

R2FD2: Fast and Robust Matching of Multimodal Remote Sensing Image via Repeatable Feature Detector and Rotation-invariant Feature Descriptor

Automatically identifying feature correspondences between multimodal images is facing enormous challenges because of the significant differences both in radiation and geometry. To address these problems, we propose a novel feature matching method (named R2FD2) that is robust to radiation and rotation differences. Our R2FD2 is conducted in two critical contributions, consisting of a repeatable feature detector and a rotation-invariant feature descriptor. In the first stage, a repeatable feature detector called the Multi-channel Auto-correlation of the Log-Gabor (MALG) is presented for feature detection, which combines the multi-channel auto-correlation strategy with the Log-Gabor wavelets to detect interest points (IPs) with high repeatability and uniform distribution. In the second stage, a rotation-invariant feature descriptor is constructed, named the Rotation-invariant Maximum index map of the Log-Gabor (RMLG), which consists of two components: fast assignment of dominant orientation and construction of feature representation. In the process of fast assignment of dominant orientation, a Rotation-invariant Maximum Index Map (RMIM) is built to address rotation deformations. Then, the proposed RMLG incorporates the rotation-invariant RMIM with the spatial configuration of DAISY to depict a more discriminative feature representation, which improves RMLG's resistance to radiation and rotation variances.Experimental results show that the proposed R2FD2 outperforms five state-of-the-art feature matching methods, and has superior advantages in adaptability and universality. Moreover, our R2FD2 achieves the accuracy of matching within two pixels and has a great advantage in matching efficiency over other state-of-the-art methods.

cs.CV↗

Endomorphism property of vertex operator algebras over arbitrary fields

In this paper, we study the endomorphism properties of vertex operator algebras over an arbitrary field $\mathbb{F}$, with $\text{Char}(\mathbb{F}) \neq 2$. Let $V$ be a strongly finitely generated vertex operator algebra over $\mathbb{F}$, and $M$ be an irreducible admissible $V$-module. We prove that every element in $\text{End}_V(M)$ is algebraic over $\mathbb{F}$ and that $\text{End}_V(M)$ is also finite-dimensional. As an application, we prove Schur's lemma for strongly finitely generated vertex operator algebras over arbitrary algebraically closed fields, and we give a test for absolute irreducibility of $V$-modules.

math.QA↗

AONN: An adjoint-oriented neural network method for all-at-once solutions of parametric optimal control problems

Parametric optimal control problems governed by partial differential equations (PDEs) are widely found in scientific and engineering applications. Traditional grid-based numerical methods for such problems generally require repeated solutions of PDEs with different parameter settings, which is computationally prohibitive especially for problems with high-dimensional parameter spaces. Although recently proposed neural network methods make it possible to obtain the optimal solutions simultaneously for different parameters, challenges still remain when dealing with problems with complex constraints. In this paper, we propose AONN, an adjoint-oriented neural network method, to overcome the limitations of existing approaches in solving parametric optimal control problems. In AONN, the neural networks are served as parametric surrogate models for the control, adjoint and state functions to get the optimal solutions all at once. In order to reduce the training difficulty and handle complex constraints, we introduce an iterative training framework inspired by the classical direct-adjoint looping (DAL) method so that penalty terms arising from the Karush-Kuhn-Tucker (KKT) system can be avoided. Once the training is done, parameter-specific optimal solutions can be quickly computed through the forward propagation of the neural networks, which may be further used for analyzing the parametric properties of the optimal solutions. The validity and efficiency of AONN is demonstrated through a series of numerical experiments with problems involving various types of parameters.

math.OC↗

Dynamic Mode Decomposition for Extrapolating Non-equilibrium Green's Functions Dynamics

The HF-GKBA offers an approximate numerical procedure for propagating the two-time non-equilibrium Green's function(NEGF). Here we compare the HF-GKBA to exact results for a variety of systems with long and short-range interactions, different two-body interaction strengths and various non-equilibrium preparations. We find excellent agreement between the HF-GKBA and exact time evolution in models when more realistic long-range exponentially decaying interactions are considered. This agreement persists for long times and for intermediate to strong interaction strengths. In large systems, HF-GKBA becomes prohibitively expensive for long-time evolutions. For this reason, look at the use of dynamical mode decomposition(DMD) to reconstruct long-time NEGF trajectories from a sample of the initial trajectory. Using no more than 16\% of the total time evolution we reconstruct the total trajectory with high fidelity. Our results show the potential for DMD to be used in conjunction with HF-GKBA to calculate long time trajectories in large-scale systems.

physics.comp-ph↗

SAS: Self-Augmentation Strategy for Language Model Pre-training

The core of self-supervised learning for pre-training language models includes pre-training task design as well as appropriate data augmentation. Most data augmentations in language model pre-training are context-independent. A seminal contextualized augmentation was recently proposed in ELECTRA and achieved state-of-the-art performance by introducing an auxiliary generation network (generator) to produce contextualized data augmentation for the training of a main discrimination network (discriminator). This design, however, introduces extra computation cost of the generator and a need to adjust the relative capability between the generator and the discriminator. In this paper, we propose a self-augmentation strategy (SAS) where a single network is utilized for both regular pre-training and contextualized data augmentation for the training in later epochs. Essentially, this strategy eliminates a separate generator and uses the single network to jointly conduct two pre-training tasks with MLM (Masked Language Modeling) and RTD (Replaced Token Detection) heads. It avoids the challenge to search for an appropriate size of the generator, which is critical to the performance as evidenced in ELECTRA and its subsequent variant models. In addition, SAS is a general strategy that can be seamlessly combined with many new techniques emerging recently or in the future, such as the disentangled attention mechanism from DeBERTa. Our experiments show that SAS is able to outperform ELECTRA and other state-of-the-art models in the GLUE tasks with similar or less computation cost.

cs.CL↗

Signature of nonequilibrium quantum phase transition in the long time average of Loschmidt echo

We unveil the role of the long time average of Loschmidt echo in the characterization of nonequilibrium quantum phase transitions by studying sudden quench processes across quantum phase transitions in various quantum systems. While the dynamical quantum phase transitions are characterized by the emergence of a series of zero points at critical times during time evolution, we demonstrate that nonequilibrium quantum phase transitions can be identified by nonanalyticities in the long time average of Loschmidt echo. The nonanalytic behaviours are illustrated by a sharp change in the long time average of Loschmidt echo or the corresponding rate function or the emergence of divergence in the second derivative of rate function when the driving quench parameter crosses the phase transition points. The connection between the second derivative of rate function and fidelity susceptibility is also discussed.

quant-ph↗

Strings And Colorings Of Topological Coding Towards Asymmetric Topology Cryptography

We, for anti-quantum computing, will discuss various number-based strings, such as number-based super-strings, parameterized strings, set-based strings, graph-based strings, integer-partitioned and integer-decomposed strings, Hanzi-based strings, as well as algebraic operations based on number-based strings. Moreover, we introduce number-based string-colorings, magic-constraint colorings, and vector-colorings and set-colorings related with strings. For the technique of encrypting the entire network at once, we propose graphic lattices related with number-based strings, Hanzi-graphic lattices, string groups, all-tree-graphic lattices. We study some topics of asymmetric topology cryptography, such as topological signatures, Key-pair graphs, Key-pair strings, one-encryption one-time and self-certification algorithms. Part of topological techniques and algorithms introduced here are closely related with NP-complete problems or NP-hard problems.

cs.IT↗

Tensor-Based Sketching Method for the Low-Rank Approximation of Data Streams

Low-rank approximation in data streams is a fundamental and significant task in computing science, machine learning and statistics. Multiple streaming algorithms have emerged over years and most of them are inspired by randomized algorithms, more specifically, sketching methods. However, many algorithms are not able to leverage information of data streams and consequently suffer from low accuracy. Existing data-driven methods improve accuracy but the training cost is expensive in practice. In this paper, from a subspace perspective, we propose a tensor-based sketching method for low-rank approximation of data streams. The proposed algorithm fully exploits the structure of data streams and obtains quasi-optimal sketching matrices by performing tensor decomposition on training data. A series of experiments are carried out and show that the proposed tensor-based method can be more accurate and much faster than the previous work.

cs.DS↗

Parallel energy stable phase field simulations of Ni-based alloys system

In this paper, we investigate numerical methods for solving Nickel-based phase field system related to free energy, including the elastic energy and logarithmic type functionals. To address the challenge posed by the particular free energy functional, we propose a semi-implicit scheme based on the discrete variational derivative method, which is unconditionally energy stable and maintains the energy dissipation law and the mass conservation law. Due to the good stability of the semi-implicit scheme, the adaptive time step strategy is adopted, which can flexibly control the time step according to the dynamic evolution of the problem. A domain decomposition based, parallel Newton--Krylov--Schwarz method is introduced to solve the nonlinear algebraic system constructed by the discretization at each time step. Numerical experiments show that the proposed algorithm is energy stable with large time steps, and highly scalable to six thousand processor cores.

math.NA↗

Research on Multi-Objective Planning of Electric Vehicle Charging Stations Considering the Condition of Urban Traffic Network

As an important supporting facility for electric vehicles, the reasonable planning and layout of charging stations are of great significance to the development of electric vehicles. However, the planning and layout of charging stations is affected by various complex factors such as policy economy, charging demand, user charging comfort, and road traffic conditions. How to weigh various factors to construct a reasonable model of charging station location and capacity has become a major difficulty in the field of electric vehicle charging facility planning. Firstly, this paper constructs the location and capacity optimization model of the charging station with the goal of maximizing the revenue of operators and minimizing the user's charging additional cost. At the same time, the road time-consuming index is introduced to quantify the impact of road congestion on the user's charging additional cost, so as to effectively improve the user's satisfaction during charging. Then, aiming at the charging station planning model, a non-dominated sorting genetic algorithm with an elite strategy (NSGA-II) based on chaos initialization and arithmetic crossover operator is proposed. Finally, taking the Haidian District of Beijing as the simulation object, the results show that compared with the situation of urban traffic networks not considered, the model proposed in this paper significantly reduces the cost of lost time of users by 11.4% and the total additional cost of users' charging by 7.6%. It not only ensures the economy of the system, but also effectively improves the charging satisfaction of users, which further verifies the feasibility and effectiveness of the model, and can provide a reference for the planning and layout of charging stations in the future.

eess.SY↗

KSSOLV 2.0: An efficient MATLAB toolbox for solving the Kohn-Sham equations with plane-wave basis set

KSSOLV (Kohn-Sham Solver) is a MATLAB toolbox for performing Kohn-Sham density functional theory (DFT) calculations with a plane-wave basis set. KSSOLV 2.0 preserves the design features of the original KSSOLV software to allow users and developers to easily set up a problem and perform ground-state calculations as well as to prototype and test new algorithms. Furthermore, it includes new functionalities such as new iterative diagonalization algorithms, k-point sampling for electron band structures, geometry optimization and advanced algorithms for performing DFT calculations with local, semi-local, and hybrid exchange-correlation functionals. It can be used to study the electronic structures of both molecules and solids. We describe these new capabilities in this work through a few use cases. We also demonstrate the numerical accuracy and computational efficiency of KSSOLV on a variety of examples.

physics.comp-ph↗

DAS-PINNs: A deep adaptive sampling method for solving high-dimensional partial differential equations

In this work we propose a deep adaptive sampling (DAS) method for solving partial differential equations (PDEs), where deep neural networks are utilized to approximate the solutions of PDEs and deep generative models are employed to generate new collocation points that refine the training set. The overall procedure of DAS consists of two components: solving the PDEs by minimizing the residual loss on the collocation points in the training set and generating a new training set to further improve the accuracy of current approximate solution. In particular, we treat the residual as a probability density function and approximate it with a deep generative model, called KRnet. The new samples from KRnet are consistent with the distribution induced by the residual, i.e., more samples are located in the region of large residual and less samples are located in the region of small residual. Analogous to classical adaptive methods such as the adaptive finite element, KRnet acts as an error indicator that guides the refinement of the training set. Compared to the neural network approximation obtained with uniformly distributed collocation points, the developed algorithms can significantly improve the accuracy, especially for low regularity and high-dimensional problems. We demonstrate the effectiveness of the proposed DAS method with numerical experiments.

math.NA↗

WeNet 2.0: More Productive End-to-End Speech Recognition Toolkit

Recently, we made available WeNet, a production-oriented end-to-end speech recognition toolkit, which introduces a unified two-pass (U2) framework and a built-in runtime to address the streaming and non-streaming decoding modes in a single model. To further improve ASR performance and facilitate various production requirements, in this paper, we present WeNet 2.0 with four important updates. (1) We propose U2++, a unified two-pass framework with bidirectional attention decoders, which includes the future contextual information by a right-to-left attention decoder to improve the representative ability of the shared encoder and the performance during the rescoring stage. (2) We introduce an n-gram based language model and a WFST-based decoder into WeNet 2.0, promoting the use of rich text data in production scenarios. (3) We design a unified contextual biasing framework, which leverages user-specific context (e.g., contact lists) to provide rapid adaptation ability for production and improves ASR accuracy in both with-LM and without-LM scenarios. (4) We design a unified IO to support large-scale data for effective model training. In summary, the brand-new WeNet 2.0 achieves up to 10\% relative recognition performance improvement over the original WeNet on various corpora and makes available several important production-oriented features.

cs.SD↗