Searcharxiv⌕ Search

arXiv subjects

Hailiang Liu

Publications and source records attributed to Hailiang Liu.

At least 37 records · Page 2Linked to original sources

Wide Neural Networks as Gaussian Processes: Lessons from Deep Equilibrium Models

Neural networks with wide layers have attracted significant attention due to their equivalence to Gaussian processes, enabling perfect fitting of training data while maintaining generalization performance, known as benign overfitting. However, existing results mainly focus on shallow or finite-depth networks, necessitating a comprehensive analysis of wide neural networks with infinite-depth layers, such as neural ordinary differential equations (ODEs) and deep equilibrium models (DEQs). In this paper, we specifically investigate the deep equilibrium model (DEQ), an infinite-depth neural network with shared weight matrices across layers. Our analysis reveals that as the width of DEQ layers approaches infinity, it converges to a Gaussian process, establishing what is known as the Neural Network and Gaussian Process (NNGP) correspondence. Remarkably, this convergence holds even when the limits of depth and width are interchanged, which is not observed in typical infinite-depth Multilayer Perceptron (MLP) networks. Furthermore, we demonstrate that the associated Gaussian vector remains non-degenerate for any pairwise distinct input data, ensuring a strictly positive smallest eigenvalue of the corresponding kernel matrix using the NNGP kernel. These findings serve as fundamental elements for studying the training and generalization of DEQs, laying the groundwork for future research in this area.

cs.LG↗

On critical thresholds for hyperbolic balance law systems

