SearcharxivSearch

arXiv subjects

Fei Xu

Publications and source records attributed to Fei Xu.

At least 37 records · Page 2Linked to original sources

SEAFL: Enhancing Efficiency in Semi-Asynchronous Federated Learning through Adaptive Aggregation and Selective Training

Federated Learning (FL) is a promising distributed machine learning framework that allows collaborative learning of a global model across decentralized devices without uploading their local data. However, in real-world FL scenarios, the conventional synchronous FL mechanism suffers from inefficient training caused by slow-speed devices, commonly known as stragglers, especially in heterogeneous communication environments. Though asynchronous FL effectively tackles the efficiency challenge, it induces substantial system overheads and model degradation. Striking for a balance, semi-asynchronous FL has gained increasing attention, while still suffering from the open challenge of stale models, where newly arrived updates are calculated based on outdated weights that easily hurt the convergence of the global model. In this paper, we present {\em SEAFL}, a novel FL framework designed to mitigate both the straggler and the stale model challenges in semi-asynchronous FL. {\em SEAFL} dynamically assigns weights to uploaded models during aggregation based on their staleness and importance to the current global model. We theoretically analyze the convergence rate of {\em SEAFL} and further enhance the training efficiency with an extended variant that allows partial training on slower devices, enabling them to contribute to global aggregation while reducing excessive waiting times. We evaluate the effectiveness of {\em SEAFL} through extensive experiments on three benchmark datasets. The experimental results demonstrate that {\em SEAFL} outperforms its closest counterpart by up to $\sim$22\% in terms of the wall-clock training time required to achieve target accuracy.

cs.DC

Integral embeddings of central simple algebras over number fields

A criterion for determining exactly when an order of a maximal subfield of a central simple algebra over a number field can be embedded into an order of this algebra is given. Various previous results have been generalized and recovered by applying this criterion.

math.NT

Guided and Variance-Corrected Fusion with One-shot Style Alignment for Large-Content Image Generation

Producing large images using small diffusion models is gaining increasing popularity, as the cost of training large models could be prohibitive. A common approach involves jointly generating a series of overlapped image patches and obtaining large images by merging adjacent patches. However, results from existing methods often exhibit noticeable artifacts, e.g., seams and inconsistent objects and styles. To address the issues, we proposed Guided Fusion (GF), which mitigates the negative impact from distant image regions by applying a weighted average to the overlapping regions. Moreover, we proposed Variance-Corrected Fusion (VCF), which corrects data variance at post-averaging, generating more accurate fusion for the Denoising Diffusion Probabilistic Model. Furthermore, we proposed a one-shot Style Alignment (SA), which generates a coherent style for large images by adjusting the initial input noise without adding extra computational burden. Extensive experiments demonstrated that the proposed fusion methods improved the quality of the generated image significantly. The proposed method can be widely applied as a plug-and-play module to enhance other fusion-based methods for large image generation. Code: https://github.com/TitorX/GVCFDiffusion

cs.CV

Integral Springer Theorem for Quadratic Lattices under Base Change of Odd Degree

A quadratic lattice $M$ over a Dedekind domain $R$ with fraction field $F$ is defined to be a finitely generated torsion-free $R$-module equipped with a non-degenerate quadratic form on the $F$-vector space $F\otimes_{R}M$. Assuming that $F\otimes_{R}M$ is isotropic of dimension $\geq 3$ and that $2$ is invertible in $R$, we prove that a quadratic lattice $N$ can be embedded into a quadratic lattice $M$ over $R$ if and only if $S\otimes_{R}N$ can be embedded into $S\otimes_{R}M$ over $S$, where $S$ is the integral closure of $R$ in a finite extension of odd degree of $F$. As a key step in the proof, we establish several versions of the norm principle for integral spinor norms, which may be of independent interest.

math.NT

A Knowledge-Informed Large Language Model Framework for U.S. Nuclear Power Plant Shutdown Initiating Event Classification for Probabilistic Risk Assessment

