{"total":44,"rows":[{"id":"2304.06129","title":"Label-Free Concept Bottleneck Models","created":"2023-04-12","cited_by_count":285,"area":null},{"id":"2105.04857","title":"Leveraging Sparse Linear Layers for Debuggable Deep Networks","created":"2021-05-11","cited_by_count":82,"area":null},{"id":"2203.11654","title":"Fine-Grained Scene Graph Generation with Data Transfer","created":"2022-03-22","cited_by_count":57,"area":null},{"id":"2211.00385","title":"Behavioral Intention Prediction in Driving Scenes: A Survey","created":"2022-11-01","cited_by_count":30,"area":null},{"id":"2111.10934","title":"Privacy-preserving Federated Adversarial Domain Adaption over Feature Groups for Interpretability","created":"2021-11-22","cited_by_count":28,"area":null},{"id":"2204.11830","title":"Proto2Proto: Can you recognize the car, the way I do?","created":"2022-04-25","cited_by_count":23,"area":null},{"id":"2210.05189","title":"Neural Networks are Decision Trees","created":"2022-10-11","cited_by_count":17,"area":null},{"id":"2203.14932","title":"Attributable Visual Similarity Learning","created":"2022-03-28","cited_by_count":12,"area":null},{"id":"2407.16067","title":"LCA-on-the-Line: Benchmarking Out-of-Distribution Generalization with Class Taxonomies","created":"2024-07-22","cited_by_count":12,"area":null},{"id":"2103.03768","title":"VIPriors 1: Visual Inductive Priors for Data-Efficient Deep Learning Challenges","created":"2021-03-05","cited_by_count":11,"area":null},{"id":"2106.04072","title":"Coarse-to-Fine Curriculum Learning","created":"2021-06-08","cited_by_count":10,"area":null},{"id":"2304.11744","title":"SketchXAI: A First Look at Explainability for Human Sketches","created":"2023-04-23","cited_by_count":10,"area":null},{"id":"2209.03415","title":"A Survey of Neural Trees","created":"2022-09-07","cited_by_count":7,"area":null},{"id":"2304.13374","title":"SEAL: Simultaneous Label Hierarchy Exploration And Learning","created":"2023-04-26","cited_by_count":6,"area":null},{"id":"2408.09135","title":"Vanilla Gradient Descent for Oblique Decision Trees","created":"2024-08-17","cited_by_count":6,"area":null},{"id":"2212.09062","title":"Bort: Towards Explainable Neural Networks with Bounded Orthogonal Constraint","created":"2022-12-18","cited_by_count":5,"area":null},{"id":"2401.10442","title":"Path Choice Matters for Clear Attribution in Path Methods","created":"2024-01-19","cited_by_count":4,"area":null},{"id":"2505.24601","title":"Taxonomic Networks: A Representation for Neuro-Symbolic Pairing","created":"2025-05-30","cited_by_count":4,"area":null},{"id":"2108.06384","title":"Finding Representative Interpretations on Convolutional Neural Networks","created":"2021-08-13","cited_by_count":3,"area":null},{"id":"2302.05918","title":"Efficient Fraud Detection Using Deep Boosting Decision Trees","created":"2023-02-12","cited_by_count":3,"area":null},{"id":"2303.03389","title":"Contrastive Hierarchical Clustering","created":"2023-03-03","cited_by_count":3,"area":null},{"id":"2412.07802","title":"Language Model as Visual Explainer","created":"2024-12-08","cited_by_count":3,"area":null},{"id":"2203.01482","title":"MetaDT: Meta Decision Tree with Class Hierarchy for Interpretable Few-Shot Learning","created":"2022-03-03","cited_by_count":2,"area":null},{"id":"2605.24797","title":"HCL-FF: Hierarchical and Contrastive Learning for Forward-Forward Algorithm","created":"2026-05-24","cited_by_count":2,"area":null},{"id":"2107.13214","title":"SONG: Self-Organizing Neural Graphs","created":"2021-07-28","cited_by_count":1,"area":null},{"id":"2202.10677","title":"Transition Matrix Representation of Trees with Transposed Convolutions","created":"2022-02-22","cited_by_count":1,"area":null},{"id":"2310.04352","title":"Fair Feature Importance Scores for Interpreting Tree-Based Methods and Surrogates","created":"2023-10-06","cited_by_count":1,"area":null},{"id":"2404.18976","title":"Foundations of Multisensory Artificial Intelligence","created":"2024-04-29","cited_by_count":1,"area":null},{"id":"2406.02612","title":"Is Data Valuation Learnable and Interpretable?","created":"2024-06-03","cited_by_count":1,"area":null},{"id":"2411.17003","title":"Can a Single Tree Outperform an Entire Forest?","created":"2024-11-26","cited_by_count":1,"area":null},{"id":"2510.08635","title":"Hi-OSCAR: Hierarchical Open-set Classifier for Human Activity Recognition","created":"2025-10-08","cited_by_count":1,"area":null},{"id":"2101.08656","title":"Dive into Decision Trees and Forests: A Theoretical Demonstration","created":"2021-01-20","cited_by_count":0,"area":null},{"id":"2107.09909","title":"DRDF: Determining the Importance of Different Multimodal Information with Dual-Router Dynamic Framework","created":"2021-07-21","cited_by_count":0,"area":null},{"id":"2108.07714","title":"Harnessing value from data science in business: ensuring explainability and fairness of solutions","created":"2021-08-10","cited_by_count":0,"area":null},{"id":"2112.01187","title":"Computing Class Hierarchies from Classifiers","created":"2021-12-02","cited_by_count":0,"area":null},{"id":"2202.05343","title":"Towards Disentangling Information Paths with Coded ResNeXt","created":"2022-02-10","cited_by_count":0,"area":null},{"id":"2211.04693","title":"Deep Explainable Learning with Graph Based Data Assessing and Rule Reasoning","created":"2022-11-09","cited_by_count":0,"area":null},{"id":"2303.14937","title":"LEURN: Learning Explainable Univariate Rules with Neural Networks","created":"2023-03-27","cited_by_count":0,"area":null},{"id":"2402.08423","title":"Vehicle Behavior Prediction by Episodic-Memory Implanted NDT","created":"2024-02-13","cited_by_count":0,"area":null},{"id":"2406.00073","title":"A Novel Review of Stability Techniques for Improved Privacy-Preserving Machine Learning","created":"2024-05-31","cited_by_count":0,"area":null},{"id":"2506.08612","title":"Data-Efficient Challenges in Visual Inductive Priors: A Retrospective","created":"2025-06-10","cited_by_count":0,"area":null},{"id":"2510.21998","title":"From Black-box to Causal-box: Towards Building More Interpretable Models","created":"2025-10-24","cited_by_count":0,"area":null},{"id":"2605.07837","title":"Approximation-Free Differentiable Oblique Decision Trees","created":"2026-05-08","cited_by_count":0,"area":null},{"id":"2606.23609","title":"Discovering Latent Groups for Robust Classification","created":"2026-06-22","cited_by_count":0,"area":null}],"next_cursor":null}