<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Leveraging Machine Learning to Alleviate Hubbard Model Sign Problems · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2006.11221/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2006.11221/feed.xml" rel="self" type="application/rss+xml" /><item><title>Leveraging Machine Learning to Alleviate Hubbard Model Sign Problems — mentioned by evanb</title><link>https://news.ycombinator.com/item?id=30226324</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.11221:30226324</guid><pubDate>Sat, 05 Feb 2022 21:30:59 GMT</pubDate><description>&lt;p&gt;When my collaborators and I published our LQCD computation of the nucleon axial coupling I wrote this http://evanberkowitz.com/2018/05/30/gA.html though I did not get into the technical details of gauge invariance. We can use neural networks in some steps but not in others. The main use seems to be in the generation of gauge configurations (states of the Markov chains we use). We can use neural networks there because we alway do our Metropolis-Hastings accept/reject step according to the ‘true’ action, which corrects any numerical errors introduced by the ML approximation. There are different…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.11221/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cond-mat.str-el</category></item></channel></rss>
