Related papers: A logical alarm for misaligned binary classifiers

Related papers

GenOS: Compositional Certificates for Semantic Robustness in AI Code Generation [0.0]
GenOS is a probabilistic operational semantics for replacing a prompt, contract, generator, or program.<n>We prove that equivalence-compatible kernels descend to quotient classes and that quotienting commutes with distributional extension and sequential composition.<n>We also establish workflow bi-commit safety under sound validation, total-variation non-expansiveness, and an additive bound.
arXiv Detail & Related papers (2026-08-04T12:42:11Z)
When Rule Violations Are Rare: Chimera Training for Logical Anomaly Detection [56.362776482614976]
We study anomaly detection in a setting where constraints are given as logical rules over learned visual concepts.<n>We propose a neural rule evaluator that compiles each constraint into a directed acyclic graph and learns feature-aware subtree gates.<n>Across CLEVRER, OpenImages, and VidOR, the resulting evaluator improves rule-level anomaly AUROC over independent-events and same-image semantic-training baselines.
arXiv Detail & Related papers (2026-05-25T02:52:36Z)
The Generalized Turing Test: A Foundation for Comparing Intelligence [0.8929189891250133]
We introduce a formal framework for comparing the capabilities of arbitrary agents via indistinguishability.<n>For agents A and B, we define the Turing comparator A $geq$ B to hold if B, acting as a distinguisher, cannot reliably distinguish between interactions with A and another instance of B.<n>This yields a dataset- and task-agnostic notion of relative intelligence.
arXiv Detail & Related papers (2026-05-11T17:00:18Z)
Almost Asymptotically Optimal Active Clustering Through Pairwise Observations [59.20614082241528]
We propose a new analysis framework for clustering $M$ items into an unknown number of $K$ distinct groups using noisy and actively collected responses.<n>We establish a fundamental lower bound on the expected number of queries needed to achieve a desired confidence in the accuracy of the clustering.<n>We develop a computationally feasible variant of the Generalized Likelihood Ratio statistic and show that its performance gap to the lower bound can be accurately empirically estimated.
arXiv Detail & Related papers (2026-02-05T14:16:47Z)
Logical Consistency Between Disagreeing Experts and Its Role in AI Safety [0.0]
Two experts disagree on a test, we may conclude both cannot be 100 per cent correct. But if they completely agree, no possible evaluation can be excluded.<n>This asymmetry in the utility of agreements versus disagreements is explored here by formalizing a logic of unsupervised evaluation for classifiers.
arXiv Detail & Related papers (2025-10-01T12:30:01Z)
The logic of NTQR evaluations of noisy AI agents: Complete postulates and logically consistent error correlations [0.0]
We consider the problem in AI safety of monitoring noisy AI agents in unsupervised settings. We show how some of the postulates have been previously identified in the ML literature but not recognized as such. We demonstrate how the formalism of logical consistency via algebraic postulates of evaluation can help increase the safety of machines using AI algorithms.
arXiv Detail & Related papers (2023-12-08T22:06:44Z)
Streaming algorithms for evaluating noisy judges on unlabeled data -- binary classification [0.0]
We search for nearly error independent trios by using the algebraic failure modes to reject evaluation ensembles as too correlated. The results produced by the surviving ensembles can sometimes be as good as 1%. A Taylor expansion of the estimates produced when independence is assumed but the classifiers are, in fact, slightly correlated helps clarify how the independent evaluator has algebraic blind spots'
arXiv Detail & Related papers (2023-06-02T17:52:59Z)
Predicting the Score of Atomic Candidate OWL Class Axioms [0.0]
axiom scorings are often computationally expensive, which is an issue if you wish to use them in search techniques like level-wise generate-and-test or evolutionary algorithms. We address the problem of developing a predictive model as a substitute for reasoning that predicts the possibility score of candidate class axioms. We show that the approach provided in this work can accurately learn the possibility scores of candidate class axioms and that it can do so for a variety of class axioms.
arXiv Detail & Related papers (2022-12-21T08:30:24Z)
Towards Continuous Consistency Axiom [0.0]
Development of new algorithms in the area of machine learning, especially clustering, requires availability of labeled data sets. We propose an alternative axiomatic system, in which Kleinberg's inner consistency axiom is replaced by a centric consistency axiom. We demonstrate that the new system is satisfiable for a hierarchical version of $k$-means with auto-adjusted $k$, hence it is not contradictory.
arXiv Detail & Related papers (2022-02-12T08:25:01Z)
Unsupervised Full Constituency Parsing with Neighboring Distribution Divergence [48.69930912510414]
We propose an unsupervised and training-free labeling procedure by exploiting the property of a recently introduced metric. For implementation, we develop NDD into Dual POS-NDD and build "molds" to detect constituents and their labels in sentences. We show that DP-NDD not only labels constituents precisely but also inducts more accurate unlabeled constituency trees than all previous unsupervised methods with simpler rules.
arXiv Detail & Related papers (2021-10-29T17:27:34Z)
Logical Credal Networks [87.25387518070411]
This paper introduces Logical Credal Networks, an expressive probabilistic logic that generalizes many prior models that combine logic and probability. We investigate its performance on maximum a posteriori inference tasks, including solving Mastermind games with uncertainty and detecting credit card fraud.
arXiv Detail & Related papers (2021-09-25T00:00:47Z)
Nested Counterfactual Identification from Arbitrary Surrogate Experiments [95.48089725859298]
We study the identification of nested counterfactuals from an arbitrary combination of observations and experiments. Specifically, we prove the counterfactual unnesting theorem (CUT), which allows one to map arbitrary nested counterfactuals to unnested ones.
arXiv Detail & Related papers (2021-07-07T12:51:04Z)
Independence Tests Without Ground Truth for Noisy Learners [0.0]
We discuss the exact solution for independent binary classifiers. Its practical applicability is hampered by its sole remaining assumption. A similar conjecture for the ground truth invariant system for scalar regressors is solvable.
arXiv Detail & Related papers (2020-10-28T13:03:26Z)
Pointwise Binary Classification with Pairwise Confidence Comparisons [97.79518780631457]
We propose pairwise comparison (Pcomp) classification, where we have only pairs of unlabeled data that we know one is more likely to be positive than the other. We link Pcomp classification to noisy-label learning to develop a progressive URE and improve it by imposing consistency regularization.
arXiv Detail & Related papers (2020-10-05T09:23:58Z)
Foundations of Reasoning with Uncertainty via Real-valued Logics [70.43924776071616]
We give a sound and strongly complete axiomatization that can be parametrized to cover essentially every real-valued logic. Our class of sentences are very rich, and each describes a set of possible real values for a collection of formulas of the real-valued logic.
arXiv Detail & Related papers (2020-08-06T02:13:11Z)
L2R2: Leveraging Ranking for Abductive Reasoning [65.40375542988416]
The abductive natural language inference task ($alpha$NLI) is proposed to evaluate the abductive reasoning ability of a learning system. A novel $L2R2$ approach is proposed under the learning-to-rank framework. Experiments on the ART dataset reach the state-of-the-art in the public leaderboard.
arXiv Detail & Related papers (2020-05-22T15:01:23Z)

This list is automatically generated from the titles and abstracts of the papers in this site.