Identifying and classifying shutdown initiating events (SDIEs) is critical for developing low power shutdown probabilistic risk assessment for nuclear power plants. Existing computational approaches cannot achieve satisfactory performance due to the challenges of unavailable large, labeled datasets, imbalanced event types, and label noise. To address these challenges, we propose a hybrid pipeline that integrates a knowledge-informed machine learning mode to prescreen non-SDIEs and a large language model (LLM) to classify SDIEs into four types. In the prescreening stage, we proposed a set of 44 SDIE text patterns that consist of the most salient keywords and phrases from six SDIE types. Text vectorization based on the SDIE patterns generates feature vectors that are highly separable by using a simple binary classifier. The second stage builds Bidirectional Encoder Representations from Transformers (BERT)-based LLM, which learns generic English language representations from self-supervised pretraining on a large dataset and adapts to SDIE classification by fine-tuning it on an SDIE dataset. The proposed approaches are evaluated on a dataset with 10,928 events using precision, recall ratio, F1 score, and average accuracy. The results demonstrate that the prescreening stage can exclude more than 97% non-SDIEs, and the LLM achieves an average accuracy of 93.4% for SDIE classification.

cs.AI

Molecular dynamics simulations of interaction between a super edge dislocation and interstitial dislocation loops in irradiated L12-Ni3Al

The study employed MD simulations to investigate the interactions between a <110> super-edge dislocation, consisting of the four Shockley partials, and interstitial dislocation loops (IDLs) in irradiated L12-Ni3Al. Accounting for symmetry breakage in the L12 lattice, the superlattice planar faults with four distinct fault vectors have been considered for different IDL configurations. The detailed dislocation reactions and structural evolution events were identified as the four partials interacted with various IDL configurations. The slipping characteristics of Shockley partials within the IDLs and the resultant shearing and looping mechanisms were also clarified, revealing distinct energetic transition states determined by the fault vectors after the Shockley partials sweeping the IDL. Furthermore, significant variations in critical resolved shear stress (CRSS) required for the super-edge dislocation to move past the IDL were observed, attributed to various sizes and faulted vectors of enclosed superlattice planar faults in the IDLs. The current study extends the existing dislocation-IDL interaction theory from pristine FCC to L12 lattice, advances the understanding of irradiation hardening effects in L12-Ni3Al, and suggests potential applicability to other L12 systems.

cond-mat.mtrl-sci

The Weakly Nonlinear Schr\"odinger Equation in Higher Dimensions with Quasi-periodic Initial Data

In this paper, under the exponential/polynomial decay condition in Fourier space, we prove that the nonlinear solution to the quasi-periodic Cauchy problem for the weakly nonlinear Schr\"odinger equation in higher dimensions will asymptotically approach the associated linear solution within a specific time scale. The proof is based on a combinatorial analysis method present through diagrams. Our results and methods apply to {\em arbitrary} space dimensions and general power-law nonlinearities of the form $\pm|u|^{2p}u$, where $1\leq p\in\mathbb N$.

math.AP

Cross-Attention Based Influence Model for Manual and Nonmanual Sign Language Analysis

Both manual (relating to the use of hands) and non-manual markers (NMM), such as facial expressions or mouthing cues, are important for providing the complete meaning of phrases in American Sign Language (ASL). Efforts have been made in advancing sign language to spoken/written language understanding, but most of these have primarily focused on manual features only. In this work, using advanced neural machine translation methods, we examine and report on the extent to which facial expressions contribute to understanding sign language phrases. We present a sign language translation architecture consisting of two-stream encoders, with one encoder handling the face and the other handling the upper body (with hands). We propose a new parallel cross-attention decoding mechanism that is useful for quantifying the influence of each input modality on the output. The two streams from the encoder are directed simultaneously to different attention stacks in the decoder. Examining the properties of the parallel cross-attention weights allows us to analyze the importance of facial markers compared to body and hand features during a translating task.

