In a typical supervised machine learning setting, the predictions on all test instances are based on a common subset of features discovered during model training. However, using a different subset of features that is most informative for each test instance individually may not only improve prediction accuracy, but also the overall interpretability of the model. At the same time, feature selection methods for classification have been known to be the most effective when many features are irrelevant and/or uncorrelated. In fact, feature selection ignoring correlations between features can lead to poor classification performance. In this work, a Bayesian network is utilized to model feature dependencies. Using the dependency network, a new method is proposed that sequentially selects the best feature to evaluate for each test instance individually, and stops the selection process to make a prediction once it determines that no further improvement can be achieved with respect to classification accuracy. The optimum number of features to acquire and the optimum classification strategy are derived for each test instance. The theoretical properties of the optimum solution are analyzed, and a new algorithm is proposed that takes advantage of these properties to implement a robust and scalable solution for high dimensional settings. The effectiveness, generalizability, and scalability of the proposed method is illustrated on a variety of real-world datasets from diverse application domains.
DIWIFT: Discovering Instance-wise Influential Features for Tabular Data
Guangdong Laboratory of Artificial Intelligence and Digital Economy (SZ)(广东省人工智能与数字经济实验室(深圳));Shenzhen University(深圳大学);Huawei Technologies Co Ltd(华为技术有限公司);Tencent(腾讯);Tsinghua-Berkeley Shenzhen Institute(清华-伯克利深圳学院)
Correlated Time Series Self-Supervised Representation Learning via Spatiotemporal Bootstrapping
The Hong Kong University of Science and Technology(香港科技大学);The Shanghai AI Laboratory(上海人工智能实验室);University of Cologne(科隆大学);Qing Yuan Research Institute of Shanghai Jiao Tong University(上海交通大学清源研究院);The Hong Kong University of Science and Technology (Guangzhou)(香港科技大学(广州))
Customizing Language Models with Instance-wise LoRA for Sequential Recommendation
University of Science and Technology of China(中国科学技术大学);National University of Singapore(新加坡国立大学);Electronic Science Research Institute of China Electronics Technology Group Corporation(中国电子科技集团公司电子科学研究院)
CWP: Instance complexity weighted channel-wise soft masks for network pruning
Ningxia University(宁夏大学);Collaborative Innovation Center for Ningxia Big Data and Artificial Intelligence co-founded by Ningxia Municipality and Ministry of Education(宁夏大数据与人工智能省部共建协同创新中心)
College of Software Engineering, Southeast University(东南大学软件学院);School of Computer Science and Engineering, Southeast University(东南大学计算机科学与工程学院);Yam Pak Charitable Foundation School of Computing and Information Sciences, Saint Francis University(圣弗朗西斯大学叶荫堂计算与信息科学学院);Department of Computer Science, City University of Hong Kong(香港城市大学计算机科学系)
Instance-Wise Adaptive Sampling for Dataset Construction in Approximating Inverse Problem Solutions
Center for Computational Mathematics, Flatiron Institute(计算数学中心,Flatiron研究所);Department of Applied Physics and Applied Mathematics, Columbia University(应用物理与应用数学系,哥伦比亚大学)
What went wrong and when? Instance-wise Feature Importance for Time-series Models
University of Toronto(多伦多大学);Vector Institute(向量研究所);Harvard University (SEAS)(哈佛大学工程与应用科学学院);Lunenfeld Tanenbaum Research Institute(卢嫩菲尔德-塔南鲍姆研究所);The Hospital for Sick Children(病童医院)
DRAUC: An Instance-wise Distributionally Robust AUC Optimization Framework
SKLOIS, Institute of Information Engineering, CAS(中国科学院信息工程研究所);School of Cyber Security, University of Chinese Academy of Sciences(中国科学院大学网络空间安全学院);Key Lab. of Intelligent Information Processing, Institute of Computing Tech., CAS(中国科学院计算技术研究所);School of Computer Science and Tech., University of Chinese Academy of Sciences(中国科学院大学计算机科学与技术学院);School of Cyber Science and Tech., Shenzhen Campus of Sun Yat-sen University(中山大学深圳校区网络空间安全学院);BDKM, University of Chinese Academy of Sciences(中国科学院大学BDKM)
Instance-Wise Minimax-Optimal Algorithms for Logistic Bandits
Criteo AI Lab(Criteo人工智能实验室);LTCI TélécomParis(法国电信高等学院LTCI实验室)
物流强盗最近吸引了大量的关注,通过提供一个整洁但具有挑战性的框架来理解参数化强盗中非线性的影响。Faury et al.(2020)表明,逻辑强盗的学习理论困难可以通过一个大的(有时是禁止的)问题依赖常数$κ$来体现,它表征了奖励的非线性程度。在本文中,我们介绍了一种新的算法,我们提供了一个完善的分析。这允许更好地表征非线性效应,并产生改进的问题相关保证。在大多数有利的情况下,这会导致遗憾的上限缩放为$\tilde{\mathcal{O}}(d\sqrt{T/κ})$,这大大改善了$\tilde{\mathcal{O}}(d\sqrt{T}+κ)$的最新保证。我们证明了这个速率是最小最大最优的推导出一个$Ω(d\sqrt{T/κ})$问题相关的下限。我们的分析确定了遗憾的两种机制(永久性和暂时性),最终重新调和了Faury et al.(2020)与Dong et al.(2019)的贝叶斯方法。与以前的工作相比,我们发现,在永久政权的非线性可以显着地减轻勘探开发权衡。虽然它也影响了过渡阶段的长度在一个问题依赖的方式,我们表明,这种影响是温和的,在最合理的配置。
Towards Instance-Wise Calibration: Local Amortized Diagnostics and Reshaping of Conditional Densities (LADaR)
1 Department of Physics;Astronomy, University of Pittsburgh;Cosmology Center (PITT PACC), University of Pittsburgh;3 Department of Statistical Sciences, University of Toronto;4 Canadian Institute for Theoretical Astrophysics (CITA), University of Toronto;5 Dunlap Institute for Astronomy \& Astrophysics, University of Toronto;6 Vector Institute;7 Department of Statistics;Data Science, Carnegie Mellon University;8 Department of Statistics, Federal University of S\ a o Carlos (UFSCar)