atlas

Research map / Learning theory and algorithms / Sample complexity

Robust Learning of Fixed-Structure Bayesian Networks

NeurIPS 2018 · Learning theory and algorithms › Sample complexity · approach: Sample complexity of learning distributions · 23 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use spectral filtering to remove suspected corrupted samples rather than estimate conditional probabilities directly from noisy samplesFixed-structure Bayesian network learning · Synthetic random tree and random graphestimated total variation distanceHelped
Use spectral filtering instead of RANSAC subsamplingFixed-structure Bayesian network learning · Synthetic random tree and random graphestimated total variation distanceHelped
Use spectral filtering rather than noisy empirical conditional meansALARM semi-synthetic learning · ALARMestimated total variation distanceHelped
Use spectral filtering instead of RANSAC subsamplingALARM semi-synthetic learning · ALARMestimated total variation distanceHelped
Increase the corrupted-sample fractionFiltering on ALARM · ALARMestimated total variation distanceHurt
Apply filtering when the balancedness assumption on conditional probabilities is violatedFixed-structure Bayesian network learning · Synthetic data and ALARMestimated total variation distanceHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy