Related papers: Directed update for the Stochastic Green Function …
We consider the problem of minimizing the average of a large number of smooth but possibly non-convex functions. In the context of most machine learning applications, each loss function is non-negative and thus can be expressed as the…
This paper presents a novel stochastic gradient descent algorithm for constrained optimization. The proposed algorithm randomly samples constraints and components of the finite sum objective function and relies on a relaxed logarithmic…
We propose an efficient algorithm for the ground state of frustration-free one-dimensional gapped Hamiltonians. This algorithm is much simpler than the original one by Landau et al., and thus may be easily accessible to a general audience…
Given a lattice \Gamma in a locally compact group G and a closed subgroup H of G, one has a natural action of \Gamma on the homogeneous space V=H\G. For an increasing family of finite subsets {\Gamma_T: T>0}, a dense orbit v\Gamma, v\in V,…
First-order stochastic methods for solving large-scale non-convex optimization problems are widely used in many big-data applications, e.g. training deep neural networks as well as other complex and potentially non-convex machine learning…
We propose an adaptively weighted stochastic gradient Langevin dynamics algorithm (SGLD), so-called contour stochastic gradient Langevin dynamics (CSGLD), for Bayesian learning in big data statistics. The proposed algorithm is essentially a…
We consider a general one-particle Hamiltonian H = - \Delta_r + u(r) defined in a d-dimensional domain. The object of interest is the time-independent Green function G_z(r,r') = < r | (z-H)^{-1} | r' >. Recently, in one dimension (1D), the…
We propose and apply the finite-element discrete variable representation to express the nonequilibrium Green's function for strongly inhomogeneous quantum systems. This method is highly favorable against a general basis approach with regard…
We introduce "AnnealSGD", a regularized stochastic gradient descent algorithm motivated by an analysis of the energy landscape of a particular class of deep networks with sparse random weights. The loss function of such networks can be…
We introduce a fast algorithm for computing volume potentials - that is, the convolution of a translation invariant, free-space Green's function with a compactly supported source distribution defined on a uniform grid. The algorithm relies…
In this paper we suggest an {\it iterative} algorithm to compute automatically the scattering matrix elements of any given effective lagrangian, $\Gamma$. By exploiting the relation between $\Gamma$ and the connected Green function…
Average atom models are widely used to make equation of state tables and for calculating other properties of materials over a wide range of conditions, from zero temperature isolated atom to fully ionized free electron gases. The numerical…
Modern machine learning is trained by stochastic gradient descent (SGD), whose performance critically depends on how the learning rate (LR) is adjusted and decreased over time. Yet existing LR regimes may be intricate, or need to tune one…
We introduce SMUTF (Schema Matching Using Generative Tags and Hybrid Features), a unique approach for large-scale tabular data schema matching (SM), which assumes that supervised learning does not affect performance in open-domain tasks,…
This paper proposes a symbolic-numeric Bayesian filtering method for a class of discrete-time nonlinear stochastic systems to achieve high accuracy with a relatively small online computational cost. The proposed method is based on the…
In recent years, stochastic variance reduction algorithms have attracted considerable attention for minimizing the average of a large but finite number of loss functions. This paper proposes a novel Riemannian extension of the Euclidean…
We develop a stochastic resolution of identity approach to the real-time second-order Green's function (real-time sRI-GF2) theory, extending our recent work for imaginary-time Matsubara Green's function {\em J. Chem. Phys.} {\bf 151},…
Flexible boundary condition methods couple an isolated defect to bulk through the bulk lattice Green's function. The inversion of the force-constant matrix for the lattice Green's function requires Fourier techniques to project out the…
Using the six parameters truncated Mittag-Leffler function, we introduce a convenient truncated function to define the so-called truncated $\mathcal{V}$-fractional derivative type. After a discussion involving some properties associated…
We study the lattice Green's function (LGF) of the screened Poisson equation on a two-dimensional rectangular lattice. This LGF arises in numerical analysis, random walks, solid-state physics, and other fields. Its defining characteristic…