{"title":"35 years of math and AI","authors":"Martin Charles Golumbic","doi":"10.1007/s10472-025-09969-7","DOIUrl":"10.1007/s10472-025-09969-7","url":null,"abstract":"","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"93 1","pages":"1 - 3"},"PeriodicalIF":1.2,"publicationDate":"2025-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143716905","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}
{"title":"Guest editorial: Revised selected papers from the LION 16 conference","authors":"Ilias S. Kotsireas, Panos M. Pardalos","doi":"10.1007/s10472-024-09958-2","DOIUrl":"10.1007/s10472-024-09958-2","url":null,"abstract":"","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"93 1","pages":"19 - 20"},"PeriodicalIF":1.2,"publicationDate":"2025-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143716634","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}
{"title":"Common equivalence and size of forgetting from Horn formulae","authors":"Paolo Liberatore","doi":"10.1007/s10472-024-09955-5","DOIUrl":"10.1007/s10472-024-09955-5","url":null,"abstract":"<div><p>Forgetting variables from a propositional formula may increase its size. Introducing new variables is a way to shorten it. Both operations can be expressed in terms of common equivalence, a weakened version of equivalence. In turn, common equivalence can be expressed in terms of forgetting. An algorithm for forgetting and checking common equivalence in polynomial space is given for the Horn case; it is polynomial-time for the subclass of single-head formulae. Minimizing after forgetting is polynomial-time if the formula is also acyclic and variables cannot be introduced, NP-hard when they can.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"92 6","pages":"1545 - 1584"},"PeriodicalIF":1.2,"publicationDate":"2024-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-024-09955-5.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142870292","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}
{"title":"Time-penalised trees (TpT): introducing a new tree-based data mining algorithm for time-varying covariates","authors":"Mathias Valla","doi":"10.1007/s10472-024-09950-w","DOIUrl":"10.1007/s10472-024-09950-w","url":null,"abstract":"<div><p>This article introduces a new decision tree algorithm that accounts for time-varying covariates in the decision-making process. Traditional decision tree algorithms assume that the covariates are static and do not change over time, which can lead to inaccurate predictions in dynamic environments. Other existing methods suggest workaround solutions such as the pseudo-subject approach, discussed in the article. The proposed algorithm utilises a different structure and a time-penalised splitting criterion that allows a recursive partitioning of both the covariates space and time. Relevant historical trends are then inherently involved in the construction of a tree, and are visible and interpretable once it is fit. This approach allows for innovative and highly interpretable analysis in settings where the covariates are subject to change over time. The effectiveness of the algorithm is demonstrated through a real-world data application in life insurance. The results presented in this article can be seen as an introduction or proof-of-concept of our time-penalised approach, and the algorithm’s theoretical properties and comparison against existing approaches on datasets from various fields, including healthcare, finance, insurance, environmental monitoring, and data mining in general, will be explored in forthcoming work.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"92 6","pages":"1609 - 1661"},"PeriodicalIF":1.2,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142178074","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}
{"title":"Conformal test martingales for hypergraphical models","authors":"Ilia Nouretdinov","doi":"10.1007/s10472-024-09951-9","DOIUrl":"https://doi.org/10.1007/s10472-024-09951-9","url":null,"abstract":"<p>In this work, we study applications of the Conformal Prediction machine learning framework to the questions of statistical data testing. This technique is also known as Conformal Test Martingales. Earlier works on this topic used it to detect deviations from exchangeability assumptions (such as change points). Here we move to test popular hypergraphical models. We adopt and compare two versions of Conformal Testing Martingales. First: testing the data against exchangeability assumption, but using the elements of hypergraphical model for setting its parameters. Second: combining Conformal Testing Martingale with Hypergraphical On-Line Compression Models. The latter is an extension of the Conformal Prediction technique beyond exchangeability.</p><p>We show how these approaches help to accelerate the detection of data deviation from i.i.d. by making use of the knowledge about relations between the features embedded into a hypergraphical model.</p>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"15 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2024-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141884628","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}
{"title":"Costly information providing in binary contests","authors":"Noam Simon, Priel Levy, David Sarne","doi":"10.1007/s10472-024-09953-7","DOIUrl":"10.1007/s10472-024-09953-7","url":null,"abstract":"<div><p>Contests are commonly used as a mechanism for eliciting effort and participation in multi-agent settings. Naturally, and much like with various other mechanisms, the information provided to the agents prior to and throughout the contest fundamentally influences its outcomes. In this paper we study the problem of information providing whenever the contest organizer does not initially hold the information and obtaining it is potentially costly. As the underlying contest mechanism for our model we use the binary contest, where contestants’ strategy is captured by their decision whether or not to participate in the contest in the first place. Here, it is often the case that the contest organizer can proactively obtain and provide contestants information related to their expected performance in the contest. We provide a comprehensive equilibrium analysis of the model, showing that even when such information is costless, it is not necessarily the case that the contest organizer will prefer to obtain and provide it to all agents, let alone when the information is costly.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"92 5","pages":"1353 - 1375"},"PeriodicalIF":1.2,"publicationDate":"2024-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-024-09953-7.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141779355","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}
{"title":"Tumato 2.0 - a constraint-based planning approach for safe and robust robot behavior","authors":"Jan Vermaelen, Tom Holvoet","doi":"10.1007/s10472-024-09949-3","DOIUrl":"https://doi.org/10.1007/s10472-024-09949-3","url":null,"abstract":"<p>Ensuring the safe and effective operation of autonomous systems is a complex undertaking that inherently relies on underlying decision-making processes. To rigorously analyze these processes, formal verification methods, such as model checking, offer a valuable means. However, the non-deterministic nature of realistic environments makes these approaches challenging and often impractical. This work explores the capabilities of a constraint-based planning approach, Tumato, in generating policies that guide the system to predefined goals while adhering to safety constraints. Constraint-based planning approaches are inherently able to provide guarantees of soundness and completeness. Our primary contribution lies in extending Tumato’s capabilities to accommodate non-deterministic outcomes of actions, enhancing the robustness of the behavior. Originally designed to accommodate only deterministic outcomes, actions can now be modeled to include alternative outcomes to address contingencies explicitly. The adapted solver generates policies that enable reaching the goals in a safe manner, even when such alternative outcomes of actions occur. Additionally, we introduce a purely declarative manner for specifying safety in Tumato to further enhance its expressiveness as well as to reduce the susceptibility to errors during specification. The incorporation of cost or duration values to actions enables the solver to restore safety in the most preferred manner when necessary. Finally, we highlight the overlap of Tumato’s safety-related capabilities with a systems-theoretic approach, STPA (Systems-Theoretic Process Analysis). The aim is to emphasize the ability to avoid unsafe control actions without their explicit identification, contributing to a more comprehensive and holistic understanding of safety.</p>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"44 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2024-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141779357","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}
Théo Guilbert, Olivier Caelen, Andrei Chirita, Marco Saerens
{"title":"Calibration methods in imbalanced binary classification","authors":"Théo Guilbert, Olivier Caelen, Andrei Chirita, Marco Saerens","doi":"10.1007/s10472-024-09952-8","DOIUrl":"10.1007/s10472-024-09952-8","url":null,"abstract":"<div><p>The calibration problem in machine learning classification tasks arises when a model’s output score does not align with the ground truth observed probability of the target class. There exist several parametric and non-parametric post-processing methods that can help to calibrate an existing classifier. In this work, we focus on binary classification cases where the dataset is imbalanced, meaning that the negative target class significantly outnumbers the positive one. We propose new parametric calibration methods designed to this specific case and a new calibration measure focusing on the primary objective in imbalanced problems: detecting infrequent positive cases. Experiments on several datasets show that, for imbalanced problems, our approaches outperform state-of-the-art methods in many cases.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"92 5","pages":"1319 - 1352"},"PeriodicalIF":1.2,"publicationDate":"2024-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141745855","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}