相关论文: On the validity of "A proof that the discrete sing…

The goal of this paper is to prove how Arthur's results, in the case of split odd orthogonal p-adic groups, imply the Langlands' classification of discrete series. Of course this need the validity of ''fundamental'' lemmas which are not yet…

The one-dimensional modified shallow water equations in Lagrangian coordinates are considered. It is shown the relationship between symmetries and conservation laws in Lagrangian coordinates, in mass Lagrangian variables, and Eulerian…

We comment on two randomized algorithms for constructing low-rank matrix decompositions. Both algorithms employ the Subsampled Randomized Hadamard Transform [14]. The first algorithm appeared recently in [9]; here, we provide a novel…

Gaussian processes (GPs) are nonparametric priors over functions. Fitting a GP implies computing a posterior distribution of functions consistent with the observed data. Similarly, deep Gaussian processes (DGPs) should allow us to compute a…

A new primal-dual weak Galerkin (PD-WG) finite element method was developed and analyzed in this article for first-order linear convection equations in non-divergence form. The PD-WG method results in a symmetric discrete system involving…

This paper is concerned with a rigorous convergence analysis of a fully discrete Lagrangian scheme for the Hele-Shaw flow, which is the fourth order thin-film equation with linear mobility in one space dimension. The discretization is based…

We construct explicitly Pad\'e approximations of the second kind for a special class of G-functions. These are then applied to prove a Baker-type lower bound for linear forms in the p-adic values of these functions. Moreover, we consider…

Diffusion-limited aggregation is consistent with simple scaling. However, strong subdominant terms are present, and these can account for various earlier claims of anomalous scaling. We show this in detail for the case of multiscaling.

We prove upper and lower bounds for certain sums of products of fractional parts by using majoring and minorizing functions from Fourier analysis. In special cases the upper bounds are sharp if there exist counterexamples to the Littlewood…

It is well known that the Lagrangian and Hamiltonian descriptions of field theories are equivalent at the discrete time level when variational integrators are used. Besides the symplectic Hamiltonian structure, many physical systems exhibit…

The linear nonhomogeneous fractional difference system with constant coefficients is introduced. An explicit solution to the system is acquired by proposing a newly discrete retarded perturbation of the nabla Mittag-Leffer-type function…

Federated Averaging (FedAvg), also known as Local SGD, is one of the most popular algorithms in Federated Learning (FL). Despite its simplicity and popularity, the convergence rate of FedAvg has thus far been undetermined. Even under the…

For the fractional Laplacian of variable order, an efficient and accurate numerical evaluation in multi-dimension is a challenge for the nature of a singular integral. We propose a simple and easy-to-implement finite difference scheme for…

We prove quantitative convergence rates at which discrete Langevin-like processes converge to the invariant distribution of a related stochastic differential equation. We study the setup where the additive noise can be non-Gaussian and…

In this work, we present the convergence analysis of one-point large deviations rate functions (LDRFs) of the spatial finite difference method (FDM) for stochastic wave equations with small noise, which is essentially about the asymptotical…

Higher-order tensor methods were recently proposed for minimizing smooth convex and nonconvex functions. Higher-order algorithms accelerate the convergence of the classical first-order methods thanks to the higher-order derivatives used in…

Motivated by big data applications, first-order methods have been extremely popular in recent years. However, naive gradient methods generally converge slowly. Hence, much efforts have been made to accelerate various first-order methods.…

This is a handbook of simple proofs of the convergence of gradient and stochastic gradient descent type methods. We consider functions that are Lipschitz, smooth, convex, strongly convex, and/or Polyak-{\L}ojasiewicz functions. Our focus is…

We consider the setting where the nodes of an undirected, connected network collaborate to solve a shared objective modeled as the sum of smooth functions. We assume that each summand is privately known by a unique node. NEAR-DGD is a…

Several recent empirical studies demonstrate that important machine learning tasks, e.g., training deep neural networks, exhibit low-rank structure, where the loss function varies significantly in only a few directions of the input space.…