IP Library › Granted Patent US 12,488,242
Granted Patent B2
US 12,488,242 · App. 18/596,992 · Granted Dec 2, 2025

Method for an explainable autoencoder and an explainable generative adversarial network

Inventors: Angelo Dalli (Floriana, MT); Mauro Pirrone (Kalkara, MT); Matthew Grech (San Gwann, MT)
Assignee: UMNAI Limited
G06N3/08
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,488,242
App. No.
18/596,992
Granted
Dec 2, 2025
Kind
B2
Abstract

An exemplary embodiment provides an autoencoder which is explainable. An exemplary autoencoder may explain the degree to which each feature of the input attributed to the output of the system, which may be a compressed data representation. An exemplary embodiment may be used for classification, such as anomaly detection, as well as other scenarios where an autoencoder is input to another machine learning system or when an autoencoder is a component in an end-to-end deep learning architecture. An exemplary embodiment provides an explainable generative adversarial network that adds explainable generation, simulation and discrimination capabilities. The underlying architecture of an exemplary embodiment may be based on an explainable or interpretable neural network, allowing the underlying architecture to be a fully explainable white-box machine learning system.

Claims (32)

1 . A non-transitory computer-readable medium comprising computer program code that, when executed by a computer comprising a processor and a memory, is configured to configure the computer to perform steps for providing an explainable model comprising one or more of an explainable autoencoder and an explainable generative adversarial network, the steps comprising:

forming a first model and a second model; wherein one or more of the first model and second model is a white-box explainable model comprising a first feature importance vector having a global level of explainability; and

generating, with the first model and the second model, simultaneously in a single feed-forward step, one or more rules, a plurality of feature attributions, and one or more explanations, by steps comprising:

generating synthetic data from the first model and inputting the synthetic data and/or an input dataset to the second model, and forming the explainable model, the explainable model comprising one or more of the explainable autoencoder and the explainable generative adversarial network based on an output of the second model associated with the synthetic data and/or the input dataset, wherein forming the explainable model comprises identifying a plurality of partitions associated with the synthetic data and/or the input dataset, wherein the partitions are arranged in a hierarchy, each partition in the hierarchy having a predetermined proximity to each other partition in the hierarchy, said predetermined proximity defined by the hierarchy, wherein each partition in the hierarchy comprises a second feature importance vector having an intermediate level of explainability;

extracting partition information from the explainable model and identifying the plurality of feature attributions associated with a plurality of features of the input dataset; and

generating the one or more explanations based on the partition information and the plurality of feature attributions; and

terminating processing associated with generating the one or more rules, the plurality of feature attributions, and the one or more explanations, and outputting the one or more explanations, following the single feed-forward step.

2 . The non-transitory computer-readable medium according to claim 1 , wherein the input dataset is input into the second model, wherein the input dataset comprises an output of a deep learning system.

3 . The non-transitory computer-readable medium according to claim 2 , wherein the deep learning system is one of a convolutional neural network (CNN) or an explainable convolutional neural network (CNN-XNN), and wherein the output of the deep learning system is an image.

4 . The non-transitory computer-readable medium according to claim 3 , wherein the image is an X-ray image, and wherein identifying the plurality of feature attributions associated with a plurality of features of the input dataset comprises highlighting one or more pixels in the image.

5 . The non-transitory computer-readable medium according to claim 4 , further comprising identifying a reconstruction loss in the X-ray image, comparing the reconstruction loss to a threshold, and identifying an anomaly based on comparison of the reconstruction loss to the threshold.

6 . The non-transitory computer-readable medium according to claim 1 , wherein the input dataset is a plurality of partial medical readings, and wherein the steps comprise applying at least one network reversibility method to reconstruct a medical image from the plurality of partial medical readings.

7 . The non-transitory computer-readable medium according to claim 1 , wherein the input dataset comprises a medical image and at least one additional feature, and wherein the steps comprise encoding the medical image into a latent space, and, after encoding the medical image into the latent space, connecting the at least one additional feature.

