Proposes DAPr framework to learn feature importance from prior knowledge.
problem Ensuring meaningful feature attributions in deep models.
method Jointly learns feature importance from prior knowledge and biases models to rely on important features.
result Improves model generalization and provides new interpretation methods.
Bayesian priors improve neural network performance on weak signals.
problem Challenges in encoding domain knowledge for weak signals in neural networks.
method Proposed a new joint prior over local scale parameters for feature sparsity and signal-to-noise ratio, optimized with Stein gradient.
result Improved prediction accuracy on various datasets, including genetics applications with weak and sparse signals.
ADNN uses prior knowledge to construct financial features.
problem Feature construction in financial trading.
method Tailored neural network structure with domain knowledge.
result ADNN constructs more informative features than genetic programming.
The paper proposes a method to integrate prior information into penalized regression.
problem Improving predictive performance in high-dimensional tasks with prior information.
method Integrating multiple sources of prior information into penalized regression.
result The method improves predictive performance, as shown by simulations and applications.
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.
Bayesian framework extracts features from high-dimensional spatio-temporal data.
problem Sparse structure and spatio-temporal dependence in high-dimensional data.
method Develops a Bayesian feature-extraction framework using Gaussian and Diffused-gamma priors, employing Bregman divergence likelihood and MCMC for posterior computation.
result Improves recovery of sparse features and enhances interpretability in the presence of spatio-temporal dependence.
Identifying small subsets of features that are relevant for prediction and/or classification tasks is a central problem in machine learning and statistics. The feature selection task is especially important, and computationally difficult, for modern datasets where the number of features can be comparable to, or even ex…
Providing accurate predictions is challenging for machine learning algorithms when the number of features is larger than the number of samples in the data. Prior knowledge can improve machine learning models by indicating relevant variables and parameter values. Yet, this prior knowledge is often tacit and only availab…
Proposes a new method to learn meta-priors from data.
problem Improving learning systems with domain knowledge and controlling parameter learning rates.
method Hierarchical Empirical Bayes approach to decouple learning rates of features.
result Meta-prior learning improves performance and convergence time in various applications.
New Gromov-Wasserstein metric controls rigidity and incorporates prior knowledge.
problem Inflexible Gromov-Wasserstein distance and lack of feature alignment.
method Augmented Gromov-Wasserstein distance with feature alignments and prior knowledge.
result Improved performance in single-cell multi-omic alignment and transfer learning.
The paper proposes a method to incorporate prior knowledge into generative models using a regularizer.
problem Learning generative models with prior domain knowledge is costly and often impractical.
method Formulate a regularizer that makes generative model marginals follow prescribed feature relations.
result The method effectively incorporates prior knowledge into generative models without requiring specific model architectures.
R2D2-Net improves Bayesian neural networks by preventing over-shrinkage of important weights.
problem Bayesian neural networks struggle with choosing appropriate priors, leading to over-shrinkage or poor predictive performance.
method Proposes R2D2-Net with an R^2-induced Dirichlet Decomposition prior and variational Gibbs inference algorithm.
result R2D2-Net effectively shrinks irrelevant coefficients while preventing key features from over-shrinkage.
This paper distills financial indicators into neural networks to reduce noise and improve accuracy.
problem Reduction of non-stationary noise in financial time series data.
method Co-distillation of smaller networks trained on indicators to transfer prior knowledge and reduce overfitting.
result The proposed method outperforms traditional methods in terms of speed and accuracy on real financial datasets.
Improves feature selection in high-dimensional data using LLM-generated weights.
problem Inaccurate LLM-generated weights degrade feature selection performance.
method Integrates LLM-generated weights into prior inclusion probabilities using LLM Sparsity Prior (LSP).
result Improves prediction accuracy and identifies clinically relevant features.
New method learns disentangled representations using Gromov-Monge maps.
problem Learning disentangled representations from unlabelled data.
method Introduces a novel approach based on Gromov-Monge maps to preserve geometric features while aligning data distributions.
result Demonstrates effectiveness on four benchmarks, outperforming other methods.
New insights into how neural networks learn features, especially when they are very wide.
problem Understanding how gradient flow in wide neural networks selects solutions, especially in the feature-learning regime.
method Axiomatizing the canonical regularizer as a function-space energy and lift, and deriving geodesic ridge for the feature-learning regime.
result Gradient flow in feature-learning networks biases towards ridge regularization, distorting the inductive bias and damaging pretrained networks.
Unified deep learning from noisy crowds using BP and MF.
problem Inference and learning from noisy crowdsourced data.
method Neural-powered Bayesian framework with deepMF and deepBP.
result deepBP is more robust against wrong priors and feature overfitting.
We add prior knowledge to deep networks to make them invariant to transformations.
problem Creating deep networks invariant to transformations like rotation.
method A novel layer based on invariant integration to enforce feature space invariances.
result State-of-the-art performance on the Rotated-MNIST dataset.
High-dimensional feature selection arises in many areas of modern science. For example, in genomic research we want to find the genes that can be used to separate tissues of different classes (e.g. cancer and normal) from tens of thousands of genes that are active (expressed) in certain tissue cells. To this end, we wi…
Improved deep learning models using new attribution priors and expected gradients.
problem Improving interpretability and performance of deep learning models.
method Introducing new attribution priors and expected gradients method that satisfies interpretability axioms.
result Improves model performance across various real-world tasks.
DIVA clusters dynamic data without needing cluster count, outperforming baselines.
problem Clustering complex, dynamic data without prior knowledge of cluster count.
method Nonparametric Dirichlet Process Mixtures with memoized online variational inference.
result DIVA outperforms state-of-the-art in classifying complex data with changing features.
Latent feature models are widely used to decompose data into a small number of components. Bayesian nonparametric variants of these models, which use the Indian buffet process (IBP) as a prior over latent features, allow the number of features to be determined from the data. We present a generalization of the IBP, the …
This paper improves image super-resolution by integrating cross-scale non-local attention.
problem Improving image super-resolution by leveraging long-range and cross-scale feature correlations.
method Proposes a Cross-Scale Non-Local (CS-NL) attention module integrated into a recurrent neural network.
result Significantly improved performance on SISR benchmarks.
Study proposes a new method for MRI image reconstruction using denoising autoencoders and undecimated wavelet transforms.
problem Efficient MRI image reconstruction using under-sampled data.
method Undecimated wavelet transform, denoising autoencoder, proximal gradient algorithm.
result The proposed method enhances MRI image reconstruction efficiency and robustness.
Inference of latent feature models in the Bayesian nonparametric setting is generally difficult, especially in high dimensional settings, because it usually requires proposing features from some prior distribution. In special cases, where the integration is tractable, we can sample new feature assignments according to …
DS2CF-Net learns hierarchical representations with deep coupled factorization and enriched prior.
problem Learning deep hierarchical representations from data.
method Dual-constrained Deep Semi-Supervised Coupled Factorization Network (DS2CF-Net) with enriched prior.
result DS2CF-Net achieves state-of-the-art performance in representation learning and clustering.
Robust optimization improves deep learning feature representations.
problem Deep learning feature representations lack versatility and high-level encoding.
method Robust optimization as a prior for feature learning.
result Robust models learn approximately invertible, salient feature representations.
Unified framework for Bayesian PDE-constrained inversion using physics-informed neural networks.
problem Incorporating prior distributions in function space into Bayesian PINN-based inversion.
method Functional-prior-based approaches (fpBPINN) to Bayesian PDE-constrained inversion using physics-informed neural networks (PINNs). Two complementary approaches: FPI-BPINN and fParVI-PINN.
result Accurate estimation of posterior distributions in seismic traveltime tomography and Darcy-flow permeability inversion.
Improves naturalness in TTS samples using quantized VAE and auto-regressive prosody.
problem Discontinuous and unnatural speech from standard VAE priors.
method Discretized latent features using vector quantization (VQ), and separately trained autoregressive (AR) prior model.
result Significantly improves naturalness in random sample generation.
New FGSPCA method captures grouping and sparse structures in PCA without prior info.
problem Capture grouping and sparse structures in PCA without prior info.
method Truncated regularization with alternating algorithm.
result FGSPCA method reduces model complexity and increases interpretability.
SNI framework for mixed-type data imputation interprets and explains missing values.
problem Missing data in mixed-type databases skew analysis results.
method SNI couples statistical priors with neural attention to impute and explain missing values.
result SNI provides interpretable feature dependency diagnostics and soft regularization of attention.
The quality of data representation in deep learning methods is directly related to the prior model imposed on the representations; however, generally used fixed priors are not capable of adjusting to the context in the data. To address this issue, we propose deep predictive coding networks, a hierarchical generative mo…
BSTabDiff: Block-Subunit Diffusion Priors for HDLSS Tabular Data Generation
problem High-dimensional tabular data generation in HDLSS
method Block-subunit generative framework
result More realistic and stable synthetic data
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.
In this paper we propose a class of prior distributions on decomposable graphs, allowing for improved modeling flexibility. While existing methods solely penalize the number of edges, the proposed work empowers practitioners to control clustering, level of separation, and other features of the graph. Emphasis is placed…
Enhanced financial reward with shuffled feature CNN-DRL.
problem Improving reward in financial data using CNN-DRL.
method Applying shuffled features to financial data for CNN-DRL.
result Substantial enhancement in reward attainment.
SJS model predicts label shifts in multinomial datasets.
problem Predicting label shifts in multinomial datasets.
method Sparse joint shift model for dataset shift.
result Valid predictions and class prior probabilities estimates.
A new non-convex method improves robust PCA with features.
problem Robust Principal Component Analysis with prior feature information.
method A novel non-convex optimization approach for decomposition.
result Exact recovery guarantees with low computational complexity.
DIVI clusters noisy high-dimensional data with stable feature gating.
problem Challenging clustering in high-dimensional noisy data.
method Data-informed variational clustering framework combining global feature gating and adaptive structure growth.
result DIVI performs competitively under severe feature noise and remains computationally feasible.
New features reduce computational cost of variational inference.
problem Efficiently compute ELBO with reduced computational cost.
method Developed features that reduce O(M3) to O(ildeNT+MT) for large M. result Unbiased ELBO estimation with reduced computational complexity.
This paper discovers classification models from sequential data without prior knowledge.
problem Lack of prior knowledge in defining kernels for online classification.
method Adapts GP-based time-series structure discovery with SMC to learn new features from sequential data.
result Improves classification accuracy by 10% on real-world data.
A new algorithm learns causal relationships from multimodal data.
problem Discovering causal relationships in exploratory settings without prior information.
method causalPIMA algorithm using multimodal data and physics constraints.
result Learned causal structure and key features in fully unsupervised settings.
Guided adaptive shrinkage uses co-data to improve feature selection in genomic studies.
problem Feature selection challenges in high-dimensional genomics data, especially in clinical settings.
method Guided adaptive shrinkage methods that use co-data to adapt shrinkage parameters.
result Improves feature selection in genomic studies, demonstrated through comparisons and examples.
Improves transparency and incorporates prior knowledge in Gaussian Process models.
problem Challenges in understanding and expressing prior assumptions in complex Bayesian models.
method Introduces self-explaining variational posterior distributions for Gaussian Processes.
result Allows incorporation of both general and feature-specific prior knowledge.
Bayesian optimization uses priors to speed up robot learning.
problem Identifying the best prior when multiple exist for a new task.
method Introduces MLEI, a new acquisition function combining prior likelihood and expected improvement.
result MLEI effectively identifies and exploits priors in new situations.
RSAC improves lightweight continuous learning efficiency.
problem Excessive training time and memory usage in continuous learning.
method Regularized subspace approximation classifier with feature reduction and regularization.
result RSAC achieves more efficient continuous learning than prior methods.
A new probabilistic model for semi-supervised learning unifies various methods.
problem Combining different aspects of data distribution for semi-supervised learning.
method A probabilistic model that interprets and improves upon existing SSL methods.
result The model unifies various SSL methods and extends to neuro-symbolic learning.
PIMA autoencoders discover shared features in multimodal scientific data.
problem Discovering shared information in high-throughput scientific datasets.
method Physics-informed multimodal autoencoders (PIMA) with Gaussian mixture prior and product of experts formulation.
result Accurate cross-modal inference between images and mechanical stress-strain response in lattice metamaterials.