检索结果-内蒙古大学图书馆

Perception datasets for Anomaly Detection in Autonomous Driving: A Survey

学校读者我要写书评

暂无评论

Perception Datasets for Anomaly Detection in Autonomous Driv...

IEEE Symposium on Intelligent Vehicle

作者： Daniel Bogdoll Svenja Uhlemeyer Kamil Kowol J. Marius Zöllner FZI Research Center for Information Technology Germany Karlsruhe Institute of Technology Germany University of Wuppertal Germany Interdisciplinary Center for Machine Learning and Data Analytics Germany

关键词：

Deliberative XAI: How Explanations Impact Understanding and Decision-Making of AI Novices in Collective and Individual Settings

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Schmude, Timothée Koesten, Laura Möller, Torsten Tschiatschek, Sebastian University of Vienna Faculty of Computer Science Research Network Data Science Doctoral School Computer Science Austria University of Vienna Faculty of Computer Science Research Group Visualization and Data Analysis Austria University of Vienna Faculty of Computer Science Research Group Visualization and Data Analysis Research Network Data Science Austria University of Vienna Faculty of Computer Science Research Network Data Science Research Group Data Mining and Machine Learning Austria

XAI research often focuses on settings where people learn about and assess algorithmic systems individually. However, as more public AI systems are deployed, it becomes essential for XAI to facilitate collective understanding and deliberation. We conducted a task-based interview study involving 8 focus groups and 12 individual interviews to explore how explanations can support AI novices in understanding and forming opinions about AI systems. Participants received a collection of explanations organized into four information categories to solve tasks and decide about a system’s deployment. These explanations improved or calibrated participants’ self-reported understanding and decision confidence and facilitated group discussions. Participants valued both technical and contextual information and the self-directed and modular explanation structure. Our contributions include an explanation approach that facilitates both individual and collaborative interaction and explanation design recommendations, including active and controllable exploration, different levels of information detail and breadth, and adaptations to the needs of decision subjects. Copyright © 2024, The Authors. All rights reserved.

关键词：

On the Impact of Explanations on Understanding of Algorithmic Decision-Making

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Schmude, Timothée Koesten, Laura Möller, Torsten Tschiatschek, Sebastian University of Vienna Faculty of Computer Science Research Network Data Science UniVie Doctoral School Computer Science DoCS Austria University of Vienna Faculty of Computer Science Research Group Visualization and Data Analysis Austria University of Vienna Faculty of Computer Science Research Network Data Science Research Group Visualization and Data Analysis Austria University of Vienna Faculty of Computer Science Research Network Data Science Research Group Data Mining and Machine Learning Austria

Ethical principles for algorithms are gaining importance as more and more stakeholders are affected by "high-risk" algorithmic decision-making (ADM) systems. Understanding how these systems work enables stakeholders to make informed decisions and to assess the systems’ adherence to ethical values. Explanations are a promising way to create understanding, but current explainable artificial intelligence (XAI) research does not always consider existent theories on how understanding is formed and evaluated. In this work, we aim to contribute to a better understanding of understanding by conducting a qualitative task-based study with 30 participants, including users and affected stakeholders. We use three explanation modalities (textual, dialogue, and interactive) to explain a "high-risk" ADM system to participants and analyse their responses both inductively and deductively, using the "six facets of understanding" framework by Wiggins & McTighe [63]. Our findings indicate that the "six facets" framework is a promising approach to analyse participants’ thought processes in understanding, providing categories for both rational and emotional understanding. We further introduce the "dialogue" modality as a valid explanation approach to increase participant engagement and interaction with the "explainer", allowing for more insight into their understanding in the process. Our analysis further suggests that individuality in understanding affects participants’ perceptions of algorithmic fairness, demonstrating the interdependence between understanding and ADM assessment that previous studies have outlined. We posit that drawing from theories on learning and understanding like the "six facets" and leveraging explanation modalities can guide XAI research to better suit explanations to learning processes of individuals and consequently enable their assessment of ethical values of ADM systems. © 2023, CC BY.

关键词： Decision making

Your Transformer May Not be as Powerful as You Expect 36

学校读者我要写书评

暂无评论

Your Transformer May Not be as Powerful as You Expect

36th Conference on Neural Information Processing Systems, NeurIPS 2022

作者： Luo, Shengjie Li, Shanda Zheng, Shuxin Liu, Tie-Yan Wang, Liwei He, Di National Key Laboratory of General Artificial Intelligence School of Intelligence Science and Technology Peking University China Machine Learning Department School of Computer Science Carnegie Mellon University United States Microsoft Research United States Center for Data Science Peking University China Zhejiang Lab China

ISBN: (纸本)9781713871088

