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

learning Fair Representations through Uniformly Distributed Sensitive Attributes

学校读者我要写书评

暂无评论

Learning Fair Representations through Uniformly Distributed ...

Secure and Trustworthy machine learning (SaTML), IEEE Conference on

作者： Patrik Joslin Kenfack Adín Ramírez Rivera Adil Mehmood Khan Manuel Mazzara Machine Learning and Knowledge Representation Lab Innopolis University Innopolis Russia Department of Informatics Digital Signal Processing and Image Analysis (DSB) group University of Oslo Oslo Norway School of Computer Science University of Hull Hull UK Institute of Software Development and Engineering Innopolis University Innopolis Russia

machine learning (ML) models trained on biased data can reproduce and even amplify these biases. Since such models are deployed to make decisions that can affect people's lives, ensuring their fairness is critical. One approach to mitigate possible unfairness of ML models is to map the input data into a less-biased new space by means of training the model on fair representations. Several methods based on adversarial learning have been proposed to learn fair representation by fooling an adversary in predicting the sensitive attribute (e.g., gender or race). However, adversarial-based learning can be too difficult to optimize in practice; besides, it penalizes the utility of the representation. Hence, in this research effort we train bias-free representations from the input data by inducing a uniform distribution over the sensitive attributes in the latent space. In particular, we propose a probabilistic framework that learns these representations by enforcing the correct reconstruction of the original data, plus the prediction of the attributes of interest while eliminating the possibility of predicting the sensitive ones. Our method leverages the inability of Deep Neural Networks (DNNs) to generalize when trained on a noisy label space to regularize the latent space. We use a network head that predicts a noisy version of the sensitive attributes in order to increase the uncertainty of their predictions at test time. Our experiments in two datasets demonstrated that the proposed model significantly improves fairness while maintaining the prediction accuracy of downstream tasks.

关键词：

Robust Barron-Loss Tucker Tensor Decomposition

学校读者我要写书评

暂无评论

TechRxiv

TechRxiv 2021年

作者： Mozaffari, Mahsa Markopoulos, Panos P. Department of Electrical and Microelectronic Engineering Machine Learning Optimization and Signal Processing Laboratory Rochester Institute of Technology RochesterNY14623 United States

Tucker decomposition is a standard method for the analysis of high-order tensor data. Standard Tucker decomposition generalizes singular-value decomposition and is formulated as minimization of the L2-norm of the low-rank approximation error. Due to the quadratic emphasis on peripheral data, the L2-norm based formulation of Tucker has been shown to be sensitive against corruptions. L1-norm-based variants (L1-Tucker) are proposed as robust Tucker decomposition methods, and are formulated as subspace estimators by absolute-projection maximization, and have proven effective in outlier resistant subspace computation. However, Tucker decomposition for robust low-rank tensor approximation is not defined/optimized in the literature. In this work, we propose a new formulation for low-rank tensor approximation, with tunable outlier-robustness, and present a unified algorithmic solution framework. This formulation relies on a new generalized robust loss function (Barron loss), which encompasses several well-known loss-functions with variable outlier-resistance. The robustness of the proposed framework is corroborated by the presented numerical studies on synthetic and real data. © 2021, CC BY.

关键词： Singular value decomposition

Uncertainty quantification for sparse Fourier recovery

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Hoppe, Frederik Krahmer, Felix Verdun, Claudio Mayrink Menzel, Marion I. Rauhut, Holger Mathematics of Information Processing RWTH Aachen University Aachen Germany Department of Mathematics Munich Data Science Institute Technical University of Munich Munich Center for Machine Learning Munich Germany Department of Mathematics Department of Electrical and Computer Engineering Technical University of Munich Munich Center for Machine Learning Munich Germany AImotion Bavaria Faculty of Electrical Engineering and Information Technology Technische Hochschule Ingolstadt Ingolstadt Department of Physics Technical University of Munich Garching and GE Healthcare Munich Germany Department of Mathematics LMU Munich Germany

