Search Results for author:
Found 4 papers, 0 papers with code
NeuRes: Learning Proofs of Propositional Satisfiability
We introduce NeuRes, a neuro-symbolic proof-based SAT solver.
Breaking the De-Pois Poisoning Defense
In our work, we break this poison-protection layer by replicating the critic model and then performing a composed gradient-sign attack on both the critic and target models simultaneously -- allowing us to bypass the critic firewall to poison the target model.
FLoBC: A Decentralized Blockchain-Based Federated Learning Framework
The rapid expansion of data worldwide invites the need for more distributed solutions in order to apply machine learning on a much wider scale.
On Theoretical Complexity and Boolean Satisfiability
Further, we introduce the two most famous problem complexity classes $\textbf{P}$ and $\textbf{NP}$ along with the relationship between them.