Relative Positional Encoding (RPE), which encodes the relative distance between any pair of tokens, is one of the most successful modifications to the original Transformer. As far as we know, theoretical understanding of the RPE-based Transformers is largely unexplored. In this work, we mathematically analyze the power of RPE-based Transformers regarding whether the model is capable of approximating any continuous sequence-to-sequence functions. One may naturally assume the answer is in the affirmative-RPE-based Transformers are universal function approximators. However, we present a negative result by showing there exist continuous sequence-to-sequence functions that RPE-based Transformers cannot approximate no matter how deep and wide the neural network is. One key reason lies in that most RPEs are placed in the softmax attention that always generates a right stochastic matrix. This restricts the network from capturing positional information in the RPEs and limits its capacity. To overcome the problem and make the model more powerful, we first present sufficient conditions for RPE-based Transformers to achieve universal function approximation. With the theoretical guidance, we develop a novel attention module, called Universal RPE-based (URPE) Attention, which satisfies the conditions. Therefore, the corresponding URPE-based Transformers become universal function approximators. Extensive experiments covering typical architectures and tasks demonstrate that our model is parameter-efficient and can achieve superior performance to strong baselines in a wide range of applications. The code will be made publicly available at https://***/lsj2408/URPE. © 2022 Neural information processing systems foundation. All rights reserved.

关键词： Encoding (symbols)

Applying Interdisciplinary Frameworks to Understand Algorithmic Decision-Making

学校读者我要写书评

暂无评论

arXiv 2023年

We argue that explanations for "algorithmic decision-making" (ADM) systems can profit by adopting practices that are already used in the learning sciences. We shortly introduce the importance of explaining ADM systems, give a brief overview of approaches drawing from other disciplines to improve explanations, and present the results of our qualitative task-based study incorporating the "six facets of understanding" [24] framework. We close with questions guiding the discussion of how future studies can leverage an interdisciplinary approach. © 2023, CC BY.

关键词： Decision making

NC-ALG: Graph-Based Active learning under Noisy Crowd 40

学校读者我要写书评

暂无评论

NC-ALG: Graph-Based Active Learning under Noisy Crowd

40th IEEE International Conference on data Engineering, ICDE 2024

作者： Zhang, Wentao Wang, Yexin You, Zhenbang Li, Yang Cao, Gang Yang, Zhi Cui, Bin Center for Machine Learning Research Peking University China Key Lab of High Confidence Software Technologies Peking University China Institute of Advanced Algorithms Research Shanghai China Institute of Computational Social Science Peking University Qingdao China National Engineering Labratory for Big Data Analytics and Applications China TEG Tencent Inc. Department of Data Platform China Beijing Academy of Artificial Intelligence China

ISBN: (纸本)9798350317152

Graph Neural Networks (GNNs) have achieved great success in various data mining tasks but they heavily rely on a large number of annotated nodes, requiring considerable human efforts. Despite the effectiveness of existing GNN-based Active learning (AL) methods, they assume that the annotated labels are always correct, which is contradictory to the error-prone labeling process in a practical crowdsourcing environment. Besides, due to this impractical assumption, existing works only focus on optimizing the node selection in AL but neglect optimizing the labeling process. Therefore, we present NC-ALG, the first GNN-based AL framework that optimizes both the node selection and node labeling process under a noisy crowd. For node selection, NC-ALG introduces a new measurement to model influence reliability and an effective influence maximization objective to select nodes. For node labeling, NC-ALG significantly reduces the labeling cost by considering the model-predicted labels and the labels of mirror nodes. To the best of our knowledge, this is the first attempt to consider GNN-based AL under the practical noisy crowd. Empirical studies on public datasets demonstrate that NC-ALG significantly outperforms existing methods in terms labeling efficiency. Notably, it only takes NC-ALG one-third of the labeling budget that the competitive baseline GRAIN needs to achieve an accuracy of 70.7 % on PubMed. © 2024 IEEE.

关键词： Crowdsourcing

Optimal neural summarization for full-field weak lensing cosmological implicit inference

学校读者我要写书评

暂无评论

Astronomy and Astrophysics 2025年 697卷

作者： Lanzieri, Denise Zeghal, Justine Lucas Makinen, T. Boucaud, Alexandre Starck, Jean-Luc Lanusse, François Université Paris Cité Université Paris-Saclay CEA CNRS AIM Gif-sur-Yvette F-91191 France Université Paris Cité CNRS Paris F-75013 France Imperial Centre for Inference and Cosmology (ICIC) & Astrophysics Group Imperial College London Blackett Laboratory Prince Consort Road London SW7 2AZ United Kingdom Université Paris-Saclay Université Paris Cité CEA CNRS AIM Gif-sur-Yvette 91191 France Sony Computer Science Laboratories - Rome Joint Initiative CREF-SONY Centro Ricerche Enrico Fermi Via Panisperna 89/A Rome 00184 Italy Institutes of Computer Science and Astrophysics Foundation for Research and Technology Hellas (FORTH) Heraklion 70013 Greece Center for Computational Astrophysics Flatiron Institute 162 5th Ave New York 10010 NY United States Department of Physics Université de Montréal Montréal H2V 0B3 Canada Mila - Quebec Artificial Intelligence Institute Montréal H2S 3H1 Canada Ciela - Montreal Institute for Astrophysical Data Analysis and Machine Learning Montréal H2V 0B3 Canada

