InfoGram and admissible machine learning

DOI10.1007/S10994-021-06121-4MaRDI QIDQ2127228zbMATH OpenOpenAlexFDO

Authors Subhadeep Mukhopadhyay

Publication date 20 April 2022

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2108.07380

zbMATH Keywords

admissible machine learningALFA-testingalgorithmic risk managementCOREmlfairnessFINEmlInfoGraminformation-theoryinterpretabilityL-features

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• A definition of conditional mutual information for arbitrary ensembles
• Greedy function approximation: A gradient boosting machine.
• scientific article; zbMATH DE number 6438182 (Why is no real title available?)
• Panning for Gold: ‘Model-X’ Knockoffs for High Dimensional Controlled Variable Selection
• Population theory for boosting ensembles.
• Statistical behavior and consistency of classification methods based on convex risk minimization.
• The conditional permutation test for independence while controlling for confounders

Describes a project that uses

Uses Software

• iRF
• plsgenomics
• glmnet

This page was built for publication: InfoGram and admissible machine learning

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