Proposes PFCVMLP for feature selection and classification.
problem Performance degradation and low efficiency of traditional sparse Bayesian classifiers in high-dimensional data.
method Sparse Bayesian embedded feature selection method using truncated Gaussian distributions.
result PFCVMLP improves classification performance and feature selection effectiveness.
Value selection reduces model size while maintaining accuracy.
problem Space efficiency in model size reduction.
method Two probabilistic methods based on information theory's metric: PVS and P + VS.
result Value selection achieves balance between accuracy and model size reduction.
A new feature selection method for semi-supervised learning with imperfect labels.
problem Feature selection for semi-supervised learning with imperfectly labeled data.
method Genetic algorithm for proposing feature subsets, probabilistic error model for mislabeling, multi-class C-bound selection criterion.
result Empirical results show the effectiveness of the proposed framework compared to state-of-the-art approaches.
Paper proposes a framework for probabilistic load forecasting by integrating point forecasts.
problem Short-term load forecasting for power systems energy management.
method Two-stage framework: first stage for point forecasting, second stage for probabilistic forecasting using feature integration.
result Numerical results show effectiveness of the proposed approach in hour-ahead load forecasting.
New method enforces encoder sparsity in HPF for more interpretable feature selection.
problem Lack of encoder sparsity in HPF leads to lack of column-clustering property.
method Enforces encoder sparsity using a generalized additive model (GAM).
result Gains ability to perform feature selection and relates each representation to original features.
GSPPCA selects relevant features in high-dimensional data.
problem Difficulty in interpreting sparse principal components.
method Bayesian probabilistic PCA with a relaxation for model selection.
result GSPPCA identifies relevant variables with the same sparsity pattern.
This paper improves SVM prediction uncertainty quantification methods.
problem Lack of comprehensive UQ methods for SVM predictions.
method Developed SSVQR model for sparse PI estimation and feature selection algorithm.
result Proposed SSVQR model achieves sparse solutions and improves PI quality.
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.
The paper explores features from orderbooks to improve intraday electricity price forecasting.
problem Improving probabilistic forecasting of intraday electricity prices.
method Extracted 384 features from orderbooks, selected powerful features, and benchmarked models across two countries and product types.
result Revealed an asymmetric generalization phenomenon in electricity price forecasting models.
Deep learning uses layers of transformations to predict structured data with uncertainty.
problem Predicting structured high-dimensional data efficiently and with uncertainty.
method Applying layers of semi-affine input transformations to find features for probabilistic statistical methods.
result Achieves scalable prediction rules with uncertainty quantification and feature selection.
New method selects features more sparsely than lasso.
problem Feature selection in high-dimensional data.
method Horseshoe regularization penalty for non-convex optimization.
result Better statistical performance and faster computation.
Efficiently predict LLM benchmarks using feature selection and regression.
problem Predicting full benchmark scores with minimal question subsets.
method Multiple regression with feature selection, using kernel ridge regression and mRMR.
result Improved prediction accuracy and ranking correlation across various benchmarks.
New robustness metric helps select reliable classifiers.
problem Evaluating reliability of classifier predictions.
method Proposed new robustness metric for any classifier and feature type.
result Demonstrated ability to distinguish reliable from unreliable predictions.
This paper investigates two feature-scoring criteria that make use of estimated class probabilities: one method proposed by \citet{shen} and a complementary approach proposed below. We develop a theoretical framework to analyze each criterion and show that both estimate the spread (across all values of a given feature)…
New probabilistic approaches offer recourse recommendations even when causal models are imperfect.
problem Limited causal knowledge makes guaranteeing algorithmic recourse impossible.
method Two probabilistic approaches: Bayesian model averaging and average effect computation.
result Probabilistic approaches lead to more reliable recourse recommendations.
New method provides calibrated feature importance explanations for regression models.
problem Lack of uncertainty quantification in existing local explanation methods.
method Extension of Calibrated Explanations method to support regression and probabilistic regression.
result Calibrated Explanations for regression provides quantified uncertainty and robust explanations.
The paper proposes a method to improve prediction accuracy by querying expert knowledge sequentially.
problem Prediction in high-dimensional settings with limited samples and costly expert consultation.
method Formulates knowledge elicitation as a probabilistic inference process, sequentially querying experts to improve predictions.
result The method shows improved prediction accuracy with minimal expert effort.
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.
We present a unifying framework which reduces the construction of probabilistic component analysis techniques to a mere selection of the latent neighbourhood, thus providing an elegant and principled framework for creating novel component analysis models as well as constructing probabilistic equivalents of deterministi…
New neural network model measures systematic risk without feature engineering.
problem Measuring systematic risk with limited prior knowledge.
method Neural network factor model that automatically selects suitable factors.
result Achieves performance comparable to existing models without feature engineering.
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.
EBBS integrates expert assessments into MIO best-subsets problem.
problem Identifying relevant features in statistical models.
method Expert-implied Bayesian approach using MIO.
result Reduces to classical best-subsets when experts are silent.
Probabilistic Boolean tensor decomposition improves accuracy and scalability.
problem Approximating multi-way binary data with interpretable low-rank factors.
method Scalable sampling-based posterior inference exploiting combinatorial structure.
result Maximum a posteriori decompositions outperform existing techniques.
Probabilistic k-nearest neighbour (PKNN) classification has been introduced to improve the performance of original k-nearest neighbour (KNN) classification algorithm by explicitly modelling uncertainty in the classification of each feature vector. However, an issue common to both KNN and PKNN is to select the optimal n…
The problem of joint feature selection across a group of related tasks has applications in many areas including biomedical informatics and computer vision. We consider the l2,1-norm regularized regression model for joint feature selection from multiple tasks, which can be derived in the probabilistic framework by assum…
Study proposes a hybrid method for medium-term load forecasting.
problem Accurate medium-term load forecasting for power system operation and planning.
method Support Vector Regression (SVR) combined with Symbiotic Organism Search Optimization (SOSO) for parameter optimization and feature selection.
result The proposed method outperformed previous methods in the EUNITE competition dataset.
A new probabilistic model detects communities in networks using both structure and node features.
problem Detecting communities in networks with node features for more accurate results.
method Generative probabilistic model considering network structure and node features.
result The model accurately detects communities and determines feature strength.
A method for selecting data for short-term load forecasting using Bayesian probabilistic models.
problem Lack of effective data selection techniques in power load forecasting.
method A fully automatic methodology based on a full Bayesian probabilistic model.
result The method improves the performance of load forecast models using real data.
This work improves understanding of dimension reduction algorithms and their probabilistic embeddings.
problem Improving theoretical understanding of non-linear dimension reduction algorithms.
method Analytical investigation of a generalized multidimensional scaling optimization problem.
result Probabilistic formulation of the problem leads to deterministic embeddings, contrary to standard implementations.
New scoring rules improve probabilistic classification model evaluation.
problem Traditional scoring rules misalign with the preference for correct classifications.
method Introduces Penalized Brier Score (PBS) and Penalized Logarithmic Loss (PLL) to modify proper scoring rules.
result PBS and PLL better identify optimal checkpoints and early stopping points, leading to superior F1 scores.
Generative model learns multi-layer features from images.
problem Learning multi-layer features from images.
method Probabilistic pooling operation integrated into deep convolutional learning.
result Excellent classification results on MNIST and Caltech 101 datasets.
PSI models and infers feature attributions efficiently and accurately.
problem Modeling and inferring feature attributions in flexible predictive models.
method Probabilistic Shapley inference (PSI) framework using latent random variables and a masking-based neural network architecture.
result PSI learns feature attribution distributions centered at Shapley values, revealing meaningful uncertainty.
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.
Model selects and generates music rules for realization and understanding.
problem Selecting and generating music rules that follow given constraints.
method Formulated as a bi-convex problem, derived efficient algorithm.
result Demonstrated model's effectiveness in music composition and analysis.
The paper automates machine learning pipelines using probabilistic matrix factorization and Bayesian optimization.
problem Automating the selection and tuning of machine learning pipelines.
method Combining collaborative filtering and Bayesian optimization with probabilistic matrix factorization.
result The approach quickly identifies high-performing pipelines across various datasets, significantly outperforming state-of-the-art methods.
Improves BN graph learning with splines for scalability.
problem Learning accurate BN graph structures from data.
method Score-and-search approach with MARS for CPD modeling.
result Improves BN graph accuracy and scalability.
Develops an online group feature selection method considering feature stream structure.
problem Online feature selection ignoring feature group structure.
method Formulates online group feature selection problem; develops OGFS method with intra-group and inter-group selection stages.
result Our method outperforms state-of-the-art methods in multiple tasks.
Counterexamples show HSIC feature selection misses critical features.
problem Feature selection using HSIC misses important features.
method Feature selection via HSIC maximization.
result HSIC feature selection can miss critical features.
DynamicPPL speeds up probabilistic modeling in Julia.
problem Developing and executing complex dynamic probabilistic models efficiently.
method Modular Julia library with a DSL, tracing data structure, and contextual dispatch.
result Achieves computational performance close to or better than Stan.
UniFeat is an open-source Java tool for feature selection.
problem Efficient feature selection in various research areas.
method Provides a set of advanced feature selection methods.
result Facilitates rapid development of new feature selection algorithms.
AEFS selects features from high-dimensional data using autoencoders.
problem Feature selection for high-dimensional data in computer vision and machine learning.
method Combines autoencoder regression and group lasso for unsupervised feature selection.
result AEFS selects more important features than traditional methods, including linear and nonlinear information.
Gradient Boosted Feature Selection (GBFS) selects features reliably and scales well.
problem Feature selection in complex datasets.
method Gradient Boosted Trees modification.
result GBFS outperforms other feature selection algorithms on real-world data.
Introduces greedy feature selection for classifier-dependent feature ranking.
problem Feature selection for classification tasks.
method Greedy feature selection, identifying the most important feature at each step based on the selected classifier.
result Theoretical and numerical benefits of greedy feature selection.
This work combines recurrent models with diffusion for probabilistic time series forecasting.
problem Scalability and capturing high-dimensional distributions and cross-feature dependencies in time series forecasting.
method Combines recurrent neural networks' efficiency with diffusion models' probabilistic modeling, using stochastic interpolants and conditional generation.
result Offers scalable probabilistic time series forecasting methods.
A new method selects optimal PHMM models for sequence alignment, improving accuracy.
problem Improving sequence alignment accuracy using PHMMs with optimal hidden states.
method Factorized Asymptotic Bayesian algorithm (FIC) for model selection.
result Improved alignment accuracy with more complex models than previous studies.
Paper proposes a novel unsupervised feature selection method using K-means and ADMM.
problem Finding a subset of features for high-dimensional unsupervised learning problems.
method Developed K-means Derived Unsupervised Feature Selection (K-means UFS) using ADMM to solve NP-hard optimization.
result K-means UFS outperforms baselines in feature selection for clustering.
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.
NGP selects N features from P using neural networks in a greedy, iterative process.
problem Feature selection for non-linear prediction problems.
method Neural Greedy Pursuit (NGP) algorithm, selecting features sequentially in an iterative loss minimization procedure.
result NGP provides better performance than DeepLIFT and Drop-one-out loss methods.