Cautious Monotonicity in Case-Based Reasoning with Abstract Argumentation

• URL: http://arxiv.org/abs/2007.05284v2
• Date: Mon, 13 Jul 2020 07:42:11 GMT
• Title: Cautious Monotonicity in Case-Based Reasoning with Abstract Argumentation
• Abstract summary: We prove that $AAtext -CBR_succeq$ is not cautiously monotonic. We also prove that such variation is equivalent to using $AAtext -CBR_succeq$ with a restricted casebase.
• Score: 10.616061367794385
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recently, abstract argumentation-based models of case-based reasoning ($AA{\text -}CBR$ in short) have been proposed, originally inspired by the legal domain, but also applicable as classifiers in different scenarios, including image classification, sentiment analysis of text, and in predicting the passage of bills in the UK Parliament. However, the formal properties of $AA{\text -}CBR$ as a reasoning system remain largely unexplored. In this paper, we focus on analysing the non-monotonicity properties of a regular version of $AA{\text -}CBR$ (that we call $AA{\text -}CBR_{\succeq}$). Specifically, we prove that $AA{\text -}CBR_{\succeq}$ is not cautiously monotonic, a property frequently considered desirable in the literature of non-monotonic reasoning. We then define a variation of $AA{\text -}CBR_{\succeq}$ which is cautiously monotonic, and provide an algorithm for obtaining it. Further, we prove that such variation is equivalent to using $AA{\text -}CBR_{\succeq}$ with a restricted casebase consisting of all "surprising" cases in the original casebase.

Related papers

• A Mathematical Theory of Value: a synthesis on goal-directed agency under resource constraints [6.057587531186626]
  We show that value, the quantity goal-directed agents create, destroy, and exchange, is a lawful structural quantity in the same category as information.<n>For populations, value is frame-relative while price is frame-independent; a fleet that pools its resource and fuses its perception inherits the ceiling.
  arXiv  Detail & Related papers  (2026-06-10T16:11:04Z)
• ClaimFlow: Tracing the Evolution of Scientific Claims in NLP [67.23189226608389]
  We introduce $texttClaimFlow$, a claim-centric view of the NLP literature.<n>We define a new task $-$ $textitClaim Relation Classification$ $-$ which requires models to infer the scientific stance toward a cited claim.<n>Our analysis reveals that $63.5$% claims are never reused; only $11.1$% are ever challenged.
  arXiv  Detail & Related papers  (2026-03-17T02:43:36Z)
• Intuitionistic $j$-Do-Calculus in Topos Causal Models [1.3295383263113112]
  We generalize Pearl's do-calculus to an Intuitionistic setting called $j$-stable causal inference inside a topos of sheaves.<n>Our framework is an elaboration of the recently proposed framework of Topos Causal Models (TCMs), where causal interventions are defined as subobjects.
  arXiv  Detail & Related papers  (2025-10-20T17:12:17Z)
• Non-representable quantum measures [55.2480439325792]
  Grade-$d$ measures on a $sigma$-algebra $mathcalAsubseteq 2X$ over a set $X$ are generalizations of measures satisfying one of a hierarchy of weak additivity-type conditions.<n>Every signed polymeasure $lambda$ on $(X,mathcalA)d$ produces a grade-$d$ measure as its diagonal $widetildelambda(A):=lambda(A,cdots,A)$.
  arXiv  Detail & Related papers  (2025-08-20T00:47:24Z)
• Simple Convergence Proof of Adam From a Sign-like Descent Perspective [58.89890024903816]
  We show that Adam achieves the optimal rate of $cal O(frac1Ts14)$ rather than the previous $cal O(fracln TTs14)$.<n>Our theoretical analysis provides new insights into the role of momentum as a key factor ensuring convergence.
  arXiv  Detail & Related papers  (2025-07-08T13:19:26Z)
• On the Emergence of Linear Analogies in Word Embeddings [5.440589713820591]
  Models such as Word2Vec and GloVe construct word embeddings based on the co-occurrence probability $P(i,j)$ of words $i$ and $j$ in text corpora.<n>We introduce a theoretical generative model in which words are defined by binary semantic attributes, and co-occurrence probabilities are derived from attribute-based interactions.
  arXiv  Detail & Related papers  (2025-05-24T11:42:26Z)
• QUDsim: Quantifying Discourse Similarities in LLM-Generated Text [70.22275200293964]
  We introduce an abstraction based on linguistic theories in Questions Under Discussion (QUD) and question semantics to help quantify differences in discourse progression. We then use this framework to build $textbfQUDsim$, a similarity metric that can detect discursive parallels between documents. Using QUDsim, we find that LLMs often reuse discourse structures (more so than humans) across samples, even when content differs.
  arXiv  Detail & Related papers  (2025-04-12T23:46:09Z)
• Rational Inference in Formal Concept Analysis [0.4499833362998487]
  Defeasible conditionals are a form of non-monotonic inference. KLM framework defines a semantics for the propositional case of defeasible conditionals.
  arXiv  Detail & Related papers  (2025-04-07T20:15:20Z)
• Taxonomy-Aware Evaluation of Vision-Language Models [48.285819827561625]
  We propose a framework for evaluating unconstrained text predictions, such as those generated from a vision-language model, against a taxonomy. Specifically, we propose the use of hierarchical precision and recall measures to assess the level of correctness and specificity of predictions with regard to a taxonomy.
  arXiv  Detail & Related papers  (2025-04-07T19:46:59Z)
