SearcharxivSearch

arXiv subjects

Jing An

Publications and source records attributed to Jing An.

At least 19 recordsLinked to original sources

GLM-5: from Vibe Coding to Agentic Engineering

We present GLM-5, a next-generation foundation model designed to transition the paradigm of vibe coding to agentic engineering. Building upon the agentic, reasoning, and coding (ARC) capabilities of its predecessor, GLM-5 adopts DSA to significantly reduce training and inference costs while maintaining long-context fidelity. To advance model alignment and autonomy, we implement a new asynchronous reinforcement learning infrastructure that drastically improves post-training efficiency by decoupling generation from training. Furthermore, we propose novel asynchronous agent RL algorithms that further improve RL quality, enabling the model to learn from complex, long-horizon interactions more effectively. Through these innovations, GLM-5 achieves state-of-the-art performance on major open benchmarks. Most critically, GLM-5 demonstrates unprecedented capability in real-world coding tasks, surpassing previous baselines in handling end-to-end software engineering challenges. Code, models, and more information are available at https://github.com/zai-org/GLM-5.

cs.LG

Reaction enhancement by flux-limited chemotaxis

Chemotaxis plays a crucial role in a variety of processes in biology and ecology. Quite often it acts to improve efficiency of biological reactions; one example is the immune system signalling, where infected tissues release chemokines attracting monocytes to fight invading bacteria. Another example is reproduction, where eggs release pheromones that attract sperm. In this paper, we analyze a system of two reacting densities, one of which is chemotactic on another. Since the speed of any biological agents is limited, we employ flux limited chemotaxis model. Our main result is the rigorous derivation of the scaling laws showing how presence of chemotaxis affects the typical reaction time scale. This work builds on the results of \cite{kiselev2022chemotaxis}, which employed a classical Keller-Segel chemotaxis term (not flux limited) - leading to the effect of possible over concentration and restricting the results to radial data. The model presented here is more reasonable biologically and covers broader parameter regimes.

math.AP

Convergence of two-timescale gradient descent ascent dynamics: finite-dimensional and mean-field perspectives

The two-timescale gradient descent-ascent (GDA) is a canonical gradient algorithm designed to find Nash equilibria in min-max games. We analyze the two-timescale GDA by investigating the effects of learning rate ratios on convergence behavior in both finite-dimensional and mean-field settings. In particular, for finite-dimensional quadratic min-max games, we obtain long-time convergence in near quasi-static regimes through the hypocoercivity method. For mean-field GDA dynamics, we investigate convergence under a finite-scale ratio using a mixed synchronous-reflection coupling technique.

math.OC

Why does the two-timescale Q-learning converge to different mean field solutions? A unified convergence analysis

We revisit the unified two-timescale Q-learning algorithm as initially introduced by Angiuli et al. \cite{angiuli2022unified}. This algorithm demonstrates efficacy in solving mean field game (MFG) and mean field control (MFC) problems, simply by tuning the ratio of two learning rates for mean field distribution and the Q-functions respectively. In this paper, we provide a comprehensive theoretical explanation of the algorithm's bifurcated numerical outcomes under fixed learning rates. We achieve this by establishing a diagram that correlates continuous-time mean field problems to their discrete-time Q-function counterparts, forming the basis of the algorithm. Our key contribution lies in the construction of a Lyapunov function integrating both mean field distribution and Q-function iterates. This Lyapunov function facilitates a unified convergence of the algorithm across the entire spectrum of learning rates, thus providing a cohesive framework for analysis.

math.OC

Front location determines convergence rate to traveling waves

We propose a novel method for establishing the convergence rates of solutions to reaction-diffusion equations to traveling waves. The analysis is based on the study of the traveling wave shape defect function introduced in [2]. It turns out that the convergence rate is controlled by the distance between the ``phantom front location'' for the shape defect function and the true front location of the solution. Curiously, the convergence to a traveling wave itself has a pulled nature, regardless of whether the traveling wave is of pushed, pulled, or pushmi-pullyu type. In addition to providing new results, this approach simplifies dramatically the proof in the Fisher-KPP case and gives a unified, succinct explanation for the known algebraic rates of convergence in the Fisher-KPP case and the exponential rates in the pushed case.

