The study assesses sensitivity to prior choices in Bayesian nonparametric models.
problem Difficulty in specifying priors for Bayesian nonparametric models.
method Utilizes variational Bayesian methods to assess sensitivity to concentration parameter and stick-breaking distribution.
result Demonstrates how to evaluate sensitivity to prior choices in Dirichlet process mixtures and related models.
The paper analyzes Thompson Sampling's sensitivity to prior distributions.
problem Understanding the impact of prior distributions on Thompson Sampling's performance.
method Characterizes Thompson Sampling's worst-case regret bounds using martingale theory.
result Proves matching upper and lower bounds for regret in terms of prior probability mass.
New method speeds up causal sensitivity analysis.
problem Bounding causal effects in unobserved confounding.
method Amortized approach using prior-data fitted networks.
result Orders of magnitude faster computation.
Proposes efficient sensitivity analysis for complex Bayesian models.
problem Inefficiency of sensitivity analyses in complex Bayesian models.
method SA-ABI: weight sharing and neural network rapid inference.
result Efficiently integrates sensitivity analyses into Bayesian inference.
Recent reports have described that learning Bayesian networks are highly sensitive to the chosen equivalent sample size (ESS) in the Bayesian Dirichlet equivalence uniform (BDeu). This sensitivity often engenders some unstable or undesirable results. This paper describes some asymptotic analyses of BDeu to explain the …
The paper discusses the impact of prior densities on Bayesian model selection.
problem The sensitivity of marginal likelihood to prior choice in Bayesian model selection.
method Analyzes the role of prior densities in model selection, discusses improper priors, and proposes solutions.
result Marginal likelihood can be sensitive to prior choice, but improper priors can still be used with caution.
Bayesian model averaging (BMA) is the state of the art approach for overcoming model uncertainty. Yet, especially on small data sets, the results yielded by BMA might be sensitive to the prior over the models. Credal Model Averaging (CMA) addresses this problem by substituting the single prior over the models by a set …
JORC-UMAP improves UMAP by incorporating geometric and topological priors.
problem UMAP's local Euclidean distance assumption fails to capture intrinsic manifold geometry, leading to topological tearing and structural collapse.
method JORC-UMAP introduces Ollivier-Ricci curvature as a geometric prior and Jaccard similarity as a topological prior to reinforce edges and reduce redundant links.
result JORC-UMAP reduces tearing and collapse more effectively than standard UMAP and other DR methods, as measured by SVM accuracy and triplet preservation scores.
This paper examines how the choice of prior distribution affects likelihoods of out-of-distribution inputs in deep generative models.
problem Mismatch between prior and data distributions causes deep generative models to assign higher likelihoods to out-of-distribution inputs.
method Proposes using a mixture distribution as a prior to make likelihoods of out-of-distribution inputs more sensitive.
result A mixture prior lowers the out-of-distribution likelihood with respect to real image data sets.
BriarPatches obscure sensitive attributes to achieve demographic parity.
problem Achieving demographic parity in model predictions.
method Pixel-space interventions that obscure sensitive attributes from classifier representations.
result BriarPatches push downstream predictors towards demographic parity.
NetBiTE predicts drug sensitivity and identifies biomarkers in cancer.
problem Predicting drug sensitivity and identifying biomarkers in cancer.
method NetBiTE combines prior knowledge and gene expression data using a biased tree ensemble approach.
result NetBiTE outperforms RF in predicting IC50 drug sensitivity for drugs targeting membrane receptor pathways.
Proposes ECS-DBN for cost-sensitive deep belief network in imbalanced classification.
problem Imbalanced data classification with unequal misclassification costs.
method ECS-DBN uses adaptive differential evolution to optimize misclassification costs based on training data.
result ECS-DBN consistently outperforms state-of-the-art methods on benchmark and real-world datasets.
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.
The paper proposes a method to learn differentially private variational autoencoders with term-wise gradient aggregation.
problem Learning variational autoencoders with differential privacy constraints and multiple divergences.
method Term-wise Differentially Private SGD (DP-SGD) that crafts randomized gradients for each loss term, keeping sensitivity at O(1).
result The method reduces the amount of noise needed for differential privacy, allowing better learning.
Proposes FOAGP for efficient orthogonal effect decomposition of black-box computer experiments.
problem Challenges in sensitivity analysis of black-box computer experiments with complex, nonlinear functional outputs.
method Functional-output orthogonal additive Gaussian process (FOAGP) with conditional orthogonality constraint.
result Demonstrates effectiveness in orthogonal effect decomposition and variance decomposition through simulations and real-world application.
Bayesian methods improve causal effect estimation, offering shrinkage and sensitivity analysis.
problem Improving causal effect estimation in practical settings.
method Parametric and nonparametric Bayesian approaches.
result Priors induce shrinkage and sparsity in parametric models.
Improved bounds for ℓp sensitivity sampling reducing the sample complexity for structured matrices.
problem Improving the sample complexity for structured matrices using ℓp sensitivity sampling. method Developed new bounds for ℓp sensitivity sampling, achieving a bound of roughly S2−2/p for 2<p<∞. result Achieved improved bounds for ℓp sensitivity sampling, reducing the sample complexity for structured matrices. Model dynamic customer sensitivities across categories.
problem Dynamic heterogeneity in customer sensitivities to marketing elements.
method Hierarchical dynamic factor model with Bayesian nonparametric Gaussian processes.
result Dynamic heterogeneity can be explained by a few global trends.
Proposes a method to assess unobserved confounding effects in causal inference.
problem Assessing unobserved confounding in causal inference studies.
method Copula-based normalizing flows with sensitivity parameter ρ. result Estimates average causal effect (ACE) as a function of unobserved confounding strength.
Study shows prior Lipschitz continuity can improve adversarial robustness of Bayesian Neural Networks.
problem Improving adversarial robustness of Bayesian Neural Networks.
method Analysis of i.i.d., zero-mean Gaussian priors and posteriors approximated via mean-field variational inference.
result Adversarial robustness is sensitive to the prior variance.
A fast outlier detection method using sensitivity.
problem Detecting outliers in large datasets efficiently.
method Intuition from clustering sensitivity leads to a linear-time algorithm.
result The method outperforms existing distance-based approaches.
Novel approach for estimating conditional expectations using Bayesian quadrature.
problem Estimating conditional expectations with costly evaluations.
method Probabilistic numerical methods incorporating prior smoothness knowledge.
result Fast convergence rate and uncertainty quantification.
A fair autoencoder removes sensitive factors while preserving useful latent representations.
problem Learning fair representations that ignore sensitive factors.
method Variational autoencoder with priors and MMD penalty.
result The method effectively removes unwanted sources of variation.
Bayesian adaptive PCE method improves surrogate modeling and sensitivity analysis.
problem Lack of fully Bayesian PCE methods in statistics.
method Developed a novel fully Bayesian adaptive PCE method with R implementation.
result Bayesian adaptive PCE provides competitive performance for various UQ tasks.
Approach to fairness in machine learning models using regularization and Gaussian processes.
problem Bias in machine learning models due to sensitive covariates.
method Regularization approach using HSIC and ridge regression, applied to Gaussian processes.
result Improves fairness in automated decisions without sacrificing predictive accuracy.
New LSH algorithms improve nearest-neighbor search performance.
problem Efficiently searching for similar high-dimensional data.
method High-dimensional locality-sensitive hashing (LSH) based on fruit fly olfactory circuit.
result New LSH algorithms outperform existing methods on benchmark datasets.
Optimizes Bayesian priors for matrix factorization without posterior inference.
problem Selecting optimal priors for Bayesian models in machine learning.
method Prior predictive distribution and virtual statistics matching user-provided or observed data statistics.
result Analytically determines hyperparameters for Poisson factorization models.
This research explores how different discrete diffusion kernels affect graph generation quality.
problem The impact of different discrete diffusion kernels on graph generation quality.
method Developed a family of discrete diffusion kernels that converge to different Bernoulli priors.
result The quality of generated graphs is sensitive to the prior used, challenging previous intuitions.
Paper introduces threshold invariant fairness to ensure equitable predictions across different groups.
problem Machine learning models can be unfair to certain groups based on sensitive attributes.
method Proposes threshold invariant fairness and uses two approximation methods to equalize risk distributions.
result Demonstrates effectiveness in alleviating threshold sensitivity in fairness models.
Probabilistic ESI model improves brain activity pattern analysis.
problem Noise sensitivity and lack of time-varying pattern flexibility in traditional ESI methods.
method Hierarchical graph prior with spanning tree constraint and alternating convex search algorithm.
result Significant improvements in source localization performance, especially at high noise levels.
Algorithm ensures demographic parity in regression without sensitive attribute data.
problem Performing regression with demographic parity constraints.
method Post-processing algorithm using accurate estimates and sensitive attribute predictor.
result Generates predictions meeting demographic parity constraint.
This paper modifies the Black-Litterman model to fit a Bayesian framework.
problem Combining investors' views with historical data for optimal portfolio weights.
method Integrates investors' views as priors and uses Bayesian techniques to update the covariance matrix.
result Improved performance of the modified model on test data.
A new CVaR test reduces group performance disparity detection complexity.
problem Detecting performance disparities across multiple sensitive groups in ML models.
method Conditional Value-at-Risk (CVaR) testing to reduce sample complexity.
result Sample complexity reduced exponentially to be at most the square root of the number of groups.
Novel model predicts anticancer compound sensitivity with high accuracy and interpretability.
problem Predicting anticancer compound sensitivity with high accuracy and interpretability.
method Multimodal attention-based convolutional encoder using SMILES, gene expression profiles, and protein-protein interaction networks.
result The model significantly outperforms baseline models and demonstrates high interpretability.
A new method distills material models from noisy data without prior selection.
problem Uncertainty in material model discovery from noisy data.
method Augmenting data with Gaussian process, approximating parameter distribution with normalizing flow, distilling by matching stress-deformation functions, performing sensitivity analysis.
result Sparse and interpretable material models discovered from experimental data.
New Bayesian method for estimating portfolio VaR and CVaR that adapts to volatility changes.
problem Estimating VaR and CVaR of portfolios in volatile markets.
method Volatility-sensitive Bayesian estimation using conjugate priors and rolling window sizes.
result The new method provides better risk estimation, especially during turbulent periods.
Enhances GFlowNets with distributional approach for risk-sensitive policies.
problem Limited applicability of current GFlowNet framework in handling stochastic reward functions.
method Adopting a distributional paradigm, parameterizing each edge flow through quantile functions, and introducing a risk-sensitive learning algorithm.
result Significant improvement on benchmarks due to enhanced training algorithm, even in deterministic reward settings.
tDB removes unfairness from black-box models using probability theory.
problem Mitigating unfairness in predictions from black-box models.
method towerDebias (tDB) method based on the Tower Property.
result tDB improves prediction fairness without retraining the original model.
GS-WGAN sanitizes sensitive data for machine learning with improved privacy and model quality.
problem Lack of privacy in sensitive data hinders machine learning applications.
method Gradient-sanitized Wasserstein Generative Adversarial Networks (GS-WGAN).
result GS-WGAN generates more informative samples and outperforms state-of-the-art approaches.
PR-GAN preserves data privacy while maintaining utility for specific applications.
problem Privacy concerns in collecting personal data and machine learning inference.
method Generative adversarial networks (GAN) to modify data, incorporating prior knowledge of correlations.
result PR-GAN provides privacy guarantees under the Pufferfish framework, outperforming conventional methods.
Unified analysis of privacy leakage in correlated data considering prior knowledge.
problem Understanding the impact of prior knowledge and data correlation on privacy leakage.
method Proposed prior differential privacy (PDP) and analyzed using WHG and multivariate Gaussian models.
result Derived closed-form expression for continuous data and chain rule for discrete data.
New method prunes neural networks at initialization, improving performance.
problem Improving neural network compression at initialization.
method Formally characterizes initialization conditions for reliable pruning based on connection sensitivity.
result Improved neural network performance on image classification tasks.
Study variational Bayes for high-dimensional linear regression with sparse priors.
problem Sparse high-dimensional linear regression model selection.
method Mean-field spike and slab variational Bayes approximation, oracle inequalities, coordinate-ascent variational inference (CAVI), prioritized updating scheme.
result Mean-field VB approximation converges to the sparse truth at optimal rate and gives optimal prediction.
Algorithm generates private continuous-time data for sensitive domains.
problem Private generation of continuous-time data for sensitive domains.
method Mean-field Langevin dynamics and noisy particle gradient descent.
result Strong privacy guarantees for one-time data contributions.
New pruning method retains model expressiveness for NLP tasks.
problem Pruning large pretrained transformer models for real-world deployment.
method Mixture Gaussian Prior Pruning (MGPP) algorithm.
result MGPP outperforms existing pruning methods in high sparsity settings.
We study the asymptotic behavior of the difference between the values at risk VaR(L) and VaR(L+S) for heavy tailed random variables L and S for application in sensitivity analysis of quantitative operational risk management within the framework of the advanced measurement approach of Basel II (and III). Here L describe…
Bayesian algorithms perform well even with misspecified priors, especially in meta-learning.
problem Performance degradation of Bayesian algorithms with misspecified priors.
method Thompson sampling and meta-learning analysis with misspecified priors.
result Thompson sampling's performance degrades gracefully with misspecification, with a bound of ildeO(H2ε). Fairness in biased data learned through causal modeling.
problem Learning from biased historical datasets that reflect historical prejudices.
method Causal modeling approach to learn from observational data, even with unobserved confounders.
result Fairness-aware causal modeling provides better estimates of causal effects and more accurate policies.