Identifying contributors to supply chain outcomes in a multi-echelon setting: a decentralised approach

• URL: http://arxiv.org/abs/2307.12157v1
• Date: Sat, 22 Jul 2023 20:03:16 GMT
• Title: Identifying contributors to supply chain outcomes in a multi-echelon setting: a decentralised approach
• Authors: Stefan Schoepf, Jack Foster, Alexandra Brintrup
• Abstract summary: We propose the use of explainable artificial intelligence for decentralised computing of estimated contributions to a metric of interest. This approach mitigates the need to convince supply chain actors to share data, as all computations occur in a decentralised manner. Results demonstrate the effectiveness of our approach in detecting the source of quality variations compared to a centralised approach.
• Score: 69.62333053044712
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Organisations often struggle to identify the causes of change in metrics such as product quality and delivery duration. This task becomes increasingly challenging when the cause lies outside of company borders in multi-echelon supply chains that are only partially observable. Although traditional supply chain management has advocated for data sharing to gain better insights, this does not take place in practice due to data privacy concerns. We propose the use of explainable artificial intelligence for decentralised computing of estimated contributions to a metric of interest in a multi-stage production process. This approach mitigates the need to convince supply chain actors to share data, as all computations occur in a decentralised manner. Our method is empirically validated using data collected from a real multi-stage manufacturing process. The results demonstrate the effectiveness of our approach in detecting the source of quality variations compared to a centralised approach using Shapley additive explanations.

Related papers

• Federated Automatic Latent Variable Selection in Multi-output Gaussian Processes [0.7366405857677227]
  A common approach in MGPs to transfer knowledge across units involves gathering all data from each unit to a central server. We propose a hierarchical model that places spike-and-slab priors on the coefficients of each latent process. These priors help automatically select only needed latent processes by shrinking the coefficients of unnecessary ones to zero.
  arXiv  Detail & Related papers  (2024-07-24T02:03:28Z)
• Data Quality in Crowdsourcing and Spamming Behavior Detection [2.6481162211614118]
  We introduce a systematic method for evaluating data quality and detecting spamming threats via variance decomposition. A spammer index is proposed to assess entire data consistency and two metrics are developed to measure crowd worker's credibility.
  arXiv  Detail & Related papers  (2024-04-04T02:21:38Z)
• An Analysis of Multi-Agent Reinforcement Learning for Decentralized Inventory Control Systems [0.0]
  Most solutions to the inventory management problem assume a centralization of information incompatible with organisational constraints in real supply chain networks. This paper proposes a decentralized data-driven solution to inventory management problems using multi-agent reinforcement learning. Results show that using multi-agent proximal policy optimization with a centralized critic leads to performance very close to that of a centralized data-driven solution.
  arXiv  Detail & Related papers  (2023-07-21T08:52:08Z)
• Revisiting Modality Imbalance In Multimodal Pedestrian Detection [6.7841188753203046]
  We introduce a novel training setup with regularizer in the multimodal architecture to resolve the problem of this disparity between the modalities. Specifically, our regularizer term helps to make the feature fusion method more robust by considering both the feature extractors equivalently important during the training.
  arXiv  Detail & Related papers  (2023-02-24T11:56:57Z)
• Multi-View Knowledge Distillation from Crowd Annotations for Out-of-Domain Generalization [53.24606510691877]
  We propose new methods for acquiring soft-labels from crowd-annotations by aggregating the distributions produced by existing methods. We demonstrate that these aggregation methods lead to the most consistent performance across four NLP tasks on out-of-domain test sets.
  arXiv  Detail & Related papers  (2022-12-19T12:40:18Z)
• Towards federated multivariate statistical process control (FedMSPC) [1.8047694351309207]
  We propose a privacy-preserving, federated statistical process control (FedMSPC) framework based on Federated Principal Component Analysis (PCA) and Secure Multiparty Computation. Our empirical results demonstrate the superior fault detection capability of the proposed approach compared to standard, single-party (multiway) PCA.
  arXiv  Detail & Related papers  (2022-11-03T08:36:30Z)
• Concepts and Algorithms for Agent-based Decentralized and Integrated Scheduling of Production and Auxiliary Processes [78.120734120667]
  This paper describes an agent-based decentralized and integrated scheduling approach. Part of the requirements is to develop a linearly scaling communication architecture. The approach is explained using an example based on industrial requirements.
  arXiv  Detail & Related papers  (2022-05-06T18:44:29Z)
• Coarse to Fine: Domain Adaptive Crowd Counting via Adversarial Scoring Network [58.05473757538834]
  This paper proposes a novel adversarial scoring network (ASNet) to bridge the gap across domains from coarse to fine granularity. Three sets of migration experiments show that the proposed methods achieve state-of-the-art counting performance.
  arXiv  Detail & Related papers  (2021-07-27T14:47:24Z)
• Decentralized Local Stochastic Extra-Gradient for Variational Inequalities [125.62877849447729]
  We consider distributed variational inequalities (VIs) on domains with the problem data that is heterogeneous (non-IID) and distributed across many devices. We make a very general assumption on the computational network that covers the settings of fully decentralized calculations. We theoretically analyze its convergence rate in the strongly-monotone, monotone, and non-monotone settings.
  arXiv  Detail & Related papers  (2021-06-15T17:45:51Z)
• Dif-MAML: Decentralized Multi-Agent Meta-Learning [54.39661018886268]
  We propose a cooperative multi-agent meta-learning algorithm, referred to as MAML or Dif-MAML. We show that the proposed strategy allows a collection of agents to attain agreement at a linear rate and to converge to a stationary point of the aggregate MAML. Simulation results illustrate the theoretical findings and the superior performance relative to the traditional non-cooperative setting.
  arXiv  Detail & Related papers  (2020-10-06T16:51:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.