Fetching the paper…
Reading the bibliography…
The canonical problem of solving a system of linear equations arises in numerous contexts in information theory, communication theory, and related fields.
Y. Weiss, C. Yaniver, and T. Meltzer, “Linear programming relaxations and belief propagation – an empirical study,” in
1907
Earlier work this paper cites.
L. Katz, “A new status index derived from sociometric analysis,” in
1953
Earlier work this paper cites.
G. B. Dantzig and P. Wolfe, “Decomposition principle for linear programs,”
1960
Earlier work this paper cites.
P. Henrici,
1964
Earlier work this paper cites.
A. Viterbi, “Error bounds for convolutional codes and an asymptotically optimum decoding algorithm,”
1967
Earlier work this paper cites.
K. M. Hall, “An r-dimensional quadratic placement algorithm,” in
1970
Earlier work this paper cites.
L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, “Optimal decoding of linear codes for minimizing symbol error rate,”
1974
Earlier work this paper cites.
N. Karmarkar, “A new polynomial-time algorithm for linear programming,” in
1984
Earlier work this paper cites.
N. Z. Shor,
1985
Earlier work this paper cites.
R. J. Vanderbei, M. S. Meketon, and B. A. Freedman, “A modification of Karmarkar’s linear programming algorithm,” in
1986
Earlier work this paper cites.
J. Pearl,
1988
Earlier work this paper cites.
D. P. Bertsekas and J. N. Tsitsiklis,
1989
Earlier work this paper cites.
D. A. Bayer and J. C. Lagarias, “Karmarkar’s linear programming algorithm and newton’s method,” in
1991
Earlier work this paper cites.
O. Axelsson,
1994
Earlier work this paper cites.
S. Puthenpura, L. Sinha, S.-C. Fang, and R. Saigal, “Solving stochastic programming problems via Kalman filter and affine scaling,” in
1995
Earlier work this paper cites.
C. T. Kelley,
1995
Earlier work this paper cites.
G. H. Golub and C. F. V. Loan, Eds.,
1996
Earlier work this paper cites.
Y. Saad, Ed.,
1996
Earlier work this paper cites.
S. Lauritzen, “Graphical models,” in
1996
Earlier work this paper cites.
S. Portnoy and R. Koenker, “The Gaussian Hare and the Laplacian Tortoise: Computability of Squared- Error versus Absolute-Error Estimators,” in
1997
Earlier work this paper cites.
F. Kelly, A. Maulloo, and D. Tan, “Rate control for communication networks: Shadow prices, proportional fairness and stability,”
1997
Earlier work this paper cites.
S. J. Wright,
1997
Earlier work this paper cites.
J. Demmel,
1997
Earlier work this paper cites.
S. Brin and L. Page, “The anatomy of a large-scale hypertextual web search engine,” in
1998
Earlier work this paper cites.
S. Verdú,
1998
Earlier work this paper cites.
C. L. Blake, E. J. Keogh, and C. J. Merz, “UCI repository of machine learning databases, 1998
1998
Earlier work this paper cites.
D. Bertsekas,
1998
Earlier work this paper cites.
M. I. Jordan, Ed.,
1999
Earlier work this paper cites.
K. M. Murphy, Y. Weiss, and M. I. Jordan, “Loopy belief propagation for approximate inference: An empirical study,” in
1999
Earlier work this paper cites.
B. J. Frey, “Local probability propagation for factor analysis,” in
1999
Earlier work this paper cites.
S. Vijayakumar and S. Wu, “Sequential support vector classifiers and regression,” in
1999
Earlier work this paper cites.
T. Joachims, “Making large-scale SVM learning practical,” in
1999
Earlier work this paper cites.
N. Tishby, F. Pereira, and W. Bialek, “The information bottleneck method,” in
1999
Earlier work this paper cites.
S. H. Low and D. E. Lapsley, “Optimization flow control I: Basic algorithms and convergence,”
1999
Earlier work this paper cites.
J. Nocedal and S. J. Wright,
1999
Earlier work this paper cites.
B. J. Frey, “Local probability propagation for factor analysis,” in
1999
Earlier work this paper cites.
P. H. Tan and L. K. Rasmussen, “Linear interference cancellation in CDMA based on iterative techniques for linear equation systems,”
2000
Earlier work this paper cites.
S. M. Aji and R. J. McEliece, “The generalized distributive law,”
2000
Earlier work this paper cites.
J. G. Proakis,
2000
Earlier work this paper cites.
N. Cristianini and J. Shawe-Taylor, “An introduction to support vector machines and other kernel-based learning methods,” in
2000
Earlier work this paper cites.
Y. Weiss and W. T. Freeman, “Correctness of belief propagation in Gaussian graphical models of arbitrary topology,”
2001
Earlier work this paper cites.
A. Grant and C. Schlegel, “Iterative implementations for linear multiuser detectors,”
2001
Cited alongside, same era.
F. Kschischang, B. Frey, and H. A. Loeliger, “Factor graphs and the sum-product algorithm,”
2001
Cited alongside, same era.
Y. Weiss and W. T. Freeman, “On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs,”
2001
Cited alongside, same era.
Y. Weiss and W. T. Freeman, “Correctness of belief propagation in Gaussian graphical models of arbitrary topology,” in
2001
Cited alongside, same era.
W. Bialek, I. Nemenman, and N. Tishby, “Predictability, complexity, and learning,” in
2001
Cited alongside, same era.
A. Yener, R. D. Yates, , and S. Ulukus, “CDMA multiuser detection: A nonlinear programming approach,”
A. Montanari and D. Tse, “Analysis of belief propagation for non-linear problems: The example of CDMA (or: How to prove Tanaka’s formula),” in
2006
Later among the works it cites.
C. C. Wang and D. Guo, “Belief propagation is asymptotically equivalent to MAP detection for sparse linear systems,” in
2006
Later among the works it cites.
L. Zanni, T. Serafini, and G. Zanghirati, “Parallel software for training large scale support vector machines on multiprocessor systems,”
2006
Later among the works it cites.
J. Dems̆ar, “Statistical comparisons of classifiers over multiple data sets,” in
2006
Later among the works it cites.
G. Welch and G. Bishop, “An introduction to the Kalman filter,” Tech. Rep., 2006. [Online]. Available:
2006
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2002
Cited alongside, same era.
B. Schölkopf and A. J. Smola, “Learning with kernels: Support vector machines, regularization, optimization, and beyond.” MIT Press, Cambridge, MA, USA, 2002
2002
Cited alongside, same era.
R. Collobert, S. Bengio, and Y. Bengio, “A parallel mixture of svms for very large scale problems,” in
2002
Cited alongside, same era.
E. B. Sudderth, “Embedded trees: Estimation of Gaussian processes on graphs with cycles,” Master’s thesis, University of California at San Diego, February 2002
2002
Cited alongside, same era.
Y. Koren, “On spectral graph drawing,” in
2003
Cited alongside, same era.
E. Sudderth, A. Ihler, W. Freeman, and A. Willsky, “Nonparametric belief propagation,” in
2003
Cited alongside, same era.
Y. Kabashima, “A CDMA multiuser detection algorithm on the basis of belief propagation,”
2003
Cited alongside, same era.
D. Palomar and M. Chiang, “A tutorial on decomposition methods and distributed network resource allocation,”
2006
Later among the works it cites.
2006
Later among the works it cites.
C. C.Moallemi and B. Van Roy, “Convergence of the min-sum algorithm for convex optimization,” in
2007
Later among the works it cites.
D. Bickson, O. Shental, P. H. Siegel, J. K. Wolf, and D. Dolev, “Linear detection via belief propagation,” in
2007
Later among the works it cites.
D. Bickson, D. Malkhi, and L. Zhou, “Peer to peer rating,” in
2007
Later among the works it cites.
D.Bickson, D. Dolev, and E. Yom-Tov, “Solving large scale kernel ridge regression using a gaussian belief propagation solver,” in
2007
Later among the works it cites.
D. Bickson, D. Dolev, and Y. Weiss, “Resilient peer-to-peer streaming,” in
2007
Later among the works it cites.
D. Bickson and R. Borer, “Bitcode: A bittorrent clone using network coding,” in
2007
Later among the works it cites.
E. Jaffe, D. Bickson, and S. Kirkpatrick, “Everlab - a production platform for research in network experimentation and computation,” in
2007
Later among the works it cites.
J. Schiff, D. Antonelli, A. Dimakis, D. Chu, and M. Wainwright, “Robust message passing for statistical inference in sensor networks,” in
2007
Later among the works it cites.
R. Bell and Y. Koren, “Scalable collaborative filtering with jointly derived neighborhood interpolation weights,” in
2007
Later among the works it cites.
M. DellAmico, “Mapping small worlds,” in
2007
Later among the works it cites.
J. K. Johnson, D. Malioutov, and A. S. Willsky, “Lagrangian relaxation for map estimation in graphical models,” in
2007
Later among the works it cites.
E. Yom-Tov, “A distributed sequential solver for large scale SVMs,” in
2007
Later among the works it cites.
Y. Weiss, C. Yanover, and T. Meltzer, “Map estimation, linear programming and belief propagation with convex free energies,” in
2007
Later among the works it cites.
A. Globerson and T. Jaakkola, “Fixing max-product: Convergent message passing algorithms for MAP LP-relaxations,” in
2007
Later among the works it cites.
M. Chiang, S. H. Low, A. R. Calderbank, and J. C. Doyle, “Layering as optimization decomposition: A mathematical theory of network architectures,”
2007
Later among the works it cites.
A. Zymnis, N. Trichakis, S. Boyd, and D. Oneill, “An interior-point method for large scale network utility maximization,” in
2007
Later among the works it cites.
K. Koh, S.-J. Kim, and S. Boyd, “An interior point method for large-scale
2007
Later among the works it cites.
M. Kočvara and M. Stingl, “On the solution of large-scale SDP problems by the modified barrier method using iterative solvers,”
2007
Later among the works it cites.
O. Shental, D. Bickson, P. H. Siegel, J. K. Wolf, and D. Dolev, “Gaussian belief propagation solver for systems of linear equations,” in
2008
Closest in time.
——, “Gaussian belief propagation for solving systems of linear equations: Theory and application,” in
2008
Closest in time.
——, “A message-passing solver for linear systems,” in
2008
Closest in time.
D. Bickson, O. Shental, P. H. Siegel, J. K. Wolf, and D. Dolev, “Gaussian belief propagation based multiuser detection,” in
2008
Closest in time.
D. Bickson and D. Malkhi, “A unifying framework for rating users and data items in peer-to-peer and social networks,” in
2008
Closest in time.
D. Bickson, D. Dolev, and E. Yom-Tov, “A Gaussian belief propagation solver for large scale Support Vector Machines,” in
2008
Closest in time.
D. Bickson, Y. Tock, O. Shental, and D. Dolev, “Polynomial linear programming with Gaussian belief propagation,” in
2008
Closest in time.
D. Bickson, O. Shental, and D. Dolev, “Distributed kalman filter via Gaussian belief propagation,” in
2008
Closest in time.
T. Anker, D. Bickson, D. Dolev, and B. Hod, “Efficient clustering for improving network performance in wireless sensor networks,” in
2008
Closest in time.
T. Hazan, A. Man, and A. Shashua, “A parallel decomposition solver for SVM: Distributed dual ascent using fenchel duality,” in
2008
Closest in time.
M. Collins, A. Globerson, T. Koo, X. Carreras, and P. Bartlett, “Exponentiated gradient algorithms for conditional random fields and max-margin markov networks,” in
2008
Closest in time.
S. Joshi and S. Boyd, “An efficient method for large-scale gate sizing,”
2008
Closest in time.
——, “An efficient method for large-scale slack allocation,” in
2008
Closest in time.
J. K. Johnson, D. Bickson, and D. Dolev, “Fixing converge of Gaussian belief propagation,” in
2009
Closest in time.
D. Bickson, Y. Tock, A. Zymnis, S. Boyd, and D. Dolev., “Distributed large scale network utility maximization,” in
2009
Closest in time.