arXiv subjects

Lu Lu

Publications and source records attributed to Lu Lu.

At least 181 records · Page 10Linked to original sources

arXiv2022

Splitting fields of mixed Cayley graphs over abelian groups

The splitting field $\mathbb{SF}(Γ)$ of a mixed graph $Γ$ is the smallest field extension of $\mathbb{Q}$ which contains all eigenvalues of the Hermitian adjacency matrix of $Γ$. The extension degree $[\mathbb{SF}(Γ):\mathbb{Q}]$ is called the algebraic degree of $Γ$. In this paper, we determine the splitting fields and algebraic degrees of mixed Cayley graphs over abelian groups. This generalizes the main results of [K. Mönius, Splitting fields of spectra of circulant graphs, J. Algebra 594(15) (2022) 154--169] and [M. Kadyan, B. Bhattacharjya, Integral mixed Cayley graphs over abelian groups, Electron. J. Combin. 28(4) (2021) \#P4.46].

math.CO↗

arXiv2022

Distance-regular Cayley graphs over dicyclic groups

The characterization of distance-regular Cayley graphs originated from the problem of identifying strongly regular Cayley graphs, or equivalently, regular partial difference sets. In this paper, a classification of distance-regular Cayley graphs on dicyclic groups is obtained. More specifically, it is shown that every distance-regular Cayley graph on a dicyclic group is a complete graph, a complete multipartite graph, or a non-antipodal bipartite distance-regular graph with diameter $3$ satisfying some additional conditions.

math.CO↗

arXiv2022

Conjugate Gradient Adaptive Learning with Tukey's Biweight M-Estimate

We propose a novel M-estimate conjugate gradient (CG) algorithm, termed Tukey's biweight M-estimate CG (TbMCG), for system identification in impulsive noise environments. In particular, the TbMCG algorithm can achieve a faster convergence while retaining a reduced computational complexity as compared to the recursive least-squares (RLS) algorithm. Specifically, the Tukey's biweight M-estimate incorporates a constraint into the CG filter to tackle impulsive noise environments. Moreover, the convergence behavior of the TbMCG algorithm is analyzed. Simulation results confirm the excellent performance of the proposed TbMCG algorithm for system identification and active noise control applications.

cs.LG↗

arXiv2022

Active noise control techniques for nonlinear systems

Most of the literature focuses on the development of the linear active noise control (ANC) techniques. However, ANC systems might have to deal with some nonlinear components and the performance of linear ANC techniques may degrade in this scenario. To overcome this limitation, nonlinear ANC (NLANC) algorithms were developed. In Part II, we review the development of NLANC algorithms during the last decade. The contributions of heuristic ANC algorithms are outlined. Moreover, we emphasize recent advances of NLANC algorithms, such as spline ANC algorithms, kernel adaptive filters, and nonlinear distributed ANC algorithms. Then, we present recent applications of ANC technique including linear and nonlinear perspectives. Future research challenges regarding ANC techniques are also discussed.

cs.LG↗

arXiv2022

MIONet: Learning multiple-input operators via tensor product

As an emerging paradigm in scientific machine learning, neural operators aim to learn operators, via neural networks, that map between infinite-dimensional function spaces. Several neural operators have been recently developed. However, all the existing neural operators are only designed to learn operators defined on a single Banach space, i.e., the input of the operator is a single function. Here, for the first time, we study the operator regression via neural networks for multiple-input operators defined on the product of Banach spaces. We first prove a universal approximation theorem of continuous multiple-input operators. We also provide detailed theoretical analysis including the approximation error, which provides a guidance of the design of the network architecture. Based on our theory and a low-rank approximation, we propose a novel neural operator, MIONet, to learn multiple-input operators. MIONet consists of several branch nets for encoding the input functions and a trunk net for encoding the domain of the output function. We demonstrate that MIONet can learn solution operators involving systems governed by ordinary and partial differential equations. In our computational examples, we also show that we can endow MIONet with prior knowledge of the underlying system, such as linearity and periodicity, to further improve the accuracy.

cs.LG↗

arXiv2022

Systems Biology: Identifiability analysis and parameter identification via systems-biology informed neural networks

The dynamics of systems biological processes are usually modeled by a system of ordinary differential equations (ODEs) with many unknown parameters that need to be inferred from noisy and sparse measurements. Here, we introduce systems-biology informed neural networks for parameter estimation by incorporating the system of ODEs into the neural networks. To complete the workflow of system identification, we also describe structural and practical identifiability analysis to analyze the identifiability of parameters. We use the ultridian endocrine model for glucose-insulin interaction as the example to demonstrate all these methods and their implementation.

q-bio.QM↗

arXiv2021

Nonparametric estimation of multivariate copula using empirical bayes method

In the field of finance, insurance, and system reliability, etc., it is often of interest to measure the dependence among variables by modeling a multivariate distribution using a copula. The copula models with parametric assumptions are easy to estimate but can be highly biased when such assumptions are false, while the empirical copulas are non-smooth and often not genuine copula making the inference about dependence challenging in practice. As a compromise, the empirical Bernstein copula provides a smooth estimator but the estimation of tuning parameters remains elusive. In this paper, by using the so-called empirical checkerboard copula we build a hierarchical empirical Bayes model that enables the estimation of a smooth copula function for arbitrary dimensions. The proposed estimator based on the multivariate Bernstein polynomials is itself a genuine copula and the selection of its dimension-varying degrees is data-dependent. We also show that the proposed copula estimator provides a more accurate estimate of several multivariate dependence measures which can be obtained in closed form. We investigate the asymptotic and finite-sample performance of the proposed estimator and compare it with some nonparametric estimators through simulation studies. An application to portfolio risk management is presented along with a quantification of estimation uncertainty.

stat.ME↗

arXiv2021

A comprehensive and fair comparison of two neural operators (with practical extensions) based on FAIR data

Neural operators can learn nonlinear mappings between function spaces and offer a new simulation paradigm for real-time prediction of complex dynamics for realistic diverse applications as well as for system identification in science and engineering. Herein, we investigate the performance of two neural operators, and we develop new practical extensions that will make them more accurate and robust and importantly more suitable for industrial-complexity applications. The first neural operator, DeepONet, was published in 2019, and the second one, named Fourier Neural Operator or FNO, was published in 2020. In order to compare FNO with DeepONet for realistic setups, we develop several extensions of FNO that can deal with complex geometric domains as well as mappings where the input and output function spaces are of different dimensions. We also endow DeepONet with special features that provide inductive bias and accelerate training, and we present a faster implementation of DeepONet with cost comparable to the computational cost of FNO. We consider 16 different benchmarks to demonstrate the relative performance of the two neural operators, including instability wave analysis in hypersonic boundary layers, prediction of the vorticity field of a flapping airfoil, porous media simulations in complex-geometry domains, etc. The performance of DeepONet and FNO is comparable for relatively simple settings, but for complex geometries and especially noisy data, the performance of FNO deteriorates greatly. For example, for the instability wave analysis with only 0.1% noise added to the input data, the error of FNO increases 10000 times making it inappropriate for such important applications, while there is hardly any effect of such noise on the DeepONet. We also compare theoretically the two neural operators and obtain similar error estimates for DeepONet and FNO under the same regularity assumptions.

physics.comp-ph↗

arXiv2021

Gradient-enhanced physics-informed neural networks for forward and inverse PDE problems

Deep learning has been shown to be an effective tool in solving partial differential equations (PDEs) through physics-informed neural networks (PINNs). PINNs embed the PDE residual into the loss function of the neural network, and have been successfully employed to solve diverse forward and inverse PDE problems. However, one disadvantage of the first generation of PINNs is that they usually have limited accuracy even with many training points. Here, we propose a new method, gradient-enhanced physics-informed neural networks (gPINNs), for improving the accuracy and training efficiency of PINNs. gPINNs leverage gradient information of the PDE residual and embed the gradient into the loss function. We tested gPINNs extensively and demonstrated the effectiveness of gPINNs in both forward and inverse PDE problems. Our numerical results show that gPINN performs better than PINN with fewer training points. Furthermore, we combined gPINN with the method of residual-based adaptive refinement (RAR), a method for improving the distribution of training points adaptively during training, to further improve the performance of gPINN, especially in PDEs with solutions that have steep gradients.

cs.LG↗

arXiv2021

A survey on active noise control techniques -- Part I: Linear systems

Active noise control (ANC) is an effective way for reducing the noise level in electroacoustic or electromechanical systems. Since its first introduction in 1936, this approach has been greatly developed. This paper focuses on discussing the development of ANC techniques over the past decade. Linear ANC algorithms, including the celebrated filtered-x least-mean-square (FxLMS)-based algorithms and distributed ANC algorithms, are investigated and evaluated. Nonlinear ANC (NLANC) techniques, such as functional link artificial neural network (FLANN)-based algorithms, are pursued in Part II. Furthermore, some novel methods and applications of ANC emerging in the past decade are summarized. Finally, future research challenges regarding the ANC technique are discussed.

eess.SP↗

arXiv2021

Study of Proximal Normalized Subband Adaptive Algorithm for Acoustic Echo Cancellation

In this paper, we propose a novel normalized subband adaptive filter algorithm suited for sparse scenarios, which combines the proportionate and sparsity-aware mechanisms. The proposed algorithm is derived based on the proximal forward-backward splitting and the soft-thresholding methods. We analyze the mean and mean square behaviors of the algorithm, which is supported by simulations. In addition, an adaptive approach for the choice of the thresholding parameter in the proximal step is also proposed based on the minimization of the mean square deviation. Simulations in the contexts of system identification and acoustic echo cancellation verify the superiority of the proposed algorithm over its counterparts.

eess.SP↗

arXiv2021

Concept Study of a Radio Array Embedded in a Deep Gen2-like Optical Array

The IceCube Neutrino Observatory has discovered a diffuse astrophysical flux up to 10 PeV and is now planning a large extension with IceCube-Gen2, including an optical array and a large radio array at shallow depth [1]. Neutrino searches for energies >100 PeV are best done with such shallow radio detectors like the Askaryan Radio Array (ARA) or similar (buried as deep as 200 meters below the surface) as they are cheaper to deploy. This poster explores the potential of opportunistically burying radio antennas within the planned IceCube-Gen2 detector volume (between 1350 meters and 2600 meters below the surface). A hybrid detection of events in optical and radio could substantially improve the uncertainty of neutrino cascade direction as radio signals do not scatter in ice. We show the first results of simulating neutrinos from an astrophysical and a cosmogenic flux interacting with 9760 ARA-style vertically polarized radio antennas distributed evenly across 122 strings.

astro-ph.HE↗

arXiv2021

Point Adversarial Self Mining: A Simple Method for Facial Expression Recognition

In this paper, we propose a simple yet effective approach, named Point Adversarial Self Mining (PASM), to improve the recognition accuracy in facial expression recognition. Unlike previous works focusing on designing specific architectures or loss functions to solve this problem, PASM boosts the network capability by simulating human learning processes: providing updated learning materials and guidance from more capable teachers. Specifically, to generate new learning materials, PASM leverages a point adversarial attack method and a trained teacher network to locate the most informative position related to the target task, generating harder learning samples to refine the network. The searched position is highly adaptive since it considers both the statistical information of each sample and the teacher network capability. Other than being provided new learning materials, the student network also receives guidance from the teacher network. After the student network finishes training, the student network changes its role and acts as a teacher, generating new learning materials and providing stronger guidance to train a better student network. The adaptive learning materials generation and teacher/student update can be conducted more than one time, improving the network capability iteratively. Extensive experimental results validate the efficacy of our method over the existing state of the arts for facial expression recognition.

cs.CV↗

arXiv2021

Mixed graphs with smallest eigenvalue greater than $-\frac{\sqrt{5}+1}{2}$

The classical problem of characterizing the graphs with bounded eigenvalues may date back to the work of Smith in 1970. Especially, the research on graphs with smallest eigenvalues not less than $-2$ has attracted widespread attention. Mixed graphs are natural generalization of undirected graphs. In this paper, we completely characterize the mixed graphs with smallest Hermitian eigenvalue greater than $-\frac{\sqrt{5}+1}{2}$, which consists of three infinite classes of mixed graphs and $30$ scattered mixed graphs. By the way, we get a new class of mixed graphs switching equivalent to their underlying graphs.

math.CO↗

arXiv2021

Modeling Bivariate Geyser Eruption System with Covariate-Adjusted Recurrent Event Process

Geyser eruption is one of the most popular signature attractions at the Yellowstone National Park. The interdependence of geyser eruptions and impacts of covariates are of interest to researchers in geyser studies. In this paper, we propose a parametric covariate-adjusted recurrent event model for estimating the eruption gap time. We describe a general bivariate recurrent event process, where a bivariate lognormal distribution and a Gumbel copula with different marginal distributions are used to model an interdependent dual-type event system. The maximum likelihood approach is used to estimate model parameters. The proposed method is applied to analyzing the Yellowstone geyser eruption data for a bivariate geyser system and offers a deeper understanding of the event occurrence mechanism of individual events as well as the system as a whole. A comprehensive simulation study is conducted to evaluate the performance of the proposed method.

stat.AP↗

arXiv2021

Convergence rate of DeepONets for learning operators arising from advection-diffusion equations

We present convergence analysis of operator learning in [Chen and Chen 1995] and [Lu et al. 2020], where continuous operators are approximated by a sum of products of branch and trunk networks. In this work, we consider the rates of learning solution operators from both linear and nonlinear advection-diffusion equations with or without reaction. We find that the convergence rates depend on the architecture of branch networks as well as the smoothness of inputs and outputs of solution operators.

math.AP↗

arXiv2021

Physics-informed neural networks with hard constraints for inverse design

Inverse design arises in a variety of areas in engineering such as acoustic, mechanics, thermal/electronic transport, electromagnetism, and optics. Topology optimization is a major form of inverse design, where we optimize a designed geometry to achieve targeted properties and the geometry is parameterized by a density function. This optimization is challenging, because it has a very high dimensionality and is usually constrained by partial differential equations (PDEs) and additional inequalities. Here, we propose a new deep learning method -- physics-informed neural networks with hard constraints (hPINNs) -- for solving topology optimization. hPINN leverages the recent development of PINNs for solving PDEs, and thus does not rely on any numerical PDE solver. However, all the constraints in PINNs are soft constraints, and hence we impose hard constraints by using the penalty method and the augmented Lagrangian method. We demonstrate the effectiveness of hPINN for a holography problem in optics and a fluid problem of Stokes flow. We achieve the same objective as conventional PDE-constrained optimization methods based on adjoint methods and numerical PDE solvers, but find that the design obtained from hPINN is often simpler and smoother for problems whose solution is not unique. Moreover, the implementation of inverse design with hPINN can be easier than that of conventional methods.

physics.comp-ph↗

arXiv2020

Operator learning for predicting multiscale bubble growth dynamics

Simulating and predicting multiscale problems that couple multiple physics and dynamics across many orders of spatiotemporal scales is a great challenge that has not been investigated systematically by deep neural networks (DNNs). Herein, we develop a framework based on operator regression, the so-called deep operator network (DeepONet), with the long term objective to simplify multiscale modeling by avoiding the fragile and time-consuming "hand-shaking" interface algorithms for stitching together heterogeneous descriptions of multiscale phenomena. To this end, as a first step, we investigate if a DeepONet can learn the dynamics of different scale regimes, one at the deterministic macroscale and the other at the stochastic microscale regime with inherent thermal fluctuations. Specifically, we test the effectiveness and accuracy of DeepONet in predicting multirate bubble growth dynamics, which is described by a Rayleigh-Plesset (R-P) equation at the macroscale and modeled as a stochastic nucleation and cavitation process at the microscale by dissipative particle dynamics (DPD). Taken together, our findings demonstrate that DeepONets can be employed to unify the macroscale and microscale models of the multirate bubble growth problem, hence providing new insight into the role of operator regression via DNNs in tackling realistic multiscale problems and in simplifying modeling with heterogeneous descriptions.

physics.comp-ph↗