Multi-instance data, in which each object (bag) contains a collection of instances, are widespread in machine learning, computer vision, bioinformatics, signal processing, and social sciences. We present a maximum entropy (ME) framework for learning from multi-instance data. In this approach each bag is represented as a distribution using the principle of ME. We introduce the concept of confidence-constrained ME (CME) to simultaneously learn the structure of distribution space and infer each distribution. The shared structure underlying each density is used to learn from instances inside each bag. The proposed CME is free of tuning parameters. We devise a fast optimization algorithm capable of handling large scale multi-instance data. In the experimental section, we evaluate the performance of the proposed approach in terms of exact rank recovery in the space of distributions and compare it with the regularized ME approach. Moreover, we compare the performance of CME with Multi-Instance Learning (MIL) state-of-the-art algorithms and show a comparable performance in terms of accuracy with reduced computational complexity.
Confidence Scores Make Instance-dependent Label-noise Learning Possible
RIKEN Center for Advanced Intelligence Project(理化学研究所先进智能项目中心);Hong Kong Baptist University(香港浸会大学);University of Sydney(悉尼大学);University of Tokyo(东京大学)
DBC-Forest: Deep forest with binning confidence screening
School of Artificial Intelligence, Hebei University of Technology(河北工业大学人工智能学院);Hebei Key Laboratory of Big Data Computing(河北省大数据计算重点实验室);School of Economics and Management, Hebei University of Technology(河北工业大学经济管理学院);State Key Laboratory of Reliability and Intelligence of Electrical Equipment, Hebei University of Technology(河北工业大学省部共建电工装备可靠性与智能化国家重点实验室);Alibaba Group(阿里巴巴集团)
Optimal Best-Arm Identification under Fixed Confidence with Multiple Optima
Faculty of Computer Science and Engineering, Ho Chi Minh City University of Technology (HCMUT), Vietnam(计算机科学与工程学院,胡志明市技术大学(HCMUT),越南);Vietnam National University Ho Chi Minh City (VNU-HCM), Vietnam(越南胡志明市国家大学(VNU-HCM),越南)
Vector Institute for Artificial Intelligence(向量人工智能研究所);School of Data Science, The Chinese University of Hong Kong, Shenzhen(香港中文大学(深圳)数据科学学院);Huawei Technologies Canada(华为技术加拿大公司);Cheriton School of Computer Science, University of Waterloo(滑铁卢大学谢里敦计算机科学学院)
Conformal Prediction Sets for Instance Segmentation
Laboratory for Information and Decision Systems, MIT(麻省理工学院信息与决策系统实验室);Department of Electrical Engineering and Computer Science, MIT(麻省理工学院电子工程与计算机科学系);Department of Mechanical Engineering, MIT(麻省理工学院机械工程系);Institute for Data, Systems, and Society, MIT(麻省理工学院数据、系统与社会研究所)
Peter the Great St.Petersburg Polytechnic University (SPbPU)(彼得大帝圣彼得堡理工大学(SPbPU));St.Petersburg Clinical Research Center for Special Types of Medical Care (Oncology-oriented)(圣彼得堡特殊医疗类型临床研究中心(肿瘤导向))
Filtering instances and rejecting predictions to obtain reliable models in healthcare
Instituto de Computação(计算研究所);Universidade Estadual de Campinas(Campinas州立大学);Department of Informatics(信息学院);King’s College London(伦敦国王学院);Núcleo de Telessaúde(远程医疗中心);Universidade Federal do Rio Grande do Sul(鲁汶联邦大学);Escola Paulista de Medicina(巴西圣保罗医学学院);Universidade Federal de São Paulo(圣保罗联邦大学);Divisão de Ciência da Computação(计算机科学部);Instituto Tecnológico de Aeronáutica(航空技术研究所)
Knowledge-Constrained Shape Optimization with a Mixture-of-Experts Neural Operator for High-Confidence Design
School of Ocean and Civil Engineering, Shanghai Jiao Tong University(上海交通大学海洋与土木工程学院);Eastern Institute of Technology(东方理工学院);TenFong Technology Co., Ltd.(十方科技有限公司);IM Motors Technology Co., Ltd.(集度汽车科技有限公司)
Joint Bootstrapping Machines for High Confidence Relation Extraction
Siemens AG(西门子股份公司);University of Munich (LMU)(慕尼黑大学(LMU))
用于从文本中提取关系的半监督自举技术迭代地扩展一组初始种子实例。由于缺乏标记数据,自举中的一个关键挑战是语义漂移:如果在迭代期间添加了假阳性实例,则所有后续迭代都将受到污染。我们介绍BREX,一个新的自举方法,防止这种污染的高度有效的信心评估。这是通过联合使用实体和模板种子(而不是在以前的工作中只有一个),通过并行扩展实体和模板,并在每次迭代中相互约束的方式,并通过引入更高质量的模板相似性措施。实验结果表明,BREX在四个关系中实现了比现有技术好0.13(0.87 vs. 0.74)的F1。
Mitigating Label Bias in Machine Learning: Fairness through Confident Learning
Hangzhou Dianzi University(杭州电子科技大学);University of Technology Sydney(悉尼科技大学);Huazhong University of Science and Technology(华中科技大学);Renmin University of China(中国人民大学)
Domain-Specific Pre-training Improves Confidence in Whole Slide Image Classification
Birla Institute of Technology and Science, Pilani(毕拉理工与科学大学 Pilani校区);Macquarie University(麦考瑞大学);University of California, San Diego(加利福尼亚大学圣地亚哥分校);TCS Research(塔塔咨询服务公司研究院)
Near-Optimal Algorithms for Constrained k-Center Clustering with Instance-level Background Knowledge
School of Mathematics and Statistics, Fuzhou University(福州大学数学与统计学学院);School of Accounting, Information Systems and Supply Chain, RMIT University(皇家墨尔本理工大学会计、信息系统与供应链学院);School of Information Technology, Deakin University(德肯大学信息科技学院);Western Sydney University(西悉尼大学);CSIRO’s Data61(澳大利亚联邦科学与工业研究组织Data61)
Achieving Instance-dependent Sample Complexity for Constrained Markov Decision Process
Department of Industrial Engineering & Decision Analytics, Hong Kong University of Science and Technology(香港科技大学工业工程与决策分析系);Institute for Computational and Mathematical Engineering, Stanford University(斯坦福大学计算与数学工程研究所);Department of Management Science & Engineering, Stanford University(斯坦福大学管理科学与工程系)