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.
Spike-and-slab priors are improved for high-dimensional Bayesian regression.
Spike-and-slab priors are popular Bayesian solutions for high-dimensional linear regression problems. Previous theoretical studies on spike-and-slab methods focus on specific prior formulations and use prior-dependent conditions and analyses, and thus can not be generalized directly. In this paper, we propose a class o…
Paper proposes a new method for Bayesian linear regression using spike-and-slab priors.
New algorithms improve Bayesian linear regression with spike-and-slab priors.
New algorithms sample spike-and-slab priors efficiently in high dimensions.
A fast and scalable method for variable selection in high-dimensional Gaussian processes.
We apply the spike-and-slab Restricted Boltzmann Machine (ssRBM) to texture modeling. The ssRBM with tiled-convolution weight sharing (TssRBM) achieves or surpasses the state-of-the-art on texture synthesis and inpainting by parametric models. We also develop a novel RBM model with a spike-and-slab visible layer and bi…
In this work, we address the problem of solving a series of underdetermined linear inverse problems subject to a sparsity constraint. We generalize the spike-and-slab prior distribution to encode a priori correlation of the support of the solution in both space and time by imposing a transformed Gaussian process on the…
We study inference and learning based on a sparse coding model with `spike-and-slab' prior. As in standard sparse coding, the model used assumes independent latent sources that linearly combine to generate data points. However, instead of using a standard sparse prior such as a Laplace distribution, we study the applic…
Improved VB algorithm for high-dimensional logistic regression with theoretical guarantees.
A new method discovers equations from data using Bayesian and kernel techniques.
We are interested in solving the multiple measurement vector (MMV) problem for instances, where the underlying sparsity pattern exhibit spatio-temporal structure motivated by the electroencephalogram (EEG) source localization problem. We propose a probabilistic model that takes this structure into account by generalizi…
Bayesian SPCA method tackles orthogonality constraint with spike and slab prior.
Bayesian -regularized least squares is a variable selection technique for high dimensional predictors. The challenge is optimizing a non-convex objective function via search over model space consisting of all possible predictor combinations. Spike-and-slab (a.k.a. Bernoulli-Gaussian) priors are the gold standard f…
The Gaussian process latent variable model (GP-LVM) is a popular approach to non-linear probabilistic dimensionality reduction. One design choice for the model is the number of latent variables. We present a spike and slab prior for the GP-LVM and propose an efficient variational inference procedure that gives a lower …
The paper extends and applies a new shrinkage prior in Bayesian factor analysis.
Bayesian neural network achieves nearly optimal performance in Besov space.
In this letter, we address sparse signal recovery using spike and slab priors. In particular, we focus on a Bayesian framework where sparsity is enforced on reconstruction coefficients via probabilistic priors. The optimization resulting from spike and slab prior maximization is known to be a hard non-convex problem, a…
We consider the problem of object recognition with a large number of classes. In order to overcome the low amount of labeled examples available in this setting, we introduce a new feature learning and extraction procedure based on a factor model we call spike-and-slab sparse coding (S3C). Prior work on S3C has not prio…
In this article, we propose a new class of priors for Bayesian inference with multiple Gaussian graphical models. We introduce fully Bayesian treatments of two popular procedures, the group graphical lasso and the fused graphical lasso, and extend them to a continuous spike-and-slab framework to allow self-adaptive shr…
We consider the problem of using a factor model we call {\em spike-and-slab sparse coding} (S3C) to learn features for a classification task. The S3C model resembles both the spike-and-slab RBM and sparse coding. Since exact inference in this model is intractable, we derive a structured variational inference procedure …
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…
Paper proposes new Bayesian neural network models for efficient learning.
Exact inference in the linear regression model with spike and slab priors is often intractable. Expectation propagation (EP) can be used for approximate inference. However, the regular sequential form of EP (R-EP) may fail to converge in this model when the size of the training set is very small. As an alternative, we …
Bayesian GAMs improve predictive performance for high-dimensional data.
Improved Thompson Sampling for high-dimensional sparse bandits.
IDS improves sparse linear bandits by balancing information and regret.
Proposes a flexible MGP model for dynamic, sparse correlations.
CONCERT improves transfer learning by borrowing partial information from auxiliary datasets.
PliableBVS extends Bayesian lasso for modeling interactions with modifying variables.
DABS uses a policy network to select experiments in high-dimensional design spaces.
In this paper a new Bayesian model for sparse linear regression with a spatio-temporal structure is proposed. It incorporates the structural assumptions based on a hierarchical Gaussian process prior for spike and slab coefficients. We design an inference algorithm based on Expectation Propagation and evaluate the mode…
Efficiently identifies important variables in binary outcomes using variational Bayes.
Improves variational inference for sparse models using mixtures of exponential families.
Proposes a Bayesian approach for automatic node selection in sparse neural networks.
Paper develops efficient variational inference for sparse deep learning with theoretical guarantees.
In recent years a number of methods have been developed for automatically learning the (sparse) connectivity structure of Markov Random Fields. These methods are mostly based on L1-regularized optimization which has a number of disadvantages such as the inability to assess model uncertainty and expensive crossvalidatio…
In recent years a number of methods have been developed for automatically learning the (sparse) connectivity structure of Markov Random Fields. These methods are mostly based on L1-regularized optimization which has a number of disadvantages such as the inability to assess model uncertainty and expensive cross-validati…
New method samples from piecewise smooth distributions using Hamiltonian Monte Carlo.
Bayesian model predicts phenotype effects from multi-environmental factors.
We introduce a wavelet-domain functional analysis of variance (fANOVA) method based on a Bayesian hierarchical model. The factor effects are modeled through a spike-and-slab mixture at each location-scale combination along with a normal-inverse-Gamma (NIG) conjugate setup for the coefficients and errors. A graphical mo…
Study improves theoretical understanding of Bayesian deep learning for classification tasks.
Improves feature selection in high-dimensional data using LLM-generated weights.
Estimation of the covariance matrix of asset returns from high frequency data is complicated by asynchronous returns, market mi- crostructure noise and jumps. One technique for addressing both asynchronous returns and market microstructure is the Kalman-EM (KEM) algorithm. However the KEM approach assumes log-normal pr…
New method estimates sparse canonical vectors efficiently.
Bayesian framework selects features and lags for time series forecasting.
BayTiDe discovers time-delayed differential equations from noisy data.
Guided adaptive shrinkage uses co-data to improve feature selection in genomic studies.