math.AP

Convergence of stochastic gradient descent under a local Lojasiewicz condition for deep neural networks

We study the convergence of stochastic gradient descent (SGD) for non-convex objective functions. We establish the local convergence with positive probability under the local \L{}ojasiewicz condition introduced by Chatterjee in \cite{chatterjee2022convergence} and an additional local structural assumption of the loss function landscape. A key component of our proof is to ensure that the whole trajectories of SGD stay inside the local region with a positive probability. We also provide examples of neural networks with finite widths such that our assumptions hold.

cs.LG

Critical Points and Convergence Analysis of Generative Deep Linear Networks Trained with Bures-Wasserstein Loss

We consider a deep matrix factorization model of covariance matrices trained with the Bures-Wasserstein distance. While recent works have made advances in the study of the optimization problem for overparametrized low-rank matrix approximation, much emphasis has been placed on discriminative settings and the square loss. In contrast, our model considers another type of loss and connects with the generative setting. We characterize the critical points and minimizers of the Bures-Wasserstein distance over the space of rank-bounded matrices. The Hessian of this loss at low-rank matrices can theoretically blow up, which creates challenges to analyze convergence of gradient optimization methods. We establish convergence results for gradient flow using a smooth perturbative version of the loss as well as convergence results for finite step size gradient descent under certain assumptions on the initial weights.

stat.ML

Voting models and semilinear parabolic equations

We present probabilistic interpretations of solutions to semi-linear parabolic equations with polynomial nonlinearities in terms of the voting models on the genealogical trees of branching Brownian motion (BBM). These extend the connection between the Fisher-KPP equation and BBM discovered by McKean in~\cite{McK}. In particular, we present ``random outcome'' and ``random threshold'' voting models that yield any polynomial nonlinearity $f$ satisfying $f(0)=f(1)=0$ and a ``recursive up the tree'' model that allows to go beyond this restriction on $f$. We compute a few examples of particular interest; for example, we obtain a curious interpretation of the heat equation in terms of a nontrivial voting model and a ``group-based'' voting rule that leads to a probabilistic view of the pushmi-pullyu transition for a class of nonlinearities introduced by Ebert and van Saarloos.

math.AP

Quantitative steepness, semi-FKPP reactions, and pushmi-pullyu fronts

