New Bayesian method for joint sparse parameter inference.
problem Inference of jointly sparse parameter vectors from multiple measurements.
method Hierarchical Bayesian learning with joint sparsity-promoting priors.
result New algorithms consistently outperform existing methods in numerical experiments.
Bayesian framework for encoding uncertainty and inducing sparsity.
problem Handling uncertainty and inducing sparsity in statistical models.
method General Bayesian framework with explicit encoding of uncertainty and sparsity-inducing approach.
result Effective in linear and logistic regression, and Bayesian neural networks.
Sparse Bayesian Optimization (SEBO) finds interpretable configurations.
problem Optimizing black-box functions for recommendation systems while maintaining interpretability.
method Regularization-based approaches, including a differentiable relaxation for L0 regularization, and a hyperparameter-free method SEBO. result SEBO efficiently optimizes for sparsity without hyperparameters.
Develops a sparsity-inducing Bayesian Causal Forest for estimating heterogeneous treatment effects.
problem Estimating heterogeneous treatment effects using observational data with varying degrees of sparsity.
method Introduces a sparsity-inducing version of Bayesian Causal Forests with additional priors to adjust covariate weights.
result Improves adaptability to sparse data generating processes and uncovering moderating factors driving heterogeneity.
This paper reviews Bayesian methods for sparsity-aware modeling.
problem Uncertainty evaluation and robustness in sparsity-aware models.
method Incorporates sparsity-promoting priors into deep neural networks, Gaussian processes, and tensor decomposition.
result Bayesian methods improve model robustness and uncertainty evaluation.
A test for sparsity in Bayesian networks helps choose algorithms.
problem Selecting appropriate structure discovery algorithms for Bayesian networks.
method Developed a hypothesis test using the largest eigenvalue of the normalized inverse covariance matrix.
result The hypothesis test can determine if a BN has max in-degree greater than 1.
Sparsity-promoting priors have become increasingly popular over recent years due to an increased number of regression and classification applications involving a large number of predictors. In time series applications where observations are collected over time, it is often unrealistic to assume that the underlying spar…
The use of L1 regularisation for sparse learning has generated immense research interest, with successful application in such diverse areas as signal acquisition, image coding, genomics and collaborative filtering. While existing work highlights the many advantages of L1 methods, in this paper we find that L1 regularis…
Proposes a tail-adaptive shrinkage method for robust sparse estimation.
problem Robust Bayesian methods for high-dimensional regression under diverse sparse regimes.
method Global-local-tail (GLT) Gaussian mixture distribution with tail-adaptive shrinkage.
result GLT posterior contracts at minimax optimal rate for sparse normal mean models.
Bayesian method improves dictionary learning for complex problems.
problem Efficiently identifying relevant dictionary entries for complex inverse problems.
method Bayesian group sparsity coding and deflation steps to compress and identify relevant subdictionaries.
result Significant computational complexity reduction and improved glitch detection in LIGO experiment.
T-LoHo model detects structured sparsity and smoothness on graph data.
problem Detecting structured sparsity and smoothness in graph-structured data.
method Tree-based Low-rank Horseshoe (T-LoHo) prior for multivariate parameters.
result Improves anomaly detection on road networks compared to other methods.
Bayesian inference corrected for bias in high-dimensional models.
problem Bayesian inference for high-dimensional regression models often produces biased credible sets.
method Debiasing approach based on Bernstein-von Mises theorem.
result Frequentist validity of debiased Bayesian posterior.
Bayesian inference improves neural network pruning efficiency.
problem Reducing computational and memory demands of large neural networks.
method Utilizes Bayesian inference to calculate Bayes factors for iterative pruning.
result Achieves desired levels of sparsity while maintaining competitive accuracy.
Bayesian approach groups observations with similar effects for better inference.
problem Estimating heterogeneity across observations in political science.
method Structured sparsity framework integrated into Bayesian regression analysis.
result Method outperforms state-of-the-art methods for heterogeneous effects estimation.
Study finds economic data may not be as sparse as previously thought.
problem Modeling economic relations with many variables and prior sensitivity issues.
method Bayesian approach with Spike-and-Slab prior to evaluate variable selection and shrinkage.
result Prior distribution affects detection of sparsity patterns in economic data.
HALO learns to prune neural networks by adaptively shrinking weights.
problem Sparsity and model size in deep neural networks.
method Bayesian hierarchical models and trainable parameters for adaptive sparsification.
result HALO learns to create highly sparse networks with significant performance gains.
Paper proposes new Bayesian neural network models for efficient learning.
problem Efficient learning and model compression in deep neural networks.
method Proposes Spike-and-Slab Group Lasso (SS-GL) and Spike-and-Slab Group Horseshoe (SS-GHS) priors for structured sparsity in Bayesian neural networks.
result Establishes competitive performance in prediction accuracy, model compression, and inference latency compared to baseline models.
New Bayesian method for sparse multidimensional item response theory.
problem Sparse interpretable explanations for questionnaire data.
method Bayesian EM algorithm for sparse factor loadings.
result Reliable recovery of factor dimensionality and latent structure.
Scalable Bayesian LASSO using variational inference for large p and n.
problem Large-scale regression with sparsity constraints.
method Variational Bayesian inference with scale mixtures of Normal distributions.
result The method achieves comparable performance to Bayesian LASSO but at a lower computational cost.
This paper is about variable selection, clustering and estimation in an unsupervised high-dimensional setting. Our approach is based on fitting constrained Gaussian mixture models, where we learn the number of clusters K and the set of relevant variables S using a generalized Bayesian posterior with a sparsity indu…
The paper decouples shrinkage and selection in Bayesian Quantile Regression.
problem Improving prediction accuracy in high-dimensional Bayesian Quantile Regression.
method Two-step procedure: shrinkage through continuous priors, sparsification through SAVS.
result The method reduces bias and provides interpretable variable selection.
Dynamic pricing learns demand model from sparse product networks.
problem Minimizing revenue loss in a large network of products with unknown demand parameters.
method Combines optimism-in-the-face-of-uncertainty and PAC-Bayesian approaches.
result Achieves asymptotically optimal performance in terms of network size and time horizon.
MuVI models multi-view data with structured sparsity, integrating domain knowledge.
problem Disentangling variation across multiple data views in complex systems.
method Multi-view latent variable model with structured sparsity using a modified horseshoe prior.
result MuVI outperforms state-of-the-art methods in structured sparsity modeling and integrates noisy domain expertise.
Novel regularization for Vision Transformers improves model generalization and sparsity.
problem Improving generalization and sparsity in Vision Transformers.
method Likelihood-guided variational Ising-based regularization.
result Improved generalization and sparsity in Vision Transformers.
New method reduces bias in sparse Bayesian learning.
problem High sparsity in statistical models leads to significant bias.
method Variable-coefficient ℓ1 penalty with hyperpriors. result Reduces bias in sparse Bayesian learning.
Paper tackles sparse phase retrieval with a novel Bayesian approach.
problem Sparse phase retrieval from magnitude-only data.
method Quasi-Bayesian approach using a scaled Student distribution.
result Achieves minimax-optimal convergence rates under sub-exponential noise.
In this paper, we introduce a new sparsity-promoting prior, namely, the "normal product" prior, and develop an efficient algorithm for sparse signal recovery under the Bayesian framework. The normal product distribution is the distribution of a product of two normally distributed variables with zero means and possibly …
Bayesian method improves sparse CCA for multi-view data.
problem Integrative statistical analysis of multi-view high-dimensional data.
method Bayesian infinite factor model with graphical horseshoe prior or diagonal structure to encourage sparsity.
result The proposed Bayesian ScSCCA approach achieves robust estimation of sparse CCA.
In this paper, we consider the block-sparse signals recovery problem in the context of multiple measurement vectors (MMV) with common row sparsity patterns. We develop a new method for recovery of common row sparsity MMV signals, where a pattern-coupled hierarchical Gaussian prior model is introduced to characterize bo…
Novel Bayesian method for high-dimensional count data prediction.
problem Count data in high-dimensional settings requires feature selection.
method Pseudo-Bayesian framework with scaled Student prior and exponential weights.
result Strong performance compared to Lasso in various settings.
Existing methods for sparse channel estimation typically provide an estimate computed as the solution maximizing an objective function defined as the sum of the log-likelihood function and a penalization term proportional to the l1-norm of the parameter of interest. However, other penalization terms have proven to have…
Jointly learns feature and sample relevancies for robust sparse recovery.
problem Sparse recovery sensitivity to data contaminants like outliers or misspecified noise.
method Jointly learns feature and sample relevancies via marginal likelihood optimization.
result Consistent sparse and robust prediction models across diverse tasks.
Bayesian model infers factor dimensionality and sparse loading matrix adaptively.
problem Inference of high-dimensional sparse factor model with varying sparsity and factor dimensions.
method Adaptive Bayesian sparse factor model with posterior concentration.
result Posterior distribution asymptotically concentrates on true factor dimensionality and sparsity.
We compress large neural networks for quick adaptation to specific contexts.
problem How to quickly adapt a pretrained large neural network to specific contexts.
method Propose a Bayesian hypernetwork framework to compress the network and encourage sparsity.
result Generated compressed networks are significantly smaller than baseline methods.
We study the computational complexity of Markov chain Monte Carlo (MCMC) methods for high-dimensional Bayesian linear regression under sparsity constraints. We first show that a Bayesian approach can achieve variable-selection consistency under relatively mild conditions on the design matrix. We then demonstrate that t…
Dropout-based regularization methods can be regarded as injecting random noise with pre-defined magnitude to different parts of the neural network during training. It was recently shown that Bayesian dropout procedure not only improves generalization but also leads to extremely sparse neural architectures by automatica…
A novel Bayesian method for dynamic sparsity in Gaussian dynamic linear regression.
problem Variable selection and shrinkage in time-varying regression models.
method Time-varying sparsity via Markov switching priors for coefficients' variances, extending spike-and-slab priors.
result Induces smoothness or shrinkage towards zero at each time point, leading to improved model performance.
Bayesian method uses data spectra to estimate non-sparse high-dimensional models.
problem Handling many parameters in high-dimensional Bayesian statistics.
method Data-adaptive Gaussian prior aligned with leading eigenvectors of sample covariance.
result Posterior contraction rates reveal the effect of spectral mass on prediction error.
Change detection involves segmenting sequential data such that observations in the same segment share some desired properties. Multivariate change detection continues to be a challenging problem due to the variety of ways change points can be correlated across channels and the potentially poor signal-to-noise ratio on …
Bayesian neural networks improve deep learning's accuracy and uncertainty estimation.
problem Overconfident predictions, adversarial attacks, and variability underestimation in deep models.
method Stochastic relaxation of feed-forward rectified neural networks with sparsity-promoting priors and Polya-Gamma data augmentation.
result Improved scalability and robustness to architectural design through approximate variational inference.
GRASP simplifies Bayesian regression with grouped predictors using an adaptive NBP prior.
problem Regression with grouped predictors and adaptive shrinkage.
method Normal Beta Prime (NBP) prior with tunable hyperparameters for flexible sparsity control.
result Empirical validation of robust and versatile GRASP across various sparsity and signal-to-noise ratios.
Proposes HDBEN for heteroscedastic regression with improved sparsity and variance modeling.
problem Violation of constant error variance in high-dimensional regression.
method HDBEN framework using hierarchical Bayesian priors with ℓ1 and ℓ2 penalties. result Achieves posterior concentration, variable selection consistency, and asymptotic normality.
A new method discovers equations from data using Bayesian and kernel techniques.
problem Discovering equations from data is hard due to sparsity and noise.
method Kernel regression for function estimation and Bayesian spike-and-slab prior for uncertainty quantification.
result KBASS method outperforms state-of-the-art methods on benchmark tasks.
Bayesian model selection of vine copulas: a loss-based perspective
problem Efficient model selection and estimation in Bayesian vine methodology
method Combines loss-based model priors with shotgun stochastic search strategy
result Promotes sparsity and enables fast and effective structure selection
Paper presents a new probabilistic approach for high-dimensional quantile prediction.
problem High-dimensional quantile prediction challenges in robust statistical methods.
method Pseudo-Bayesian framework with scaled Student-t prior and Langevin Monte Carlo.
result Demonstrates strong theoretical guarantees and competitive performance in simulations and real-world data.
Bayesian tree ensemble model for estimating treatment effects in high-dimensional survival data.
problem Estimating heterogeneous treatment effects in censored survival data with many covariates.
method Developed a Bayesian tree ensemble model with a horseshoe prior for adaptive shrinkage.
result Accurately estimates treatment effects in high-dimensional covariate spaces and non-linear functions.
The paper analyzes methods for sparse Bayesian regression in nonlinear system identification.
problem Learning sparse models in Bayesian regression with nonlinear applications.
method Two classes of methods: regularization and thresholding based, built on automatic relevance determination (ARD).
result Analytical demonstration of favorable performance with sparse solutions in linear problems.
Bayesian Tobit model tackles high-dimensional censored data with Horseshoe prior.
problem High-dimensional censored data with unknown bounds.
method Horseshoe prior for shrinkage, data augmentation for Gibbs sampling.
result Established posterior consistency and concentration rates for Bayesian Tobit models.