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,657 papers · 148 categories

Trend · papers per month

151302452603 · Jun 202019922001200920172026
48 results for combined features

New methods for assessing and visualizing feature groups in machine learning models.

problem Lack of methods for interpreting feature groups in machine learning models.
method Permutation-based, refitting, and Shapley-based techniques for grouped feature importance. Introduced a sequential procedure for identifying stable feature combinations. Developed a combined features effect plot.
result Effective methods for assessing and visualizing the importance and effect of feature groups in machine learning models.

GOLFS selects features for clustering by combining global and local information.

problem Feature selection for high-dimensional clustering without labels.
method Combines global and local information via manifold learning and regularized self-representation.
result Improves feature selection and clustering accuracy.

A novel weighted feature selection method using fuzzy sets improves classification accuracy and stability.

problem Improving feature selection accuracy and stability in machine learning models.
method Combination of four feature selection methods using fuzzy sets and bootstrap.
result Our method achieved significantly higher stability than individual methods.

Simplifies forecast combination by using diversity of out-of-sample forecasts.

problem Estimating optimal weights for forecast combinations is challenging.
method Use out-of-sample forecasts to extract features and calculate weights for forecast combination.
result Achieves superior forecasting performance in point forecasts and prediction intervals.

SIAN bridges simple models to neural networks by identifying necessary feature combinations.

problem The gap between simple models and powerful neural networks in performance.
method Feature interaction detection and sparse selection algorithm.
result Competitive performance across multiple tabular datasets with optimal tradeoff.

In recent work, it was shown that combining multi-kernel based support vector machines (SVMs) can lead to near state-of-the-art performance on an action recognition dataset (HMDB-51 dataset). This was 0.4\% lower than frameworks that used hand-crafted features in addition to the deep convolutional feature extractors. I…

2017-08-18abs ↗pdf ↗

We present a novel, log-radius profile representation for convex curves and define a new operation for combining the shape features of curves. Unlike the standard, angle profile-based methods, this operation accurately combines the shape features in a visually intuitive manner. This method have implications in shape an…

2015-06-24abs ↗pdf ↗

Optimized fuzzy entropy framework improves feature selection and classification performance.

problem Improving feature selection and classification in fuzzy entropy frameworks.
method Implemented and compared combinations of ideal vectors, maximal similarity classifiers, and fuzzy entropy functions.
result Optimized combination of ideal vector, similarity classifier, and fuzzy entropy function achieved the most stable performance for all three datasets.

IUS framework predicts EUR/USD exchange rate with improved accuracy.

problem Accurate forecasting of EUR/USD exchange rate.
method Combines large language models for sentiment analysis, deep learning for forecasting, and feature selection.
result Optuna-optimized Bi-LSTM model reduces MAE and RMSE by 10.69% and 9.56% respectively.

The group affect or emotion in an image of people can be inferred by extracting features about both the people in the picture and the overall makeup of the scene. The state-of-the-art on this problem investigates a combination of facial features, scene extraction and even audio tonality. This paper combines three addit…

2018-03-13abs ↗pdf ↗

State-of-the-art link prediction utilizes combinations of complex features derived from network panel data. We here show that computationally less expensive features can achieve the same performance in the common scenario in which the data is available as a sequence of interactions. Our features are based on social vec…

2013-04-15abs ↗pdf ↗

Generalized linear models with nonlinear feature transformations are widely used for large-scale regression and classification problems with sparse inputs. Memorization of feature interactions through a wide set of cross-product feature transformations are effective and interpretable, while generalization requires more…

2016-06-24abs ↗pdf ↗

Combines datasets to improve model fitting with small sample sizes.

problem Improving model performance with limited samples from at least one dataset.
method Proposes a novel framework called Combine datasets based on Imputation (ComImp) and PCA-ComImp for combining datasets with missing data.
result Significant improvement in model accuracy, especially with small datasets and when combined with transfer learning.

CTRF combines logged data and randomized experiments for robust prediction.

problem Robust prediction models to handle distributional shifts between training and testing data.
method CTRF uses existing training data and a small amount of randomized experiment data to train a robust model.
result CTRF produces robust predictions and outperforms baseline methods in the presence of feature shifts.

