paper-with-me

Papers

Lightsolver challenges a leading deep learning solver for Max-2-SAT problems

2023-02-14 · Hod Wirzberger, Assaf Kalinski, Idan Meirzada, Harel Primack, Yaniv Romano, Chene Tradonsky, Ruti Ben Shlomi

Maximum 2-satisfiability (MAX-2-SAT) is a type of combinatorial decision problem that is known to be NP-hard. In this paper, we compare LightSolver's quantum-inspired algorithm to a leading deep-learning solver for the MAX-2-SAT problem. Experiments on benchmark data sets show that LightSolver achieves significantly smaller time-to-optimal-solution compared to a state-of-the-art deep-learning algorithm, where the gain in performance tends to increase with the problem size.

📄 PDF Abstract BibTeX arXiv:2302.06926

Code (1)

RUNCSP/RUN-CSP 공식 구현 tf

Tasks

Deep Learning

Similar Papers 제목 키워드 기반

Learning to Optimize Multigrid PDE Solvers

2019-02-25 · Daniel Greenfeld, Meirav Galun, Ron Kimmel, Irad Yavneh 외

Constructing fast numerical solvers for partial differential equations (PDEs) is crucial for many scientific disciplines. A leading technique for solving large-scale PDEs is using multigrid methods. At the core of a mult…

Learning to Pose Problems: Reasoning-Driven and Solver-Adaptive Data Synthesis

2025-11-13 · Yongxian Wei, Yilin Zhao, Zixuan Hu, Li Shen 외 arxiv

Data synthesis for training large reasoning models offers a scalable alternative to limited, human-curated datasets, enabling the creation of high-quality data. However, existing approaches face several challenges: (i) i…

Quantum Sparse Coding

2022-09-08 · Yaniv Romano, Harel Primack, Talya Vaknin, Idan Meirzada 외

The ultimate goal of any sparse coding method is to accurately recover from a few noisy linear measurements, an unknown sparse vector. Unfortunately, this estimation problem is NP-hard in general, and it is therefore alw…

Multi-Fidelity Delayed Acceptance: hierarchical MCMC sampling for Bayesian inverse problems combining multiple solvers through deep neural networks

2025-12-18 · Filippo Zacchei, Paolo Conti, Attilio Alberto Frangi, Andrea Manzoni arxiv

Inverse uncertainty quantification (UQ) tasks such as parameter estimation are computationally demanding whenever dealing with physics-based models, and typically require repeated evaluations of complex numerical solvers…

Graph Neural Reasoning for 2-Quantified Boolean Formula Solvers

2019-04-27 · Zhanfu Yang, Fei Wang, Ziliang Chen, Guannan Wei 외

In this paper, we investigate the feasibility of learning GNN (Graph Neural Network) based solvers and GNN-based heuristics for specified QBF (Quantified Boolean Formula) problems. We design and evaluate several GNN arch…

Graph Neural Network