mlsanityData to 7 Oct 2026

Achieving More with Less: A Tensor-Optimization-Powered Ensemble Method

arXiv 2408.02936 ↗First posted 6 Aug 2024cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

Ensemble learning is a method that leverages weak learners to produce a strong learner. However, obtaining a large number of base learners requires substantial time and computational resources. Therefore, it is meaningful to study how to achieve the performance typically obtained with many base learners using only a few. We argue that to achieve this, it is essential to enhance both classification performance and generalization ability during the ensemble process. To increase model accuracy, each weak base learner needs to be more efficiently integrated. It is observed that different base learners exhibit varying levels of accuracy in predicting different classes. To capitalize on this, we introduce confidence tensors tildeTheta, where tildeThetarst signifies the degree of confidence that the t-th base classifier assigns the sample to class r while it actually belongs to class s. To the best of our knowledge, this is the first time an evaluation of the performance of base classifiers across different classes has been proposed. The proposed confidence tensor compensates for the strengths and weaknesses of each base classifier in different classes, enabling the method to achieve superior results with a smaller number of base learners. To enhance generalization performance, we design a smooth and partially convex objective function that leverages the concept of margin, making the strong learner more discriminative. Furthermore, it is proved that in the gradient matrix of the loss function, the sum of each column's elements is zero, allowing us to solve a constrained optimization problem using gradient-based methods.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 8 of its 21 references that are in the map. First posted on arXiv 6 Aug 2024.

Builds on

8 of 21 references.

References · 8

  1. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
  2. 2021Beyond Max-Margin: Class Margin Equilibrium for Few-shot Object Detectioncited by 80
  3. 2023A Unified Theory of Diversity in Ensemble Learningcited by 71
  4. 2021Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimizationcited by 66
  5. 2020Unified Analysis of Stochastic Gradient Methods for Composite Convex and Smooth Optimizationcited by 36
  6. 2022Dimensionality Reduced Training by Pruning and Freezing Parts of a Deep Neural Network, a Surveycited by 12
  7. 2019A Universal Approximation Result for Difference of log-sum-exp Neural Networkscited by 9
  8. 2023Multi-class Support Vector Machine with Maximizing Minimum Margincited by 6

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 3.

4 papers.