cs.CV

Dataset of Tensile Properties for Sub-sized Specimens of Nuclear Structural Materials

Mechanical testing with sub-sized specimens plays an important role in the nuclear industry, facilitating tests in confined experimental spaces with lower irradiation levels and accelerating the qualification of new materials. The reduced size of specimens results in different material behavior at the microscale, mesoscale, and macroscale, in comparison to standard-sized specimens, which is referred to as the specimen size effect. Although analytical models have been proposed to correlate the properties of sub-sized specimens to standard-sized specimens, these models lack broad applicability across different materials and testing conditions. The objective of this study is to create the first large public dataset of tensile properties for sub-sized specimens used in nuclear structural materials. We performed an extensive literature review of relevant publications and extracted over 1,000 tensile testing records comprising 54 parameters including material type and composition, manufacturing information, irradiation conditions, specimen dimensions, and tensile properties. The dataset can serve as a valuable resource to investigate the specimen size effect and develop computational methods to correlate the tensile properties of sub-sized specimens.

physics.ins-det

Rubick: Exploiting Job Reconfigurability for Deep Learning Cluster Scheduling

The era of large deep learning models has given rise to advanced training strategies such as 3D parallelism and the ZeRO series. These strategies enable various (re-)configurable execution plans for a training job, which exhibit remarkably different requirements of multiple resource types. Existing cluster scheduling systems, however, treat such reconfigurable training jobs as black boxes: they rely on users to choose execution plans statically, and then make resource allocations without awareness of the chosen plans and their resource requirements. This approach results in mismatches between execution plans and resources, making both training performance and cluster utilization far from optimal. We introduce Rubick, a cluster scheduling system for deep learning training that exploits the reconfigurability to improve job performance and cluster efficiency. Rubick incorporates the job execution planning as a new dimension in cluster scheduling, by continuously reconfiguring jobs' execution plans and tuning multi-resource allocations across jobs jointly. Such a co-optimization is navigated by a performance model that understands the diverse resource requirements and performance characteristics of different jobs and execution plans. Rubick exploits such a model to make performance-aware scheduling decisions to maximize cluster throughput while providing performance guarantees to individual jobs. Evaluations on a 64-GPU high-performance training cluster show that Rubick improves average job completion time and makespan by up to 3.2x and 1.4x, respectively, compared against state-of-the-art systems.

cs.DC

Non-uniqueness of Leray weak solutions of the forced MHD equations

In this paper, we exhibit non-uniqueness of Leray weak solutions of the forced magnetohydrodynamic (MHD for short) equations. Similar to the solutions constructed in \cite{ABC2}, we first find a special steady solution of ideal MHD equations whose linear unstability was proved in \cite{Lin}. It is possible to perturb the unstable scenario of ideal MHD to 3D viscous and resistive MHD equations, which can be regarded as the first unstable "background" solution. Our perturbation argument is based on the spectral theoretic approach \cite{Kato}. The second solution we would construct is a trajectory on the unstable manifold associated to the unstable steady solution. It is worth noting that these solutions live precisely on the borderline of the known well-posedness theory.

math.AP

FedClust: Tackling Data Heterogeneity in Federated Learning through Weight-Driven Client Clustering

Federated learning (FL) is an emerging distributed machine learning paradigm that enables collaborative training of machine learning models over decentralized devices without exposing their local data. One of the major challenges in FL is the presence of uneven data distributions across client devices, violating the well-known assumption of independent-and-identically-distributed (IID) training samples in conventional machine learning. To address the performance degradation issue incurred by such data heterogeneity, clustered federated learning (CFL) shows its promise by grouping clients into separate learning clusters based on the similarity of their local data distributions. However, state-of-the-art CFL approaches require a large number of communication rounds to learn the distribution similarities during training until the formation of clusters is stabilized. Moreover, some of these algorithms heavily rely on a predefined number of clusters, thus limiting their flexibility and adaptability. In this paper, we propose {\em FedClust}, a novel approach for CFL that leverages the correlation between local model weights and the data distribution of clients. {\em FedClust} groups clients into clusters in a one-shot manner by measuring the similarity degrees among clients based on the strategically selected partial weights of locally trained models. We conduct extensive experiments on four benchmark datasets with different non-IID data settings. Experimental results demonstrate that {\em FedClust} achieves higher model accuracy up to $\sim$45\% as well as faster convergence with a significantly reduced communication cost up to 2.7$\times$ compared to its state-of-the-art counterparts.

