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

Trend · papers per month

3857711,1561,541 · Jun 202019922001200920172026
48 results for meta-features learning

The success of machine learning on a given task dependson, among other things, which learning algorithm is selected and its associated hyperparameters. Selecting an appropriate learning algorithm and setting its hyperparameters for a given data set can be a challenging task, especially for users who are not experts in …

2014-07-07abs ↗pdf ↗

Hyperparameter optimization aims to find the optimal hyperparameter configuration of a machine learning model, which provides the best performance on a validation dataset. Manual search usually leads to get stuck in a local hyperparameter configuration, and heavily depends on human intuition and experience. A simple al…

2017-10-17abs ↗pdf ↗

A method for clustering using transfer learning from similar labeled data.

problem Clustering with datasets having different features and labeled data.
method Constructing meta-features to describe structural characteristics of data and transferring them between source and target domains.
result The method is efficient and works under arbitrary feature descriptions of source and target domains with smaller complexity.

In this paper, we propose a novel dynamic ensemble selection framework using meta-learning. The framework is divided into three steps. In the first step, the pool of classifiers is generated from the training data. The second phase is responsible to extract the meta-features and train the meta-classifier. Five distinct…

2018-11-01abs ↗pdf ↗

SYNTHONY selects tabular synthesizers based on stress profiling and user intent.

problem Non-uniform performance of tabular generative models across datasets.
method Stress profiling and intent-conditioned tabular synthesis selection.
result Meta-features predict synthesizer performance, improving selection accuracy.

Auto-sklearn 2.0 simplifies AutoML with meta-learning and meta-feature-free techniques.

problem Designing efficient machine learning pipelines for large datasets under time constraints.
method PoSH Auto-sklearn uses meta-learning and bandit strategy for budget allocation.
result Reduces relative error by up to a factor of 4.5 and improves performance in 10 minutes.

Dynamic ensemble selection systems work by estimating the level of competence of each classifier from a pool of classifiers. Only the most competent ones are selected to classify a given test sample. This is achieved by defining a criterion to measure the level of competence of a base classifier, such as, its accuracy …

2018-09-30abs ↗pdf ↗

Proposes a Siamese NN for algorithm selection focusing on alike performing instances.

problem Lack of effective meta-features for algorithm selection via meta-learning.
method Siamese Neural Network architecture with 'Algorithm-Performance Personas' concept.
result Proposed metric outperforms standard performance metrics in training sample selection.

Meta-learning system predicts when tuning SVM hyperparameters improves performance.

problem High computational cost of hyperparameter tuning for machine learning models.
method Meta-learning recommender system using meta-features and meta-learners.
result Meta-learning system accurately predicts when tuning improves SVM performance.

A new method selects the best feature selection technique for datasets.

problem Selecting the best feature selection method for unseen datasets.
method Data synthesis, meta features, fuzzy similarity, classification model training.
result Successfully recommended the best feature selection method for five out of eight datasets.

Ensembles are popular methods for solving practical supervised learning problems. They reduce the risk of having underperforming models in production-grade software. Although critical, methods for learning heterogeneous regression ensembles have not been proposed at large scale, whereas in classical ML literature, stac…

2018-04-17abs ↗pdf ↗

Proposes TPIS for early and low-cost TB vs. pneumonia diagnosis.

problem Challenges in differentiating TB from pneumonia.
method Two-step decision support system with stacked ensemble classifiers.
result TPIS outperforms other methods in early and final diagnosis.

Fusion framework improves time series classification across different datasets.

problem Kernel-based methods like Rocket perform inconsistently across datasets.
method Fusion-3 framework that adaptively fuses three representations (Rocket, SAX, SFA) based on dataset properties.
result Fusion-3 framework yields small but consistent average improvements over Rocket on 113 UCR datasets.

Meta-learning system recommends best multi-target regression method.

problem Improving predictive performance in multi-target regression problems.
method Developed a meta-learning system to recommend the best multi-target regression method for a given problem.
result Meta-models were able to recommend the best method with a balanced accuracy superior to 70%.

GOTabPFN improves tabular model performance with compact tokenization for HDLSS data.

