Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,786 papers · 148 categories

Trend · papers per month

3216419621,282 · Jun 202019922001200920172026
48 results for supervised ensemble methods

Efficiently builds diverse sub-model ensembles for robust self-supervised learning.

problem Challenges in diversity and efficiency of deep ensembles for self-supervised representation learning.
method Ensemble of independent sub-networks with a new loss function for diversity.
result Significantly improves prediction reliability and model calibration.

This paper improves SSL methods using ensemble techniques with data-dependent weighted losses.

problem Improving SSL performance and robustness with large unlabeled data.
method Developed a framework for weighted cross-entropy losses in ensembling SSL methods without altering the backbone.
result Our method outperforms state-of-the-art SSL methods on ImageNet-1K, especially in few-shot learning.

XGBOD combines unsupervised and supervised methods for better outlier detection.

problem Enhanced outlier detection from normal observations in various datasets.
method Hybrid approach using unsupervised representation learning to improve a supervised classifier.
result XGBOD outperforms competing methods across seven datasets.

DSL uses supervised learning to optimize portfolios, improving stability and performance.

problem Optimizing robust portfolios in financial markets.
method DSL reframes portfolio construction as a supervised learning problem, using cross-entropy loss and optimizing Sharpe or Sortino ratios. Deep Ensemble methods are employed to reduce variance.
result DSL outperforms traditional and machine learning methods, achieving higher median returns and more stable risk-adjusted performance.

Clustering ensemble is one of the most recent advances in unsupervised learning. It aims to combine the clustering results obtained using different algorithms or from different runs of the same clustering algorithm for the same data set, this is accomplished using on a consensus function, the efficiency and accuracy of…

2012-08-20abs ↗pdf ↗

Study examines unsupervised and graph-based methods for anomaly detection in IoBT, outperformed by supervised stacking ensemble.

problem Anomaly detection in adversarial environments of IoBT.
method Unsupervised learning, graph-based methods, ensemble supervised learning, adversarial training.
result Supervised stacking ensemble method outperforms unsupervised and graph-based methods in detecting anomalies.

Different types of training data have led to numerous schemes for supervised classification. Current learning techniques are tailored to one specific scheme and cannot handle general ensembles of training data. This paper presents a unifying framework for supervised classification with general ensembles of training dat…

2019-01-24abs ↗pdf ↗

Combines Xgboost and transductive SVM for semi-supervised learning.

problem Improving semi-supervised learning performance with heterogeneous tabular data.
method Proposes an optimization-based ensemble method to adaptively combine Xgboost and transductive SVM.
result Significantly improves classification accuracy over state-of-the-art methods.

In this article, the logic rule ensembles approach to supervised learning is applied to the unsupervised or semi-supervised clustering. Logic rules which were obtained by combining simple conjunctive rules are used to partition the input space and an ensemble of these rules is used to define a similarity matrix. Simila…

2012-07-17abs ↗pdf ↗

Study on how intraclass variability affects Temporal Ensembling accuracy.

problem Effect of intraclass variability on Temporal Ensembling accuracy.
method Investigated through experiments with varying seed sizes and types on different datasets.
result Significant drop in accuracy with high intraclass variability datasets, more seed images improve accuracy, and seed type impacts overall efficiency.

A new machine learning framework called machine collaboration improves prediction accuracy.

problem Improving prediction accuracy in machine learning.
method Machine Collaboration (MaC) framework, which uses a circular and interactive learning approach.
result Machine Collaboration framework significantly outperforms other state-of-the-art methods in most cases.

Ensembled neural networks improve MRI image quality.

problem Accelerated parallel MR imaging with high SSIM scores.
method Ensembled ΣΣ-net combining parallel coil and sensitivity networks, trained with supervised and semi-supervised methods.
result Ensembling models achieves visually sharp and textured images with robust SSIM scores.

We formalize the notion of a pseudo-ensemble, a (possibly infinite) collection of child models spawned from a parent model by perturbing it according to some noise process. E.g., dropout (Hinton et. al, 2012) in a deep neural network trains a pseudo-ensemble of child subnetworks generated by randomly masking nodes in t…

2014-12-16abs ↗pdf ↗

Learning algorithms that aggregate predictions from an ensemble of diverse base classifiers consistently outperform individual methods. Many of these strategies have been developed in a supervised setting, where the accuracy of each base classifier can be empirically measured and this information is incorporated in the…

2018-02-13abs ↗pdf ↗

Paper fine-tunes LLMs using user edits, unifying preference, supervision, and reward feedback.

problem Adapting LLMs to user preferences and feedback types.
method Derives bounds for learning algorithms from user edits, proposes an ensembling procedure.
result Ensembling procedure outperforms individual feedback methods and robustly adapts to different user-edit distributions.

In this article supervised learning problems are solved using soft rule ensembles. We first review the importance sampling learning ensembles (ISLE) approach that is useful for generating hard rules. The soft rules are then obtained with logistic regression from the corresponding hard rules. In order to deal with the p…

2012-05-21abs ↗pdf ↗

Solves weakly supervised regression using low-rank approximations and manifold regularization.

problem Weakly supervised regression with known, unknown, and uncertain labels.
method Combines manifold regularization and low-rank matrix decomposition for optimization.
result Improves solution quality and stability for large datasets.

As data streams become more prevalent, the necessity for online algorithms that mine this transient and dynamic data becomes clearer. Multi-label data stream classification is a supervised learning problem where each instance in the data stream is classified into one or more pre-defined sets of labels. Many methods hav…

2018-09-26abs ↗pdf ↗

The recently proposed self-ensembling methods have achieved promising results in deep semi-supervised learning, which penalize inconsistent predictions of unlabeled data under different perturbations. However, they only consider adding perturbations to each single data point, while ignoring the connections between data…

2017-11-01abs ↗pdf ↗

We address the problem of aggregating an ensemble of predictors with known loss bounds in a semi-supervised binary classification setting, to minimize prediction loss incurred on the unlabeled data. We find the minimax optimal predictions for a very general class of loss functions including all convex and many non-conv…

2015-10-01abs ↗pdf ↗

Study predicts heart failure patient survival using stacked ensemble ML.

problem Predicting survival of heart failure patients.
method Collect and analyze patient data, apply SMOTE, use K-Means, Fuzzy C-Means clustering, Random Forest, XGBoost, Decision Tree, and propose a stacked ensemble model.
result Supervised ML algorithms outperform unsupervised models, achieving high accuracy and F1 score.

New methods improve tree ensemble models by compressing them while maintaining accuracy.

problem Theoretical understanding and practical compression of tree ensembles like random forests and gradient boosting machines.
method Spectral perspective on tree ensembles, deriving minimax rates and developing compression schemes.
result Leading eigenfunctions/singular vectors capture dominant predictive directions, leading to smaller, competitive models.