One of the most prominent methods for uncertainty quantification in high-dimensional statistics is the desparsified LASSO that relies on unconstrained 1-minimization. The majority of initial works focused on real (sub-)Gaussian designs. However, in many applications, such as magnetic resonance imaging (MRI), the measurement process possesses a certain structure due to the nature of the problem. The measurement operator in MRI can be described by a subsampled Fourier matrix. The purpose of this work is to extend the uncertainty quantification process using the desparsified LASSO to design matrices originating from a bounded orthonormal system, which naturally generalizes the subsampled Fourier case and also allows for the treatment of the case where the sparsity basis is not the standard basis. In particular we construct honest confidence intervals for every pixel of an MR image that is sparse in the standard basis provided the number of measurements satisfies n Á maxts log2 s log p, s log2 pu or that is sparse with respect to the Haar wavelet basis provided a slightly larger number of measurements. Copyright © 2022, The Authors. All rights reserved.

关键词： Magnetic resonance imaging

A predictive surrogate model for heat transfer of an impinging jet on a concave surface

学校读者我要写书评

暂无评论

International Journal of Heat and Mass Transfer 2025年 251卷

作者： Sajad Salavatidezfouli Saeed Rakhsha Armin Sheidani Giovanni Stabile Gianluigi Rozza Mathematics Area MathLab International School for Advanced Studies (SISSA) Trieste Italy Department of Electrical and Computer Engineering - Signal Processing and Machine Learning Aarhus University Aarhus Denmark Department of Mechanical Engineering Semnan University Semnan Iran Department of Applied Physics Eindhoven University of Technology The Netherlands Department of Pure and Applied Sciences Informatics and Mathematics Section University of Urbino Carlo Bo Urbino Italy The Biorobotics Institute Sant’Anna School of Advanced Studies Pisa Italy

This paper aims to comprehensively investigate the efficacy of model order reduction and deep learning techniques in predicting heat transfer of pulsatile impinging jets on a concave surface. We introduce two predictive approaches: one employing a Fast Fourier Transform-augmented Artificial Neural Network for predicting the area-averaged Nusselt number under constant-frequency jet scenarios, and another comparing the performance of LSTM and Transformer neural networks for random-frequency jets. Results indicate that the Transformer significantly outperforms the LSTM, achieving higher accuracy and robustness in predicting Nusselt numbers — covering up to 50% of the cycle with precision, whereas the LSTM covers only 20% with greater error margins. Additionally, the integration of Proper Orthogonal Decomposition with Transformer networks yields a novel strategy for predicting local Nusselt number distributions. This method significantly reduces computational complexity while maintaining high accuracy, with a maximum prediction error of 5%. These findings demonstrate the efficacy of advanced deep learning techniques for temporal prediction of the Nusselt number on complex surfaces, suggesting further applicability in broader fluid dynamics and heat transfer analyses.

关键词：

ScanMix: learning from Severe Label Noise via Semantic Clustering and Semi-Supervised learning

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Sachdeva, Ragav Cordeiro, Filipe Rolim Belagiannis, Vasileios Reid, Ian Carneiro, Gustavo Visual Geometry Group Department of Engineering Science University of Oxford United Kingdom School of Computer Science Australian Institute for Machine Learning Australia Visual Computing Lab Department of Computing Universidade Federal Rural de Pernambuco Brazil Otto-von-Guericke-Universität Magdeburg Germany Centre for Vision Speech and Signal Processing University of Surrey United Kingdom

We propose a new training algorithm, ScanMix, that explores semantic clustering and semi-supervised learning (SSL) to allow superior robustness to severe label noise and competitive robustness to non-severe label noise problems, in comparison to the state of the art (SOTA) methods. ScanMix is based on the expectation maximisation framework, where the E-step estimates the latent variable to cluster the training images based on their appearance and classification results, and the M-step optimises the SSL classification and learns effective feature representations via semantic clustering. We present a theoretical result that shows the correctness and convergence of ScanMix, and an empirical result that shows that ScanMix has SOTA results on CIFAR-10/-100 (with symmetric, asymmetric and semantic label noise), Red Mini-ImageNet (from the Controlled Noisy Web Labels), Clothing1M and WebVision. In all benchmarks with severe label noise, our results are competitive to the current SOTA. © 2021, CC BY.

