Answers are grounded in this paper and cite their sources.
Proposes a new descent algorithm to optimize functions in pseudo-Riemannian spaces, suggesting improvements for Boolean satisfiability problems.
We generalize the convexity inequality “function above tangent” to a class of functions that are convex in a pseudo-Riemannian sense. We propose a new descent algorithm for such functions and provide a regret analysis. Finally, we explain how to apply that method to design a 3-SAT solver based on continuous relaxation.
No takes yet. Share an insight, caveat, or question.
Mastane Achab (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: