首页/论文/1902.08313

arXiv 1902.083132019-02-21cs.LGstat.ML

Reduced-Rank Local Distance Metric Learning for k-NN Classification

University of Central Florida（中佛罗里达大学）；Florida Institute of Technology（佛罗里达理工学院）

YInjie Huang, Cong Li, Michael Georgiopoulos, Georgios C. Anagnostopoulos

英文摘要：

We propose a new method for local distance metric learning based on sample similarity as side information. These local metrics, which utilize conical combinations of metric weight matrices, are learned from the pooled spatial characteristics of the data, as well as the similarity profiles between the pairs of samples, whose distances are measured. The main objective of our framework is to yield metrics, such that the resulting distances between similar samples are small and distances between dissimilar samples are above a certain threshold. For learning and inference purposes, we describe a transductive, as well as an inductive algorithm; the former approach naturally befits our framework, while the latter one is provided in the interest of faster learning. Experimental results on a collection of classification problems imply that the new methods may exhibit notable performance advantages over alternative metric learning approaches that have recently appeared in the literature.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Rank4Class: A Ranking Formulation for Multiclass Classification

University of Virginia（弗吉尼亚大学）；Google Research（谷歌研究院）

Multiclass classification (MCC) is a fundamental machine learning problem of classifying each instance into one of a predefined set of classes. In the deep learning era, extensive efforts have been spent on developing more powerful neural embedding models to better represent the instance for improving MCC performance. In this paper, we do not aim to propose new neural models for instance representation learning, but to show that it is promising to boost MCC performance with a novel formulation through the lens of ranking. In particular, by viewing MCC as to rank classes for an instance, we fir…

2022-12-21cs.AIcs.IRcs.LG

Robust Sparse Reduced Rank Regression in High Dimensions

We propose robust sparse reduced rank regression for analyzing large and complex high-dimensional data with heavy-tailed random noise. The proposed method is based on a convex relaxation of a rank- and sparsity-constrained non-convex optimization problem, which is then solved using the alternating direction method of multipliers algorithm. We establish non-asymptotic estimation error bounds under both Frobenius and nuclear norms in the high-dimensional setting. This is a major contribution over existing results in reduced rank regression, which mainly focus on rank selection and prediction con…

2019-04-14cs.LGstat.ML

稀疏降秩回归：基于流形优化的同时秩与变量选择

Sparse Reduced-Rank Regression for Simultaneous Rank and Variable Selection via Manifold Optimization

The University of Electro-Communications（电气通信大学）

针对高真实秩下降秩回归系数估计失效的问题，提出基于稀疏正则化与流形优化的同时秩与变量选择算法，实现准确估计并验证有效性。

2019-11-01cs.LGstat.MEstat.ML

Joint Ranking SVM and Binary Relevance with Robust Low-Rank Learning for Multi-Label Classification

University of Chinese Academy of Sciences（中国科学院大学）；Chinese Academy of Sciences（中国科学院）；Beijing Union University（北京联合大学）

Multi-label classification studies the task where each example belongs to multiple labels simultaneously. As a representative method, Ranking Support Vector Machine (Rank-SVM) aims to minimize the Ranking Loss and can also mitigate the negative influence of the class-imbalance issue. However, due to its stacking-style way for thresholding, it may suffer error accumulation and thus reduces the final classification performance. Binary Relevance (BR) is another typical method, which aims to minimize the Hamming Loss and only needs one-step learning. Nevertheless, it might have the class-imbalance…

2019-11-05cs.LGstat.ML

高阶降秩回归

Higher Order Reduced Rank Regression

本文提出高阶降秩回归（HORRR），通过张量表示与Tucker分解捕捉多响应回归中的非线性交互，并利用黎曼优化求解带多线性秩约束的问题。

2025-03-09cs.LGcs.NAmath.NA

一种求解降秩算子回归的随机化算法

A randomized algorithm to solve reduced rank operator regression

Istituto Italiano di Tecnologia（意大利理工学院）；University of Novi Sad（诺维萨德大学）；University College London（伦敦大学学院）

本文提出随机化降秩回归（R4）算法，利用高斯草图技术高效求解可能无限维的向量值回归问题，理论证明风险接近最优，实验展示在神经科学和Koopman算子回归中的优势。

2023-12-28cs.LGcs.NAmath.NA

更多相关论文收起更多论文

CoLoRA：连续低秩自适应用于参数化偏微分方程的简化隐式神经建模

CoLoRA: Continuous low-rank adaptation for reduced implicit neural modeling of parameterized partial differential equations

Courant Institute of Mathematical Sciences, New York University（纽约大学柯朗数学科学研究所）

本文提出CoLoRA方法，通过预训练神经网络并连续调整低秩权重，快速预测参数化偏微分方程的解场，支持数据驱动和变分驱动，速度快且适用于数据稀缺场景。

2024-07-21cs.LGcs.NAmath.NA

Sparse Reduced Rank Regression With Nonconvex Regularization

The Hong Kong University of Science and Technology（香港科技大学）

