|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM349547637 |
| 003 |
DE-627 |
| 005 |
20231226042908.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231226s2023 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TPAMI.2022.3225162
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n1165.xml
|
| 035 |
|
|
|a (DE-627)NLM349547637
|
| 035 |
|
|
|a (NLM)36441893
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Chattopadhyay, Aditya
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Interpretable by Design
|b Learning Predictors by Composing Interpretable Queries
|
| 264 |
|
1 |
|c 2023
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 07.05.2023
|
| 500 |
|
|
|a Date Revised 07.05.2023
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a There is a growing concern about typically opaque decision-making with high-performance machine learning algorithms. Providing an explanation of the reasoning process in domain-specific terms can be crucial for adoption in risk-sensitive domains such as healthcare. We argue that machine learning algorithms should be interpretable by design and that the language in which these interpretations are expressed should be domain- and task-dependent. Consequently, we base our model's prediction on a family of user-defined and task-specific binary functions of the data, each having a clear interpretation to the end-user. We then minimize the expected number of queries needed for accurate prediction on any given input. As the solution is generally intractable, following prior work, we choose the queries sequentially based on information gain. However, in contrast to previous work, we need not assume the queries are conditionally independent. Instead, we leverage a stochastic generative model (VAE) and an MCMC algorithm (Unadjusted Langevin) to select the most informative query about the input based on previous query-answers. This enables the online determination of a query chain of whatever depth is required to resolve prediction ambiguities. Finally, experiments on vision and NLP tasks demonstrate the efficacy of our approach and its superiority over post-hoc explanations
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Slocum, Stewart
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Haeffele, Benjamin D
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Vidal, Rene
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Geman, Donald
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on pattern analysis and machine intelligence
|d 1979
|g 45(2023), 6 vom: 28. Juni, Seite 7430-7443
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnns
|
| 773 |
1 |
8 |
|g volume:45
|g year:2023
|g number:6
|g day:28
|g month:06
|g pages:7430-7443
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TPAMI.2022.3225162
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 45
|j 2023
|e 6
|b 28
|c 06
|h 7430-7443
|