A non-trivial algorithm enumerating relevant features over finite fields

MaRDI QIDQ7025119zbMATH OpenFDO

Authors Mikito Nanashima

Publication date 19 February 2025

Full work available at URL https://proceedings.mlr.press/v117/nanashima20a.html

zbMATH Keywords

computational learning theoryexact learningfinite fieldslearning juntas

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• A faster subquadratic algorithm for finding outlier correlations
• A Fourier-analytic approach to Reed-Muller decoding
• An illuminating algorithm for the light bulb problem
• Analysis of Boolean Functions
• Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem
• Fixed-Parameter Tractability and Completeness I: Basic Results
• scientific article; zbMATH DE number 4023423 (Why is no real title available?)
• scientific article; zbMATH DE number 6846423 (Why is no real title available?)
• Learning functions of \(k\) relevant variables
• On lattices, learning with errors, random linear codes, and cryptography
• Parameterized learnability of juntas
• Powers of tensors and fast matrix multiplication
• Probability Inequalities for Sums of Bounded Random Variables
• Pseudorandom bits for polynomials
• Selection of relevant features and examples in machine learning

This page was built for publication: A non-trivial algorithm enumerating relevant features over finite fields

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