In this paper, the estimation problem for sparse reduced rank regression (SRRR) model is considered. The SRRR model is widely used for dimension reduction and variable selection with applications in signal processing, econometrics, etc. The problem is formulated to minimize the least squares loss with a sparsity-inducing penalty considering an orthogonality constraint. Convex sparsity-inducing functions have been used for SRRR in literature. In this work, a nonconvex function is proposed for better sparsity inducing. An efficient algorithm is developed based on the alternating minimization (or…

2018-03-20cs.LGq-fin.CPstat.ME

用于分类和生存分析的二分排序算法

Bipartite ranking algorithm for classification and survival analysis

MetaPattern

独立构建的单变量预测器的无监督聚合被探索作为噪声，稀疏数据集的另一种正则化方法。介绍了实现该方法的二分排序算法Smooth Rank。该算法的优点证明了两种类型的问题。首先，平滑排序被应用于生物医学领域的两类问题，其中排序往往比分类更可取。与具有径向和线性内核的SVM相比，Smooth Rank在12个基准测试中的8个上具有最佳性能。第二个应用领域是生存分析，这是减少在这里的方式，允许一个使用普遍接受的方法性能的措施，以二分排名。在将Smooth Rank与Cox PH回归和CoxPath方法进行比较时，Smooth Rank在10个基准数据集中的9个上被证明是最好的。

2011-12-08cs.LG

2016年CIKM杯跨设备匹配的分类和学习排序方法

Classification and Learning-to-rank Approaches for Cross-Device Matching at CIKM Cup 2016

L3S Research Center（L3S研究中心）；Leibniz Universität Hannover（莱布尼茨汉诺威大学）

在本文中，我们提出了两种方法来解决CIKM Cup 2016在线广告的跨设备匹配问题。第一种方法将匹配问题视为一个二进制分类任务，并利用集成学习技术来解决它。第二种方法将匹配问题定义为一个排序任务，并使用学习排序算法有效地解决它。实验结果表明，基于排序的方法比基于分类的方法具有更好的性能。

2016-12-20cs.IRcs.LG

大规模数据中基于鲁棒二分类和并行参数估计的排序

Ranking via Robust Binary Classification and Parallel Parameter Estimation in Large-Scale Data

Purdue University（普渡大学）

我们提出了RoBiRank，排名算法，其动机是观察学习排名和鲁棒分类损失函数的评估指标之间的密切联系。该算法在标准基准数据集上显示出非常有竞争力的性能，与文献中的其他代表性算法相比。另一方面，在大规模的问题，明确的特征向量和分数没有给出，我们的算法可以有效地并行在大量的机器;对于需要在待排序的项目之间进行386，133 × 49，824，519个成对交互的任务，在相同的计算时间下，我们的算法找到的解决方案的质量比最先进的竞争对手算法找到的解决方案的质量要高得多。

2014-08-21cs.DCcs.LGstat.CO

无线传感器网络中基于联合迭代优化的分布式低秩估计

Distributed Low-Rank Estimation Based on Joint Iterative Optimization in Wireless Sensor Networks

University of York（约克大学）；PUC-Rio（里约热内卢天主教大学）；Princeton University（普林斯顿大学）

提出了一种新的分布式降秩算法和一种自适应分布式估计算法。建议的分布式方案是基于一个变换，在网络的每个代理进行降维，然后由一个降维参数向量。提出了一种分布式降秩联合迭代估计算法，与现有技术相比，该算法能够显著降低通信开销，提高估计性能。仿真结果表明，所提出的策略在收敛速度和均方误差性能方面的优势。

2014-11-05cs.ITcs.LGmath.IT

RLSEP: Learning Label Ranks for Multi-label Classification

Istanbul Technical University（伊斯坦布尔技术大学）；Technical University of Munich（慕尼黑工业大学）；University of Vermont（佛蒙特大学）

Multi-label ranking maps instances to a ranked set of predicted labels from multiple possible classes. The ranking approach for multi-label learning problems received attention for its success in multi-label classification, with one of the well-known approaches being pairwise label ranking. However, most existing methods assume that only partial information about the preference relation is known, which is inferred from the partition of labels into a positive and negative set, then treat labels with equal importance. In this paper, we focus on the unique challenge of ranking when the order of t…

2022-12-08cs.CVcs.LG

Rank over Class: The Untapped Potential of Ranking in Natural Language Processing

Durham University（杜伦大学）；Newcastle University（纽卡斯尔大学）

Text classification has long been a staple within Natural Language Processing (NLP) with applications spanning across diverse areas such as sentiment analysis, recommender systems and spam detection. With such a powerful solution, it is often tempting to use it as the go-to tool for all NLP problems since when you are holding a hammer, everything looks like a nail. However, we argue here that many tasks which are currently addressed using classification are in fact being shoehorned into a classification mould and that if we instead address them as a ranking problem, we not only improve the mod…

2021-12-03cs.CLcs.LG

基于语义排序的概率Zero-shot分类

Probabilistic Zero-shot Classification with Semantic Rankings

The Ohio State University（俄亥俄州立大学）

在本文中，我们提出了一个非度量排名为基础的表示语义相似性，允许自然聚合的语义信息从多个异构源。我们将基于排名的表示应用于零样本学习问题，并提出了确定性和概率性的zero-shot分类器，可以从预先训练的分类器中构建，而无需重新训练。我们在两个大型的真实世界图像数据集上展示了它们的优势。特别是，我们表明，聚合不同来源的语义信息，包括众包，导致更准确的分类。

2015-02-27cs.AIcs.CVcs.LG

Adaptive Reduced Rank Regression

William & Mary（威廉玛丽学院）；Worcester Polytechnic Institute（伍斯特理工学院）；University of Oxford（牛津大学）

We study the low rank regression problem $\my = M\mx + ε$, where $\mx$ and $\my$ are $d_1$ and $d_2$ dimensional vectors respectively. We consider the extreme high-dimensional setting where the number of observations $n$ is less than $d_1 + d_2$. Existing algorithms are designed for settings where $n$ is typically as large as $\Rank(M)(d_1+d_2)$. This work provides an efficient algorithm which only involves two SVD, and establishes statistical guarantees on its performance. The algorithm decouples the problem by first estimating the precision matrix of the features, and then solving the matrix…

2020-10-23cs.DScs.LG