An Analysis on Disentanglement in Machine Learning

Hazal Mogultay, Sinan Kalkan, Fatoş T. Yarman Vural
{"title":"An Analysis on Disentanglement in Machine Learning","authors":"Hazal Mogultay, Sinan Kalkan, Fatoş T. Yarman Vural","doi":"10.1109/SIU55565.2022.9864743","DOIUrl":null,"url":null,"abstract":"Learnt representations by Deep autoencoders is not capable of decomposing the complex information into simple notion. In other words, attributes of samples are entangled in the basis vectors spanning the learned space. This leads to significant errors in deep learning algorithms. In order to avoid these errors, it is necessary to separate the feature space according to the common features shared between classes and to define a simple subspace for each feature. This approach has led to the birth of a new paradigm in Machine Learning, called disentanglement.Roughly, disentangled models can be defined as models that can independently learn the different components of the probability density function that produces the dataset in the feature space. Unfortunately, it is not always possible to learn these models. For this reason, there is still no easily applicable mathematical definition of disentanglement in the literature. In this study, a mathematical definition of the concept of disentanglement will be made and methods and metrics related to this approach will be discussed.","PeriodicalId":115446,"journal":{"name":"2022 30th Signal Processing and Communications Applications Conference (SIU)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 30th Signal Processing and Communications Applications Conference (SIU)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIU55565.2022.9864743","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Learnt representations by Deep autoencoders is not capable of decomposing the complex information into simple notion. In other words, attributes of samples are entangled in the basis vectors spanning the learned space. This leads to significant errors in deep learning algorithms. In order to avoid these errors, it is necessary to separate the feature space according to the common features shared between classes and to define a simple subspace for each feature. This approach has led to the birth of a new paradigm in Machine Learning, called disentanglement.Roughly, disentangled models can be defined as models that can independently learn the different components of the probability density function that produces the dataset in the feature space. Unfortunately, it is not always possible to learn these models. For this reason, there is still no easily applicable mathematical definition of disentanglement in the literature. In this study, a mathematical definition of the concept of disentanglement will be made and methods and metrics related to this approach will be discussed.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
机器学习中的解纠缠分析
深度自编码器的学习表征不能将复杂的信息分解为简单的概念。换句话说,样本的属性在跨越学习空间的基向量中纠缠。这导致深度学习算法出现重大错误。为了避免这些错误,有必要根据类之间共享的公共特征来分离特征空间,并为每个特征定义一个简单的子空间。这种方法导致了机器学习新范式的诞生,称为解纠缠。粗略地说,解纠缠模型可以定义为能够独立学习特征空间中产生数据集的概率密度函数的不同组成部分的模型。不幸的是,学习这些模型并不总是可能的。由于这个原因,在文献中仍然没有一个容易适用的解缠的数学定义。在本研究中,将给出解纠缠概念的数学定义,并讨论与此方法相关的方法和度量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Traffic Prediction with Peak-Aware Temporal Graph Convolutional Networks Artificial Neural Network Based Fault Diagnostic System for Wind Turbines Remaining Useful Life Prediction on C-MAPSS Dataset via Joint Autoencoder-Regression Architecture A New Fast Walsh Hadamard Transform Spread UW-Optical-OFDM Waveform Indoor Localization with Transfer Learning
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1