关键词： Semantics

LongReMix: Robust learning with High Confidence Samples in a Noisy Label Environment

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Cordeiro, Filipe R. Sachdeva, Ragav Belagiannis, Vasileios Reid, Ian Carneiro, Gustavo School of Computer Science Australian Institute for Machine Learning Australia Visual Geometry Group Department of Engineering Science University of Oxford United Kingdom Visual Computing Lab Department of Computing Universidade Federal Rural de Pernambuco Brazil Otto-von-Guericke-Universität Magdeburg Germany Centre for Vision Speech and Signal Processing University of Surrey United Kingdom

State-of-the-art noisy-label learning algorithms rely on an unsupervised learning to classify training samples as clean or noisy, followed by a semi-supervised learning (SSL) that minimises the empirical vicinal risk using a labelled set formed by samples classified as clean, and an unlabelled set with samples classified as noisy. The classification accuracy of such noisy-label learning methods depends on the precision of the unsupervised classification of clean and noisy samples, and the robustness of SSL to small clean sets. We address these points with a new noisy-label training algorithm, called LongReMix, which improves the precision of the unsupervised classification of clean and noisy samples and the robustness of SSL to small clean sets with a two-stage learning process. The stage one of LongReMix finds a small but precise high-confidence clean set, and stage two augments this high-confidence clean set with new clean samples and oversamples the clean data to increase the robustness of SSL to small clean sets. We test LongReMix on CIFAR-10 and CIFAR-100 with introduced synthetic noisy labels, and the real-world noisy-label benchmarks CNWL (Red Mini-ImageNet), WebVision, Clothing1M, and Food101-N. The results show that our LongReMix produces significantly better classification accuracy than competing approaches, particularly in high noise rate problems. Furthermore, our approach achieves state-of-the-art performance in most datasets. The code is available at https://***/filipe-research/LongReMix. © 2021, CC BY.

关键词： Deep learning

Overview of the Tenth Dialog System Technology Challenge: DSTC10

学校读者我要写书评

暂无评论

IEEE/ACM Transactions on Audio Speech and Language processing 2024年 32卷 765-778页

作者： Yoshino, Koichiro Chen, Yun-Nung Crook, Paul Kottur, Satwik Li, Jinchao Hedayatnia, Behnam Moon, Seungwhan Fei, Zhengcong Li, Zekang Zhang, Jinchao Feng, Yang Zhou, Jie Kim, Seokhwan Liu, Yang Jin, Di Papangelis, Alexandros Gopalakrishnan, Karthik Hakkani-Tur, Dilek Damavandi, Babak Geramifard, Alborz Hori, Chiori Shah, Ankit Zhang, Chen Li, Haizhou Sedoc, Joao D'haro, Luis F. Banchs, Rafael Rudnicky, Alexander Guardian Robot Project R-IH RIKEN 2-2-2 Hikaridai Seika Shoraku619-0288 Japan Information Science Nara Institute of Science and Technology Ikoma630-0101 Japan Computer Science and Information Engineering National Taiwan University Taipei10617 Taiwan Inc. Palo AltoCA95054 United States Alexa AI *** Inc. SunnyvaleCA94089 United States Meta Seattle RedmondWA98052 United States Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China Tencent AI Lab Beijing Beijing China Kexueyuan South Road Zhongguancun Beijing100190 China Beijing 100190 China Alexa AI *** Inc. SunnyvaleCA United States 1120 Enterprise way Sunnyvale94089 United States *** Inc. SeattleWA United States Menlo Park CA United States Audio and Speech Group Mitsubishi Electric Research Laboratories CambridgeMA02139-1955 United States Carnegie Mellon University Department of Language and Information Technologies or just Carnegie Mellon University Pittsburgh United States National University of Singapore Singapore Singapore Department of Electrical and Computer Engineering National University of Singapore Singapore Singapore Shenzhen Research Institute of Big Data School of Data Science Chinese University of Hong Kong Shenzhen518172 China New York University New YorkNY United States ETSI de Telecomunicacion - Speech Technology and Machine Learning Group Universidad Politecnica de Madrid Ciudad Universitaria Madrid28040 Spain Nanyang Technological University Singapore Singapore Carnegie Mellon University PittsburghPA United States

