297

One-Shot Learning for k-SAT

International Colloquium on Automata, Languages and Programming (ICALP), 2025
Main:15 Pages
Bibliography:4 Pages
Abstract

Consider a kk-SAT formula Φ\Phi where every variable appears at most dd times, and let σ\sigma be a satisfying assignment of Φ\Phi sampled proportionally to eβm(σ)e^{\beta m(\sigma)} where m(σ)m(\sigma) is the number of variables set to true and β\beta is a real parameter. Given Φ\Phi and σ\sigma, can we learn the value of β\beta efficiently?

View on arXiv
Comments on this paper