Search Results for author: Thomas P. Hayes

Found 2 papers, 1 papers with code

Distributed Metropolis Sampler with Optimal Parallelism

no code implementations1 Apr 2019 Weiming Feng, Thomas P. Hayes, Yitong Yin

Furthermore, if a natural Lipschitz condition is satisfied by the Metropolis filters, our algorithm can simulate $N$-step Metropolis chains within $O(N/n+\log n)$ rounds of asynchronous communications, where $n$ is the number of variables.

Block Coordinate Descent for Sparse NMF

1 code implementation15 Jan 2013 Vamsi K. Potluru, Sergey M. Plis, Jonathan Le Roux, Barak A. Pearlmutter, Vince D. Calhoun, Thomas P. Hayes

However, present algorithms designed for optimizing the mixed norm L$_1$/L$_2$ are slow and other formulations for sparse NMF have been proposed such as those based on L$_1$ and L$_0$ norms.

Cannot find the paper you are looking for? You can Submit a new open access paper.