Kernel selection for power market inference via block successive upper bound minimization

Vassilis Kekatos, Yu Zhang, Georgios B Giannakis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Advanced data analytics are undoubtedly needed to enable the envisioned smart grid functionalities. Towards that goal, modern statistical learning tools are developed for day-ahead electricity market inference. Congestion patterns are modeled as rank-one components in the matrix of spatio-temporal prices. The new kernel-based predictor is regularized by the square root of the nuclear norm of the sought matrix. Such a regularizer not only promotes low-rank solutions, but it also facilitates a systematic kernel selection methodology. The non-convex optimization problem involved is efficiently driven to a stationary point following a block successive upper bound minimization approach. Numerical tests on real high-dimensional market data corroborate the interpretative merits and the computational efficiency of the novel method.

Original languageEnglish (US)
Title of host publication2014 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages7684-7688
Number of pages5
ISBN (Print)9781479928927
DOIs
StatePublished - 2014
Event2014 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2014 - Florence, Italy
Duration: May 4 2014May 9 2014

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
ISSN (Print)1520-6149

Other

Other2014 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2014
Country/TerritoryItaly
CityFlorence
Period5/4/145/9/14

Keywords

  • Kernel learning
  • block successive upper bound minimization
  • multikernel selection
  • nuclear norm

Fingerprint

Dive into the research topics of 'Kernel selection for power market inference via block successive upper bound minimization'. Together they form a unique fingerprint.

Cite this