Peter Nystrup
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Peter Nystrup has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Henrik Madsen
Technical University of Denmark
15 shared publications - Erik Lindström
Lund University
12 shared publications - Jan Kloppenborg Møller
Technical University of Denmark, Kongens Lyngby, Denmark
4 shared publications - Bo William Hansen
Is the head of investment analysis at Sampension in Hellerup, Denmark
2 shared publications - Stephen Boyd
Stanford University
2 shared publications - Bastian Schmidt Jørgensen1 shared publication
Latest Publications
- Open Access
- 3 May 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 284
Sequential methods for error correction of probabilistic wind power forecasts
- 3 May 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 284
Open AccessSequential methods for error correction of probabilistic wind power forecasts
- 20 January 2023
- Published by Elsevier in International Journal of Forecasting
- Vol. 40 (2) , 515-531
Likelihood-based inference in temporal hierarchies
- 20 January 2023
- Published by Elsevier in International Journal of Forecasting
- Vol. 40 (2) , 515-531
Likelihood-based inference in temporal hierarchies
- Open Access
- 18 October 2022
- Published by Wiley in Wires Energy and Environment
- Vol. 12 (2)
Recent developments in multivariate wind and solar power forecasting
The intermittency of renewable energy sources, such as wind and solar, means that they require reliable and accurate forecasts to integrate properly into energy systems. This review introduces and examines a selection of state‐of‐the‐art methods that are applied for multivariate forecasting of wind and solar power production. Methods such as conditional parametric and combined forecasting already see wide use in practice, both commercially and scientifically. In the context of multivariate forecasting, it is vital to model the dependence between forecasts correctly. In recent years, reconciliation of forecasts to ensure coherency across spatial and temporal aggregation levels has shown great promise in increasing the accuracy of renewable energy forecasts. We introduce the methodology used for forecast reconciliation and review some recent applications for wind and solar power forecasting. Many forecasters are beginning to see the benefit of the greater information provided by probabilistic forecasts. We highlight stochastic differential equations as a method for probabilistic forecasting, which can also model the dependence structure. Lastly, we discuss forecast evaluation and how choosing a proper approach to evaluation is vital to avoid misrepresenting forecasts.This article is categorized under: Climate and Environment > Net Zero Planning and Decarbonization Sustainable Energy > Solar Energy Sustainable Energy > Wind Energy
- 18 October 2022
- Published by Wiley in Wires Energy and Environment
- Vol. 12 (2)
Open AccessRecent developments in multivariate wind and solar power forecasting
The intermittency of renewable energy sources, such as wind and solar, means that they require reliable and accurate forecasts to integrate properly into energy systems. This review introduces and examines a selection of state‐of‐the‐art methods that are applied for multivariate forecasting of wind and solar power production. Methods such as conditional parametric and combined forecasting already see wide use in practice, both commercially and scientifically. In the context of multivariate forecasting, it is vital to model the dependence between forecasts correctly. In recent years, reconciliation of forecasts to ensure coherency across spatial and temporal aggregation levels has shown great promise in increasing the accuracy of renewable energy forecasts. We introduce the methodology used for forecast reconciliation and review some recent applications for wind and solar power forecasting. Many forecasters are beginning to see the benefit of the greater information provided by probabilistic forecasts. We highlight stochastic differential equations as a method for probabilistic forecasting, which can also model the dependence structure. Lastly, we discuss forecast evaluation and how choosing a proper approach to evaluation is vital to avoid misrepresenting forecasts.This article is categorized under: Climate and Environment > Net Zero Planning and Decarbonization Sustainable Energy > Solar Energy Sustainable Energy > Wind Energy
- Open Access
- 1 December 2021
- Published by Elsevier in Expert Systems with Applications
- Vol. 184
Feature selection in jump models
- 1 December 2021
- Published by Elsevier in Expert Systems with Applications
- Vol. 184
Open AccessFeature selection in jump models
- Open Access
- 1 June 2021
- Published by Elsevier in Applied Energy
- Vol. 292, 116872
Heat load forecasting using adaptive temporal hierarchies
- 1 June 2021
- Published by Elsevier in Applied Energy
- Vol. 292, 116872
Open AccessHeat load forecasting using adaptive temporal hierarchies
- Open Access
- 1 May 2021
- Published by Elsevier in Smart Energy
- Vol. 2
Clustering commercial and industrial load patterns for long-term energy planning
- 1 May 2021
- Published by Elsevier in Smart Energy
- Vol. 2
Open AccessClustering commercial and industrial load patterns for long-term energy planning
- 31 July 2020
- Published by With Intelligence LLC in The Journal of Financial Data Science
- Vol. 2 (3) , 25-39
Greedy Online Classification of Persistent Market States Using Realized Intraday Volatility Features
In many financial applications, it is important to classify time-series data without any latency while maintaining persistence in the identified states. The authors propose a greedy online classifier that contemporaneously determines which hidden state a new observation belongs to without the need to parse historical observations and without compromising persistence. Their classifier is based on the idea of clustering temporal features while explicitly penalizing jumps between states by a fixed-cost regularization term that can be calibrated to achieve a desired level of persistence. Through a series of return simulations, the authors show that in most settings their new classifier remarkably obtains a higher accuracy than the correctly specified maximum likelihood estimator. They illustrate that the new classifier is more robust to misspecification and yields state sequences that are significantly more persistent both in and out of sample. They demonstrate how classification accuracy can be further improved by including features that are based on intraday data. Finally, the authors apply the new classifier to estimate persistent states of the S&P 500 Index. TOPICS:Statistical methods, simulations, big data/machine learning Key Findings • A new greedy online classifier is proposed that contemporaneously determines which hidden state a new observation belongs to without the need to parse historical observations and without compromising temporal persistence. • A series of simulations demonstrates that the new classifier frequently obtains a higher accuracy and is more robust to misspecification than the correctly specified maximum likelihood estimator. • Classification accuracy can be improved by including features that are based on intraday volatility data.
- 31 July 2020
- Published by With Intelligence LLC in The Journal of Financial Data Science
- Vol. 2 (3) , 25-39
Greedy Online Classification of Persistent Market States Using Realized Intraday Volatility Features
In many financial applications, it is important to classify time-series data without any latency while maintaining persistence in the identified states. The authors propose a greedy online classifier that contemporaneously determines which hidden state a new observation belongs to without the need to parse historical observations and without compromising persistence. Their classifier is based on the idea of clustering temporal features while explicitly penalizing jumps between states by a fixed-cost regularization term that can be calibrated to achieve a desired level of persistence. Through a series of return simulations, the authors show that in most settings their new classifier remarkably obtains a higher accuracy than the correctly specified maximum likelihood estimator. They illustrate that the new classifier is more robust to misspecification and yields state sequences that are significantly more persistent both in and out of sample. They demonstrate how classification accuracy can be further improved by including features that are based on intraday data. Finally, the authors apply the new classifier to estimate persistent states of the S&P 500 Index. TOPICS:Statistical methods, simulations, big data/machine learning Key Findings • A new greedy online classifier is proposed that contemporaneously determines which hidden state a new observation belongs to without the need to parse historical observations and without compromising temporal persistence. • A series of simulations demonstrates that the new classifier frequently obtains a higher accuracy and is more robust to misspecification than the correctly specified maximum likelihood estimator. • Classification accuracy can be improved by including features that are based on intraday volatility data.
- Open Access
- 1 July 2020
- Published by Elsevier in Expert Systems with Applications
- Vol. 150, 113307
Learning hidden Markov models with persistent states by penalizing jumps
- 1 July 2020
- Published by Elsevier in Expert Systems with Applications
- Vol. 150, 113307
Open AccessLearning hidden Markov models with persistent states by penalizing jumps
- 18 June 2020
- Published by With Intelligence LLC in The Journal of Financial Data Science
- Vol. 2 (3) , 40-54
Hyperparameter Optimization for Portfolio Selection
Portfolio selection involves a trade-off between maximizing expected return and minimizing risk. In practice, useful formulations also include various costs and constraints that regularize the problem and reduce the risk due to estimation errors, resulting in solutions that depend on a number of hyperparameters. As the number of hyperparameters grows, selecting their value becomes increasingly important and difficult. In this article, the authors propose a systematic approach to hyperparameter optimization by leveraging recent advances in automated machine learning and multiobjective optimization. They optimize hyperparameters on a train set to yield the best result subject to market-determined realized costs. In applications to single- and multiperiod portfolio selection, they show that sequential hyperparameter optimization finds solutions with better risk–return trade-offs than manual, grid, and random search over hyperparameters using fewer function evaluations. At the same time, the solutions found are more stable from in-sample training to out-of-sample testing, suggesting they are less likely to be extremities that randomly happened to yield good performance in training. TOPICS:Portfolio theory, portfolio construction, big data/machine learning Key Findings • The growing number of applications of machine-learning approaches to portfolio selection means that hyperparameter optimization becomes increasingly important. We propose a systematic approach to hyperparameter optimization by leveraging recent advances in automated machine learning and multiobjective optimization. • We establish a connection between forecast uncertainty and holding- and trading-cost parameters in portfolio selection. We argue that they should be considered regularization parameters that can be adjusted in training to achieve optimal performance when tested subject to realized costs. • We show that multiobjective optimization can find solutions with better risk–return trade-offs than manual, grid, and random search over hyperparameters for portfolio selection. At the same time, the solutions are more stable across in-sample training and out-of-sample testing.
- 18 June 2020
- Published by With Intelligence LLC in The Journal of Financial Data Science
- Vol. 2 (3) , 40-54
Hyperparameter Optimization for Portfolio Selection
Portfolio selection involves a trade-off between maximizing expected return and minimizing risk. In practice, useful formulations also include various costs and constraints that regularize the problem and reduce the risk due to estimation errors, resulting in solutions that depend on a number of hyperparameters. As the number of hyperparameters grows, selecting their value becomes increasingly important and difficult. In this article, the authors propose a systematic approach to hyperparameter optimization by leveraging recent advances in automated machine learning and multiobjective optimization. They optimize hyperparameters on a train set to yield the best result subject to market-determined realized costs. In applications to single- and multiperiod portfolio selection, they show that sequential hyperparameter optimization finds solutions with better risk–return trade-offs than manual, grid, and random search over hyperparameters using fewer function evaluations. At the same time, the solutions found are more stable from in-sample training to out-of-sample testing, suggesting they are less likely to be extremities that randomly happened to yield good performance in training. TOPICS:Portfolio theory, portfolio construction, big data/machine learning Key Findings • The growing number of applications of machine-learning approaches to portfolio selection means that hyperparameter optimization becomes increasingly important. We propose a systematic approach to hyperparameter optimization by leveraging recent advances in automated machine learning and multiobjective optimization. • We establish a connection between forecast uncertainty and holding- and trading-cost parameters in portfolio selection. We argue that they should be considered regularization parameters that can be adjusted in training to achieve optimal performance when tested subject to realized costs. • We show that multiobjective optimization can find solutions with better risk–return trade-offs than manual, grid, and random search over hyperparameters for portfolio selection. At the same time, the solutions are more stable across in-sample training and out-of-sample testing.
- 1 February 2020
- Published by Elsevier in European Journal of Operational Research
- Vol. 280 (3) , 876-888
Temporal hierarchies with autocorrelation for load forecasting
- 1 February 2020
- Published by Elsevier in European Journal of Operational Research
- Vol. 280 (3) , 876-888
Temporal hierarchies with autocorrelation for load forecasting