Semi-supervised group DRO: combating sparsity with unlabeled data

MaRDI QIDQ7017122zbMATH OpenFDO

Authors Pranjal Awasthi, Satyen Kale, Ankit Pensia

Publication date 6 March 2025

Full work available at URL https://proceedings.mlr.press/v237/awasthi24a.html

zbMATH Keywords

data sparsitygroup DROmin-max fairnesssemi-supervised learning

Mathematics Subject Classification ID

Statistical aspects of big data and data science (62R07) Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• A theory of learning from different domains
• Foundations of machine learning
• High-dimensional probability. An introduction with applications in data science
• scientific article; zbMATH DE number 1448976 (Why is no real title available?)
• Linear algorithms for online multitask classification
• Oracle inequalities and optimal inference under group sparsity
• Robust optimization
• Statistics of robust optimization: a generalized empirical likelihood approach
• The benefit of multitask representation learning
• Two-player games for efficient non-convex constrained optimization
• Understanding machine learning. From theory to algorithms
• Wasserstein distributionally robust optimization and variation regularization

This page was built for publication: Semi-supervised group DRO: combating sparsity with unlabeled data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7017122)