8 . The non-transitory computer-readable medium according to claim 7 , wherein the at least one additional feature is human knowledge and wherein the steps further comprise injecting human knowledge into the explainable model, wherein the human knowledge creates or alters the one or more rules or one or more of the plurality of partitions, and wherein the created or altered one or more rules or one or more of the plurality of partitions is static and unchangeable by the explainable model, and wherein the human knowledge is expressed as a knowledge graph comprising nodes that describe human defined entities, and edges that describe a relationship between nodes; and wherein each node in the knowledge graph comprises one or more taxonomy identifiers that contribute to a classification of knowledge in the knowledge graph, wherein the knowledge graph comprises multiple taxonomies; and wherein one or more taxonomy identifiers are configured to fuse a plurality of knowledge graphs together.

9 . The non-transitory computer-readable medium according to claim 1 , wherein the input dataset comprises a video comprising a plurality of images arranged in a sequence, and wherein identifying the plurality of feature attributions associated with a plurality of features of the input dataset comprises highlighting one or more pixels in each image in the sequence.

10 . The non-transitory computer-readable medium according to claim 1 , wherein the input dataset comprises a loan application, wherein the one or more explanations comprise attributes of the loan application contributing to acceptance or rejection, and wherein generating the one or more explanations comprises determining that at least one attribute of the loan application is associated with an illegal outcome state.

11 . The non-transitory computer-readable medium according to claim 1 , wherein the explainable model is configured to be used as the basis or part of a practical data privacy preserving artificial intelligence (AI) system implementation, including at least one of: a differential privacy solution, a secure multi-party computation solution, a federated learning solution, and a homomorphic encryption solution.

12 . The non-transitory computer-readable medium according to claim 11 , wherein the explainable model includes the differential privacy solution, comprising a step of introducing noise in training data governed by a predetermined noise factor.

13 . The non-transitory computer-readable medium according to claim 11 , wherein the explainable model includes the secure multi-party computation solution, comprising a step of performing a portion of computation steps in a protected space.

14 . The non-transitory computer-readable medium according to claim 11 , wherein the explainable model includes the federated learning solution, comprising a step of executing the explainable model across a plurality of devices, each holding local data samples not shared with each other device in the plurality of devices.

15 . The non-transitory computer-readable medium according to claim 11 , wherein the explainable model includes the homomorphic encryption solution, comprising a step of executing one or more computations directly on encrypted data.

16 . The non-transitory computer-readable medium according to claim 1 , further comprising a step of sending the one or more explanations to a workflow system, and receiving feedback data from the workflow system and updating the explainable autoencoder based on the feedback data.

17 . The non-transitory computer-readable medium according to claim 16 , wherein the workflow system is a component of a Robotic Process Automation (RPA) system.

18 . The non-transitory computer-readable medium according to claim 17 , wherein the input dataset comprises sequence data comprising sensing data including at least one of LIDAR data, RADAR data, SONAR data, or sensor data.

19 . The non-transitory computer-readable medium according to claim 16 , wherein the workflow system is a component of a Decision Support System (DSS).

20 . A computer apparatus comprising a processor and a memory, the memory comprising program code configured to configure the processor to perform steps for providing an explainable model comprising one or more of an explainable autoencoder and an explainable generative adversarial network, the steps comprising:

forming a first model and a second model; wherein one or more of the first model and second model is a white-box explainable model comprising a first feature importance vector having a global level of explainability; and

generating, with the first model and the second model, simultaneously in a single feed-forward step, one or more rules, a plurality of feature attributions, and one or more explanations, by steps comprising:

