Agnostic Learning in Permutation-Invariant Domains

DOI10.1145/2963169zbMATH Open1445.68117OpenAlexW2489962967MaRDI QIDQ4962625

Karl Wimmer

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2963169

zbMATH Keywords

learning theoryFourier analysisrepresentation theory of the symmetric group

Mathematics Subject Classification ID

Computational learning theory (68Q32) Combinatorial aspects of representation theory (05E10) Representations of finite symmetric groups (20C30)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Reliable agnostic learning 👍 👎
• Agnostic active learning 👍 👎
• Agnostic learning of disjunctions on symmetric distributions 👍 👎
• Agnostically Learning Halfspaces 👍 👎
• Efficient agnostic learning of neural networks with bounded fan-in 👍 👎
• Agnostic Learning from Tolerant Natural Proofs 👍 👎
• Approximate resilience, monotonicity, and the complexity of agnostic learning 👍 👎

This page was built for publication: Agnostic Learning in Permutation-Invariant Domains

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