We uncover a seemingly previously unnoticed algebraic structure of a large class of reaction-diffusion equations and use it, in particular, to study the long time behavior of the solutions and their convergence to traveling waves in the pulled and pushed regimes, as well as at the pushmi-pullyu boundary. One such new object introduced in this paper is the shape defect function, which, indirectly, measures the difference between the profiles of the solution and the traveling wave. While one can recast the classical notion of `steepness' in terms of the positivity of the shape defect function, its positivity can, surprisingly, be used in numerous quantitative ways. In particular, the positivity is used in a new weighted Hopf-Cole transform and in a relative entropy approach that play a key role in the stability arguments. The shape defect function also gives a new connection between reaction-diffusion equations and reaction conservation laws at the pulled-pushed transition. Other simple but seemingly new algebraic constructions in the present paper supply various unexpected inequalities sprinkled throughout the paper. Of note is a new variational formulation that applies equally to pulled and pushed fronts, opening the door to an as-yet-elusive variational analysis in the pulled case.

math.AP

Nonlocal nonreciprocal optomechanical circulator

A nonlocal circulator protocol is proposed in hybrid optomechanical system. By analogy with quantum communication, using the input-output relationship, we establish the quantum channel between two optical modes with long-range. The three body nonlocal interaction between the cavity and the two oscillators is obtained by eliminating the optomechanical cavity mode and verifying the Bell-CHSH inequality of continuous variables. By introducing the phase accumulation between cyclic interactions, the unidirectional transmission of quantum state between optical mode and two mechanical modes are achieved. The results show that nonreciprocal transmissions are achieved as long as the accumulated phase reaches a certain value. In addition, the effective interaction parameters in our system are amplified, which reduces the difficulty of the implementation of our protocol. Our research can provide potential applications for nonlocal manipulation and transmission control of quantum platforms.

quant-ph

Pushed, pulled and pushmi-pullyu fronts of the Burgers-FKPP equation

We consider the long time behavior of the solutions to the Burgers-FKPP equation with advection of a strength $\beta\in\mathbb{R}$. This equation exhibits a transition from pulled to pushed front behavior at $\beta_c=2$. We prove convergence of the solutions to a traveling wave in a reference frame centered at a position $m_\beta(t)$ and study the asymptotics of the front location $m_\beta(t)$. When $\beta < 2$, it has the same form as for the standard Fisher-KPP equation established by Bramson \cite{Bramson1,Bramson2}: $m_\beta(t) = 2t - (3/2)\log(t) + x_\infty + o(1)$ as $t\to+\infty$. This form is typical of pulled fronts. When $\beta > 2$, the front is located at the position $m_\beta(t)=c_*(\beta)t+x_\infty+o(1)$ with $c_*(\beta)=\beta/2+2/\beta$, which is the typical form of pushed fronts. However, at the critical value $\beta_c = 2$, the expansion changes to $m_\beta(t) = 2t - (1/2)\log(t) + x_\infty + o(1)$, reflecting the "pushmi-pullyu" nature of the front. The arguments for $\beta<2$ rely on a new weighted Hopf-Cole transform that allows to control the advection term, when combined with additional steepness comparison arguments. The case $\beta>2$ relies on standard pushed front techniques. The proof in the case $\beta=\beta_c$ is much more intricate and involves arguments not usually encountered in the study of the Bramson correction. It relies on a somewhat hidden viscous conservation law structure of the Burgers-FKPP equation at $\beta_c=2$ and utilizes a dissipation inequality, which comes from a relative entropy type computation, together with a weighted Nash inequality involving dynamically changing weights.

math.AP

Combining resampling and reweighting for faithful stochastic optimization

Many machine learning and data science tasks require solving non-convex optimization problems. When the loss function is a sum of multiple terms, a popular method is the stochastic gradient descent. Viewed as a process for sampling the loss function landscape, the stochastic gradient descent is known to prefer flat minima. Though this is desired for certain optimization problems such as in deep learning, it causes issues when the goal is to find the global minimum, especially if the global minimum resides in a sharp valley. Illustrated with a simple motivating example, we show that the fundamental reason is that the difference in the Lipschitz constants of multiple terms in the loss function causes stochastic gradient descent to experience different variances at different minima. In order to mitigate this effect and perform faithful optimization, we propose a combined resampling-reweighting scheme to balance the variance at local minima and extend to general loss functions. We explain from the numerical stability perspective how the proposed scheme is more likely to select the true global minimum, and the local convergence analysis perspective how it converges to a minimum faster when compared with the vanilla stochastic gradient descent. Experiments from robust statistics and computational chemistry are provided to demonstrate the theoretical findings.

cs.LG

Hierarchical RNNs-Based Transformers MADDPG for Mixed Cooperative-Competitive Environments

At present, attention mechanism has been widely applied to the fields of deep learning models. Structural models that based on attention mechanism can not only record the relationships between features position, but also can measure the importance of different features based on their weights. By establishing dynamically weighted parameters for choosing relevant and irrelevant features, the key information can be strengthened, and the irrelevant information can be weakened. Therefore, the efficiency of deep learning algorithms can be significantly elevated and improved. Although transformers have been performed very well in many fields including reinforcement learning, there are still many problems and applications can be solved and made with transformers within this area. MARL (known as Multi-Agent Reinforcement Learning) can be recognized as a set of independent agents trying to adapt and learn through their way to reach the goal. In order to emphasize the relationship between each MDP decision in a certain time period, we applied the hierarchical coding method and validated the effectiveness of this method. This paper proposed a hierarchical transformers MADDPG based on RNN which we call it Hierarchical RNNs-Based Transformers MADDPG(HRTMADDPG). It consists of a lower level encoder based on RNNs that encodes multiple step sizes in each time sequence, and it also consists of an upper sequence level encoder based on transformer for learning the correlations between multiple sequences so that we can capture the causal relationship between sub-time sequences and make HRTMADDPG more efficient.

cs.LG

Why resampling outperforms reweighting for correcting sampling bias with stochastic gradients

A data set sampled from a certain population is biased if the subgroups of the population are sampled at proportions that are significantly different from their underlying proportions. Training machine learning models on biased data sets requires correction techniques to compensate for the bias. We consider two commonly-used techniques, resampling and reweighting, that rebalance the proportions of the subgroups to maintain the desired objective function. Though statistically equivalent, it has been observed that resampling outperforms reweighting when combined with stochastic gradient algorithms. By analyzing illustrative examples, we explain the reason behind this phenomenon using tools from dynamical stability and stochastic asymptotics. We also present experiments from regression, classification, and off-policy prediction to demonstrate that this is a general phenomenon. We argue that it is imperative to consider the objective function design and the optimization algorithm together while addressing the sampling bias.

cs.LG

On the gradient flow structure of the isotropic Landau equation

We prove that the isotropic Landau equation equipped with the Coulomb potential introduced by Krieger-Strain and Gualdani-Guillen can be identified with the gradient flow of the entropy in the probability space with respect to a Riemannian metric tensor with nonlocal mobility. We give characterizations of the corresponding geodesics equations and present a convergence rate result by estimating its Hessian operator.

math.AP

Global well-posedness for the Euler alignment system with mildly singular interactions

We consider the Euler alignment system with mildly singular interaction kernels. When the local repulsion term is of the fractional type, global in time existence of smooth solutions was proved in\cite{do2018global,shvydkoy2017eulerian1,shvydkoy2017eulerian2,shvydkoy2017eulerian3}. Here, we consider a class of less singular interaction kernels and establish the global regularity of solutions as long as the interaction kernels are not integrable. The proof relies on modulus of continuity estimates for a class of parabolic integro-differential equations with a drift and mildly singular kernels.

math.AP

Stochastic modified equations for the asynchronous stochastic gradient descent

We propose a stochastic modified equations (SME) for modeling the asynchronous stochastic gradient descent (ASGD) algorithms. The resulting SME of Langevin type extracts more information about the ASGD dynamics and elucidates the relationship between different types of stochastic gradient algorithms. We show the convergence of ASGD to the SME in the continuous time limit, as well as the SME's precise prediction to the trajectories of ASGD with various forcing terms. As an application of the SME, we propose an optimal mini-batching strategy for ASGD via solving the optimal control problem of the associated SME.

stat.ML

Fast algorithms for integral formulations of steady-state radiative transfer equation

We investigate integral formulations and fast algorithms for the steady-state radiative transfer equation with isotropic and anisotropic scattering. When the scattering term is a smooth convolution on the unit sphere, a model reduction step in the angular domain using the Fourier transformation in 2D and the spherical harmonic transformation in 3D significantly reduces the number of degrees of freedoms. The resulting Fourier coefficients or spherical harmonic coefficients satisfy a Fredholm integral equation of the second kind. We study the uniqueness of the equation and proved an a priori estimate. For a homogeneous medium, the integral equation can be solved efficiently using the FFT and iterative methods. For an inhomogeneous medium, the recursive skeletonization factorization method is applied instead. Numerical simulations demonstrate the efficiency of the proposed algorithms in both homogeneous and inhomogeneous cases and for both transport and diffusion regimes.

math.NA