Annals of Mathematics and Artificial Intelligence最新文献

Preface for Special issue on Data Science meets Optimization III 《数据科学与最优化》特刊前言III

IF 1.6 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2026-07-03 DOI: 10.1007/s10472-026-10015-3

Yaoxin Wu, Jayanta Mandi, Hoong Chuin Lau, Michele Lombardi, Neil Yorke-Smith, Yingqian Zhang

引用次数: 0

A comparison of the Myerson value and the position value 迈尔森值和位置值的比较

IF 1.6 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2026-05-13 DOI: 10.1007/s10472-026-10011-7

Ayşe Mutlu Derya

{"title":"A comparison of the Myerson value and the position value","authors":"Ayşe Mutlu Derya","doi":"10.1007/s10472-026-10011-7","DOIUrl":"10.1007/s10472-026-10011-7","url":null,"abstract":"<div><p>In the realm of graph-restricted games, the underlying network structure plays a pivotal role, enforcing a key constraint: communication between agents is possible only if a valid path connecting them exists within the network. This constraint strongly shapes the dynamics and strategic considerations, particularly in value allocation settings. The Myerson value and the position value are two prominent allocation rules in such contexts. While classical axiomatic characterizations of these rules often rely on structural assumptions, such as component additivity of the value function or restrictions on the network, these assumptions limit their applicability in general, non-additive environments. We provide new axiomatic characterizations of both values that apply to arbitrary (including non-additive) value functions. Our key axiom specifies how an allocation rule should respond when a source network <i>g</i> and all its supergraphs experience a uniform perturbation <span>(epsilon )</span>, which may represent either an increase or a decrease in value. For the Myerson value, this perturbation is shared equally among the agents with links in <i>g</i> (EDBA). For the position value, it is shared equally among the links in <i>g</i> and then split between their endpoints (EDBL). Combined with a null-game property, each axiom uniquely identifies its respective value. This parallel axiomatization highlights the fundamental contrast between agent-oriented and link-oriented allocation and extends both values beyond previously assumed structural restrictions.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"94 4","pages":"419 - 451"},"PeriodicalIF":1.6,"publicationDate":"2026-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148927610","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

Automated conjecturing with TxGraffiti 自动猜测与TxGraffiti

IF 1.6 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2026-04-14 DOI: 10.1007/s10472-026-10005-5

Randy Davila

{"title":"Automated conjecturing with TxGraffiti","authors":"Randy Davila","doi":"10.1007/s10472-026-10005-5","DOIUrl":"10.1007/s10472-026-10005-5","url":null,"abstract":"<div><p><i>Texas Graffiti</i> (<i>TxGraffiti</i>) is an automated conjecturing system that operates on a finite, versioned <i>snapshot table</i> of mathematical objects equipped with precomputed numerical invariants and Boolean predicates. For a chosen target invariant and hypothesis predicate, <i>TxGraffiti</i> searches over predicate–predictor combinations and generates <i>table-true</i> conditional inequalities by fitting coefficients within simple, human-readable templates (e.g., univariate affine upper and lower bounds) via a sequence of small linear programs. The resulting candidates are ranked and compressed using heuristics that measure informativeness (e.g., touch/sharp behavior) and remove redundancy or transitive implication, producing a compact set of interpretable conjectures suitable for further testing and proof. We describe the system architecture, data curation workflow, optimization models, and filtering procedures, and we provide an interactive web interface together with an open-source Python implementation. Although our examples focus on graph invariants, the snapshot-table paradigm and optimization-and-filtering pipeline apply broadly whenever objects admit computable features and predicates.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"94 4","pages":"453 - 476"},"PeriodicalIF":1.6,"publicationDate":"2026-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148927611","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 prudent logic of partial functions 部分函数的谨慎逻辑

IF 1.6 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2026-03-20 DOI: 10.1007/s10472-025-09999-1

Đorđe Marković, Robbe Van den Eede, Marc Denecker

{"title":"A prudent logic of partial functions","authors":"Đorđe Marković, Robbe Van den Eede, Marc Denecker","doi":"10.1007/s10472-025-09999-1","DOIUrl":"10.1007/s10472-025-09999-1","url":null,"abstract":"<div><p>Partial functions are ubiquitous in Knowledge Representation applications, ranging from practical, e.g., business applications, to more abstract, e.g., mathematical and programming applications. Expressing propositions about partial functions may lead to non/denoting terms. These result in undefinedness errors and ambiguity, causing subtle modeling and reasoning problems. In our approach, formulae are well-defined (<i>true</i> or <i>false</i>) and non/ambiguous in all structures. We develop a base extension of three-valued predicate logic, in which partial function terms are <i>guarded</i> by domain expressions, ensuring the well/definedness property despite the three-valued nature of the underlying logic. This property allows us to define the satisfaction relation of the new logic in terms of the standard two-valued logic of total functions. To tackle the verbosity of this core language, we propose different ways to increase convenience by means of disambiguating annotations and non-commutative connectives. As a practically relevant result, we prove that many different <i>unnesting</i> methods, which eliminate (partial) functions by replacing them with their graph predicates, are equivalence-preserving in the proposed language. Furthermore, we present an extension of the logic with <i>definitions</i> of partial functions and give their semantics in terms of the existing semantics for inductive definitions of sets. Finally, we explore the connection to functional programming.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"94 4","pages":"477 - 519"},"PeriodicalIF":1.6,"publicationDate":"2026-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148927561","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

Non-parametric binary regression in metric spaces with logarithmic loss 具有对数损失的度量空间中的非参数二元回归

IF 1.6 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2026-02-10 DOI: 10.1007/s10472-025-09995-5

Ariel Avital, Klim Efremenko, Aryeh Kontorovich, David Tolpin, Bo Waggoner

{"title":"Non-parametric binary regression in metric spaces with logarithmic loss","authors":"Ariel Avital, Klim Efremenko, Aryeh Kontorovich, David Tolpin, Bo Waggoner","doi":"10.1007/s10472-025-09995-5","DOIUrl":"10.1007/s10472-025-09995-5","url":null,"abstract":"<div><p>In Bernoulli discriminative models, log-likelihood is a natural — and, in a well-defined sense, universal — choice of risk score. In this general setting, we propose a non-parametric variant of binary regression, where the model is regularized to be a Lipschitz function taking a metric space to [0, 1]. Our choice of logarithmic loss corresponds to the log-likelihood risk score. This setting presents novel computational and statistical challenges. On the computational front, we derive an efficient optimization algorithm based on interior point methods (IPM); an attractive feature is that it is parameter-free (that is, does not require tuning an update step size). On the statistical front, the unbounded loss function presents a problem for classic generalization bounds, based on covering-number and Rademacher techniques. Additionally, an impossibility result we prove shows that the unboundedness presents an inherent obstruction to learnability. We get around this challenge via an adaptive truncation approach, and also derive a lower bound indicating that the truncation is, in some sense, necessary. To our knowledge, our approach provides the first rigorous computational and theoretical results in this area. Finally, we present encouraging empirical results.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"94 4","pages":"521 - 547"},"PeriodicalIF":1.6,"publicationDate":"2026-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-025-09995-5.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148927262","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

Universum support vector machines with elastic net loss and RoBoSS loss 优兴支持向量机与弹性净损失和RoBoSS损失

IF 1.6 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2026-01-20 DOI: 10.1007/s10472-025-10002-0

Ping Li

{"title":"Universum support vector machines with elastic net loss and RoBoSS loss","authors":"Ping Li","doi":"10.1007/s10472-025-10002-0","DOIUrl":"10.1007/s10472-025-10002-0","url":null,"abstract":"<div><p>Support vector machine with Universum data (USVM) is an effective algorithm which utilizes the prior information embedded in Universum data to improve its generalization ability. However, the <span>(l_{1})</span>-loss adopted by USVM has an irrationality in geometric definition, which makes it unable to accurately reflect the location information of violated samples, thus degrading the model’s performance to some extent. To address the above limitation, we propose a novel elastic net support vector machine with Universum data (ENUSVM). It adopts the elastic net loss instead of <span>(l_{1})</span>-loss to achieve a one-to-one mapping between the training samples and the slack variables. This improvement makes it more reasonable in geometric definition and thus improves the performance. Further, we derive the violation tolerance upper bound for labeled samples and Universum samples to better interpret the numerical relationship between the distance of violated samples and the slack variables. Experiments on three artificial datasets and twenty benchmark datasets prove that our proposed ENUSVM performs better. Finally, to enhance the robustness of USVM, we incorporate the RoBoSS loss and propose the least squares RoBoSS USVM (<span>( mathcal {L}_{RoBoSS})</span>-USVM). The performance is evaluated on five diverse UCI and KEEL datasets (with and without noise).</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"94 4","pages":"577 - 603"},"PeriodicalIF":1.6,"publicationDate":"2026-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148927704","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

Combinatorial and algorithmic analysis of oriented hierarchies in statistical implicative analysis 统计隐含分析中面向层次的组合与算法分析

IF 1.6 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2026-01-12 DOI: 10.1007/s10472-025-10001-1

Fidy Andrianarivony, Vlady Ravelomanana, Jean-Claude Régnier, Angelo Raherinirina

{"title":"Combinatorial and algorithmic analysis of oriented hierarchies in statistical implicative analysis","authors":"Fidy Andrianarivony, Vlady Ravelomanana, Jean-Claude Régnier, Angelo Raherinirina","doi":"10.1007/s10472-025-10001-1","DOIUrl":"10.1007/s10472-025-10001-1","url":null,"abstract":"<div><p>This paper introduces a novel and more efficient method for constructing oriented hierarchies within the framework of Statistical Implicative Analysis. The primary focus of this study is the computational complexity of the original algorithm proposed by Gras, whose cubic time complexity is established in this work. To address this limitation, a detailed combinatorial analysis of hierarchical structures is performed, leveraging tools from analytic combinatorics. This methodology facilitates the enumeration of the number of possible configurations as a function of input size and enables the investigation of both the depth and width characteristics of the hierarchy’s block structure. This study then proposes a reconstruction algorithm based on a formal correspondence between the statistical implication graph and the oriented hierarchy. The proposed method achieves quadratic worst-case complexity, thereby resulting in a substantial improvement in computational performance. Moreover, the analytic framework also makes it possible to characterise the average-case behaviour of the algorithm. The findings of the comparative computational experiments demonstrate the clear advantage of the proposed method over Gras’s algorithm, both in terms of execution time and overall algorithmic efficiency.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"94 4","pages":"605 - 646"},"PeriodicalIF":1.6,"publicationDate":"2026-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148927711","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 MaxSAT-based framework for computing circumscription 基于maxsat的计算边界框架

IF 1.6 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2026-01-05 DOI: 10.1007/s10472-025-09997-3

Zhongtao Xie, Yisong Wang, Lei Yang, Hongbo Hu

{"title":"A MaxSAT-based framework for computing circumscription","authors":"Zhongtao Xie, Yisong Wang, Lei Yang, Hongbo Hu","doi":"10.1007/s10472-025-09997-3","DOIUrl":"10.1007/s10472-025-09997-3","url":null,"abstract":"<div><p>The circumscription is an elegant non-monotonic logic. However, computing circumscription remains challenging due to its computational complexity. This paper presents a weighted partial Maximum Satisfiability (MaxSAT) encoding approach that addresses circumscription, allowing us to leverage state-of-the-art MaxSAT solvers for efficient computation. This approach introduces a linear-time encoding scheme that captures both parallel and prioritized circumscription without requiring fresh predicates. Furthermore, we develop a systematic model enumeration strategy using blocking clauses, which enables the complete and efficient enumeration of circumscription models while avoiding redundancy. Extensive experiments have been conducted on benchmarks such as model-based circuit diagnostics, random and industrial SAT problems, and extended stable marriage problems. The results indicate that our MaxSAT-based implementation, <span>circ-maxsat</span>, achieves comparable performance with state-of-the-art methods such as <span>circ2dlp</span> and <span>aspino</span>. Notably, <span>circ-maxsat</span> outperforms other solvers on the (extended) stable marriage problem in terms of computational efficiency. This study advances the computation of circumscription and introduces new applications of MaxSAT in non-monotonic reasoning.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"94 4","pages":"549 - 576"},"PeriodicalIF":1.6,"publicationDate":"2026-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148926683","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 novel intrusion detection framework using ensemble learning in MQTT IoT applications 在MQTT物联网应用中使用集成学习的新型入侵检测框架

IF 1.6 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2025-07-16 DOI: 10.1007/s10472-025-09993-7

Mitesh Solanki, Shilpi Gupta

{"title":"A novel intrusion detection framework using ensemble learning in MQTT IoT applications","authors":"Mitesh Solanki, Shilpi Gupta","doi":"10.1007/s10472-025-09993-7","DOIUrl":"10.1007/s10472-025-09993-7","url":null,"abstract":"<div><p>The Internet of Things (IoT) ecosystem increasingly relies on the Message Queuing and Telemetry Transport (MQTT) protocol due to its lightweight and efficient communication capabilities. However, MQTT-enabled networks are vulnerable to various security threats, including eavesdropping, weak authentication, and malicious payload injections. Detecting such intrusions is particularly challenging in IoT environments because of constrained resources, high traffic volumes, and heterogeneous attack vectors. To address these challenges, this study proposes an ensemble learning-based Intrusion Detection System (IDS) specifically designed for MQTT-enabled IoT networks. The ensemble integrates Gaussian Naive Bayes (GNB), Kernel-based Support Vector Machines (K-SVM), and Multi-Layer Perceptrons (MLP) as base classifiers, with Logistic Regression serving as the meta-classifier. Among these, MLP plays a pivotal role by leveraging its deep learning capabilities and parallel processing strengths to capture complex, nonlinear attack patterns that are often missed by conventional models. The combination of diverse classifiers in a stacked architecture significantly enhances the system’s precision, scalability, and adaptability. Experimental evaluation of binary and multi-class classification tasks using the MQTT-IoT-IDS2020 dataset demonstrate that the proposed model achieves outstanding detection accuracies of 99.80% and 99.59%, respectively, outperforming traditional machine learning and standalone deep learning approaches. These results highlighted the effectiveness of the ensemble framework, particularly the critical contribution of MLP, in building a robust, high-performance, and scalable intrusion detection solution for secure IoT communications.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"94 3","pages":"395 - 417"},"PeriodicalIF":1.6,"publicationDate":"2025-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148613088","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

Analysis and optimization of probabilities of beneficial mutation and crossover recombination in a Hamming space 汉明空间中有益突变和交叉重组概率的分析与优化

IF 1 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2025-06-23 DOI: 10.1007/s10472-025-09987-5

Roman V. Belavkin

{"title":"Analysis and optimization of probabilities of beneficial mutation and crossover recombination in a Hamming space","authors":"Roman V. Belavkin","doi":"10.1007/s10472-025-09987-5","DOIUrl":"10.1007/s10472-025-09987-5","url":null,"abstract":"<div><p>Inspired by Fisher’s geometric approach to study beneficial mutations, we analyse probabilities of beneficial mutation and crossover recombination of strings in a general Hamming space with arbitrary finite alphabet. Mutations and recombinations that reduce the distance to an optimum are considered as beneficial. Geometric and combinatorial analysis is used to derive closed-form expressions for transition probabilities between spheres around an optimum giving a complete description of Markov evolution of distances from an optimum over multiple generations. This paves the way for optimization of parameters of mutation and recombination operators. Here we derive optimality conditions for mutation and recombination radii maximizing the probabilities of mutation and crossover into the optimum. The analysis highlights important differences between these evolutionary operators. While mutation can potentially reach any part of the search space, the probability of beneficial mutation decreases with distance to an optimum, and the optimal mutation radius or rate should also decrease resulting in a slow-down of evolution near the optimum. Crossover recombination, on the other hand, acts in a subspace of the search space defined by the current population of strings. However, probabilities of beneficial and deleterious crossover are balanced, and their characteristics, such as variance, are translation invariant in a Hamming space, suggesting that recombination may complement mutation and boost the rate of evolution near the optimum.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"94 1","pages":"127 - 161"},"PeriodicalIF":1.0,"publicationDate":"2025-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-025-09987-5.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146082839","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