45 citations · 135 across the 4 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.ET2020★ 45 cited
Efficient Solution of Boolean Satisfiability Problems with Digital MemComputing
S. R. B. Bearden, Y. R. Pei, M. Di Ventra
Boolean satisfiability is a propositional logic problem of interest in multiple fields, e.g., physics, mathematics, and computer science. Beyond a field of research, instances of t…
cs.LG2020★ 32 cited
Mode-Assisted Unsupervised Learning of Restricted Boltzmann Machines
Haik Manukian, Yan Ru Pei, Sean R. B. Bearden +1
Restricted Boltzmann machines (RBMs) are a powerful class of generative models, but their training requires computing a gradient that, unlike supervised backpropagation on typical…