This article introduces the Tenth Dialog System Technology Challenge (DSTC-10). This edition of the DSTC focuses on applying end-to-end dialog technologies for five distinct tasks in dialog systems, namely 1. Incorporation of Meme images into open domain dialogs, 2. Knowledge-grounded Task-oriented Dialogue Modeling on Spoken Conversations, 3. Situated Interactive Multimodal dialogs, 4. Reasoning for Audio Visual Scene-Aware Dialog, and 5. Automatic Evaluation and Moderation of Open-domainDialogue Systems. This article describes the task definition, provided datasets, baselines, and evaluation setup for each track. We also summarize the results of the submitted systems to highlight the general trends of the state-of-the-art technologies for the tasks. © 2023 The Authors.

关键词： Job analysis

QUBIQ: Uncertainty Quantification for Biomedical Image Segmentation Challenge

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Li, Hongwei Bran Navarro, Fernando Ezhov, Ivan Bayat, Amirhossein Das, Dhritiman Kofler, Florian Shit, Suprosanna Waldmannstetter, Diana Paetzold, Johannes C. Hu, Xiaobin Wiestler, Benedikt Zimmer, Lucas Amiranashvili, Tamaz Prabhakar, Chinmay Berger, Christoph Weidner, Jonas Alonso-Basanta, Michelle Rashid, Arif Baid, Ujjwal Adel, Wesam Alis, Deniz Baheti, Bhakti Bai, Yingbin Bhat, Ishaan Cetindag, Sabri Can Chen, Wenting Cheng, Li Dutande, Prasad Dular, Lara Elattar, Mustafa A. Feng, Ming Gao, Shengbo Huisman, Henkjan Hu, Weifeng Innani, Shubham Ji, Wei Karimi, Davood Kuijf, Hugo J. Kwak, Jin Tae Le, Hoang Long Li, Xiang Lin, Huiyan Liu, Tongliang Ma, Jun Ma, Kai Ma, Ting Oksuz, Ilkay Holland, Robbie Oliveira, Arlindo L. Pal, Jimut Bahan Pei, Xuan Qiao, Maoying Saha, Anindo Selvan, Raghavendra Shen, Linlin Silva, Joao Lourenco Spiclin, Ziga Talbar, Sanjay Wang, Dadong Wang, Wei Wang, Xiong Wang, Yin Xi, Ruiling Xu, Kele Yang, Yanwu Yergin, Mert Yu, Shuang Zeng, Lingxi Zhang, YingLin Zhao, Jiachen Zheng, Yefeng Zukovec, Martin Do, Richard Becker, Anton Simpson, Amber Konukoglu, Ender Jakab, Andras Bakas, Spyridon Joskowicz, Leo Menze, Bjoern Department of Informatics Technical University of Munich Germany Athinoula A. Martinos Center for Biomedical Imaging Massachusetts General Hospital Harvard Medical School United States Department of Quantitative Biomedicine University of Zurich Switzerland University Children’s Hospital Zurich University of Zurich Switzerland Department of Radioncology and Radiation Theraphy Klinikum rechts der Isar Technical University of Munich Germany Department of Information Technology and Electrical Engineering ETH-Zurich Switzerland Department of Radiology Memorial Sloan Kettering Cancer Center New York City United States Department of Biomedical and Molecular Sciences Queen’s University Canada TranslaTUM - Central Institute for Translational Cancer Research Technical University of Munich Germany McGovern Institute Massachusetts Institute of Technology United States Institute for Diagnostic and Interventional Radiology Unveristy Zurich Hospital Switzerland BioMedIA Imperial College London United Kingdom Department of Radiation Oncology University of Pennsylvania PA United States University of Pennsylvania PA United States Department of Radiation Oncology Winship Cancer Institute of Emory University Georgia United States Nile University Cairo Egypt Department of Medical Sciences Acibadem University Istanbul Turkey Shri Guru Gobind Singhji Institute of Engineering and Technology Maharashtra Nanded India Trustworthy Machine Learning Lab University of Sydney Australia Image Sciences Institute University Medical Center Utrecht Netherlands Computer Engineering Department Istanbul Technical University Istanbul Turkey School of Computer Science Shenzhen University Shenzhen China University of Alberta United States University of Ljubljana Faculty of Electrical Engineering Ljubljana Slovenia Tongji University Shanghai China OPPO Research Institute Shanghai China School of Biological and Medical Engineering Beihang University Beijing China Harvard Medical School Boston

