Resilience Evaluation of Entropy Regularized Logistic Networks with Probabilistic Cost

• URL: http://arxiv.org/abs/2212.02060v1
• Date: Mon, 5 Dec 2022 06:51:14 GMT
• Title: Resilience Evaluation of Entropy Regularized Logistic Networks with Probabilistic Cost
• Authors: Koshi Oishi, Yota Hashizume, Tomohiko Jimbo, Hirotaka Kaji, and Kenji Kashima
• Abstract summary: The demand for resilient logistics networks has increased because of recent disasters. In this study, we proposed a method for designing a resilient logistics network based on entropy regularization.
• Score: 5.743156139082517
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The demand for resilient logistics networks has increased because of recent disasters. When we consider optimization problems, entropy regularization is a powerful tool for the diversification of a solution. In this study, we proposed a method for designing a resilient logistics network based on entropy regularization. Moreover, we proposed a method for analytical resilience criteria to reduce the ambiguity of resilience. First, we modeled the logistics network, including factories, distribution bases, and sales outlets in an efficient framework using entropy regularization. Next, we formulated a resilience criterion based on probabilistic cost and Kullback--Leibler divergence. Finally, our method was performed using a simple logistics network, and the resilience of the three logistics plans designed by entropy regularization was demonstrated.

Related papers

• Rigorous Probabilistic Guarantees for Robust Counterfactual Explanations [80.86128012438834]
  We show for the first time that computing the robustness of counterfactuals with respect to plausible model shifts is NP-complete. We propose a novel probabilistic approach which is able to provide tight estimates of robustness with strong guarantees.
  arXiv  Detail & Related papers  (2024-07-10T09:13:11Z)
• A network-constrain Weibull AFT model for biomarkers discovery [0.0]
  AFTNet is a network-constraint survival analysis method based on the Weibull accelerated failure time (AFT) model. We present an efficient iterative computational algorithm based on the proximal descent gradient method.
  arXiv  Detail & Related papers  (2024-02-28T11:12:53Z)
• Imitation-regularized Optimal Transport on Networks: Provable Robustness and Application to Logistics Planning [4.943443725022745]
  The I-OT solution demonstrated robustness in terms of the cost defined on the network. We also examined the imitation and apriori risk information scenarios to demonstrate the usefulness and implications of the proposed method.
  arXiv  Detail & Related papers  (2024-02-28T01:19:42Z)
• End-to-End Meta-Bayesian Optimisation with Transformer Neural Processes [52.818579746354665]
  This paper proposes the first end-to-end differentiable meta-BO framework that generalises neural processes to learn acquisition functions via transformer architectures. We enable this end-to-end framework with reinforcement learning (RL) to tackle the lack of labelled acquisition data.
  arXiv  Detail & Related papers  (2023-05-25T10:58:46Z)
• Compressed Regression over Adaptive Networks [58.79251288443156]
  We derive the performance achievable by a network of distributed agents that solve, adaptively and in the presence of communication constraints, a regression problem. We devise an optimized allocation strategy where the parameters necessary for the optimization can be learned online by the agents.
  arXiv  Detail & Related papers  (2023-04-07T13:41:08Z)
• Provably tuning the ElasticNet across instances [53.0518090093538]
  We consider the problem of tuning the regularization parameters of Ridge regression, LASSO, and the ElasticNet across multiple problem instances. Our results are the first general learning-theoretic guarantees for this important class of problems.
  arXiv  Detail & Related papers  (2022-07-20T21:22:40Z)
• Finite-Time Analysis of Entropy-Regularized Neural Natural Actor-Critic Algorithm [29.978816372127085]
  We present a finite-time analysis of Natural actor-critic (NAC) with neural network approximation. We identify the roles of neural networks, regularization and optimization techniques to achieve provably good performance.
  arXiv  Detail & Related papers  (2022-06-02T02:13:29Z)
• Edge Rewiring Goes Neural: Boosting Network Resilience via Policy Gradient [62.660451283548724]
  ResiNet is a reinforcement learning framework to discover resilient network topologies against various disasters and attacks. We show that ResiNet achieves a near-optimal resilience gain on multiple graphs while balancing the utility, with a large margin compared to existing approaches.
  arXiv  Detail & Related papers  (2021-10-18T06:14:28Z)
• Entropic alternatives to initialization [0.0]
  We analyze anisotropic, local entropic smoothenings in the language of statistical physics and information theory. We comment some aspects related to the physics of renormalization and the spacetime structure of convolutional networks.
  arXiv  Detail & Related papers  (2021-07-16T08:17:32Z)
• Multivariate Deep Evidential Regression [77.34726150561087]
  A new approach with uncertainty-aware neural networks shows promise over traditional deterministic methods. We discuss three issues with a proposed solution to extract aleatoric and epistemic uncertainties from regression-based neural networks.
  arXiv  Detail & Related papers  (2021-04-13T12:20:18Z)
• DANR: Discrepancy-aware Network Regularization [15.239252118069762]
  Network regularization is an effective tool for learning coherent models over networks. We propose a novel approach that is robust to inadequate regularizations and effectively captures model evolution and structural changes over-temporal networks. We develop a scalable and scalable algorithm based on the alternating method of multipliers (ADMM) to solve the proposed problem with guaranteed convergence to global optimum solutions.
  arXiv  Detail & Related papers  (2020-05-31T02:01:19Z)

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.