arXiv subjects

Raphael Fonteneau

Publications and source records attributed to Raphael Fonteneau.

7 recordsLinked to original sources

arXiv2021

Assessing the Impact of Offshore Wind Siting Strategies on the Design of the European Power System

This paper provides a detailed account of the impact of different offshore wind siting strategies on the design of the European power system. To this end, a two-stage method is proposed. In the first stage, a highly-granular siting problem identifies a suitable set of sites where offshore wind plants could be deployed according to a pre-specified criterion. Two siting schemes are analysed and compared within a realistic case study. These schemes essentially select a pre-specified number of sites so as to maximise their aggregate power output and their spatiotemporal complementarity, respectively. In addition, two variants of these siting schemes are provided, wherein the number of sites to be selected is specified on a country-by-country basis rather than Europe-wide. In the second stage, the subset of previously identified sites is passed to a capacity expansion planning (CEP) framework that sizes the power generation, transmission and storage assets that should be deployed and operated in order to satisfy pre-specified electricity demand levels at minimum cost. Results show that the complementarity-based siting criterion leads to system designs which are up to 5% cheaper than the ones relying the power output-based criterion when offshore wind plants are deployed with no consideration for country-based deployment targets. On the contrary, the power output-based scheme leads to system designs which are consistently 2% cheaper than the ones leveraging the complementarity-based siting strategy when such constraints are enforced. The robustness of the results is supported by a sensitivity analysis on offshore wind capital expenditure and inter-annual weather variability, respectively.

eess.SY↗

arXiv2019

On overfitting and asymptotic bias in batch reinforcement learning with partial observability

This paper provides an analysis of the tradeoff between asymptotic bias (suboptimality with unlimited data) and overfitting (additional suboptimality due to limited data) in the context of reinforcement learning with partial observability. Our theoretical analysis formally characterizes that while potentially increasing the asymptotic bias, a smaller state representation decreases the risk of overfitting. This analysis relies on expressing the quality of a state representation by bounding L1 error terms of the associated belief states. Theoretical results are empirically illustrated when the state representation is a truncated history of observations, both on synthetic POMDPs and on a large-scale POMDP in the context of smartgrids, with real-world data. Finally, similarly to known results in the fully observable setting, we also briefly discuss and empirically illustrate how using function approximators and adapting the discount factor may enhance the tradeoff between asymptotic bias and overfitting in the partially observable context.

stat.ML↗

arXiv2018

Critical Time Windows for Renewable Resource Complementarity Assessment

This paper proposes a systematic framework to assess the complementarity of renewable resources over arbitrary geographical scopes and temporal scales which is particularly well-suited to exploit very large data sets of climatological data. The concept of critical time windows is introduced, and a spatio-temporal criticality indicator is proposed, consisting in a parametrised family of scalar indicators quantifying the complementarity between renewable resources in both space and time. The criticality indicator is leveraged to devise a family of optimisation problems identifying sets of locations with maximum complementarity under arbitrary geographical deployment constraints. The applicability of the framework is shown in a case study investigating the complementarity between the wind regimes in continental western Europe and southern Greenland, and its usefulness in a power system planning context is demonstrated. Besides showing that the occurrence of low wind power production events can be significantly reduced on a regional scale by exploiting diversity in local wind patterns, results highlight the fact that aggregating wind power production sites located on different continents may result in a lower occurrence of system-wide low wind power production events and indicate potential benefits of intercontinental electrical interconnections.

physics.soc-ph↗

arXiv2016

How to Discount Deep Reinforcement Learning: Towards New Dynamic Strategies

Using deep neural nets as function approximator for reinforcement learning tasks have recently been shown to be very powerful for solving problems approaching real-world complexity. Using these results as a benchmark, we discuss the role that the discount factor may play in the quality of the learning process of a deep Q-network (DQN). When the discount factor progressively increases up to its final value, we empirically show that it is possible to significantly reduce the number of learning steps. When used in conjunction with a varying learning rate, we empirically show that it outperforms original DQN on several experiments. We relate this phenomenon with the instabilities of neural networks when they are used in an approximate Dynamic Programming setting. We also describe the possibility to fall within a local optimum during the learning process, thus connecting our discussion with the exploration/exploitation dilemma.

cs.LG↗

arXiv2015

Benchmarking for Bayesian Reinforcement Learning

In the Bayesian Reinforcement Learning (BRL) setting, agents try to maximise the collected rewards while interacting with their environment while using some prior knowledge that is accessed beforehand. Many BRL algorithms have already been proposed, but even though a few toy examples exist in the literature, there are still no extensive or rigorous benchmarks to compare them. The paper addresses this problem, and provides a new BRL comparison methodology along with the corresponding open source library. In this methodology, a comparison criterion that measures the performance of algorithms on large sets of Markov Decision Processes (MDPs) drawn from some probability distributions is defined. In order to enable the comparison of non-anytime algorithms, our methodology also includes a detailed analysis of the computation time requirement of each algorithm. Our library is released with all source code and documentation: it includes three test problems, each of which has two different prior distributions, and seven state-of-the-art RL algorithms. Finally, our library is illustrated by comparing all the available algorithms and the results are discussed.

cs.AI↗

arXiv2014

Simultaneous Perturbation Algorithms for Batch Off-Policy Search

We propose novel policy search algorithms in the context of off-policy, batch mode reinforcement learning (RL) with continuous state and action spaces. Given a batch collection of trajectories, we perform off-line policy evaluation using an algorithm similar to that by [Fonteneau et al., 2010]. Using this Monte-Carlo like policy evaluator, we perform policy search in a class of parameterized policies. We propose both first order policy gradient and second order policy Newton algorithms. All our algorithms incorporate simultaneous perturbation estimates for the gradient as well as the Hessian of the cost-to-go vector, since the latter is unknown and only biased estimates are available. We demonstrate their practicality on a simple 1-dimensional continuous state space problem.

math.OC↗

arXiv2012

Min Max Generalization for Two-stage Deterministic Batch Mode Reinforcement Learning: Relaxation Schemes

We study the minmax optimization problem introduced in [22] for computing policies for batch mode reinforcement learning in a deterministic setting. First, we show that this problem is NP-hard. In the two-stage case, we provide two relaxation schemes. The first relaxation scheme works by dropping some constraints in order to obtain a problem that is solvable in polynomial time. The second relaxation scheme, based on a Lagrangian relaxation where all constraints are dualized, leads to a conic quadratic programming problem. We also theoretically prove and empirically illustrate that both relaxation schemes provide better results than those given in [22].

eess.SY↗