Uncertainty in medical image segmentation tasks, especially inter-rater variability, arising from differences in interpretations and annotations by various experts, presents a significant challenge in achieving consistent and reliable image segmentation. This variability not only reflects the inherent complexity and subjective nature of medical image interpretation but also directly impacts the development and evaluation of automated segmentation algorithms. Accurately modeling and quantifying this variability is essential for enhancing the robustness and clinical applicability of these algorithms. We report the set-up and summarize the benchmark results of the Quantification of Uncertainties in Biomedical Image Quantification Challenge (QUBIQ), which was organized in conjunction with International Conferences on Medical Image Computing and computer-Assisted Intervention (MICCAI) 2020 and 2021. The challenge focuses on the uncertainty quantification of medical image segmentation which considers the omnipresence of inter-rater variability in imaging datasets. The large collection of images with multi-rater annotations features various modalities such as MRI and CT;various organs such as the brain, prostate, kidney, and pancreas;and different image dimensions 2D-vs-3D. A total of 24 teams submitted different solutions to the problem, combining various baseline models, Bayesian neural networks, and ensemble model techniques. The obtained results indicate the importance of the ensemble models, as well as the need for further research to develop efficient 3D methods for uncertainty quantification methods in 3D segmentation tasks. © 2024, CC BY-NC-ND.

关键词： Image segmentation

A Review of Generalized Zero-Shot learning Methods

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Pourpanah, Farhad Abdar, Moloud Luo, Yuxuan Zhou, Xinlei Wang, Ran Lim, Chee Peng Wang, Xi-Zhao Jonathan Wu, Q.M. The Centre for Computer Vision and Deep Learning Department of Electrical and Computer Engineering University of Windsor WindsorONN9B 3P4 Canada Deakin University Australia The Department of Computer Science City University of Hong Kong Hong Kong The College of Mathematics and Statistics Shenzhen Key Lab. of Advanced Machine Learning and Applications Shenzhen University Shenzhen518060 China The College of Computer Science and Software Engineering Guangdong Key Lab. of Intelligent Information Processing Shenzhen University Shenzhen518060 China

Generalized zero-shot learning (GZSL) aims to train a model for classifying data samples under the condition that some output classes are unknown during supervised learning. To address this challenging task, GZSL leverages semantic information of the seen (source) and unseen (target) classes to bridge the gap between both seen and unseen classes. Since its introduction, many GZSL models have been formulated. In this review paper, we present a comprehensive review on GZSL. Firstly, we provide an overview of GZSL including the problems and challenges. Then, we introduce a hierarchical categorization for the GZSL methods and discuss the representative methods in each category. In addition, we discuss the available benchmark data sets and applications of GZSL, along with a discussion on the research gaps and directions for future investigations. Copyright © 2020, The Authors. All rights reserved.

关键词： Zero-shot learning