Annals of Mathematics and Artificial Intelligence最新文献_第5页

Combinatorial and geometric problems in imaging sciences 成像科学中的组合和几何问题

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2024-01-19 DOI: 10.1007/s10472-024-09923-z

Valentin E. Brimkov

引用次数: 0

Best-effort adaptation 尽力适应

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2024-01-13 DOI: 10.1007/s10472-023-09917-3

Pranjal Awasthi, Corinna Cortes, Mehryar Mohri

引用次数: 0

RAMP experiments in solving the uncapacitated facility location problem 解决无容量设施位置问题的 RAMP 实验

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-12-30 DOI: 10.1007/s10472-023-09920-8

Telmo Matos

{"title":"RAMP experiments in solving the uncapacitated facility location problem","authors":"Telmo Matos","doi":"10.1007/s10472-023-09920-8","DOIUrl":"10.1007/s10472-023-09920-8","url":null,"abstract":"<div><p>In this paper, we consider three Relaxation Adaptive Memory Programming (RAMP) approaches for solving the Uncapacitated Facility Location Problem (UFLP), whose objective is to locate a set of facilities and allocate these facilities to all clients at minimum cost. Different levels of sophistication were implemented to measure the performance of the RAMP approach. In the simpler level, (Dual-) RAMP explores more intensively the dual side of the problem, incorporating a Lagrangean Relaxation and Subgradient Optimization with a simple Improvement Method on the primal side. In the most sophisticated level, RAMP combines a Dual-Ascent procedure on the dual side with a Scatter Search (SS) procedure on primal side, forming the Primal–Dual RAMP (PD-RAMP). The Dual-RAMP algorithm starts with (dual side) the dualization of the initial problem, and then a projection method projects the dual solutions into the primal solutions space. Next, (primal side) the projected solutions are improved through an improvement method. In the PD-RAMP algorithm, the SS procedure is incorporated in the primal side to carry out a more intensive exploration. The algorithm alternates between the dual and the primal side until a fixed number of iterations is achieved. Computational experiments on a standard testbed for the UFLP were conducted to assess the performance of all the RAMP algorithms.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"92 2","pages":"485 - 504"},"PeriodicalIF":1.2,"publicationDate":"2023-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139066200","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Learning from masked analogies between sentences at multiple levels of formality 从多级形式句子之间的掩蔽类比中学习

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-12-26 DOI: 10.1007/s10472-023-09918-2

{"title":"Learning from masked analogies between sentences at multiple levels of formality","authors":"","doi":"10.1007/s10472-023-09918-2","DOIUrl":"https://doi.org/10.1007/s10472-023-09918-2","url":null,"abstract":"<h3>Abstract</h3> <p>This paper explores the inference of sentence analogies not restricted to the formal level. We introduce MaskPrompt, a prompt-based method that addresses the analogy task as masked analogy completion. This enables us to fine-tune, in a lightweight manner, pre-trained language models on the task of reconstructing masked spans in analogy prompts. We apply constraints which are approximations of the parallelogram view of analogy to construct a corpus of sentence analogies from textual entailment sentence pairs. In the constructed corpus, sentence analogies are characterized by their level of being formal, ranging from strict to loose. We apply MaskPrompt on this corpus and compare MaskPrompt with the basic fine-tuning paradigm. Our experiments show that MaskPrompt outperforms basic fine-tuning in solving analogies in terms of overall performance, with gains of over 2% in accuracy. Furthermore, we study the contribution of loose analogies, i.e., analogies relaxed on the formal aspect. When fine-tuning with a small number of them (several hundreds), the accuracy on strict analogies jumps from 82% to 99%. This demonstrates that loose analogies effectively capture implicit but coherent analogical regularities. We also use MaskPrompt with different schemes on masked content to optimize analogy solutions. The best masking scheme during fine-tuning is to mask any term: it exhibits the highest robustness in accuracy on all tested equivalent forms of analogies.</p>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"1 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139051312","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A faster implementation of EQ and SE queries for switch-list representations 更快地实现开关列表表示的 EQ 和 SE 查询

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-12-16 DOI: 10.1007/s10472-023-09915-5

Ondřej Čepek, James Weigle

{"title":"A faster implementation of EQ and SE queries for switch-list representations","authors":"Ondřej Čepek, James Weigle","doi":"10.1007/s10472-023-09915-5","DOIUrl":"10.1007/s10472-023-09915-5","url":null,"abstract":"<div><p>A switch-list representation (SLR) of a Boolean function is a compressed truth table representation of a Boolean function in which only (i) the function value of the first row in the truth table and (ii) a list of switches are stored. A switch is a Boolean vector whose function value differs from the value of the preceding Boolean vector in the truth table. The paper Čepek and Chromý (JAIR 2020) systematically studies the properties of SLRs and among other results gives polynomial-time algorithms for all standard queries investigated in the Knowledge Compilation Map introduced in Darwiche and Marquis (JAIR 2002). These queries include consistency check, validity check, clausal entailment check, implicant check, equivalence check, sentential entailment check, model counting, and model enumeration. The most difficult query supported in polynomial time by the smallest number of representation languages considered in the Knowledge Compilation Map is the sentential entailment check (of which the equivalence check is a special case). This query can be answered in polynomial time for SLRs, as shown in Čepek and Chromý (JAIR 2020). However, the query-answering algorithm is an indirect one: it first compiles both input SLRs into OBDDs (changing the order of variables for one of them if necessary) and then runs the sentential entailment check on the constructed OBDDs (both respecting the same order of variables) using an algorithm from the monograph by Wegener (2000). In this paper we present algorithms that answer both the equivalence and the sentential entailment query directly by manipulating the input SLRs (hence eliminating the compilation step into OBDD), which in both cases improves the time complexity of answering the query by a factor of <i>n</i> for input SLRs on <i>n</i> variables.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"92 5","pages":"1097 - 1112"},"PeriodicalIF":1.2,"publicationDate":"2023-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138680596","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

An abstract view on optimizations in propositional frameworks 关于命题框架优化的抽象观点

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-12-16 DOI: 10.1007/s10472-023-09914-6

Yuliya Lierler

{"title":"An abstract view on optimizations in propositional frameworks","authors":"Yuliya Lierler","doi":"10.1007/s10472-023-09914-6","DOIUrl":"10.1007/s10472-023-09914-6","url":null,"abstract":"<div><p>Search/optimization problems are plentiful in scientific and engineering domains. Artificial intelligence has long contributed to the development of search algorithms and declarative programming languages geared toward solving and modeling search/optimization problems. Automated reasoning and knowledge representation are the subfields of AI that are particularly vested in these developments. Many popular automated reasoning paradigms provide users with languages supporting optimization statements: answer set programming or MaxSAT or <span>min-one</span>, to name a few. These paradigms vary significantly in their languages and in the ways they express quality conditions on computed solutions. Here we propose a unifying framework of so-called weight systems that eliminates syntactic distinctions between paradigms and allows us to see essential similarities and differences between optimization statements provided by paradigms. This unifying outlook has significant simplifying and explanatory potential in the studies of optimization and modularity in automated reasoning and knowledge representation. It also supplies researchers with a convenient tool for proving the formal properties of distinct frameworks; bridging these frameworks; and facilitating the development of translational solvers.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"92 2","pages":"355 - 391"},"PeriodicalIF":1.2,"publicationDate":"2023-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138680461","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Collective combinatorial optimisation as judgment aggregation 作为判断汇总的集体组合优化

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-12-15 DOI: 10.1007/s10472-023-09910-w

Linus Boes, Rachael Colley, Umberto Grandi, Jérôme Lang, Arianna Novaro

{"title":"Collective combinatorial optimisation as judgment aggregation","authors":"Linus Boes, Rachael Colley, Umberto Grandi, Jérôme Lang, Arianna Novaro","doi":"10.1007/s10472-023-09910-w","DOIUrl":"10.1007/s10472-023-09910-w","url":null,"abstract":"<div><p>In many settings, a collective decision has to be made over a set of alternatives that has a combinatorial structure: important examples are multi-winner elections, participatory budgeting, collective scheduling, and collective network design. A further common point of these settings is that agents generally submit preferences over issues (e.g., projects to be funded), each having a cost, and the goal is to find a feasible solution maximising the agents’ satisfaction under problem-specific constraints. We propose the use of judgment aggregation as a unifying framework to model these situations, which we refer to as collective combinatorial optimisation problems. Despite their shared underlying structure, collective combinatorial optimisation problems have so far been studied independently. Our formulation into judgment aggregation connects them, and we identify their shared structure via five case studies of well-known collective combinatorial optimisation problems, proving how popular rules independently defined for each problem actually coincide. We also chart the computational complexity gap that may arise when using a general judgment aggregation framework instead of a specific problem-dependent model.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"92 6","pages":"1437 - 1465"},"PeriodicalIF":1.2,"publicationDate":"2023-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-023-09910-w.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138680597","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Existence and verification of Nash equilibria in non-cooperative contribution games with resource contention 有资源争夺的非合作贡献博弈中纳什均衡的存在与验证

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-12-14 DOI: 10.1007/s10472-023-09905-7

Nicolas Troquard

{"title":"Existence and verification of Nash equilibria in non-cooperative contribution games with resource contention","authors":"Nicolas Troquard","doi":"10.1007/s10472-023-09905-7","DOIUrl":"10.1007/s10472-023-09905-7","url":null,"abstract":"<div><p>In resource contribution games, a class of non-cooperative games, the players want to obtain a bundle of resources and are endowed with bags of bundles of resources that they can make available into a common for all to enjoy. Available resources can then be used towards their private goals. A player is potentially satisfied with a profile of contributed resources when his bundle could be extracted from the contributed resources. Resource contention occurs when the players who are potentially satisfied, cannot actually all obtain their bundle. The player’s preferences are always single-minded (they consider a profile good or they do not) and parsimonious (between two profiles that are equally good, they prefer the profile where they contribute less). What makes a profile of contributed resources good for a player depends on their attitude towards resource contention. We study the problem of deciding whether an outcome is a pure Nash equilibrium for three kinds of players’ attitudes towards resource contention: public contention-aversity, private contention-aversity, and contention-tolerance. In particular, we demonstrate that in the general case when the players are contention-averse, then the problem is harder than when they are contention-tolerant. We then identify a natural class of games where, in presence of contention-averse preferences, it becomes tractable, and where there is always a Nash equilibrium.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"92 2","pages":"317 - 353"},"PeriodicalIF":1.2,"publicationDate":"2023-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-023-09905-7.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139002028","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Theory and algorithms for learning with rejection in binary classification 二元分类中的拒绝学习理论与算法

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-12-13 DOI: 10.1007/s10472-023-09899-2

Corinna Cortes, Giulia DeSalvo, Mehryar Mohri

引用次数: 0

Logic program proportions 逻辑程序比例

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-12-06 DOI: 10.1007/s10472-023-09904-8

Christian Antić

{"title":"Logic program proportions","authors":"Christian Antić","doi":"10.1007/s10472-023-09904-8","DOIUrl":"https://doi.org/10.1007/s10472-023-09904-8","url":null,"abstract":"<p>The purpose of this paper is to present a fresh idea on how symbolic learning might be realized via analogical reasoning. For this, we introduce directed analogical proportions between logic programs of the form “<i>P</i> transforms into <i>Q</i> as <i>R</i> transforms into <i>S</i>” as a mechanism for deriving similar programs by analogy-making. The idea is to instantiate a fragment of a recently introduced abstract algebraic framework of analogical proportions in the domain of logic programming. Technically, we define proportions in terms of modularity where we derive abstract forms of concrete programs from a “known” source domain which can then be instantiated in an “unknown” target domain to obtain analogous programs. To this end, we introduce algebraic operations for syntactic logic program composition and concatenation. Interestingly, our work suggests a close relationship between modularity, generalization, and analogy which we believe should be explored further in the future. In a broader sense, this paper is a further step towards a mathematical theory of logic-based analogical reasoning and learning with potential applications to open AI-problems like commonsense reasoning and computational learning and creativity.</p>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"24 4","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138520497","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6