An instance-weighted variant of the support vector machine (SVM) has attracted considerable attention recently since they are useful in various machine learning tasks such as non-stationary data analysis, heteroscedastic data modeling, transfer learning, learning to rank, and transduction. An important challenge in these scenarios is to overcome the computational bottleneck---instance weights often change dynamically or adaptively, and thus the weighted SVM solutions must be repeatedly computed. In this paper, we develop an algorithm that can efficiently and exactly update the weighted SVM solutions for arbitrary change of instance weights. Technically, this contribution can be regarded as an extension of the conventional solution-path algorithm for a single regularization parameter to multiple instance-weight parameters. However, this extension gives rise to a significant problem that breakpoints (at which the solution path turns) have to be identified in high-dimensional space. To facilitate this, we introduce a parametric representation of instance weights. We also provide a geometric interpretation in weight space using a notion of critical region: a polyhedron in which the current affine solution remains to be optimal. Then we find breakpoints at intersections of the solution path and boundaries of polyhedrons. Through extensive experiments on various practical applications, we demonstrate the usefulness of the proposed algorithm.
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（宁夏大数据与人工智能省部共建协同创新中心）
Variational autoencoder with weighted samples for high-dimensional non-parametric adaptive importance sampling
ONERA（法国航空航天研究院）；Université de Toulouse（图卢兹大学）；Institut de Mathématiques de Toulouse（图卢兹数学研究所）；CNRS（法国国家科学研究中心）；Zurich University of Applied Sciences（苏黎世应用科技大学）
Peter the Great St.Petersburg Polytechnic University (SPbPU)（彼得大帝圣彼得堡理工大学（SPbPU））；St.Petersburg Clinical Research Center for Special Types of Medical Care (Oncology-oriented)（圣彼得堡特殊医疗类型临床研究中心（肿瘤导向））
ANIMC: A Soft Framework for Auto-weighted Noisy and Incomplete Multi-view Clustering
Hubei Engineering Research Center on Big Data Security, School of Cyber Science and Engineering, Huazhong University of Science and Technology（大数据安全湖北工程研究中心，信息科学与工程学院，华中科技大学）；School of Computer Science and Technology, Huazhong University of Science and Technology（计算机科学与技术学院，华中科技大学）；Key Laboratory of Information Storage System Ministry of Education of China, Huazhong University of Science and Technology（信息存储系统教育部重点实验室，华中科技大学）；Department of Electrical and Computer Engineering, University of Florida（电气与计算机工程系，佛罗里达大学）
Exponentially Weighted Instance-Aware Repeat Factor Sampling for Long-Tailed Object Detection Model Training in Unmanned Aerial Vehicles Surveillance Scenarios
Center for Ubiquitous Computing (UBICOMP), University of Oulu, Finland（通用计算中心（UBICOMP），奥卢大学，芬兰）；Center for Machine Vision and Signal Analysis (CMVS), University of Oulu, Finland（机器视觉与信号分析中心（CMVS），奥卢大学，芬兰）；Center for Wireless Communications (CWC), University of Oulu, Finland（无线通信中心（CWC），奥卢大学，芬兰）；Ming Hsieh Department of Electrical and Computer Engineering, University of Southern California, United States（明斯希德电气与计算机工程系，南加州大学，美国）；Department of Computer Science, University of Helsinki, Finland（计算机科学系，赫尔辛基大学，芬兰）；University of Oulu, Oulu, Finland（奥卢大学，奥卢，芬兰）；University of Helsinki, Helsinki, Finland（赫尔辛基大学，赫尔辛基，芬兰）；University of Southern California, Los Angeles, United States（南加州大学，洛杉矶，美国）
