发布求助
文献互助 智能选刊 最新文献

International Joint Conference on Artificial Intelligence最新文献

筛选
英文 中文
Argumentation for Interactive Causal Discovery 交互式因果发现论证
International Joint Conference on Artificial Intelligence Pub Date : 2023-08-01 DOI: 10.24963/ijcai.2023/820
Fabrizio Russo
{"title":"Argumentation for Interactive Causal Discovery","authors":"Fabrizio Russo","doi":"10.24963/ijcai.2023/820","DOIUrl":"https://doi.org/10.24963/ijcai.2023/820","url":null,"abstract":"Causal reasoning reflects how humans perceive events in the world and establish relationships among them, identifying some as causes and others as effects. Causal discovery is about agreeing on these relationships and drawing them as a causal graph.\u0000\u0000Argumentation is the way humans reason systematically about an idea: the medium we use to exchange opinions, to get to know and trust each other and possibly agree on controversial matters.\u0000\u0000Developing AI which can argue with humans about causality would allow us to understand and validate the analysis of the AI and would allow the AI to bring evidence for or against humans' prior knowledge.\u0000\u0000This is the goal of this project: to develop a novel scientific paradigm of interactive causal discovery and train AI to recognise causes and effects by debating, with humans, the results of different statistical methods","PeriodicalId":394530,"journal":{"name":"International Joint Conference on Artificial Intelligence","volume":"44 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115383308","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Unifying Core-Guided and Implicit Hitting Set Based Optimization 统一基于核引导和隐式命中集的优化
International Joint Conference on Artificial Intelligence Pub Date : 2023-08-01 DOI: 10.24963/ijcai.2023/215
Hannes Ihalainen, J. Berg, M. Järvisalo
{"title":"Unifying Core-Guided and Implicit Hitting Set Based Optimization","authors":"Hannes Ihalainen, J. Berg, M. Järvisalo","doi":"10.24963/ijcai.2023/215","DOIUrl":"https://doi.org/10.24963/ijcai.2023/215","url":null,"abstract":"Two of the most central algorithmic paradigms implemented in practical solvers for maximum satisfiability (MaxSAT) and other related declarative paradigms for NP-hard combinatorial optimization are the core-guided (CG) and implicit hitting set (IHS) approaches. We develop a general unifying algorithmic framework, based on the recent notion of abstract cores, that captures both CG and IHS computations. The framework offers a unified way of establishing the correctness of variants of the approaches, and can be instantiated in novel ways giving rise to new algorithmic variants of the core-guided and IHS approaches. We illustrate the latter aspect by developing a prototype implementation of an algorithm variant for MaxSAT based on the framework.","PeriodicalId":394530,"journal":{"name":"International Joint Conference on Artificial Intelligence","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123059976","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Black-box Prompt Tuning for Vision-Language Model as a Service 视觉语言模型即服务的黑盒提示调优
International Joint Conference on Artificial Intelligence Pub Date : 2023-08-01 DOI: 10.24963/ijcai.2023/187
Lang-Chi Yu, Qin Chen, Jiaju Lin, Liang He
{"title":"Black-box Prompt Tuning for Vision-Language Model as a Service","authors":"Lang-Chi Yu, Qin Chen, Jiaju Lin, Liang He","doi":"10.24963/ijcai.2023/187","DOIUrl":"https://doi.org/10.24963/ijcai.2023/187","url":null,"abstract":"In the scenario of Model-as-a-Service (MaaS), pre-trained models are usually released as inference APIs. Users are allowed to query those models with manually crafted prompts. Without accessing the network structure and gradient information, it's tricky to perform continuous prompt tuning on MaaS, especially for vision-language models (VLMs) considering cross-modal interaction. In this paper, we propose a black-box prompt tuning framework for VLMs to learn task-relevant prompts without back-propagation. In particular, the vision and language prompts are jointly optimized in the intrinsic parameter subspace with various evolution strategies. Different prompt variants are also explored to enhance the cross-model interaction. Experimental results show that our proposed black-box prompt tuning framework outperforms both hand-crafted prompt engineering and gradient-based prompt learning methods, which serves as evidence of its capability to train task-relevant prompts in a derivative-free manner.","PeriodicalId":394530,"journal":{"name":"International Joint Conference on Artificial Intelligence","volume":"160 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116666825","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Efficient Sign Language Translation with a Curriculum-based Non-autoregressive Decoder 基于课程的非自回归解码器的高效手语翻译
International Joint Conference on Artificial Intelligence Pub Date : 2023-08-01 DOI: 10.24963/ijcai.2023/584
Pei-Ju Yu, Liang Zhang, Biao Fu, Yidong Chen
{"title":"Efficient Sign Language Translation with a Curriculum-based Non-autoregressive Decoder","authors":"Pei-Ju Yu, Liang Zhang, Biao Fu, Yidong Chen","doi":"10.24963/ijcai.2023/584","DOIUrl":"https://doi.org/10.24963/ijcai.2023/584","url":null,"abstract":"Most existing studies on Sign Language Translation (SLT) employ AutoRegressive Decoding Mechanism (AR-DM) to generate target sentences. However, the main disadvantage of the AR-DM is high inference latency. To address this problem, we introduce Non-AutoRegressive Decoding Mechanism (NAR-DM) into SLT, which generates the whole sentence at once. Meanwhile, to improve its decoding ability, we integrate the advantages of curriculum learning and NAR-DM and propose a Curriculum-based NAR Decoder (CND). Specifically, the lower layers of the CND are expected to predict simple tokens that could be predicted correctly using source-side information solely. Meanwhile, the upper layers could predict complex tokens based on the lower layers' predictions. Therefore, our CND significantly reduces the model's inference latency while maintaining its competitive performance. Moreover, to further boost the performance of our CND, we propose a mutual learning framework, containing two decoders, i.e., an AR decoder and our CND. We jointly train the two decoders and minimize the KL divergence between their outputs, which enables our CND to learn the forward sequential knowledge from the strengthened AR decoder. Experimental results on PHOENIX2014T and CSL-Daily demonstrate that our model consistently outperforms all competitive baselines and achieves 7.92/8.02× speed-up compared to the AR SLT model respectively. Our source code is available at https://github.com/yp20000921/CND.","PeriodicalId":394530,"journal":{"name":"International Joint Conference on Artificial Intelligence","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116998409","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
CTW: Confident Time-Warping for Time-Series Label-Noise Learning 时间序列标签噪声学习的自信时间翘曲
International Joint Conference on Artificial Intelligence Pub Date : 2023-08-01 DOI: 10.24963/ijcai.2023/450
Peitian Ma, Zhen Liu, Junhao Zheng, Linghao Wang, Qianli Ma
{"title":"CTW: Confident Time-Warping for Time-Series Label-Noise Learning","authors":"Peitian Ma, Zhen Liu, Junhao Zheng, Linghao Wang, Qianli Ma","doi":"10.24963/ijcai.2023/450","DOIUrl":"https://doi.org/10.24963/ijcai.2023/450","url":null,"abstract":"Noisy labels seriously degrade the generalization ability of Deep Neural Networks (DNNs) in various classification tasks. Existing studies on label-noise learning mainly focus on computer vision, while time series also suffer from the same issue. Directly applying the methods from computer vision to time series may reduce the temporal dependency due to different data characteristics. How to make use of the properties of time series to enable DNNs to learn robust representations in the presence of noisy labels has not been fully explored. To this end, this paper proposes a method that expands the distribution of Confident instances by Time-Warping (CTW) to learn robust representations of time series. Specifically, since applying the augmentation method to all data may introduce extra mislabeled data, we select confident instances to implement Time-Warping. In addition, we normalize the distribution of the training loss of each class to eliminate the model's selection preference for instances of different classes, alleviating the class imbalance caused by sample selection. Extensive experimental results show that CTW achieves state-of-the-art performance on the UCR datasets when dealing with different types of noise. Besides, the t-SNE visualization of our method verifies that augmenting confident data improves the generalization ability. Our code is available at https://github.com/qianlima-lab/CTW.","PeriodicalId":394530,"journal":{"name":"International Joint Conference on Artificial Intelligence","volume":"38 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120909203","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Efficient Object Search in Game Maps 游戏地图中的有效对象搜索
International Joint Conference on Artificial Intelligence Pub Date : 2023-08-01 DOI: 10.24963/ijcai.2023/618
Jinchun Du, Bojie Shen, Shizhe Zhao, M. A. Cheema, A. Toosi
{"title":"Efficient Object Search in Game Maps","authors":"Jinchun Du, Bojie Shen, Shizhe Zhao, M. A. Cheema, A. Toosi","doi":"10.24963/ijcai.2023/618","DOIUrl":"https://doi.org/10.24963/ijcai.2023/618","url":null,"abstract":"Video games feature a dynamic environment where locations of objects (e.g., characters, equipment, weapons, vehicles etc.) frequently change within the game world. Although searching for relevant nearby objects in such a dynamic setting is a fundamental operation, this problem has received little research attention. In this paper, we propose a simple lightweight index, called Grid Tree, to store objects and their associated textual data. Our index can be efficiently updated with the underlying updates such as object movements, and supports a variety of object search queries, including k nearest neighbors (returning the k closest objects), keyword k nearest neighbors (returning the k closest objects that satisfy query keywords), and several other variants. Our extensive experimental study, conducted on standard game maps benchmarks and real-world keywords, demonstrates that our approach has up to 2 orders of magnitude faster update times for moving objects compared to state-of-the-art approaches such as navigation mesh and IR-tree. At the same time, query performance of our approach is similar to or better than that of IR-tree and up to two orders of magnitude faster than the other competitor.","PeriodicalId":394530,"journal":{"name":"International Joint Conference on Artificial Intelligence","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121321427","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Toward Job Recommendation for All 面向所有人的工作推荐
International Joint Conference on Artificial Intelligence Pub Date : 2023-08-01 DOI: 10.24963/ijcai.2023/655
Guillaume Bied, Solal Nathan, Elia Perennes, Morgane Hoffmann, Philippe Caillou, Bruno Crépon, C. Gaillac, M. Sebag
{"title":"Toward Job Recommendation for All","authors":"Guillaume Bied, Solal Nathan, Elia Perennes, Morgane Hoffmann, Philippe Caillou, Bruno Crépon, C. Gaillac, M. Sebag","doi":"10.24963/ijcai.2023/655","DOIUrl":"https://doi.org/10.24963/ijcai.2023/655","url":null,"abstract":"This paper presents a job recommendation algorithm designed and validated in the context of the French Public Employment Service. The challenges, owing to the confidential data policy, are related with the extreme sparsity of the interaction matrix and the mandatory scalability of the algorithm, aimed to deliver recommendations to millions of job seekers in quasi real-time, considering hundreds of thousands of job ads. The experimental validation of the approach shows similar or better performances than the state of the art in terms of recall, with a gain in inference time of 2 orders of magnitude. The study includes some fairness analysis of the recommendation algorithm. The gender-related gap is shown to be statistically similar in the true data and in the counter-factual data built from the recommendations.","PeriodicalId":394530,"journal":{"name":"International Joint Conference on Artificial Intelligence","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124840159","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Targeting Minimal Rare Itemsets from Transaction Databases 目标从事务数据库的最小稀有物品集
International Joint Conference on Artificial Intelligence Pub Date : 2023-08-01 DOI: 10.24963/ijcai.2023/235
Amel Hidouri, Badran Raddaoui, Saïd Jabbour
{"title":"Targeting Minimal Rare Itemsets from Transaction Databases","authors":"Amel Hidouri, Badran Raddaoui, Saïd Jabbour","doi":"10.24963/ijcai.2023/235","DOIUrl":"https://doi.org/10.24963/ijcai.2023/235","url":null,"abstract":"The computation of minimal rare itemsets is a well known task in data mining, with numerous applications, e.g., drugs effects analysis and network security, among others. This paper presents a novel approach to the computation of minimal rare itemsets. First, we introduce a generalization of the traditional minimal rare itemset model called k-minimal rare itemset. A k-minimal rare itemset is defined as an itemset that becomes frequent or rare based on the removal of at least k or at most (k − 1) items from it. We claim that our work is the first to propose this generalization in the field of data mining. We then present a SAT-based framework for efficiently discovering k-minimal rare itemsets from large transaction databases. Afterwards, by partitioning the k-minimal rare itemset mining problem into smaller sub-problems, we aim to make it more manageable and easier to solve. Finally, to evaluate the effectiveness and efficiency of our approach, we conduct extensive experimental analysis using various popular datasets. We compare our method with existing specialized algorithms and CP-based algorithms commonly used for this task.","PeriodicalId":394530,"journal":{"name":"International Joint Conference on Artificial Intelligence","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124869585","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On Translations between ML Models for XAI Purposes 用于XAI目的的ML模型之间的翻译
International Joint Conference on Artificial Intelligence Pub Date : 2023-08-01 DOI: 10.24963/ijcai.2023/352
Alexis de Colnet, P. Marquis
{"title":"On Translations between ML Models for XAI Purposes","authors":"Alexis de Colnet, P. Marquis","doi":"10.24963/ijcai.2023/352","DOIUrl":"https://doi.org/10.24963/ijcai.2023/352","url":null,"abstract":"In this paper, the succinctness of various ML models is studied. To be more precise, the existence of polynomial-time and polynomial-space translations between representation languages for classifiers is investigated. The languages that are considered include decision trees, random forests, several types of boosted trees, binary neural networks, Boolean multilayer perceptrons, and various logical representations of binary classifiers. We provide a complete map indicating for every pair of languages C, C' whether or not a polynomial-time / polynomial-space translation exists from C to C'. We also explain how to take advantage of the resulting map for XAI purposes.","PeriodicalId":394530,"journal":{"name":"International Joint Conference on Artificial Intelligence","volume":"46 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123520823","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Ethical By Designer - How to Grow Ethical Designers of Artificial Intelligence (Extended Abstract) 设计师的道德——如何培养有道德的人工智能设计师(扩展摘要)
International Joint Conference on Artificial Intelligence Pub Date : 2023-08-01 DOI: 10.24963/ijcai.2023/794
Loïs Vanhée, Melania Borit
{"title":"Ethical By Designer - How to Grow Ethical Designers of Artificial Intelligence (Extended Abstract)","authors":"Loïs Vanhée, Melania Borit","doi":"10.24963/ijcai.2023/794","DOIUrl":"https://doi.org/10.24963/ijcai.2023/794","url":null,"abstract":"Ethical concerns regarding Artificial Intelligence technology have fueled discussions around the ethics training received by its designers. Training designers for ethical behaviour, understood as habitual application of ethical principles in any situation, can make a significant difference in the practice of research, development, and application of AI systems. Building on interdisciplinary knowledge and practical experience from computer science, moral psychology, and pedagogy, we propose a functional way to provide this training.","PeriodicalId":394530,"journal":{"name":"International Joint Conference on Artificial Intelligence","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126903814","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信