Agnostic Learning in Permutation-Invariant Domains

DOI10.1145/2963169MaRDI QIDQ4962625zbMATH OpenOpenAlexFDO

Authors 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

Fourier analysislearning theoryrepresentation theory of the symmetric group

Mathematics Subject Classification ID

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

Recommendations

• Agnostically Learning Halfspaces
• Agnostic learning of disjunctions on symmetric distributions
• Agnostic active learning
• scientific article; zbMATH DE number 2089350
• Reliable agnostic learning
• scientific article; zbMATH DE number 1804109
• Efficient agnostic learning of neural networks with bounded fan-in
• Approximate resilience, monotonicity, and the complexity of agnostic learning
• Agnostic Learning from Tolerant Natural Proofs

Cited in

(3)

• Analysis of the IJCNN 2007 agnostic learning vs. prior knowledge challenge
• Gaussian field on the symmetric group: prediction and learning
• Agnostically Learning Halfspaces

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)