4 papers
Reduction of interaction order in hard combinatorial optimization via conditionally independent degrees of freedom
Alexandru Ciobanu, David Dahmen, John Paul Strachan +1
Combinatorial optimization problems have a broad range of applications and map to physical systems with complex dynamics. Among them, the 3-SAT problem is prominent due to its NP-c…
A Poisson Jump-driven SDE Approach to Distributed Gradient Descent with Sparse Communication
Marc Weber, John Paul Strachan, Christian Ebenbauer
To bridge the gap between idealised communication models and the stochastic reality of networked systems, we introduce a framework for embedding asynchronous communication directly…
Nonlocal Monte Carlo via Reinforcement Learning
Dmitrii Dobrynin, Masoud Mohseni, John Paul Strachan
Optimizing or sampling complex cost functions of combinatorial optimization problems is a longstanding challenge across disciplines and applications. When employing family of conve…
Solving Boolean satisfiability problems with resistive content addressable memories
Giacomo Pedretti, Fabian Böhm, Tinish Bhattacharya +15
Solving optimization problems is a highly demanding workload requiring high-performance computing systems. Optimization solvers are usually difficult to parallelize in conventional…