Random Linear Projections Loss for Hyperplane-Based Optimization in Neural Networks
Advancing loss function design is pivotal for optimizing neural network training and performance. This work introduces Random Linear Projections (RLP) loss, a novel approach that enhances training efficiency by leveraging geometric relationships within the data. Distinct from traditional loss functions that target minimizing pointwise errors, RLP loss operates by minimizing the distance between sets of hyperplanes connecting fixed-size subsets of feature-prediction pairs and feature-label pairs. Our empirical evaluations, conducted across benchmark datasets and synthetic examples, demonstrate that neural networks trained with RLP loss outperform those trained with traditional loss functions, achieving improved performance with fewer data samples, and exhibiting greater robustness to additive noise. We provide theoretical analysis supporting our empirical findings.
Code (1)
Tasks
ClassificationSimilar Papers 제목 키워드 기반
Multilinear Hyperplane Hashing
Hashing has become an increasingly popular technique for fast nearest neighbor search in large databases. Despite its successful progress in classic point-to-point search, there are few studies regarding point-to-hyperpl…
Active LearningQuantizationSensitivityMerging SVMs with Linear Discriminant Analysis: A Combined Model
A key problem often encountered by many learning algorithms in computer vision dealing with high dimensional data is the so called "curse of dimensionality" which arises when the available training samples are less than …
Dimensionality ReductionObject RecognitionRediscovering Hashed Random Projections for Efficient Quantization of Contextualized Sentence Embeddings
Training and inference on edge devices often requires an efficient setup due to computational limitations. While pre-computing data representations and caching them on a server can mitigate extensive edge device computat…
QuantizationSentenceSentence ClassificationSentence EmbeddingsRandom Projections for Linear Support Vector Machines
Let X be a data matrix of rank \rho, whose rows represent n points in d-dimensional space. The linear support vector machine constructs a hyperplane separator that maximizes the 1-norm soft margin. We develop a new obliv…
Dimensionality ReductionGeneral ClassificationregressionSupport vector machines and Radon's theorem
A support vector machine (SVM) is an algorithm that finds a hyperplane which optimally separates labeled data points in $\mathbb{R}^n$ into positive and negative classes. The data points on the margin of this separating …