Monophonic halfspaces in graphs admit a 2-SAT-based cell decomposition that yields polynomial-time ERM and near-optimal PAC, active, online, and teaching algorithms.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs
Monophonic halfspaces in graphs admit a 2-SAT-based cell decomposition that yields polynomial-time ERM and near-optimal PAC, active, online, and teaching algorithms.