A two-layer classifier improves smartphone transportation mode recognition.

problem Improving accuracy of transportation mode classification.
method Two-layer hierarchical classifier combining time and frequency domain features.
result Maximum classification accuracy of 97.02%.

Despite the success of deep learning in domains such as image, voice, and graphs, there has been little progress in deep representation learning for domains without a known structure between features. For instance, a tabular dataset of different demographic and clinical factors where the feature interactions are not gi…

2019-12-20abs ↗pdf ↗

The paper improves prediction and testing for signals from a linear combination of translated features with Gaussian noise.

problem Predicting and testing signals from a linear combination of translated features with varying scale parameter and Gaussian noise.
method Extends previous off-the-grid prediction results, improves minimal distance between features, proposes a goodness-of-fit test with upper bounds.
result Upper bounds on the minimax separation rate match those for the high-dimensional linear model, matching the lower bound.

New method reconstructs missing variables in time series using autoencoders and automatic differentiation.

problem Reconstruct missing variables in time series with flexible input and output combinations.
method Train an autoencoder with all features, optimize missing variables as inputs, and use automatic differentiation.
result Flexible input and output combinations can be achieved without retraining the autoencoder.

An important step in speaker verification is extracting features that best characterize the speaker voice. This paper investigates a front-end processing that aims at improving the performance of speaker verification based on the SVMs classifier, in text independent mode. This approach combines features based on conven…

2013-06-12abs ↗pdf ↗

Latent feature models (LFM)s are widely employed for extracting latent structures of data. While offering high, parameter estimation is difficult with LFMs because of the combinational nature of latent features, and non-identifiability is a particularly difficult problem when parameter estimation is not unique and ther…

2018-09-11abs ↗pdf ↗

SCOPE-FE improves feature engineering efficiency for high-dimensional datasets.

problem Expanding and reducing feature space in tabular learning becomes computationally expensive with increased dimensionality.
method SCOPE-FE controls the search space by regulating operator and feature-pair spaces, using OperatorProbing and FeatureClustering.
result SCOPE-FE reduces feature engineering time while maintaining competitive predictive performance.

Ensemble learning that can be used to combine the predictions from multiple learners has been widely applied in pattern recognition, and has been reported to be more robust and accurate than the individual learners. This ensemble logic has recently also been more applied in feature selection. There are basically two st…

2018-11-19abs ↗pdf ↗

ALICE combines feature selection and inter-rater agreeability for ML model insights.

problem Improving interpretability of black box machine learning models.
method Integrates feature selection and inter-rater agreeability into a user-friendly Python library.
result Initial experiments on customer churn modeling show promising insights.

AdaEnsemble learns adaptive feature interactions for CTR prediction.

problem Learning feature interactions for CTR prediction in recommender systems and Ads ranking.
method AdaEnsemble is a Sparsely-Gated Mixture-of-Experts (SparseMoE) architecture that dynamically selects feature interaction depth.
result AdaEnsemble achieves better prediction accuracy and inference efficiency compared to state-of-the-art models.

The generalized partially linear additive model (GPLAM) is a flexible and interpretable approach to building predictive models. It combines features in an additive manner, allowing each to have either a linear or nonlinear effect on the response. However, the choice of which features to treat as linear or nonlinear is …

2014-07-17abs ↗pdf ↗

xDeepInt learns both vector-wise and bit-wise feature interactions.

problem Learning feature interactions for CTR prediction and recommendation.
method Polynomial Interaction Network (PIN) architecture with subspace-crossing mechanism.
result xDeepInt outperforms state-of-the-art models in CTR prediction and recommendation.

To date, attribute discretization is typically performed by replacing the original set of continuous features with a transposed set of discrete ones. This paper provides support for a new idea that discretized features should often be used in addition to existing features and as such, datasets should be extended, and n…

2018-02-09abs ↗pdf ↗

MBExplainer provides explanations for models combining graph embeddings and tabular features.

problem Explaining models using a mix of graph embeddings and tabular features.
method Model-agnostic approach using Shapley values and Monte Carlo Tree Search.
result MBExplainer efficiently finds human-readable explanations for model predictions.