Efficient Constrained Graph Search for Post-hoc Error Correction in Binary Classifiers

arXiv:2401.04282 · cs.LG · Submitted 2024-01-08 · Read on arXiv

cs.LG

Submitted: 2024-01-08

Updated: 2026-09-25

Terminology

• Objective Function — 18× in this paper · explained in 2 episodes
• Accuracy — 7× in this paper · explained in 1 episode
• Support Vector Machine — 4× in this paper
• Core — 3× in this paper · explained in 2 episodes
• Generalization — 3× in this paper · explained in 13 episodes

Related papers

• Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
• AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
• Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
• Convergence issues in Relational Concept Analysis based on AOC-posets
• Beliefs Beyond Posteriors: Local-Consistency Optimisation for Bayesian Neural Networks
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks