arXiv Machine Learning By Yuanzhuo Zhang

Accelerating Floating-Point Satisfiability Solving via Gradient Normalization

Read the original on arXiv Machine Learning →

GradSAT is a new framework that improves satisfiability solving for Quantifier-Free Floating-Point formulas by treating each SMT clause as an independent multi‑task learning problem. It uses dynamic gradient normalization (GradNorm) to balance gradient magnitudes across clauses, preventing a few difficult clauses from dominating the optimization trajectory. The approach combines a GPU‑accelerated PyTorch backend for continuous relaxation with a precise local search engine, yielding a robust, highly parallelizable solver.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Oct 8

ORACLE: Optimizer-Relative Alignment for Constrained LEarning

The paper introduces ORACLE, a method for constrained learning that evaluates constraint compatibility after the optimizer has taken a step, rather than before. ORACLE performs a joint endpoint linearization of diverse constraint families, constructs an alignment in the optimizer’s geometry, bounds its authority, and commits the adjustment only after validation. Experiments on eight PDE benchmarks with four different optimizers show that ORACLE matches or improves performance in 94% of configurations, outperforming other constraint-handling approaches.

By Utkarsh Grover, Wyatt Mackey, Kaixun Hua, J. Morris Chang, Xiaomin Lin
arXiv AI
Jun 8

A Study of Parallel Continuous Local Search

arXiv:2606. 06656v1 Announce Type: new Abstract: We study parallel Continuous Local Search (CLS) as a solution approach for Boolean satisfiability problems with symmetric pseudo-Boolean (PB) constraints.

By Cody J Christopher, Charles Gretton