Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2211.17264
Cited By
Interpretability with full complexity by constraining feature information
30 November 2022
Kieran A. Murphy
Danielle Bassett
FAtt
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Interpretability with full complexity by constraining feature information"
7 / 7 papers shown
Title
Surveying the space of descriptions of a composite system with machine learning
Kieran A. Murphy
Yujing Zhang
D. Bassett
61
0
0
27 Nov 2024
Which bits went where? Past and future transfer entropy decomposition with the information bottleneck
Kieran A. Murphy
Zhuowen Yin
D. Bassett
24
0
0
07 Nov 2024
Machine-learning optimized measurements of chaotic dynamical systems via the information bottleneck
Kieran A. Murphy
Danielle Bassett
28
5
0
08 Nov 2023
Information decomposition in complex systems via machine learning
Kieran A. Murphy
Danielle Bassett
20
8
0
10 Jul 2023
A Rate-Distortion Framework for Explaining Black-box Model Decisions
Stefan Kolek
Duc Anh Nguyen
Ron Levie
Joan Bruna
Gitta Kutyniok
27
14
0
12 Oct 2021
Neural Oblivious Decision Ensembles for Deep Learning on Tabular Data
Sergei Popov
S. Morozov
Artem Babenko
LMTD
83
292
0
13 Sep 2019
Towards A Rigorous Science of Interpretable Machine Learning
Finale Doshi-Velez
Been Kim
XAI
FaML
225
3,672
0
28 Feb 2017
1