REVIEW 3 cited by
Error Mitigation for Thermodynamic Computing
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
While physics-based computing can offer speed and energy efficiency compared to digital computing, it also is subject to errors that must be mitigated. For example, many error mitigation methods have been proposed for quantum computing. However this error mitigation framework has yet to be applied to other physics-based computing paradigms. In this work, we consider thermodynamic computing, which has recently captured attention due to its relevance to artificial intelligence (AI) applications, such as probabilistic AI and generative AI. A key source of errors in this paradigm is the imprecision of the analog hardware components. Here, we introduce a method that reduces the overall error from a linear to a quadratic dependence (from $\epsilon$ to $\epsilon^2$) on the imprecision $\epsilon$, for Gaussian sampling and linear algebra applications. The method involves sampling from an ensemble of imprecise distributions associated with various rounding events and then merging these samples. We numerically demonstrate the scalability of this method for dimensions greater than 1000. Finally, we implement this method on an actual thermodynamic computer and show $20\%$ error reduction for matrix inversion; the first thermodynamic error mitigation experiment.
Forward citations
Cited by 3 Pith papers
-
Scalable Thermodynamic Second-order Optimization
Thermodynamic computers can accelerate K-FAC training by replacing matrix inversions with physical linear-system solves, yielding quadratic rather than cubic per-layer scaling.
-
Thermodynamic Algorithms for Quadratic Programming
A hybrid digital-thermodynamic interior-point algorithm for quadratic programming is proposed, with simulated support-vector-machine speedups of 10-30x at about 1000 dimensions.
-
Solving the compute crisis with physics-based ASICs
A coalition of academic and industry researchers argues that chips exploiting natural physical dynamics, rather than enforcing digital abstractions, could dramatically cut AI computing costs.
Discussion (0). Continue with ORCID to comment.