Occam's Razor in Residential PV-Battery Systems: Theoretical Interpretation, Practical Implications, and Possible Improvements
This paper presents a theoretical interpretation and explores possible improvements of a widely adopted rule-based control for residential solar photovoltaics (PV) paired with battery storage systems (BSS). The method is referred to as Occam's control in this paper, given its simplicity and as a tribute to the 14th-century William of Ockham. Using the self-consumption-maximization application, it is proven that Occam's control is a special case of a larger category of optimization methods called online convex learning. Thus, for the first time, a theoretical upper bound is derived for this control method. Furthermore, based on the theoretical insight, an alternative algorithm is devised on the same complexity level that outperforms Occam's. Practical data is used to evaluate the performance of these learning methods as compared to the classical rolling-horizon linear/quadratic programming. Findings support online learning methods for residential applications given their low complexity and small computation, communication, and data footprint. Consequences include improved economics for residential PV-BSS systems and mitigation of distribution systems' operational challenges associated with high PV penetration.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Statistical learning theory and Occam's razor: The core argument
Statistical learning theory is often associated with the principle of Occam's razor, which recommends a simplicity preference in inductive inference. This paper distills the core argument for simplicity obtainable from s…
Learning TheoryThe Geometric Occam's Razor Implicit in Deep Learning
In over-parameterized deep neural networks there can be many possible parameter configurations that fit the training data exactly. However, the properties of these interpolating solutions are poorly understood. We argue …
ARCDeep LearningIn-context learning and Occam's razor
A central goal of machine learning is generalization. While the No Free Lunch Theorem states that we cannot obtain theoretical guarantees for generalization without further assumptions, in practice we observe that simple…
Data CompressionIn-Context LearningAchieving Occam's Razor: Deep Learning for Optimal Model Reduction
All fields of science depend on mathematical models. Occam's razor refers to the principle that good models should exclude parameters beyond those minimally required to describe the systems they represent. This is becaus…
Deep LearningDo Language Models Follow Occam's Razor? An Evaluation of Parsimony in Inductive and Abductive Reasoning
Non-deductive reasoning, encompassing inductive and abductive reasoning, is essential in addressing complex real-world questions. One key feature of inductive and abductive reasoning is that there are many valid hypothes…