Energy Storage Price Arbitrage via Opportunity Value Function Prediction

• URL: http://arxiv.org/abs/2211.07797v1
• Date: Mon, 14 Nov 2022 23:31:11 GMT
• Title: Energy Storage Price Arbitrage via Opportunity Value Function Prediction
• Authors: Ningkun Zheng, Xiaoxiang Liu, Bolun Xu, Yuanyuan Shi
• Abstract summary: This paper proposes a novel energy storage price arbitrage algorithm combining supervised learning with dynamic programming. We generate the historical optimal opportunity value function using price data and a dynamic programming algorithm. Our method achieves 65% to 90% profit compared to perfect foresight in case studies using different energy storage models and price data from New York State.
• Score: 1.8638865257327275
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper proposes a novel energy storage price arbitrage algorithm combining supervised learning with dynamic programming. The proposed approach uses a neural network to directly predicts the opportunity cost at different energy storage state-of-charge levels, and then input the predicted opportunity cost into a model-based arbitrage control algorithm for optimal decisions. We generate the historical optimal opportunity value function using price data and a dynamic programming algorithm, then use it as the ground truth and historical price as predictors to train the opportunity value function prediction model. Our method achieves 65% to 90% profit compared to perfect foresight in case studies using different energy storage models and price data from New York State, which significantly outperforms existing model-based and learning-based methods. While guaranteeing high profitability, the algorithm is also light-weighted and can be trained and implemented with minimal computational cost. Our results also show that the learned prediction model has excellent transferability. The prediction model trained using price data from one region also provides good arbitrage results when tested over other regions.

Related papers

• Compute-Constrained Data Selection [77.06528009072967]
  We formalize the problem of data selection with a cost-aware utility function, and model the problem as trading off initial-selection cost for training gain. We run a comprehensive sweep of experiments across multiple tasks, varying compute budget by scaling finetuning tokens, model sizes, and data selection compute.
  arXiv  Detail & Related papers  (2024-10-21T17:11:21Z)
• Rejection via Learning Density Ratios [50.91522897152437]
  Classification with rejection emerges as a learning paradigm which allows models to abstain from making predictions. We propose a different distributional perspective, where we seek to find an idealized data distribution which maximizes a pretrained model's performance. Our framework is tested empirically over clean and noisy datasets.
  arXiv  Detail & Related papers  (2024-05-29T01:32:17Z)
• A Study on Stock Forecasting Using Deep Learning and Statistical Models [3.437407981636465]
  This paper will review many deep learning algorithms for stock price forecasting. We use a record of s&p 500 index data for training and testing. It will discuss various models, including the Auto regression integration moving average model, the Recurrent neural network model, the long short-term model, the convolutional neural network model, and the full convolutional neural network model.
  arXiv  Detail & Related papers  (2024-02-08T16:45:01Z)
• Value function estimation using conditional diffusion models for control [62.27184818047923]
  We propose a simple algorithm called Diffused Value Function (DVF) It learns a joint multi-step model of the environment-robot interaction dynamics using a diffusion model. We show how DVF can be used to efficiently capture the state visitation measure for multiple controllers.
  arXiv  Detail & Related papers  (2023-06-09T18:40:55Z)
• ASPEST: Bridging the Gap Between Active Learning and Selective Prediction [56.001808843574395]
  Selective prediction aims to learn a reliable model that abstains from making predictions when uncertain. Active learning aims to lower the overall labeling effort, and hence human dependence, by querying the most informative examples. In this work, we introduce a new learning paradigm, active selective prediction, which aims to query more informative samples from the shifted target domain.
  arXiv  Detail & Related papers  (2023-04-07T23:51:07Z)
• Can Direct Latent Model Learning Solve Linear Quadratic Gaussian Control? [75.14973944905216]
  We study the task of learning state representations from potentially high-dimensional observations. We pursue a direct latent model learning approach, where a dynamic model in some latent state space is learned by predicting quantities directly related to planning.
  arXiv  Detail & Related papers  (2022-12-30T01:42:04Z)
• Predictive Accuracy of a Hybrid Generalized Long Memory Model for Short Term Electricity Price Forecasting [0.0]
  This study investigates the predictive performance of a new hybrid model based on the Generalized long memory autoregressive model (k-factor GARMA) The performance of the proposed model is evaluated using data from Nord Pool Electricity markets.
  arXiv  Detail & Related papers  (2022-04-18T12:21:25Z)
• Design and Analysis of Robust Deep Learning Models for Stock Price Prediction [0.0]
  Building predictive models for robust and accurate prediction of stock prices and stock price movement is a challenging research problem to solve. This chapter proposes a collection of predictive regression models built on deep learning architecture for robust and precise prediction of the future prices of a stock listed in the diversified sectors in the National Stock Exchange (NSE) of India.
  arXiv  Detail & Related papers  (2021-06-17T17:15:02Z)
• Markdowns in E-Commerce Fresh Retail: A Counterfactual Prediction and Multi-Period Optimization Approach [29.11201102550876]
  We build a semi-parametric structural model to learn individual price elasticity and predict counterfactual demand. We propose a multi-period dynamic pricing algorithm to maximize the overall profit of a perishable product over its finite selling horizon. The proposed framework has been successfully deployed to the well-known e-commerce fresh retail scenario - Freshippo.
  arXiv  Detail & Related papers  (2021-05-18T07:01:37Z)
• A Time Series Analysis-Based Stock Price Prediction Using Machine Learning and Deep Learning Models [0.0]
  We present a very robust and accurate framework of stock price prediction that consists of an agglomeration of statistical, machine learning and deep learning models. We use the daily stock price data, collected at five minutes interval of time, of a very well known company that is listed in the National Stock Exchange (NSE) of India. We contend that the agglomerative approach of model building that uses a combination of statistical, machine learning, and deep learning approaches, can very effectively learn from the volatile and random movement patterns in a stock price data.
  arXiv  Detail & Related papers  (2020-04-17T19:41:22Z)
• Value-driven Hindsight Modelling [68.658900923595]
  Value estimation is a critical component of the reinforcement learning (RL) paradigm. Model learning can make use of the rich transition structure present in sequences of observations, but this approach is usually not sensitive to the reward function. We develop an approach for representation learning in RL that sits in between these two extremes. This provides tractable prediction targets that are directly relevant for a task, and can thus accelerate learning the value function.
  arXiv  Detail & Related papers  (2020-02-19T18:10:20Z)

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.