paper-with-me

Papers

Model-Preserving Sensitivity Analysis for Families of Gaussian Distributions

2018-09-27 · Christiane Goergen, Manuele Leonelli

The accuracy of probability distributions inferred using machine-learning algorithms heavily depends on data availability and quality. In practical applications it is therefore fundamental to investigate the robustness of a statistical model to misspecification of some of its underlying probabilities. In the context of graphical models, investigations of robustness fall under the notion of sensitivity analyses. These analyses consist in varying some of the model's probabilities or parameters and then assessing how far apart the original and the varied distributions are. However, for Gaussian graphical models, such variations usually make the original graph an incoherent representation of the model's conditional independence structure. Here we develop an approach to sensitivity analysis which guarantees the original graph remains valid after any probability variation and we quantify the effect of such variations using different measures. To achieve this we take advantage of algebraic techniques to both concisely represent conditional independence and to provide a straightforward way of checking the validity of such relationships. Our methods are demonstrated to be robust and comparable to standard ones, which break the conditional independence structure of the model, using an artificial example and a medical real-world application.

📄 PDF Abstract BibTeX arXiv:1809.10794

Code (0)

등록된 구현이 없습니다.

Tasks

Sensitivityvalid

Similar Papers 제목 키워드 기반

Private Statistical Estimation via Truncation

2025-05-18 · Manolis Zampetakis, Felix Zhou

We introduce a novel framework for differentially private (DP) statistical estimation via data truncation, addressing a key challenge in DP estimation when the data support is unbounded. Traditional approaches rely on pr…

Sensitivity

A General Recipe for the Analysis of Randomized Multi-Armed Bandit Algorithms

2023-03-10 · Dorian Baudry, Kazuya Suzuki, Junya Honda

In this paper we propose a general methodology to derive regret bounds for randomized multi-armed bandit algorithms. It consists in checking a set of sufficient conditions on the sampling probability of each arm and on t…

Thompson Sampling

Statistical Unlearning of Distributions: A Hypothesis Testing Approach

2026-05-15 · Aaradhya Pandey, Sanjeev Kulkarni arxiv

Machine learning systems increasingly face requirements to forget not only individual data points, but entire domains of information, such as toxic language, copyrighted corpora, or demographic biases. This raises a fund…

Optimal Stability of KL Divergence under Gaussian Perturbations

2026-04-13 · Jialu Pan, Yufeng Zhang, Nan Hu, Zhenbang Chen 외 arxiv

We study the problem of characterizing the stability of Kullback-Leibler (KL) divergence under Gaussian perturbations beyond Gaussian families. Existing relaxed triangle inequalities for KL divergence critically rely on …

Reinforcement Learning

Sparse Continuous Distributions and Fenchel-Young Losses

2021-08-04 · André F. T. Martins, Marcos Treviso, António Farinhas, Pedro M. Q. Aguiar 외

Exponential families are widely used in machine learning, including many distributions in continuous and discrete domains (e.g., Gaussian, Dirichlet, Poisson, and categorical distributions via the softmax transformation)…

Audio ClassificationQuestion AnsweringVisual Question AnsweringVisual Question Answering (VQA)