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

Trend · papers per month

164328491655 · Jun 202019922001200920172026
48 results for Bayesian feature selection

Bayesian QFSTS model tackles feature selection in quantile time series analysis.

problem Quantile feature selection in correlated multivariate time series data.
method Bayesian dimension reduction methodology using QFSTS model with multivariate asymmetric Laplace distribution, spike-and-slab prior, Metropolis-Hastings algorithm, and Bayesian model averaging.
result QFSTS model outperforms in feature selection, parameter estimation, and forecasting.

Bayesian neural network improves feature selection and prediction.

problem Improving feature selection and prediction accuracy in neural networks.
method BNN-ARD with l2-norm feature importance measure.
result Improves variable selection and predictive performance on real-world data.

Proposes a new method for feature selection using Bayesian ID with intervention.

problem Feature selection in data with varying importance.
method Probabilistic model for interpolative decomposition with Bayesian inference and Gibbs sampling.
result The proposed Bayesian ID algorithm with intervention selects features with higher priority and comparable reconstructive errors.

Gaussian OBFS proves strong consistency in feature selection with correlations.

problem Feature selection consistency in the presence of correlations.
method Proves strong consistency of Gaussian OBFS under mild conditions.
result Identifies selected features and rates of convergence for different feature types.

VFDS selects dynamic features for efficient HAR tasks, optimizing performance-cost trade-offs.

problem Optimizing feature selection for varying costs and dynamic contexts in machine learning tasks.
method Bayesian learning framework with variational dynamic selection policy.
result VFDS selects different features under changing contexts, saving sensory costs while maintaining HAR accuracy.

Bayesian principles improve neural additive models for better feature selection and uncertainty.

problem Lack of calibrated uncertainties and feature selection in neural additive models.
method Augmenting NAMs with Bayesian principles to provide credible intervals, feature selection, and interaction ranking.
result Improved performance on tabular datasets and real-world medical tasks.

Sparse Bayesian learning is a state-of-the-art supervised learning algorithm that can choose a subset of relevant samples from the input data and make reliable probabilistic predictions. However, in the presence of high-dimensional data with irrelevant features, traditional sparse Bayesian classifiers suffer from perfo…

2016-09-18abs ↗pdf ↗

Enhances FA framework for heterogeneous data with feature selection and semi-supervised learning.

problem Feature extraction and latent representation of heterogeneous data.
method Sparse Semi-supervised Heterogeneous Interbattery Bayesian Analysis (SSHIBA) framework.
result SSHIBA outperforms state-of-the-art algorithms and shows interpretability gains.

In many real-world scenarios where data is high dimensional, test time acquisition of features is a non-trivial task due to costs associated with feature acquisition and evaluating feature value. The need for highly confident models with an extremely frugal acquisition of features can be addressed by allowing a feature…

2019-09-15abs ↗pdf ↗

Novel Bayesian model improves EEG-based BCI character selection.

problem Accurately identifying target-related responses in EEG-based BCIs.
method Probit-link Split-and-merge Gaussian Process (P-SMGP) prior for feature selection.
result Reduces computational complexity and provides interpretable statistical interpretations.

Bayesian neural networks are compressed using feature and weight pruning based on posterior inclusion probabilities.

problem Efficiently compressing Bayesian neural networks to reduce computation cost and improve generalizability.
method Bayesian model selection principles are applied to obtain posterior inclusion probabilities for pruning and feature selection.
result Pruned models show better generalizability on simulated and real-world data.

Bayesian TNKMs automatically infer model complexity and feature relevance.

problem Manual tuning of TN rank and feature dimensions is error-prone and computationally expensive.
method Bayesian approach with hierarchical priors on TN factors for automatic rank and feature selection.
result Superior performance in prediction accuracy, uncertainty quantification, interpretability, and scalability.

Bayesian neural networks explore rare fluctuations for better feature learning.

problem Understanding rare but dominant fluctuations in Bayesian neural networks.
method Large-deviation theory and joint optimization over predictors and internal kernels.
result Posterior rate function optimization reveals data-dependent kernel selection.

FBMS R package simplifies Bayesian model selection and averaging.

problem Complex regression settings with multi-modal posterior landscapes.
method Efficient MJMCMC and GMJMCMC algorithms for Bayesian model exploration.
result FBMS effectively handles Bayesian generalized linear and nonlinear models.

There is no known efficient method for selecting k Gaussian features from n which achieve the lowest Bayesian classification error. We show an example of how greedy algorithms faced with this task are led to give results that are not optimal. This motivates us to propose a more robust approach. We present a Branch and …

2012-10-19abs ↗pdf ↗

Bayesian framework selects features and lags for time series forecasting.

problem Variable selection and lagged error term identification in time series models.
method Hierarchical Bayesian models with spike-and-slab priors, two-stage MCMC algorithm.
result Posterior selection consistency under mild conditions, improved predictive performance.

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…

