atlas

Research map / Learning theory and algorithms / Sample complexity

Robust Learning of Fixed-Structure Bayesian Networks in Nearly-Linear Time

ICLR 2021 · Learning theory and algorithms › Sample complexity · approach: Learning halfspaces under noise · 0 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
Reduce robust Bayesian-network learning to robust mean estimation and use a sparse-input mean estimatorFixed-structure Bayesian networks · Fixed-structure binary Bayesian networksrunning time: Previous: \Omega(N d^2/{\epsilon}); proposed: \widetilde O(N d)Helped
Use robust mean estimation on sparse expanded samplesRobust Bayesian-network learning · Fixed-structure binary Bayesian networkstotal variation distance: O( {\epsilon}\sqrt{\log(1/{\epsilon})}/ \sqrt{\alpha c})Helped
Use a sparse-input robust mean estimation algorithmRobust mean estimation · Robust mean estimation with sparse inputrunning time: \widetilde O(\log R \cdot (\mathrm{nnz}(S) + N + d))Helped

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