problem Making tabular models effective for high-dimensional, low-sample size data without retraining.
method Introducing Graph-guided Ordering with Local Refinement (GO-LR) and Neuro-Inspired Subunit Compression (NSC) to create compact meta-features.
result GOTabPFN improves stability and accuracy in tabular benchmarks with compact tokenization.

Auto-CASH uses Deep Q-Network to automatically select machine learning algorithms.

problem Automatic selection of machine learning algorithms and hyperparameters.
method Pre-trained model based on meta-learning using Deep Q-Network.
result Auto-CASH achieves better performance with shorter time compared to classical and state-of-the-art methods.

DRL agents learn to trade Intel stock with stable positive returns.

problem Active high frequency trading in the stock market.
method End-to-end DRL framework using Proximal Policy Optimization, Sequential Model Based Optimization, and LOB-based meta-features.
result DRL agents create dynamic trading strategies with stable positive returns.

Neural architecture search has been shown to hold great promise towards the automation of deep learning. However in spite of its potential, neural architecture search remains quite costly. To this point, we propose a novel gradient-based framework for efficient architecture search by sharing information across several …

2019-02-15abs ↗pdf ↗

A meta-learning approach for efficient algorithm selection in budget-limited scenarios.

problem Efficiently selecting the best-performing machine learning algorithm with limited computational resources.
method A Markov Decision Process framework where an agent decides whether to train, wake up, or start new algorithms based on partial learning curves.
result Meta-learning from learning curves improves algorithm selection, especially when learning curves do not intersect frequently.

MGMC method handles missing data in medical datasets for accurate disease classification.

problem Handling missing data in incomplete medical datasets for accurate disease classification.
method Multigraph Geometric Matrix Completion (MGMC) using multiple graph convolutional networks.
result MGMC achieves superior classification and imputation performance compared to state-of-the-art approaches.

Meta-learning improves neural networks by adapting learning algorithms.

problem Conventional AI approaches solve tasks from scratch, but meta-learning aims to improve the learning algorithm.
method Meta-learning adapts a learning algorithm based on multiple learning episodes.
result Meta-learning can tackle deep learning challenges like data and computation bottlenecks.

Machine learning models adapt to motor learning but face challenges.

problem Adapting machine learning to handle motor variability and differentiate new movements from known ones.
method Parameter adaptation, transfer and meta-learning, reinforcement learning.
result Challenges in applying machine learning models for motor learning support systems.

New method uses bi-level optimization to learn useful representations for imitation learning.

problem Learning useful representations for multiple tasks in imitation learning settings.
method Formulates representation learning as a bi-level optimization problem.
result Bi-level optimization framework provides sample complexity benefits for imitation learning.

Tabular Q-Learning with learned state abstractions solves continuous control tasks.

problem Challenging reinforcement learning problems in continuous control.
method Learned state abstraction to transform continuous state-space into discrete.
result Tabular Q-Learning with learned abstractions achieves efficient learning in unseen tasks.

Study Whittle index learning algorithms for restless bandits with constant stepsizes.

problem Optimizing decisions in restless multi-armed bandits with constant stepsizes.
method Developed Q-learning algorithms with constant stepsizes for index learning in restless bandits, extending to DQN and function approximations.
result The algorithms learn the Whittle index effectively.

New unsupervised learning technique learns independent kernels for better machine learning tasks.

problem Improving unsupervised representation learning for machine learning tasks.
method Stacking convolutional transforms using alternating proximal minimization scheme.
result DCTL outperforms shallow version CTL on benchmark datasets.

New self-imitation learning method improves performance in continuous control tasks.

problem Improving off-policy learning in continuous control tasks.
method Proposes a n-step lower bound to generalize lower-bound Q-learning and introduces a new family of self-imitation learning algorithms.
result n-step lower bound Q-learning achieves a better trade-off between bias and contraction rate, leading to improved performance.

Deep reinforcement learning finds optimal learning policies for adaptive systems.

problem Finding individualized learning plans for learners with unknown latent traits.
method Formulated as a Markov decision process, applied deep Q-learning with a transition model estimator.
result The algorithm efficiently discovers optimal learning policies with small data sets.