Feb. 6, 2024, 5:42 a.m. | Hao Chen Jindong Wang Lei Feng Xiang Li Yidong Wang Xing Xie Masashi Sugiyama Rita Singh

cs.LG updates on arXiv.org arxiv.org

Weakly supervised learning generally faces challenges in applicability to various scenarios with diverse weak supervision and in scalability due to the complexity of existing algorithms, thereby hindering the practical deployment. This paper introduces a general framework for learning from weak supervision (GLWS) with a novel algorithm. Central to GLWS is an Expectation-Maximization (EM) formulation, adeptly accommodating various weak supervision sources, including instance partial labels, aggregate statistics, pairwise observations, and unlabeled data. We further present an advanced algorithm that significantly simplifies …

algorithm algorithms challenges complexity cs.ai cs.lg deployment diverse expectation-maximization framework general novel paper practical scalability supervised learning supervision

Founding AI Engineer, Agents

@ Occam AI | New York

AI Engineer Intern, Agents

@ Occam AI | US

AI Research Scientist

@ Vara | Berlin, Germany and Remote

Data Architect

@ University of Texas at Austin | Austin, TX

Data ETL Engineer

@ University of Texas at Austin | Austin, TX

Lead GNSS Data Scientist

@ Lurra Systems | Melbourne