RoBoSS: A Robust, Bounded, Sparse, and Smooth Loss Function for Supervised Learning
Mushir Akhtar, M. Tanveer, and Mohd. Arshad

TL;DR
This paper introduces RoBoSS, a novel loss function designed to improve supervised learning by enhancing robustness, sparsity, and smoothness, and demonstrates its effectiveness within a new SVM framework across diverse datasets.
Contribution
The paper proposes the RoBoSS loss function and integrates it into a new $ ext{L}_{RoBoSS}$-SVM algorithm, providing theoretical analysis and extensive empirical validation.
Findings
Outperforms existing methods on 88 benchmark datasets
Shows robustness against outliers and noise in data
Achieves better generalization and training efficiency
Abstract
In the domain of machine learning, the significance of the loss function is paramount, especially in supervised learning tasks. It serves as a fundamental pillar that profoundly influences the behavior and efficacy of supervised learning algorithms. Traditional loss functions, though widely used, often struggle to handle outlier-prone and high-dimensional data, resulting in suboptimal outcomes and slow convergence during training. In this paper, we address the aforementioned constraints by proposing a novel robust, bounded, sparse, and smooth (RoBoSS) loss function for supervised learning. Further, we incorporate the RoBoSS loss within the framework of support vector machine (SVM) and introduce a new robust algorithm named -SVM. For the theoretical analysis, the classification-calibrated property and generalization ability are also presented. These investigations…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and ELM · Blind Source Separation Techniques · EEG and Brain-Computer Interfaces