cs.DC

Existence, Uniqueness and Asymptotic Dynamics of Nonlinear Schr\"odinger Equations With Quasi-Periodic Initial Data: II. The Derivative NLS

This is the second part of a two-paper series studying the nonlinear Schr\"odinger equation with quasi-periodic initial data. In this paper, we focus on the quasi-periodic Cauchy problem for the derivative nonlinear Schr\"odinger equation. Under the assumption that the Fourier coefficients of the initial data obey an exponential upper bound, we establish local existence of a solution that retains quasi-periodicity in space with a slightly weaker Fourier decay. Moreover, the solution is shown to be unique within this class of quasi-periodic functions. Also, we prove that, for the derivative nonlinear Schr\"odinger equation in a weakly nonlinear setting, within the time scale, as the small parameter of nonlinearity tends to zero, the nonlinear solution converges asymptotically to the linear solution in the sense of both sup-norm and analytic Sobolev-norm. The proof proceeds via a consideration of an associated infinite system of coupled ordinary differential equations for the Fourier coefficients and an explicit combinatorial analysis for the Picard iteration with the help of Feynman diagrams and the power of $\ast^{[\cdot]}$ labelling the complex conjugate.

math.AP

Existence, Uniqueness and Asymptotic Dynamics of Nonlinear Schr\"odinger Equations With Quasi-Periodic Initial Data: I. The Standard NLS

This is the first part of a two-paper series studying nonlinear Schr\"odinger equations with quasi-periodic initial data. In this paper, we consider the standard nonlinear Schr\"odinger equation. Under the assumption that the Fourier coefficients of the initial data obey a power-law upper bound, we establish local existence of a solution that retains quasi-periodicity in space with a slightly weaker Fourier decay. Moreover, the solution is shown to be unique within this class of quasi-periodic functions. In addition, for the nonlinear Schr\"odinger equation with small nonlinearity, within the time scale, as the small parameter of nonlinearity tends to zero, we prove that the nonlinear solution converges asymptotically to the linear solution with respect to both the sup-norm $\|\cdot\|_{L_x^\infty(\mathbb R)}$ and the Sobolev-norm $\|\cdot\|_{H^s_x(\mathbb R)}$. The proof proceeds via a consideration of an associated infinite system of coupled ordinary differential equations for the Fourier coefficients and a combinatorial analysis of the resulting tree expansion of the coefficients. For this purpose, we introduce a Feynman diagram for the Picard iteration and $\ast^{[\cdot]}$ to denote the complex conjugate label.

math.AP

SignAvatar: Sign Language 3D Motion Reconstruction and Generation

Achieving expressive 3D motion reconstruction and automatic generation for isolated sign words can be challenging, due to the lack of real-world 3D sign-word data, the complex nuances of signing motions, and the cross-modal understanding of sign language semantics. To address these challenges, we introduce SignAvatar, a framework capable of both word-level sign language reconstruction and generation. SignAvatar employs a transformer-based conditional variational autoencoder architecture, effectively establishing relationships across different semantic modalities. Additionally, this approach incorporates a curriculum learning strategy to enhance the model's robustness and generalization, resulting in more realistic motions. Furthermore, we contribute the ASL3DWord dataset, composed of 3D joint rotation data for the body, hands, and face, for unique sign words. We demonstrate the effectiveness of SignAvatar through extensive experiments, showcasing its superior reconstruction and automatic generation capabilities. The code and dataset are available on the project page.