generating synthetic data from the first model and inputting the synthetic data and/or an input dataset to the second model, and forming the explainable model, the explainable model comprising one or more of the explainable autoencoder and the explainable generative adversarial network based on an output of the second model associated with the synthetic data and/or the input dataset, wherein forming the explainable model comprises identifying a plurality of partitions associated with the synthetic data and/or the input dataset, wherein the partitions are arranged in a hierarchy, each partition in the hierarchy having a predetermined proximity to each other partition in the hierarchy, said predetermined proximity defined by the hierarchy, wherein each partition in the hierarchy comprises a second feature importance vector having an intermediate level of explainability;

extracting partition information from the explainable model and identifying the plurality of feature attributions associated with a plurality of features of the input dataset; and

generating the one or more explanations based on the partition information and the plurality of feature attributions; and

terminating processing associated with generating the one or more rules, the plurality of feature attributions, and the one or more explanations, and outputting the one or more explanations, following the single feed-forward step.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 6, 2024
From: DALLI, ANGELO; PIRRONE, MAURO; GRECH, MATTHEW
To: UMNAI LIMITED
Reel/Frame 066667/0567 →
Continuity (3)
Continuation 17527726 · Nov 16, 2021
Provisional Application 63114109 · Nov 16, 2020
Related Publication 20240249143A1 · Jul 25, 2024
References Cited (36)
US 10783401B1 · Jiang · 2020 [cited by examiner]
US 20140280193A1 · Cronin et al. · 2014 [cited by applicant]
US 20180197081A1 · Ji et al. · 2018 [cited by applicant]
US 20200187841A1 · Ayyad · 2020 [cited by examiner]
US 20210110254A1 · Hoang · 2021 [cited by examiner]
US 20210287141A1 · Molloy · 2021 [cited by examiner]
US 20210326723A1 · Kumar · 2021 [cited by examiner]
EP 3640814A1 · 2020 [cited by applicant]
Zhao et al. (“Learning Hierarchical Features from Deep Generative Models” Machine Learning, PMLR 70:4091-4099, 2017) (Year: 2017). [cited by examiner]
Tschannen et al (“Recent Advances in Autoencoder-Based Representation Learning”, arXiv, NeurIPS 2018) (Year: 2018). [cited by examiner]
Loyola-González et al (“Black-Box vs. White-Box: Understanding Their Advantages and Weaknesses From a Practical Point of View,” in IEEE Access, vol. 7, pp. 154096-154113, 2019) (Year: 2019). [cited by examiner]
Feng et al. (“Interpretable Partitioned Embedding for Customized Fashion Outfit Composition”, Alibaba Group, 2017) (Year: 2017). [cited by examiner]
Papernot et al. (“Practical Black-Box Attacks against Machine Learning”, Association for Computing Machinery, pp. = {506-519}, 2017) (Year: 2017). [cited by examiner]
Antwarg, L., Miller, R.M., Shapira, B. and Rokach, L., 2019, “Explaining anomalies detected by autoencoders using SHAP”, ACM, arXiv preprint arXiv:1903.02407, 5 pages. [cited by applicant]
Bellini, V., Anelli, V.W., Di Noia, T. and Di Sciascio, E., Aug. 2017, “Auto-encoding user ratings via knowledge graphs in recommendation scenarios”, DLRS 2017: Proceedings of the 2nd Workshop on Deep Learning for Recom… [cited by applicant]
Denton, E., Chintala, S., Szlam, A. and Fergus, R., 2015, “Deep generative image models using a Laplacian pyramid of adversarial networks”, arXiv preprint arXiv:1506.05751., 2 pages. [cited by applicant]
Gondara, L., Dec. 2016, “Medical image denoising using convolutional denoising autoencoders” In 2016 IEEE 16th international conference on data mining workshops (ICDMW) (pp. 241-246). IEEE., Abstract attached, 3 pages. [cited by applicant]
Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A. and Bengio, Y., 2014. “Generative adversarial nets” Advances in neural information processing systems, 27., 9 pages. [cited by applicant]
Graves, L., Nagisetty, V., Scott, J. and Ganesh, V., Submitted on Feb. 24, 2020 (this version), latest version Oct. 26, 2020 (v2), “LogicGAN: Logic-guided Generative Adversarial Networks”, arXiv e-prints, pp. arXiv-2002… [cited by applicant]
Hinton, G.E. and Salakhutdinov, R.R., 2006, “Reducing the dimensionality of data with neural networks” science, vol. 313(5786), pp. 504-507, Abstract attached, 3 pages. [cited by applicant]
Ho, J. and Ermon, S., 2016, “Generative adversarial imitation learning” Advances in neural information processing systems, 29, pp. 4565-4573, 9 pages. [cited by applicant]
Kingma, D.P. and Welling, M., 2013, “Auto-encoding variational bayes”, arXiv preprint arXiv:1312.6114., 14 pages. [cited by applicant]
Kocaoglu, M., Snyder, C., Dimakis, A.G. and Vishwanath, S., 2017, “Causalgan: Learning causal implicit generative models with adversarial training” arXiv preprint arXiv:1709.02023., 37 pages. [cited by applicant]
Lundberg, S.M. and Lee, S.I., Dec. 2017, “A unified approach to interpreting model predictions” In Proceedings of the 31st international conference on neural information processing systems, pp. 4768-4777, 10 pages. [cited by applicant]
Mirza, M. and Osindero, S., 2014, “Conditional generative adversarial nets”, arXiv preprint arXiv:1411.1784., 7 pages. [cited by applicant]
Nagisetty, V., Graves, L., Scott, J. and Ganesh, V., 2020, “xAl-GAN: Enhancing Generative Adversarial Networks via Explainable AI Systems”, Association for the Advancement of Artificial Intelligence (www.aaai.org), 9 pa… [cited by applicant]
Nguyen, Q.P., Lim, K.W., Divakaran, D.M., Low, K.H. and Chan, M.C., Jun. 2019, “GEE: A gradient-based explainable variational autoencoder for network anomaly detection” In 2019 IEEE Conference on Communications and Netw… [cited by applicant]
Qin, C. Wu, Y. Springerberg, J.T. Brock, A. Donahue, H. Lillicrap, T. and Kohli, P. “Training Generative Adversarial Networks by Solving Ordinary Differential Equations”, In 34th Conference on Neural Information Process… [cited by applicant]
Simonyan, K., Vedaldi, A. and Zisserman, A., 2013, “Deep inside convolutional networks: Visualising image classification models and saliency maps”, arXiv preprint arXiv:1312.6034., 8 pages. [cited by applicant]
Vincent, P., Larochelle, H., Lajoie, I., Bengio, Y., Manzagol, P.A. and Bottou, L., 2010, “Stacked denoising autoencoders: Learning useful representations in a deep network with a local denoising criterion” Journal of m… [cited by applicant]
Zhao, J., Kim, Y., Zhang, K., Rush, A.M. and LeCun, Y., 2017, “Adversarially Regularized Autoencoders” arXiv e-prints, pp. arXiv-1706, 18 pages. [cited by applicant]
Al-Muhaini et al. (“Minimal Cut Sets, Petri Nets, and Prime Number Encoding in Distribution System Reliability Evaluation”, © 2012 IEEE) (Year: 2012). [cited by applicant]
Rocchetto et al. (“Learning hard quantum distributions with variational autoencoders”, npj Quantum Information (Jun. 28, 2018) (Year: 2018). [cited by applicant]
Chae et al. (“Collaborative Adversarial Autoencoders: An Effective Collaborative Filtering Model Under the GAN Framework”, IEEE , Mar. 1, 2019) (Year: 2019). [cited by applicant]
Tantipongpipat et al. (“Differentially Private Mixed-Type Data Generation for Unsupervised Learning”, ResearchGate, Dec. 6, 2019). [cited by applicant]
Zhao et al. (“Learning Hierarchical Features from Deep Generative Models” Machine Learning, PMLR 70:4091-4099, (Year: 2017). [cited by applicant]