Learning on Graphs for Mineral Asset Valuation Under Supply and Demand Uncertainty

• URL: http://arxiv.org/abs/2212.03865v1
• Date: Wed, 7 Dec 2022 00:30:18 GMT
• Title: Learning on Graphs for Mineral Asset Valuation Under Supply and Demand Uncertainty
• Authors: Yassine Yaakoubi, Hager Radi, Roussos Dimitrakopoulos
• Abstract summary: This work jointly addresses mineral asset valuation and mine plan scheduling and optimization under supply and demand uncertainty. Three graph-based solutions are proposed: (i) a neural branching policy that learns a block-sampling ore body representation, (ii) a guiding policy that learns to explore a selection tree. Results on two large-scale industrial mining complexes show a reduction of up to three orders of magnitude in primal suboptimality, execution time, and number of iterations, and an increase of up to 40% in the mineral asset value.
• Score: 2.1485350418225244
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Valuing mineral assets is a challenging task that is highly dependent on the supply (geological) uncertainty surrounding resources and reserves, and the uncertainty of demand (commodity prices). In this work, a graph-based reasoning, modeling and solution approach is proposed to jointly address mineral asset valuation and mine plan scheduling and optimization under supply and demand uncertainty in the "mining complex" framework. Three graph-based solutions are proposed: (i) a neural branching policy that learns a block-sampling ore body representation, (ii) a guiding policy that learns to explore a heuristic selection tree, (iii) a hyper-heuristic that manages the value/supply chain optimization and dynamics modeled as a graph structure. Results on two large-scale industrial mining complexes show a reduction of up to three orders of magnitude in primal suboptimality, execution time, and number of iterations, and an increase of up to 40% in the mineral asset value.

Related papers

• Managing Geological Uncertainty in Critical Mineral Supply Chains: A POMDP Approach with Application to U.S. Lithium Resources [30.240279885272827]
  The world is entering an unprecedented period of critical mineral demand, driven by renewable energy technologies and electric vehicles. This transition presents unique challenges in mineral resource development, particularly due to geological uncertainty. We propose a novel application of Partially Observable Markov Decision Processes (POMDPs) that optimize critical mineral sourcing decisions.
  arXiv  Detail & Related papers  (2025-02-08T20:44:44Z)
• Joint Pricing and Resource Allocation: An Optimal Online-Learning Approach [20.70943884841438]
  We study an online learning horizon where we make joint pricing and inventory decisions to maximize the overall net profit. We develop an efficient algorithm that utilizes a "Confidence Bound" strategy over multiple OCO.
  arXiv  Detail & Related papers  (2025-01-29T23:23:54Z)
• GraphRPM: Risk Pattern Mining on Industrial Large Attributed Graphs [33.131074213867464]
  We introduce GraphRPM, an industry-purpose parallel and distributed risk pattern mining framework on large attributed graphs. The framework incorporates a novel edge-involved graph isomorphism network alongside optimized operations for parallel graph computation.
  arXiv  Detail & Related papers  (2024-11-11T11:20:30Z)
• MetaTrading: An Immersion-Aware Model Trading Framework for Vehicular Metaverse Services [94.61039892220037]
  We propose an immersion-aware model trading framework that facilitates data provision for services while ensuring privacy through federated learning (FL) We design an incentive mechanism to incentivize metaverse users (MUs) to contribute high-value models under resource constraints. We develop a fully distributed dynamic reward algorithm based on deep reinforcement learning, without accessing any private information about MUs and other MSPs.
  arXiv  Detail & Related papers  (2024-10-25T16:20:46Z)
• Joint Admission Control and Resource Allocation of Virtual Network Embedding via Hierarchical Deep Reinforcement Learning [69.00997996453842]
  We propose a deep Reinforcement Learning approach to learn a joint Admission Control and Resource Allocation policy for virtual network embedding. We show that HRL-ACRA outperforms state-of-the-art baselines in terms of both the acceptance ratio and long-term average revenue.
  arXiv  Detail & Related papers  (2024-06-25T07:42:30Z)
• End-to-End Mineral Exploration with Artificial Intelligence and Ambient Noise Tomography [0.0]
  We focus on copper as a critical element, required in significant quantities for renewable energy solutions. We show the benefits of utilising ANT, characterised by its speed, scalability, depth penetration, resolution, and low environmental impact. We show how AI can augment geophysical data interpretation, providing a novel approach to mineral exploration.
  arXiv  Detail & Related papers  (2024-03-22T10:23:48Z)
• Improving Confidence in Evolutionary Mine Scheduling via Uncertainty Discounting [10.609857097723266]
  We introduce a new approach for determining an "optimal schedule under uncertainty" This treatment of uncertainty within an economic framework reduces previously difficult-to-use models of variability into actionable insights. We provide experimental studies using Maptek's mine planning software Evolution.
  arXiv  Detail & Related papers  (2023-05-29T08:43:09Z)
• When Demonstrations Meet Generative World Models: A Maximum Likelihood Framework for Offline Inverse Reinforcement Learning [62.00672284480755]
  This paper aims to recover the structure of rewards and environment dynamics that underlie observed actions in a fixed, finite set of demonstrations from an expert agent. Accurate models of expertise in executing a task has applications in safety-sensitive applications such as clinical decision making and autonomous driving.
  arXiv  Detail & Related papers  (2023-02-15T04:14:20Z)
• Factor Investing with a Deep Multi-Factor Model [123.52358449455231]
  We develop a novel deep multi-factor model that adopts industry neutralization and market neutralization modules with clear financial insights. Tests on real-world stock market data demonstrate the effectiveness of our deep multi-factor model.
  arXiv  Detail & Related papers  (2022-10-22T14:47:11Z)
• Pessimistic Minimax Value Iteration: Provably Efficient Equilibrium Learning from Offline Datasets [101.5329678997916]
  We study episodic two-player zero-sum Markov games (MGs) in the offline setting. The goal is to find an approximate Nash equilibrium (NE) policy pair based on a dataset collected a priori.
  arXiv  Detail & Related papers  (2022-02-15T15:39:30Z)
• Efficient Strategy Synthesis for MDPs with Resource Constraints [16.774128823546416]
  We consider strategy synthesis for the formalism called consumption Markov decision processes. The presented algorithms work in time with respect to the representation of the model.
  arXiv  Detail & Related papers  (2021-05-05T14:59:30Z)
• Coordinated Online Learning for Multi-Agent Systems with Coupled Constraints and Perturbed Utility Observations [91.02019381927236]
  We introduce a novel method to steer the agents toward a stable population state, fulfilling the given resource constraints. The proposed method is a decentralized resource pricing method based on the resource loads resulting from the augmentation of the game's Lagrangian.
  arXiv  Detail & Related papers  (2020-10-21T10:11:17Z)
• Cost-Sensitive Portfolio Selection via Deep Reinforcement Learning [100.73223416589596]
  We propose a cost-sensitive portfolio selection method with deep reinforcement learning. Specifically, a novel two-stream portfolio policy network is devised to extract both price series patterns and asset correlations. A new cost-sensitive reward function is developed to maximize the accumulated return and constrain both costs via reinforcement learning.
  arXiv  Detail & Related papers  (2020-03-06T06:28:17Z)

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.