2019-09-09abs ↗pdf ↗

Incorporating feature selection into a classification or regression method often carries a number of advantages. In this paper we formalize feature selection specifically from a discriminative perspective of improving classification/regression accuracy. The feature selection method is developed as an extension to the r…

2013-01-16abs ↗pdf ↗

Feature selection is an important task in many problems occurring in pattern recognition, bioinformatics, machine learning and data mining applications. The feature selection approach enables us to reduce the computation burden and the falling accuracy effect of dealing with huge number of features in typical learning …

2016-08-29abs ↗pdf ↗

In this paper, we examine previous work on the naive Bayesian classifier and review its limitations, which include a sensitivity to correlated features. We respond to this problem by embedding the naive Bayesian induction scheme within an algorithm that c arries out a greedy search through the space of features. We hyp…

2013-02-27abs ↗pdf ↗

BayesBoost combines boosting and Bayesian methods for linear mixed models, improving uncertainty estimation and variable selection.

problem Lack of straightforward uncertainty estimation for parameters in high-dimensional linear mixed models.
method BayesBoost: Combines boosting and Bayesian inference for linear mixed models.
result Improves uncertainty estimation and variable selection in linear mixed models.

Cost-effective feature selection improves network model choice.

problem Selecting informative features from noisy candidates in network models.
method Adapted feature selection methods to account for feature costs and used pilot simulations.
result Reduced computational cost by two orders of magnitude without sacrificing model accuracy.

In this paper, we aim to develop a unified view of causal and non-causal feature selection methods. The unified view will fill in the gap in the research of the relation between the two types of methods. Based on the Bayesian network framework and information theory, we first show that causal and non-causal feature sel…

2018-02-16abs ↗pdf ↗

The paper evaluates company investment value using machine learning models.

problem Evaluating the investment value of companies based on machine learning.
method Data mining, feature selection, cross-validation, stacking model, Bayesian Ridge Regression.
result The RMSE of the final model is 3.047, indicating improved stability and generalization.

Bayesian method identifies causal sets across populations without graph knowledge.

problem Transporting causal information across populations without causal graph knowledge.
method Combines observational and experimental data to identify s-admissible backdoor sets.
result Proves asymptotic convergence and corrects transportability bias in simulations.

PliableBVS extends Bayesian lasso for modeling interactions with modifying variables.

problem Modeling interactions between large and small sets of variables, especially in omics studies.
method Bayesian variable selection with spike-and-slab priors and hierarchical structure.
result PliableBVS outperforms pliable lasso in identifying active main and interaction effects.

Automated feature selection is important for text categorization to reduce the feature size and to speed up the learning process of classifiers. In this paper, we present a novel and efficient feature selection framework based on the Information Theory, which aims to rank the features with their discriminative capacity…

2016-02-09abs ↗pdf ↗

SVB method provides scalable Bayesian proportional hazards model for high-dimensional gene expression data.

problem Bayesian methods for high-dimensional sparse survival data often sacrifice uncertainty quantification or computational scalability.
method Mean-field variational approximation for scalable Bayesian proportional hazards model.
result SVB method offers posterior distribution for parameters and variable selection via posterior inclusion probabilities.

A common strategy for sparse linear regression is to introduce regularization, which eliminates irrelevant features by letting the corresponding weights be zeros. However, regularization often shrinks the estimator for relevant features, which leads to incorrect feature selection. Motivated by the above-mentioned issue…

2015-09-03abs ↗pdf ↗

Bayesian Cox model identifies biomarkers from multi-omics data.

problem Produce interpretable survival prognosis from multi-omics data.
method Penalized semiparametric Bayesian Cox model with graph-structured selection priors.
result Model identifies new biomarkers and improves survival prediction.

Bayesian-guided method selects optimal design from large candidate pool.

problem Optimizing complex structures with high-fidelity evaluations.
method Bayesian active learning with surrogate modeling.
result Optimal design identified with minimal oracle evaluations.

Proposes a new algorithm for Sparse Bayesian Learning connected to Stepwise Regression.

problem Sparse Bayesian Learning for probabilistic models.
method Coordinate ascent algorithm (RMP) for SBL, showing connection to Stepwise Regression.
result RMP's noise variance parameter limit connects to Stepwise Regression, with derived guarantees.

Infinite BART model selects number of trees and allows different functions for clusters.

problem Regression and classification analysis with automatic tree selection and cluster-specific functions.
method Incorporates an Indian Buffet process prior to select a subset of decision trees for each observation.
result Infinite BART model outperforms classic BART on simulated and real datasets.

This work analyzes tree-based methods from a ranking perspective, providing insights and new statistics.

problem Understanding the effectiveness of tree-based methods in finite-sample settings, especially symbolic feature selection.
method Local ranking perspective, finite-sample analysis, oracle bounds, posterior contraction results, concordant divergence statistics.
result New insights and statistics for evaluating symbolic feature mappings.