From User Preferences to Base Score Extraction Functions in Gradual Argumentation (with Appendix)

• URL: http://arxiv.org/abs/2602.14674v3
• Date: Mon, 23 Feb 2026 14:16:18 GMT
• Title: From User Preferences to Base Score Extraction Functions in Gradual Argumentation (with Appendix)
• Authors: Aniol Civit, Antonio Rago, Antonio Andriella, Guillem Alenyà, Francesca Toni,
• Abstract summary: We introduce emphBase Score Extraction Functions, which provide a mapping from users' preferences over arguments to base scores.<n>These functions can be applied to the arguments of a emphBipolar Argumentation Framework (BAF), supplemented with preferences, to obtain a emphQuantitative Bipolar Argumentation Framework (QBAF)<n>We outline the desirable properties of base score extraction functions, discuss some design choices, and provide an algorithm for base score extraction.
• Score: 23.55780650344801
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Gradual argumentation is a field of symbolic AI which is attracting attention for its ability to support transparent and contestable AI systems. It is considered a useful tool in domains such as decision-making, recommendation, debate analysis, and others. The outcomes in such domains are usually dependent on the arguments' base scores, which must be selected carefully. Often, this selection process requires user expertise and may not always be straightforward. On the other hand, organising the arguments by preference could simplify the task. In this work, we introduce \emph{Base Score Extraction Functions}, which provide a mapping from users' preferences over arguments to base scores. These functions can be applied to the arguments of a \emph{Bipolar Argumentation Framework} (BAF), supplemented with preferences, to obtain a \emph{Quantitative Bipolar Argumentation Framework} (QBAF), allowing the use of well-established computational tools in gradual argumentation. We outline the desirable properties of base score extraction functions, discuss some design choices, and provide an algorithm for base score extraction. Our method incorporates an approximation of non-linearities in human preferences to allow for better approximation of the real ones. Finally, we evaluate our approach both theoretically and experimentally in a robotics setting, and offer recommendations for selecting appropriate gradual semantics in practice.

Related papers

• Multi-User Personalisation in Human-Robot Interaction: Using Quantitative Bipolar Argumentation Frameworks for Preferences Conflict Resolution [7.448890820711756]
  We propose a novel multi-user personalisation framework based on Quantitative Bipolar Argumentation Frameworks (QBAFs)<n>Unlike prior work in Argumentation Frameworks, our approach is tailored to robotics.<n>It incorporates both users' arguments and the robot's dynamic observations of the environment.
  arXiv  Detail & Related papers  (2025-11-05T15:59:30Z)
• Reasoning Planning for Language Models [23.519351730129426]
  We introduce EPIC, an Ensemble Planning with Contrastive learning framework.<n>EPIC learns a shared representation space that captures both model reasoning abilities and query-method compatibility.<n> Experiments on diverse mathematical reasoning tasks show that EPIC consistently selects optimal reasoning methods.
  arXiv  Detail & Related papers  (2025-11-01T11:51:53Z)
• Hyperparameter Optimization via Interacting with Probabilistic Circuits [20.128718882698593]
  We develop a novel selection policy that enables an acquisition function-free generation of candidate points.<n>We demonstrate that our method achieves state-of-the-art performance in standard HPO and outperforms interactive BO baselines in interactive HPO.
  arXiv  Detail & Related papers  (2025-05-23T12:21:19Z)
• ReasonAgain: Using Extractable Symbolic Programs to Evaluate Mathematical Reasoning [54.70811660561151]
  Existing math datasets evaluate the reasoning abilities of large language models (LLMs) by either using the final answer or the intermediate reasoning steps derived from static examples. We seek to use symbolic programs as a means for automated evaluation if a model can consistently produce correct final answers across various inputs to the program. We observe significant accuracy drops using our proposed evaluation compared with original static examples, suggesting the fragility of math reasoning in state-of-the-art LLMs.
  arXiv  Detail & Related papers  (2024-10-24T18:02:37Z)
• Optimal Kernel Choice for Score Function-based Causal Discovery [92.65034439889872]
  We propose a kernel selection method within the generalized score function that automatically selects the optimal kernel that best fits the data. We conduct experiments on both synthetic data and real-world benchmarks, and the results demonstrate that our proposed method outperforms kernel selection methods.
  arXiv  Detail & Related papers  (2024-07-14T09:32:20Z)
• Adaptive Preference Scaling for Reinforcement Learning with Human Feedback [103.36048042664768]
  Reinforcement learning from human feedback (RLHF) is a prevalent approach to align AI systems with human values. We propose a novel adaptive preference loss, underpinned by distributionally robust optimization (DRO) Our method is versatile and can be readily adapted to various preference optimization frameworks.
  arXiv  Detail & Related papers  (2024-06-04T20:33:22Z)
• An Extension-based Approach for Computing and Verifying Preferences in Abstract Argumentation [1.7065454553786665]
  We present an extension-based approach for computing and verifying preferences in an abstract argumentation system. We show that the complexity of computing sets of preferences is exponential in the number of arguments. We present novel algorithms for verifying (i.e., assessing) the computed preferences.
  arXiv  Detail & Related papers  (2024-03-26T12:36:11Z)
• Experience in Engineering Complex Systems: Active Preference Learning with Multiple Outcomes and Certainty Levels [1.5257326975704795]
  Black-box optimization refers to the problem whose objective function and/or constraint sets are either unknown, inaccessible, or non-existent. The algorithm so-called Active Preference Learning has been developed to exploit this specific information. Our approach aims to extend the algorithm in such a way that can exploit further information effectively.
  arXiv  Detail & Related papers  (2023-02-27T15:55:37Z)
• Meta-Wrapper: Differentiable Wrapping Operator for User Interest Selection in CTR Prediction [97.99938802797377]
  Click-through rate (CTR) prediction, whose goal is to predict the probability of the user to click on an item, has become increasingly significant in recommender systems. Recent deep learning models with the ability to automatically extract the user interest from his/her behaviors have achieved great success. We propose a novel approach under the framework of the wrapper method, which is named Meta-Wrapper.
  arXiv  Detail & Related papers  (2022-06-28T03:28:15Z)
• Surrogate modeling for Bayesian optimization beyond a single Gaussian process [62.294228304646516]
  We propose a novel Bayesian surrogate model to balance exploration with exploitation of the search space. To endow function sampling with scalability, random feature-based kernel approximation is leveraged per GP model. To further establish convergence of the proposed EGP-TS to the global optimum, analysis is conducted based on the notion of Bayesian regret.
  arXiv  Detail & Related papers  (2022-05-27T16:43:10Z)
• Personalized Algorithmic Recourse with Preference Elicitation [20.78332455864586]
  We introduce PEAR, the first human-in-the-loop approach capable of providing personalized algorithmic recourse tailored to the needs of any end-user. PEAR builds on insights from Bayesian Preference Elicitation to iteratively refine an estimate of the costs of actions by asking choice set queries to the target user. Our empirical evaluation on real-world datasets highlights how PEAR produces high-quality personalized recourse in only a handful of iterations.
  arXiv  Detail & Related papers  (2022-05-27T03:12:18Z)
• B-Pref: Benchmarking Preference-Based Reinforcement Learning [84.41494283081326]
  We introduce B-Pref, a benchmark specially designed for preference-based RL. A key challenge with such a benchmark is providing the ability to evaluate candidate algorithms quickly. B-Pref alleviates this by simulating teachers with a wide array of irrationalities.
  arXiv  Detail & Related papers  (2021-11-04T17:32:06Z)

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.