In this work, we develop an optimal transport (OT) based framework to select informative prototypical examples that best represent a given target dataset. Summarizing a given target dataset via representative examples is an important problem in several machine learning applications where human understanding of the learning models and underlying data distribution is essential for decision making. We model the prototype selection problem as learning a sparse (empirical) probability distribution having the minimum OT distance from the target distribution. The learned probability measure supported on the chosen prototypes directly corresponds to their importance in representing the target data. We show that our objective function enjoys a key property of submodularity and propose an efficient greedy method that is both computationally fast and possess deterministic approximation guarantees. Empirical results on several real world benchmarks illustrate the efficacy of our approach.
SPOT-Occ: Sparse Prototype-guided Transformer for Camera-based 3D Occupancy Prediction
Artificial Intelligence Thrust, The Hong Kong University of Science and Technology (Guangzhou)(香港科学与技术大学人工智能方向(广州));Department of Computer Science and Engineering, The Hong Kong University of Science and Technology(香港科学与技术大学计算机科学与工程系)
UniPROT: Uniform Prototype Selection via Partial Optimal Transport with Submodular Guarantees
Department of Computer Science and Engineering, Indian Institute of Technology Bombay(印度理工学院孟买分校计算机科学与工程系);Centre for Machine Intelligence and Data Science, Indian Institute of Technology Bombay(印度理工学院孟买分校机器智能与数据科学中心);Microsoft Research India(微软研究院印度);Walmart Global Tech, India(沃尔玛全球技术印度);Microsoft India(微软印度)
Streaming Methods for Restricted Strongly Convex Functions with Applications to Prototype Selection
Amazon Development Center(亚马逊开发中心);IBM Research(IBM研究院)
在本文中,我们表明,如果优化功能是限制强凸(RSC)和限制光滑(RSM)-一个丰富的子类弱次模函数-然后流算法与常数因子近似保证是可能的。更一般地说,我们的结果适用于任何单调弱次模函数的子模比有界从上。这个(正)结果为弱次模函数提供了一个常数因子流保证的充分条件,考虑到最近的负结果,它可能是特别令人感兴趣的(Elenberg et al.,2017)对于弱次模函数的一般类。我们应用我们的流算法创建大型复杂数据集的紧凑的概要,通过选择$m$代表元素,通过优化合适的RSC和RSM目标函数。上述结果甚至在附加约束条件下也成立,例如学习非负权重,用于可解释性,用于指示其重要性的每个所选元素。我们在两个真实的数据集上对我们的算法进行了经验评估:MNIST-手写数字数据集和Letters-包含以不同字体和样式书写的字母表的UCI数据集。我们观察到,我们的算法是数量级的速度比最先进的流算法弱次模函数,我们的主要算法仍然提供同样好的解决方案在实践中。
ProME: Prototype-Margin Environments with Repair-Aware Selection for Group-Robust Learning
Shenzhen Key Laboratory of Safety and Security for Next Generation of Industrial Internet(深圳市下一代工业互联网安全重点实验室);Department of Statistics and Data Science, Southern University of Science and Technology(南方科技大学统计与数据科学系)
Shedding Light on Blind Spots: Developing a Reference Architecture to Leverage Video Data for Process Mining
FIM Research Center, University of Applied Sciences Augsburg(奥格斯堡应用技术大学FIM研究中心);FIM Research Center, University of Bayreuth(拜罗伊特大学FIM研究中心);Project Group Business & Information Systems Engineering of the Fraunhofer FIT(弗劳恩霍夫应用信息处理研究所商业与信息系统工程项目组)
Benchmarking Active Spot Selection for Cost-Efficient Spatial Transcriptomics
University of Pennsylvania(宾夕法尼亚大学);Vanderbilt University(范德堡大学);Cornell Tech(康奈尔科技校区);University of Notre Dame(圣母大学);New York Medical College(纽约医学院);Vanderbilt University Medical Center(范德堡大学医学中心);Weill Medical College of Cornell University(康奈尔大学威尔医学院)
Cube Sampled K-Prototype Clustering for Featured Data
Indian Institute of Technology Indore(印度理工学院印多尔分校);NMIMS, Shirpur(NMIMS希尔布尔分校);Institut Mines-Telecom Atlantique(法国矿业电信学校联盟大西洋校区);NMIMS Indore(NMIMS印多尔分校)