17 citations · 29 across the 8 of their papers we have counts for
9 papers
Solving sparse linear systems with approximate inverse preconditioners on analog devices
Vasileios Kalantzis, Anshul Gupta, Lior Horesh +3
Sparse linear system solvers are computationally expensive kernels that lie at the heart of numerous applications. This paper proposes a flexible preconditioning framework to subst…
HMC, an Algorithms in Data Mining, the Functional Analysis approach
Soumyadip Ghosh, Yingdong Lu, Tomasz Nowicki
The main purpose of this paper is to facilitate the communication between the Analytic, Probabilistic and Algorithmic communities. We present a proof of convergence of the Hamilton…
On Convergence of the Hamiltonian Monte Carlo
Soumyadip Ghosh, Yingdong Lu, Tomasz Nowicki
We establish convergence for Hamiltonian Monte Carlo algorithms. More specifically, under mild conditions for the associated Hamiltonian motion, we show that the outputs of t…
Approximation Algorithms for the Joint Replenishment Problem with Deadlines
Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak +5
The Joint Replenishment Problem (JRP) is a fundamental optimization problem in supply-chain management, concerned with optimizing the flow of goods from a supplier to retailers. Ov…
Dynamics of exponential linear map in functional space
David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz
We consider the question of existence of a unique invariant probability distribution which satisfies some evolutionary property. The problem arises from the random graph theory but…
Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results using the Local Weak Convergence Method
David Gamarnik, Tomasz Nowicki, Grzegorz Swirscsz
Let and be an -node sparse random graph and a sparse random -regular graph, respectively, and let and be the sizes of the…