상세 보기
Guilt by association: Interpretable multiplex graph learning of accounting-risk contagion
- Kang, Hojun;
- Lee, Sang-Gun
WEB OF SCIENCE
0SCOPUS
0초록
Severe accounting failures-material internal-control weaknesses, fraudulent restatements, and enforcement actions-are rare, costly, and relational: they cluster along the networks binding firms to common auditors, directors, and owners. We recast next-year failure prediction as node classification on a temporal multiplex firm graph whose layers encode a nested auditor hierarchy, board interlocks, and common ownership, and ask when the graph adds to the node-attribute signal. Methodologically, the usual graph-versus-tabular comparison is unfair: graph models receive node features that the tabular baselines are denied; once equalised, every standard graph network falls behind gradient-boosted trees. Architecturally, we introduce ACE-GNN, a pure multiplex network whose strength comes not from a richer operator-ruled out by a deliberate negative result-but from quantile encoding of node attributes and zero-inflated neighbour-exposure signals. ACE-GNN matches the strongest tabular learner, and a tree handed the same exposures attains near-identical accuracy, so the graph's advantage lies in faithful relation-level explanation, not accuracy. For interpretability, silent failures-firms whose warnings arrive only through their ties-are traced by edge-removal counterfactuals to specific auditor peers. These results delineate when graph-based AI earns its place on relational-but-tabular problems-and when it does not.
키워드
- 제목
- Guilt by association: Interpretable multiplex graph learning of accounting-risk contagion
- 저자
- Kang, Hojun; Lee, Sang-Gun
- 발행일
- 2027-02
- 유형
- Article
- 권
- 762
- 언어
- ENG
- 출판사
- ELSEVIER SCIENCE INC
- 발행국가
- 미국
- ISSN
- E 1872-6291
P 0020-0255