no code implementations • 9 Aug 2014 • Yucheng Low, Joseph E. Gonzalez, Aapo Kyrola, Danny Bickson, Carlos E. Guestrin, Joseph Hellerstein
Designing and implementing efficient, provably correct parallel machine learning (ML) algorithms is challenging.
no code implementations • NeurIPS 2010 • Danny Bickson, Carlos Guestrin
Using stable distributions, a heavy-tailed family of distributions which is a generalization of Cauchy, L\'evy and Gaussian distributions, we show for the first time, how to compute both exact and approximate inference in such a linear multivariate graphical model.
2 code implementations • 25 Jun 2010 • Yucheng Low, Joseph Gonzalez, Aapo Kyrola, Danny Bickson, Carlos Guestrin, Joseph M. Hellerstein
Designing and implementing efficient, provably correct parallel machine learning (ML) algorithms is challenging.
no code implementations • 14 Aug 2009 • Danny Bickson, Dror Baron, Alex T. Ihler, Harel Avissar, Danny Dolev
We consider the problem of identifying a pattern of faults from a set of noisy linear measurements.
Information Theory Information Theory
no code implementations • 6 Jul 2009 • Danny Bickson, Danny Dolev
We propose a new distributed algorithm for computing a truncated Newton method, where the main diagonal of the Hessian is computed using belief propagation.
Information Theory Information Theory
no code implementations • 27 Jan 2009 • Jason K. Johnson, Danny Bickson, Danny Dolev
It is known that when GaBP converges it converges to the correct MAP estimate of the Gaussian random vector and simple sufficient conditions for its convergence have been established.
no code implementations • 21 Jan 2009 • Danny Bickson, Alexander T. Ihler, Danny Dolev
We show that the LDLC decoder is an instance of non-parametric belief propagation and further connect it to the Gaussian belief propagation algorithm.
Information Theory Information Theory
no code implementations • 18 Jan 2009 • Danny Bickson, Yoav Tock, Argyris Zymnis, Stephen Boyd, Danny Dolev
Using an empirical evaluation we show that our new method outperforms previous approaches, including the truncated Newton method and dual-decomposition methods.
Information Theory Distributed, Parallel, and Cluster Computing Information Theory Optimization and Control
no code implementations • 9 Oct 2008 • Danny Bickson, Yoav Tock, Ori Shental, Danny Dolev
Karmarkar's celebrated algorithm is known to be an instance of the log-barrier method using the Newton iteration.
Information Theory Information Theory E.5