atlas

Research map / Learning theory and algorithms / Sample complexity

Learning Functional Distributions with Private Labels

ICML 2023 · Learning theory and algorithms › Sample complexity · approach: Learning halfspaces under noise

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
Add noisy label kernel K_eta (label randomization) with noise level eta < (M-1)/M and known eta to the predictorNoisy Smooth Bayesian Predictor for finite hypothesis classes · finite F, adversarial features (singleton distributions S)expected KL-risk (theoretical upper bound)Mixed
Bounded-away-from-zero probabilities (delta_min) instead of adversarial near-zero probabilitiesFinite hypothesis class predictor (no smoothing, K_eta^{-1} of Bayesian average) · finite F with p(x)[y] >= delta_minexpected KL-risk (theoretical upper bound)Helped
Noise kernel K_eta applied to labels (noisy labels) relative to noiseless settingLearning functional distributions · finite F, adversarial featuresexpected KL-risk growth rateHurt

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