• Towards a Sharp Analysis of Offline Policy Learning for $f$-Divergence-Regularized Contextual Bandits [49.96531901205305]
  We analyze $f$-divergence-regularized offline policy learning.<n>For reverse Kullback-Leibler (KL) divergence, we give the first $tildeO(epsilon-1)$ sample complexity under single-policy concentrability.<n>We extend our analysis to dueling bandits, and we believe these results take a significant step toward a comprehensive understanding of $f$-divergence-regularized policy learning.
  arXiv  Detail & Related papers  (2025-02-09T22:14:45Z)
• On the Structure of Game Provenance and its Applications [1.4064491732635236]
  We study the fine-grain structure of game provenance. We identify seven edge types that give rise to new kinds of provenance, i.e. potential, actual, and primary.
  arXiv  Detail & Related papers  (2024-10-07T14:48:56Z)
• Explicating the Implicit: Argument Detection Beyond Sentence Boundaries [24.728886446551577]
  We reformulate the problem of argument detection through textual entailment to capture semantic relations across sentence boundaries. Our method does not require direct supervision, which is generally absent due to dataset scarcity. We demonstrate it on a recent document-level benchmark, outperforming some supervised methods and contemporary language models.
  arXiv  Detail & Related papers  (2024-08-08T06:18:24Z)
• Testing the Feasibility of Linear Programs with Bandit Feedback [53.40256244941895]
  We develop a test based on low-regret algorithms and a nonasymptotic law of iterated logarithms. We prove that this test is reliable, and adapts to the signal level,' $Gamma,$ of any instance. We complement this by a minimax lower bound $(Omegad/Gamma2)$ for sample costs of reliable tests.
  arXiv  Detail & Related papers  (2024-06-21T20:56:35Z)
• Lasso Bandit with Compatibility Condition on Optimal Arm [10.216425987201333]
  We consider a sparse linear bandit problem where only a sparse subset of context features affects the expected reward function. We propose an algorithm that adapts the forced-sampling technique and prove that the proposed algorithm achieves $O(textpolylog dT)$ regret.
  arXiv  Detail & Related papers  (2024-06-02T18:11:47Z)
• $O_2$ is a multiple context-free grammar: an implementation-, formalisation-friendly proof [0.0]
  Classifying languages according to the expressiveness of grammars able to generate them is a fundamental problem in computational linguistics. This paper analyses the existing proofs from the computational and the proof-theoretical point of views systematically studying whether each proof can lead to a verified (i.e., checked by a proof assistant) algorithm parsing balanced languages via MCFGs.
  arXiv  Detail & Related papers  (2024-05-15T14:51:11Z)
• Machine Reading Comprehension using Case-based Reasoning [92.51061570746077]
  We present an accurate and interpretable method for answer extraction in machine reading comprehension. Our method builds upon the hypothesis that contextualized answers to similar questions share semantic similarities with each other.
  arXiv  Detail & Related papers  (2023-05-24T07:09:56Z)
• Revisiting Weighted Strategy for Non-stationary Parametric Bandits [82.1942459195896]
  This paper revisits the weighted strategy for non-stationary parametric bandits. We propose a refined analysis framework, which produces a simpler weight-based algorithm. Our new framework can be used to improve regret bounds of other parametric bandits.
  arXiv  Detail & Related papers  (2023-03-05T15:11:14Z)
• Monotonicity and Noise-Tolerance in Case-Based Reasoning with Abstract Argumentation (with Appendix) [12.932177565788976]
  We prove that $AAtext - CBR_succeq$ is not cautiously monotonic. We show that this variation of $AAtext - CBR_succeq$ is cumulative, rationally monotonic, and empowers a principled treatment of noise in "incoherent" casebases.
  arXiv  Detail & Related papers  (2021-07-13T22:10:24Z)
• Simplest non-additive measures of quantum resources [77.34726150561087]
  We study measures that can be described by $cal E(rhootimes N) =E(e;N) ne Ne$.
  arXiv  Detail & Related papers  (2021-06-23T20:27:04Z)
• When Hearst Is not Enough: Improving Hypernymy Detection from Corpus with Distributional Models [59.46552488974247]
  This paper addresses whether an is-a relationship exists between words (x, y) with the help of large textual corpora. Recent studies suggest that pattern-based ones are superior, if large-scale Hearst pairs are extracted and fed, with the sparsity of unseen (x, y) pairs relieved. For the first time, this paper quantifies the non-negligible existence of those specific cases. We also demonstrate that distributional methods are ideal to make up for pattern-based ones in such cases.
  arXiv  Detail & Related papers  (2020-10-10T08:34:19Z)
• Stochastic Bandits with Linear Constraints [69.757694218456]
  We study a constrained contextual linear bandit setting, where the goal of the agent is to produce a sequence of policies. We propose an upper-confidence bound algorithm for this problem, called optimistic pessimistic linear bandit (OPLB)
  arXiv  Detail & Related papers  (2020-06-17T22:32:19Z)
• Structured Linear Contextual Bandits: A Sharp and Geometric Smoothed Analysis [48.25118610209545]
  We consider a smoothed setting for structured linear contextual bandits where the adversarial contexts are perturbed by Gaussian noise. We show there is implicit exploration in the smoothed setting where a simple greedy algorithm works.
  arXiv  Detail & Related papers  (2020-02-26T07:29:24Z)

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

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.