Context. Traditionally, weak lensing cosmological surveys have been analyzed using summary statistics that were either motivated by their analytically tractable likelihoods (e.g., power spectrum) or by their ability to access some higher-order information (e.g., peak counts), but at the cost of requiring a simulation-based inference approach. In both cases, even if the statistics can be very informative, they are not designed nor guaranteed to be statistically sufficient (i.e., to capture all the cosmological information content of the data). With the rise of deep learning, however, it has becomes possible to create summary statistics that are specifically optimized to extract the full cosmological information content of the data. Yet, a fairly wide range of loss functions have been used in practice in the weak lensing literature to train such neural networks, leading to the natural question of whether a given loss should be preferred and whether sufficient statistics can be achieved in theory and in practice under these different choices. Aims. We compare different neural summarization strategies that have been proposed in the literature to identify the loss function that leads to theoretically optimal summary statistics for performing full-field cosmological inference. In doing so, we aim to provide guidelines and insights to the community to help guide future neural network-based cosmological inference analyses. Methods. We designed an experimental setup that allows us to isolate the specific impact of the loss function used to train neural summary statistics on weak lensing data at fixed neural architecture and simulation-based inference pipeline. To achieve this, we developed the sbi_lens JAX package, which implements an automatically differentiable lognormal weak lensing simulator and the tools needed to perform explicit full-field inference with a Hamiltonian Monte Carlo (HMC) sampler over this model. Using sbi_lens, we simulated a wCDM LSST Year 10 weak lens

关键词： Gravitational lensing: weak Large-scale structure of Universe Methods: statistical

BIM: Improving Graph Neural Networks with Balanced Influence Maximization 40

学校读者我要写书评

暂无评论

BIM: Improving Graph Neural Networks with Balanced Influence...

40th IEEE International Conference on data Engineering, ICDE 2024

作者： Zhang, Wentao Gao, Xinyi Yang, Ling Cao, Meng Huang, Ping Shan, Jiulong Yin, Hongzhi Cui, Bin Peking University Center for Machine Learning Research China Institute of Advanced Algorithms Research Shanghai China National Engineering Labratory for Big Data Analytics and Applications The University of Queensland Australia Peking University Key Lab of High Confidence Software Technologies China Apple Inc. Institute of Computational Social Science Peking University Qingdao China

ISBN: (纸本)9798350317152

The imbalanced data classification problem has aroused lots of concerns from both academia and industry since data imbalance is a widespread phenomenon in many real-world scenarios. Although this problem has been well researched from the view of imbalanced class samples, we further argue that graph neural networks (GNNs) expose a unique source of imbalance from the influenced nodes of different classes of labeled nodes, i.e., labeled nodes are imbalanced in terms of the number of nodes they influenced during the influence propagation in GNNs. To tackle this previously unexplored influence-imbalance issue, we connect social influence maximization with the imbalanced node classification problem and propose balanced influence maximization (BIM). Specifically, BIM greedily assigns the pseudo label to the node which can maximize the number of influenced nodes in GNN training while making the influence of each class more balance. Experimental results on five public datasets demonstrate the effectiveness of our method in relieving the influence-imbalance issue. For example, when training a GCN with an imbalance ratio of 0.1, BIM significantly outperforms the most competitive baseline by 0.6% -9.8% in five public datasets in terms of the F1 score. © 2024 IEEE.

关键词： Graph neural networks

On the Effectiveness of Heterogeneous Ensemble Methods for Re-identification

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Klüttermann, Simon Rutinowski, Jérôme Nguyen, Anh Grimme, Britta Roidl, Moritz Müller, Emmanuel TU Dortmund University Dortmund Germany Lamarr Institute for Machine Learning and Artificial Intelligence Germany Research Center Trustworthy Data Science and Security Germany

In this contribution, we introduce a novel ensemble method for the re-identification of industrial entities, using images of chipwood pallets and galvanized metal plates as dataset examples. Our algorithms replace commonly used, complex siamese neural networks with an ensemble of simplified, rudimentary models, providing wider applicability, especially in hardware-restricted scenarios. Each ensemble sub-model uses different types of extracted features of the given data as its input, allowing for the creation of effective ensembles in a fraction of the training duration needed for more complex state-of-the-art models. We reach state-of-the-art performance at our task, with a Rank-1 accuracy of over 77% and a Rank-10 accuracy of over 99%, and introduce five distinct feature extraction approaches, and study their combination using different ensemble methods. © 2024, CC BY.

关键词： Complex networks