arXiv research

This research reverses feature visualization in neural networks to optimize for specific feature objectives.

A new framework learns system design using neural features in function space.

We propose an optimal transport (OT) framework for generalized zero-shot learning (GZSL), seeking to distinguish samples for both seen and unseen classes, with the assist of auxiliary attributes. The discrepancy between features and attributes is minimized by solving an optimal transport problem. {Specifically, we buil…

Optimal Bayesian feature filtering (OBF) is a supervised screening method designed for biomarker discovery. In this article, we prove two major theoretical properties of OBF. First, optimal Bayesian feature selection under a general family of Bayesian models reduces to filtering if and only if the underlying Bayesian m…

GOTEX synthesizes textures by optimizing feature distributions using optimal transport.

Quantum computing improves feature selection in machine learning.

Optimized fuzzy entropy framework improves feature selection and classification performance.

Optimal feature transfer identified through bias-variance analysis.

The paper tackles fair classification with multiple sensitive features.

This paper uses MIO to select features for kernel SVM classification.

Proposes FROT for high-dimensional data, avoiding curse of dimensionality.

A new method for dynamic feature selection outperforms existing approaches.

Framework optimizes model performance and interpretability for tabular data.

Paper proposes a new method to optimize feature coordinates for better image classification.

Automates feature selection and weighting in molecular systems.

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…

A single pre-trained agent guides feature selection using knockoffs.

We propose a method for finding alternate features missing in the Lasso optimal solution. In ordinary Lasso problem, one global optimum is obtained and the resulting features are interpreted as task-relevant features. However, this can overlook possibly relevant features not selected by the Lasso. With the proposed met…

Despite their success, kernel methods suffer from a massive computational cost in practice. In this paper, in lieu of commonly used kernel expansion with respect to $N$ inputs, we develop a novel optimal design maximizing the entropy among kernel features. This procedure results in a kernel expansion with respect to en…

Optimizes feature shifts for tree ensemble reclassification.

Tree ensemble kernels improve Bayesian optimization for mixed features and constraints.

In this paper, a genetic algorithm-based frequency-domain feature search (GAFDS) method is proposed for the electroencephalogram (EEG) analysis of epilepsy. In this method, frequency-domain features are first searched and then combined with nonlinear features. Subsequently, these features are selected and optimized to …

DFIV uses deep features for IV regression, achieving optimal rates.

A general formulation of optimization problems in which various candidate solutions may use different feature-sets is presented, encompassing supervised classification, automated program learning and other cases. A novel characterization of the concept of a "good quality feature" for such an optimization problem is pro…

A novel feature selection method for SVM improves model accuracy and interpretability.

This study addresses an issue of co-adaptation between a feature extractor and a classifier in a neural network. A naive joint optimization of a feature extractor and a classifier often brings situations in which an excessively complex feature distribution adapted to a very specific classifier degrades the test perform…

Kernel methods linked to feature subspaces and maximal correlation kernels.

In machine learning, Feature Selection (FS) is a major part of efficient algorithm. It fuels the algorithm and is the starting block for our prediction. In this paper, we present a new method, called Optimal Coordinate Ascent (OCA) that allows us selecting features among block and individual features. OCA relies on coo…

New algorithm reduces feature count and accelerates error convergence.

We prove that, under low noise assumptions, the support vector machine with $N\ll m$ random features (RFSVM) can achieve the learning rate faster than $O(1/\sqrt{m})$ on a training set with $m$ samples when an optimized feature map is used. Our work extends the previous fast rate analysis of random features method from…

Quantum algorithm speeds up learning from big data exponentially.

Both feature selection and hyperparameter tuning are key tasks in machine learning. Hyperparameter tuning is often useful to increase model performance, while feature selection is undertaken to attain sparse models. Sparsity may yield better model interpretability and lower cost of data acquisition, data handling and m…

MadEvolve optimizes trading algorithms using LLMs, achieving significant improvements in feature generation and trading strategy optimization.

Sharp feature transitions revealed in extensive-width networks.

Feature selection can efficiently identify the most informative features with respect to the target feature used in training. However, state-of-the-art vector-based methods are unable to encapsulate the relationships between feature samples into the feature selection process, thus leading to significant information los…

SignSGD outperforms SGD in linear regression with optimal scaling laws under PLRF model.

Random Fourier features classification achieves fast learning rates with fewer features.

Network structure optimization is a fundamental task in complex network analysis. However, almost all the research on Bayesian optimization is aimed at optimizing the objective functions with vectorial inputs. In this work, we first present a flexible framework, denoted graph Bayesian optimization, to handle arbitrary …

In this paper, we propose a deep multimodal fusion network to fuse multiple modalities (face, iris, and fingerprint) for person identification. The proposed deep multimodal fusion algorithm consists of multiple streams of modality-specific Convolutional Neural Networks (CNNs), which are jointly optimized at multiple fe…

Improves decision-making by correcting feature selection bias.

In today world of enormous amounts of data, it is very important to extract useful knowledge from it. This can be accomplished by feature subset selection. Feature subset selection is a method of selecting a minimum number of features with the help of which our machine can learn and predict which class a particular dat…

Feature selection places an important role in improving the performance of outlier detection, especially for noisy data. Existing methods usually perform feature selection and outlier scoring separately, which would select feature subsets that may not optimally serve for outlier detection, leading to unsatisfying perfo…

In [1], we have explored the theoretical aspects of feature selection and evolutionary algorithms. In this chapter, we focus on optimization algorithms for enhancing data analytic process, i.e., we propose to explore applications of nature-inspired algorithms in data science. Feature selection optimization is a hybrid …

Predict covariance from features using convex optimization.

Neural collapse occurs in normalized features over a Riemannian manifold.

FAST optimizes additive segmentation for faster, more interpretable models.

Develops NPSVC++ to improve NPSVC performance through representation learning.

Optimal AFs minimize RFR test error and sensitivity.