Online feature selection has been an active research area in recent years. We propose a novel diverse online feature selection method based on Determinantal Point Processes (DPP). Our model aims to provide diverse features which can be composed in either a supervised or unsupervised framework. The framework aims to pro…
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,695 papers · 148 categories
Trend · papers per month
48 results for “no feature diversity”
New algorithms for model selection in linear contextual bandits without feature diversity conditions.
problem Model selection in linear contextual bandits without feature diversity conditions.
method Data-adaptive algorithms that provide model selection guarantees without feature diversity conditions.
result O(d^α T^{1-α}) model selection guarantees with no feature diversity conditions.
Random small feature subsets outperform FS in diverse datasets.
problem The significance of selected features in high-dimensional datasets is questionable.
method Analysis of 28 diverse datasets (microarray, RNA-Seq, etc.).
result Any arbitrary set of features performs as well as or better than selected features across datasets.
New statistical guarantees for transfer learning with diverse tasks.
problem Statistical guarantees for transfer learning across different tasks.
method Formal analysis of tasks with shared representation.
result Sample complexity reduction for new tasks using shared representation.
Diversity and no arbitrageq-fin.PM
A stock market is called diverse if no stock can dominate the market in terms of relative capitalization. On one hand, this natural property leads to arbitrage in diffusion models under mild assumptions. On the other hand, it is also easy to construct diffusion models which are both diverse and free of arbitrage. Can o…
We study a mini-batch diversification scheme for stochastic gradient descent (SGD). While classical SGD relies on uniformly sampling data points to form a mini-batch, we propose a non-uniform sampling scheme based on the Determinantal Point Process (DPP). The DPP relies on a similarity measure between data points and g…
Proposes method to discover diverse near-optimal policies in reinforcement learning.
problem Finding different solutions to the same problem in reinforcement learning.
method Formalizes problem as CMDP, uses Successor Features, proposes new diversity rewards.
result Proposed method discovers diverse near-optimal policies that are robust and distinct.
Standard practice in training neural networks involves initializing the weights in an independent fashion. The results of recent work suggest that feature "diversity" at initialization plays an important role in training the network. However, other initialization schemes with reduced feature diversity have also been sh…
New hyperbolic manifolds with diverse features created.
problem Creating new types of hyperbolic manifolds.
method Using cubulations and hyperbolization procedures.
result First examples of hyperbolic manifolds with non-trivial Stiefel-Whitney and Pontryagin classes.
This work explores how XAI methods can visualize the diversity of feature representations in Bayesian Neural Networks.
problem Explaining the diversity of feature representations learned by Bayesian Neural Networks.
method Application of global XAI methods to visualize and quantify the diversity of feature representations.
result The diversity of learned feature representations correlates with uncertainty estimates and network width.
Beyond Signal Propagation: Is Feature Diversity Necessary in Deep Neural Network Initialization?cs.LG
New method shows random, diverse initializations are not essential for deep neural networks.
problem The necessity of random, diverse initializations in deep neural networks.
method Constructed a deep convolutional network with identical features by initializing weights to 0, enabling signal propagation and stable gradients.
result Random, diverse initializations are not necessary for training neural networks.
HRF enhances tree diversity in random forests to improve performance.
problem Selection bias and lack of diversity in random forests.
method Introducing heterogeneity during tree construction by assigning lower weights to features used in previous trees.
result HRF outperforms other ensemble methods in accuracy across 52 datasets.
We propose a novel diverse feature selection method based on determinantal point processes (DPPs). Our model enables one to flexibly define diversity based on the covariance of features (similar to orthogonal matching pursuit) or alternatively based on side information. We introduce our approach in the context of Bayes…
Semi-automatic data annotation helps experts label unlabeled samples based on feature space projection.
problem Laborious manual data annotation for machine learning.
method Interactive semi-automatic approach using feature space projection and semi-supervised learning.
result Reduces user annotation effort and improves classification accuracy.
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.
Neural networks are a powerful class of functions that can be trained with simple gradient descent to achieve state-of-the-art performance on a variety of applications. Despite their practical success, there is a paucity of results that provide theoretical guarantees on why they are so effective. Lying in the center of…
Study compares single vs ensemble feature selection for cancer diagnosis.
problem Identifying relevant variables for cancer diagnosis and prognosis.
method Comparison of single feature selection algorithms and ensemble of diverse algorithms.
result Ensemble approach did not improve predictive performance over individual algorithms.
Paper uses VAEs to control IVS features for financial modeling.
problem Generating realistic IVSs with desired characteristics.
method Variational autoencoder architecture with controllable latent variables.
result Controlled generation of IVSs with specified features.
Exposing flaws of generative model evaluation metrics and their unfair treatment of diffusion modelscs.LG
Study flaws in generative model evaluation metrics, especially for diffusion models.
problem Flaws in existing metrics for evaluating generative models, particularly for diffusion models.
method Systematic study of generative models, human perception experiments, and analysis of feature extractors.
result State-of-the-art perceptual realism of diffusion models is not reflected in commonly reported metrics.
Bayesian model fuses diverse microbiome data types.
problem Challenges in fusing different types of microbiome data.
method Flexible multinomial-Gaussian generative model with variational EM algorithm.
result Inferred latent variables provide common dimensionality reduction and predictive posterior distribution.
GEMSS discovers multiple sparse solutions in high-dimensional data.
problem Identifying multiple sparse feature combinations in high-dimensional, underdetermined systems.
method GEMSS (Gaussian Ensemble for Multiple Sparse Solutions) uses a structured spike-and-slab prior, mixture of Gaussians, and Jaccard-based penalty to optimize a single objective function via stochastic gradient descent.
result GEMSS consistently outperforms five feature selection methods on 128 experiments and real-world datasets.
Enhances model OOD detection by diversifying feature representation.
problem Limited diversity in model ensembles for OOD detection.
method Integrates diverse training tasks into model ensembles to generate distinct feature representations.
result Superior performance of Multi-Comprehension Ensemble in OOD detection.
Safe-DRFS selects features robust to covariate shifts for reliable performance.
problem Feature selection fails in diverse deployment environments.
method Safe-DRFS extends safe screening to distributionally robust settings under covariate shift.
result Safe-DRFS identifies a feature subset encompassing optimal subsets across distribution shifts.
Introduce a variance-weighted batch distribution for diverse sampling in diffusion models.
problem Independent sampling in diffusion models.
method Introduce a variance-weighted batch distribution.
result Sampler with a transparent probabilistic target.
Study shows diverse data sources improve cryptocurrency forecasting models.
problem Improving cryptocurrency market forecasting accuracy.
method Integrating various data types, including on-chain metrics, traditional indices, and macroeconomic indicators.
result Data source diversity significantly enhances forecasting model performance.
The two key players in Generative Adversarial Networks (GANs), the discriminator and generator, are usually parameterized as deep neural networks (DNNs). On many generative tasks, GANs achieve state-of-the-art performance but are often unstable to train and sometimes miss modes. A typical failure mode is the collapse o…
Proves efficient learning of hierarchical structure in meta-reinforcement learning.
problem Lack of provable guarantees for learning hierarchical structures in reinforcement learning.
method Analyzed HRL in meta-RL setting with tabular transition dynamics, providing diversity conditions and regret bounds.
result Sample-efficient recovery of natural hierarchical structure with provable guarantees.
A financial market is called "diverse" if no single stock is ever allowed to dominate the entire market in terms of relative capitalization. In the context of the standard Ito-process model initiated by Samuelson (1965) we formulate this property (and the allied, successively weaker notions of "weak diversity" and "asy…
BOP-Elites uses Bayesian Optimisation for QD search, improving efficiency and insight.
problem Finding diverse high-performing points from an objective function.
method Bayesian Optimisation and Gaussian Processes to model quality and diversity.
result Significantly more sample efficient and better at identifying niche solutions.
In 1999 Robert Fernholz observed an inconsistency between the normative assumption of existence of an equivalent martingale measure (EMM) and the empirical reality of diversity in equity markets. We explore a method of imposing diversity on market models by a type of antitrust regulation that is compatible with EMMs. T…
Supporting evidence for adaptive feature program across diverse models.
problem Analyzing feature learning in neural networks.
method Over-parameterized sequence models and feature error measure (FEM).
result FEM is decreasing during training of adaptive feature models.
Paper presents a deterministic method for diverse subset selection.
problem Diverse subset selection problems in recommendation, summarization, and search.
method Greedy deterministic adaptation of k-DPP for low-rank approximations and image search.
result The method yields low-rank approximations of kernel matrices and demonstrates effectiveness in image search.
NOs can learn any finite collection of classes in functional data.
problem Learning finite collections of classes in infinite-dimensional spaces.
method Proved sample-based neural operators can learn any finite collection of classes in an infinite-dimensional reproducing kernel Hilbert space.
result NOs can learn any finite collection of classes in an infinite-dimensional reproducing kernel Hilbert space, even when the classes are not convex or connected.
MxPool learns graph features from diverse graphs using a hierarchical structure.
problem Learning graph features from diverse graphs with varying properties and sizes.
method MxPool uses a multiplex structure with multiple graph convolution/pooling networks in a hierarchical learning structure.
result MxPool outperforms state-of-the-art methods on graph classification benchmarks.
Prediction tasks over nodes and edges in networks require careful effort in engineering features used by learning algorithms. Recent research in the broader field of representation learning has led to significant progress in automating prediction by learning the features themselves. However, present feature learning ap…
Jigsaw-VAE tackles feature imbalance in VAE latent variables, improving generalization across environments.
problem Feature imbalance in VAE latent variables leads to poor generalization and biased sample generation.
method Proposes a regularization scheme to balance features in VAE latent variables and introduces a metric to measure balance.
result The regularization scheme substantially addresses feature imbalance, leading to improved generalization and diverse sample generation.
Multivariate functional data from a complex system are naturally high-dimensional and have complex cross-correlation structure. The complexity of data structure can be observed as that (1) some functions are strongly correlated with similar features, while some others may have almost no cross-correlations with quite di…
Study finds optimal board gender diversity for emissions performance.
problem Association between board gender diversity and emissions performance.
method Panel regressions, machine learning, explainable AI.
result Optimal board gender diversity for emissions performance is approximately 35%.
Presents STRIPE model for probabilistic forecasting of non-stationary time series.
problem Probabilistic forecasting of non-stationary time series.
method STRIPE model representing structured diversity based on shape and time features, with diversification mechanism using determinantal point processes (DPP).
result STRIPE significantly outperforms baseline methods for representing diversity while maintaining forecasting accuracy.
There are many problems in machine learning and data mining which are equivalent to selecting a non-redundant, high "quality" set of objects. Recommender systems, feature selection, and data summarization are among many applications of this. In this paper, we consider this problem as an optimization problem that seeks …
GANs mode collapse solved with Bures distance.
problem GANs mode collapse or mode dropping.
method Use Bures distance to match real and fake batch diversity in feature space.
result Diversity matching reduces mode collapse and improves sample quality.
MAP-Elites generates diverse trading strategies for improved execution performance.
problem Optimizing trading execution schedules in volatile market conditions.
method Quality-diversity algorithm (MAP-Elites) generating a portfolio of specialized strategies.
result Diverse strategies achieve 8-10% performance improvements, validating quality-diversity methods.
Kernel sparsity ("dying ReLUs") and lack of diversity are commonly observed in CNN kernels, which decreases model capacity. Drawing inspiration from information theory and wireless communications, we demonstrate the intersection of coding theory and deep learning through the Grassmannian subspace packing problem in CNN…
When Features Beat Noise: A Feature Selection Technique Through Noise-Based Hypothesis Testingstat.ML
A novel feature selection method using noise-based hypothesis testing improves feature selection accuracy.
problem Challenges in feature selection for complex, high-dimensional datasets.
method Introduces multiple random noise features and evaluates feature importance against noise feature maxima using non-parametric bootstrap-based hypothesis testing.
result Outperforms existing methods in simulated and real-world datasets.
Adaptive kernel approach learns causal effects from diverse data sources.
problem Learning causal effects from multiple, decentralized data sources in a federated setting.
method Adaptive transfer algorithm using Random Fourier Features to estimate similarities and disentangle loss function components.
result Empirically outperforms baselines on decentralized data sources with different distributions.
AutoFS combines trainers to improve feature selection efficiency and effectiveness.
problem Balancing feature selection efficiency and effectiveness.
method Interactive Reinforced Feature Selection (IRFS) framework with diverse trainers.
result Improved feature selection efficiency and effectiveness compared to existing methods.
New method selects causal features from diverse data types.
problem Discovering causal relationships from non-continuous data types.
method Transformation-Model (TRAM) based Invariant Causal Prediction (TRAM-ICP) with TRAM-GCM and TRAM-Wald tests.
result Improved power and type I error control for diverse response types.
The explosion of time series data in recent years has brought a flourish of new time series analysis methods, for forecasting, clustering, classification and other tasks. The evaluation of these new methods requires either collecting or simulating a diverse set of time series benchmarking data to enable reliable compar…