cs.CV

HarmonyBatch: Batching multi-SLO DNN Inference with Heterogeneous Serverless Functions

Deep Neural Network (DNN) inference on serverless functions is gaining prominence due to its potential for substantial budget savings. Existing works on serverless DNN inference solely optimize batching requests from one application with a single Service Level Objective (SLO) on CPU functions. However, production serverless DNN inference traces indicate that the request arrival rate of applications is surprisingly low, which inevitably causes a long batching time and SLO violations. Hence, there is an urgent need for batching multiple DNN inference requests with diverse SLOs (i.e., multi-SLO DNN inference) in serverless platforms. Moreover, the potential performance and cost benefits of deploying heterogeneous (i.e., CPU and GPU) functions for DNN inference have received scant attention. In this paper, we present HarmonyBatch, a cost-efficient resource provisioning framework designed to achieve predictable performance for multi-SLO DNN inference with heterogeneous serverless functions. Specifically, we construct an analytical performance and cost model of DNN inference on both CPU and GPU functions, by explicitly considering the GPU time-slicing scheduling mechanism and request arrival rate distribution. Based on such a model, we devise a two-stage merging strategy in HarmonyBatch to judiciously batch the multi-SLO DNN inference requests into application groups. It aims to minimize the budget of function provisioning for each application group while guaranteeing diverse performance SLOs of inference applications. We have implemented a prototype of HarmonyBatch on Alibaba Cloud Function Compute. Extensive prototype experiments with representative DNN inference workloads demonstrate that HarmonyBatch can provide predictable performance to serverless DNN inference workloads while reducing the monetary cost by up to 82.9% compared to the state-of-the-art methods.

cs.DC

A Nonnested Augmented Subspace Method for Kohn-Sham Equation

In this paper, a novel adaptive finite element method is proposed to solve the Kohn-Sham equation based on the moving mesh (nonnested mesh) adaptive technique and the augmented subspace method. Different from the classical self-consistent field iterative algorithm which requires to solve the Kohn-Sham equation directly in each adaptive finite element space, our algorithm transforms the Kohn-Sham equation into some linear boundary value problems of the same scale in each adaptive finite element space, and then the wavefunctions derived from the linear boundary value problems are corrected by solving a small-scale Kohn-Sham equation defined in a low-dimensional augmented subspace. Since the new algorithm avoids solving large-scale Kohn-Sham equation directly, a significant improvement for the solving efficiency can be obtained. In addition, the adaptive moving mesh technique is used to generate the nonnested adaptive mesh for the nonnested augmented subspace method according to the singularity of the approximate wavefunctions. The modified Hessian matrix of the approximate wavefunctions is used as the metric matrix to redistribute the mesh. Through the moving mesh adaptive technique, the redistributed mesh is almost optimal. A number of numerical experiments are carried out to verify the efficiency and the accuracy of the proposed algorithm.

math.NA

Multigrid method for nonlinear eigenvalue problems based on Newton iteration

In this paper, a novel multigrid method based on Newton iteration is proposed to solve nonlinear eigenvalue problems. Instead of handling the eigenvalue $\lambda$ and eigenfunction $u$ separately, we treat the eigenpair $(\lambda, u)$ as one element in a product space $\mathbb R \times H_0^1(\Omega)$. Then in the presented multigrid method, only one discrete linear boundary value problem needs to be solved for each level of the multigrid sequence. Because we avoid solving large-scale nonlinear eigenvalue problems directly, the overall efficiency is significantly improved. The optimal error estimate and linear computational complexity can be derived simultaneously. In addition, we also provide an improved multigrid method coupled with a mixing scheme to further guarantee the convergence and stability of the iteration scheme. More importantly, we prove convergence for the residuals after each iteration step. For nonlinear eigenvalue problems, such theoretical analysis is missing from the existing literatures on the mixing iteration scheme.

math.NA