We review the theoretical development in the study of critical thresholds for hyperbolic balance laws. The emphasis is on two classes of systems: Euler-Poisson-alignment (EPA) systems and hyperbolic relaxation systems. We start with an introduction to the `Critical Threshold Phenomena' and study some nonlocal PDE systems, which are important from modeling point of view.

math.AP↗

Anderson acceleration of gradient methods with energy for optimization problems

Anderson acceleration (AA) as an efficient technique for speeding up the convergence of fixed-point iterations may be designed for accelerating an optimization method. We propose a novel optimization algorithm by adapting Anderson acceleration to the energy adaptive gradient method (AEGD) [arXiv:2010.05109]. The feasibility of our algorithm is examined in light of convergence results for AEGD, though it is not a fixed-point iteration. We also quantify the accelerated convergence rate of AA for gradient descent by a factor of the gain at each implementation of the Anderson mixing. Our experimental results show that the proposed algorithm requires little tuning of hyperparameters and exhibits superior fast convergence.

math.OC↗

On the invariant region for compressible Euler equations with a general equation of state

The state space for solutions of the compressible Euler equations with a general equation of state is examined. An arbitrary equation of state is allowed, subject only to the physical requirements of thermodynamics. An invariant region of the resulting Euler system is identified and the convexity property of this region is justified by using only very minimal thermodynamical assumptions. Finally, we show how an invariant-region-preserving (IRP) limiter can be constructed for use in high order finite-volume type schemes to solve the compressible Euler equations with a general constitutive relation.

math.AP↗

Global Dynamics and Photon Loss in the Kompaneets Equation

The Kompaneets equation governs dynamics of the photon energy spectrum in certain high temperature (or low density) plasmas. We prove several results concerning the long-time convergence of solutions to Bose--Einstein equilibria and the failure of photon conservation. In particular, we show the total photon number can decrease with time via an outflux of photons at the zero-energy boundary. The ensuing accumulation of photons at zero energy is analogous to Bose--Einstein condensation. We provide two conditions that guarantee that photon loss occurs, and show that once loss is initiated then it persists forever. We prove that as $t\to \infty$, solutions necessarily converge to equilibrium and we characterize the limit in terms of the total photon loss. Additionally, we provide a few results concerning the behavior of the solution near the zero-energy boundary, an Oleinik inequality, a comparison principle, and show that the solution operator is a contraction in $L^1$. None of these results impose a boundary condition at the zero-energy boundary.

math.AP↗

SGEM: stochastic gradient with energy and momentum

In this paper, we propose SGEM, Stochastic Gradient with Energy and Momentum, to solve a large class of general non-convex stochastic optimization problems, based on the AEGD method that originated in the work [AEGD: Adaptive Gradient Descent with Energy. arXiv: 2010.05109]. SGEM incorporates both energy and momentum at the same time so as to inherit their dual advantages. We show that SGEM features an unconditional energy stability property, and derive energy-dependent convergence rates in the general nonconvex stochastic setting, as well as a regret bound in the online convex setting. A lower threshold for the energy variable is also provided. Our experimental results show that SGEM converges faster than AEGD and generalizes better or at least as well as SGDM in training some deep neural networks.

cs.LG↗

An Adaptive Gradient Method with Energy and Momentum

We introduce a novel algorithm for gradient-based optimization of stochastic objective functions. The method may be seen as a variant of SGD with momentum equipped with an adaptive learning rate automatically adjusted by an 'energy' variable. The method is simple to implement, computationally efficient, and well suited for large-scale machine learning problems. The method exhibits unconditional energy stability for any size of the base learning rate. We provide a regret bound on the convergence rate under the online convex optimization framework. We also establish the energy-dependent convergence rate of the algorithm to a stationary point in the stochastic non-convex setting. In addition, a sufficient condition is provided to guarantee a positive lower threshold for the energy variable. Our experiments demonstrate that the algorithm converges fast while generalizing better than or as well as SGD with momentum in training deep neural networks, and compares also favorably to Adam.

math.OC↗

A global convergence theory for deep ReLU implicit networks via over-parameterization

Implicit deep learning has received increasing attention recently due to the fact that it generalizes the recursive prediction rules of many commonly used neural network architectures. Its prediction rule is provided implicitly based on the solution of an equilibrium equation. Although a line of recent empirical studies has demonstrated its superior performances, the theoretical understanding of implicit neural networks is limited. In general, the equilibrium equation may not be well-posed during the training. As a result, there is no guarantee that a vanilla (stochastic) gradient descent (SGD) training nonlinear implicit neural networks can converge. This paper fills the gap by analyzing the gradient flow of Rectified Linear Unit (ReLU) activated implicit neural networks. For an $m$-width implicit neural network with ReLU activation and $n$ training samples, we show that a randomly initialized gradient descent converges to a global minimum at a linear rate for the square loss function if the implicit neural network is \textit{over-parameterized}. It is worth noting that, unlike existing works on the convergence of (S)GD on finite-layer over-parameterized neural networks, our convergence results hold for implicit neural networks, where the number of layers is \textit{infinite}.

cs.LG↗

Critical thresholds in the Euler-Poisson-alignment system

This paper is concerned with the global wellposedness of the Euler-Poisson-alignment (EPA) system. This system arises from collective dynamics, and features two types of nonlocal interactions: the repulsive electric force and the alignment force. It is known that the repulsive electric force generates oscillatory solutions, which is difficult to be controlled by the nonlocal alignment force using conventional comparison principles. We construct \emph{invariant regions} such that the solution trajectories cannot exit, and therefore obtain global wellposedness for subcritical initial data that lie in the invariant regions. Supercritical regions of initial data are also derived which leads to finite-time singularity formations. To handle the oscillation and the nonlocality, we introduce a new way to construct invariant regions piece by piece in the phase plane of a reformulation of the EPA system. Our result is extended to the case when the alignment force is weakly singular. The singularity leads to the loss of a priori bounds crucial in our analysis. With the help of improved estimates on the nonlocal quantities, we design non-trivial invariant regions that guarantee global wellposedness of the EPA system with weakly singular alignment interactions.

math.AP↗

Global dynamics of the Euler-alignment system with weakly singular kernel

This letter studies the Euler-alignment system with weakly singular influence functions by introducing a novel technique to bound the density. Instead of resorting to a nonlinear maximum principle used in [C. Tan, Nonlinearity, 33: 1907--1924, 2020] to bound the interaction term $ψ\astρ$ by $ρ^s$ with $s\in (0, 1)$ for $ψ$ with an algebraic singularity at origin, we bound $ψ*ρ$ by a relaxed constant for any $ψ\in L^1$. We thus establish the global-in-time existence results with weaker assumptions on $ψ$ and refined solution bounds, characterized by the structure of $ψ$.

math.AP↗

AEGD: Adaptive Gradient Descent with Energy

We propose AEGD, a new algorithm for first-order gradient-based optimization of non-convex objective functions, based on a dynamically updated energy variable. The method is shown to be unconditionally energy stable, irrespective of the step size. We prove energy-dependent convergence rates of AEGD for both non-convex and convex objectives, which for a suitably small step size recovers desired convergence rates for the batch gradient descent. We also provide an energy-dependent bound on the stationary convergence of AEGD in the stochastic non-convex setting. The method is straightforward to implement and requires little tuning of hyper-parameters. Experimental results demonstrate that AEGD works well for a large variety of optimization problems: it is robust with respect to initial data, capable of making rapid initial progress. The stochastic AEGD shows comparable and often better generalization performance than SGD with momentum for deep neural networks.

math.OC↗

Numerical Study of Non-uniqueness for 2D Compressible Isentropic Euler Equations

In this paper, we numerically study a class of solutions with spiraling singularities in vorticity for two-dimensional, inviscid, compressible Euler systems, where the initial data have an algebraic singularity in vorticity at the origin. These are different from the multi-dimensional Riemann problems widely studied in the literature. Our computations provide numerical evidence of the existence of initial value problems with multiple solutions, thus revealing a fundamental obstruction toward the well-posedness of the governing equations. The compressible Euler equations are solved using the positivity-preserving discontinuous Galerkin method.

math.AP↗

Necessary conditions for blow-up solutions to the restricted Euler--Poisson equations

In this work, we study the behavior of blow-up solutions to the multidimensional restricted Euler--Poisson equations which are the localized version of the full Euler--Poisson system. We provide necessary conditions for the existence of finite-time blow-up solutions in terms of the initial data, and describe the asymptotic behavior of the solutions near blow up times. We also identify a rich set of the initial data which yields global bounded solutions.

math.AP↗

Positivity-preserving third order DG schemes for Poisson--Nernst--Planck equations

In this paper, we design and analyze third order positivity-preserving discontinuous Galerkin (DG) schemes for solving the time-dependent system of Poisson--Nernst--Planck (PNP) equations, which has found much use in diverse applications. Our DG method with Euler forward time discretization is shown to preserve the positivity of cell averages at all time steps. The positivity of numerical solutions is then restored by a scaling limiter in reference to positive weighted cell averages. The method is also shown to preserve steady states. Numerical examples are presented to demonstrate the third order accuracy and illustrate the positivity-preserving property in both one and two dimensions.

math.NA↗

Unconditionally energy stable discontinuous Galerkin schemes for the Cahn-Hilliard equation

In this paper, we introduce novel discontinuous Galerkin (DG) schemes for the Cahn-Hilliard equation, which arises in many applications. The method is designed by integrating the mixed DG method for the spatial discretization with the \emph{Invariant Energy Quadratization} (IEQ) approach for the time discretization. Coupled with a spatial projection, the resulting IEQ-DG schemes are shown to be unconditionally energy dissipative, and can be efficiently solved without resorting to any iteration method. Both one and two dimensional numerical examples are provided to verify the theoretical results, and demonstrate the good performance of IEQ-DG in terms of efficiency, accuracy, and preservation of the desired solution properties.

math.NA↗

Energy stable Runge-Kutta discontinuous Galerkin schemes for fourth order gradient flows

We present unconditionally energy stable Runge-Kutta (RK) discontinuous Galerkin (DG) schemes for solving a class of fourth order gradient flows. Our algorithm is geared toward arbitrarily high order approximations in both space and time, while energy dissipation remains preserved without imposing any restriction on time steps and meshes. We achieve this in two steps. First, taking advantage of the penalty free DG method introduced by Liu and Yin [J Sci. Comput. 77:467--501, 2018] for spatial discretization, we reformulate an extended linearized ODE system by the energy quadratization (EQ) approach. Second, we apply an s-stage algebraically stable RK method for temporal discretization. The resulting fully discrete DG schemes are linear and unconditionally energy stable. In addition, we introduce a prediction-correction procedure to improve both the accuracy and stability of the scheme. We illustrate the effectiveness of the proposed schemes by numerical tests with benchmark problems.

math.NA↗

Data-driven optimal control of a SEIR model for COVID-19

We present a data-driven optimal control approach which integrates the reported partial data with the epidemic dynamics for COVID-19. We use a basic Susceptible-Exposed-Infectious-Recovered (SEIR) model, the model parameters are time-varying and learned from the data. This approach serves to forecast the evolution of the outbreak over a relatively short time period and provide scheduled controls of the epidemic. We provide efficient numerical algorithms based on a generalized Pontryagin Maximum Principle associated with the optimal control theory. Numerical experiments demonstrate the effective performance of the proposed model and its numerical approximations.

math.OC↗

Sharp critical thresholds in a hyperbolic system with relaxation

We propose and study a one-dimensional $2\times 2$ hyperbolic Eulerian system with local relaxation from critical threshold phenomena perspective. The system features dynamic transition between strictly and weakly hyperbolic. For different classes of relaxation we identify intrinsic critical thresholds for initial data that distinguish global regularity and finite time blowup. For relaxation independent of density, we estimate bounds on density in terms of velocity where the system is strictly hyperbolic.

math.AP↗