Pith. sign in

REVIEW 2 major objections 2 minor 1 cited by

Sequence Aware SAC Control for Engine Fuel Consumption Optimization in Electrified Powertrain

T0 review · 2 major / 2 minor · reviewed 2026-08-05 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read A sequence-aware Soft Actor-Critic controller for series hybrid electric vehicles is claimed to come within 1.8% of Dynamic Programming in fuel savings on the HFET cycle, while generalizing to unseen US06 and HHDDT cycles.

desk verdict A SAC/HEV abstract is paired with an unrelated electricity-price-forecasting full text; the claimed DP-gap results have no supporting methods or experiments. read the letter →

arxiv 2508.04874 v1 pith:OK53M57H submitted 2025-08-06 eess.SY cs.AIcs.LGcs.SY

Wafeeq Jaleel , Md Ragib Rownak , Athar Hanif , Sidra Ghayour Bhatti , Qadeer Ahmed This is my paper · ORCID
classification eess.SYcs.AIcs.LGcs.SY
keywords SoftActor-CriticserieshybridelectricvehicleenergymanagementfuelconsumptionoptimizationGatedRecurrentUnitDecisionTransformerDynamicProgrammingbenchmarkdrive-cyclegeneralization
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper is trying to establish that a Soft Actor-Critic (SAC) controller with sequence-aware components—a Decision Transformer actor and a Gated Recurrent Unit critic—can manage energy in a series hybrid electric vehicle almost as well as an offline Dynamic Programming (DP) benchmark. On the Highway Fuel Economy Test cycle, the reported fuel-savings gap to DP is 1.8%, with GRU/GRU and feedforward variants at 3.16% and 3.43%. The paper also claims that training under varied initial battery states, drive-cycle durations, power demands, and input sequence lengths lets these agents generalize to unseen US06 and HHDDT cruise cycles better than feedforward-network agents. If right, this matters because it suggests a real-time, learning-based controller can approach the optimal offline fuel-saving solution while keeping the battery charge-sustaining. The supplied full-text file is a different manuscript, so the abstract is the only evidence available here for these claims.

What carries the argument

The load-bearing mechanism is the replacement of feedforward actor and critic networks in SAC with sequence-aware function approximators: a Decision Transformer actor (a transformer that maps state history and target return to actions) and a Gated Recurrent Unit critic (a recurrent network that summarizes past states). These components let the policy condition on temporal context rather than a single snapshot, which is what the paper credits for the near-DP fuel consumption and for better transfer to unseen cycles.

What would settle it

Run the DT/GRU SAC agent and DP on the same HFET cycle with the same fuel map, battery model, SOC bounds, and time discretization, then compare fuel savings and terminal battery SOC. A concrete falsifier would be a measured gap from DP larger than 1.8 percentage points, or a DP run with a materially different final SOC.

Watch

Extended reading notes

Core claim

On its own terms, the paper claims that reformulating HEV engine control as a sequential decision problem and injecting memory into SAC closes most of the gap to Dynamic Programming optimality. The best configuration, a DT-based actor with a GRU-based critic, is reported to come within 1.8% of DP in fuel savings on the HFET cycle; GRU/GRU and FFN configurations are within 3.16% and 3.43%. On drive cycles not seen in training (US06 and the Heavy Heavy-Duty Diesel Truck cruise segment), the sequence-aware agents outperform FFN-based agents. The abstract reports training under diverse initial battery states, drive-cycle durations, power demands, and input sequence lengths, but no reward structu

Load-bearing premise

The 1.8% gap is an honest optimality gap only if the SAC reward and the DP objective describe the same problem—same fuel map and battery model, same state-of-charge bounds, same discretization—details the abstract does not give, and the full text supplied is a different paper.

Editorial extensions

If this is right

  • If the 1.8% result holds under identical problem formulations, a deployed controller could follow a near-optimal fuel-saving policy in real time without solving DP onboard.
  • Sequence-aware agents are claimed to transfer to US06 and HHDDT cruise better than feedforward agents, implying the learned temporal features generalize across drive conditions.
  • The architecture ranking (DT actor + GRU critic best, then GRU/GRU, then FFN) indicates that memory in either actor or critic improves over feedforward, with the combination mattering most.
  • Charge-sustaining behavior under varied initial battery states would support long-haul operation without frequent recharging.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Editorial inference: the 1.8% gap can be read as an upper bound on real suboptimality only if the SAC reward and DP cost are algebraically the same problem; otherwise the comparison partly tests reward alignment.
  • Editorial inference: the DT/GRU split points to a separable division of labor—the actor plans from encoded history while the critic evaluates the value of that history—so ablating only the actor's or only the critic's memory would test which side contributes more.
  • Editorial inference: if sequence awareness is the source of generalization, the same injection should transfer to other constrained sequential powertrain tasks, such as battery thermal management or predictive gear shifting, where feedforward policies may struggle.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 2 minor

Summary. The manuscript arXiv:2508.04874 is submitted under the title 'Sequence Aware SAC Control for Engine Fuel Consumption Optimization in Electrified Powertrain' with an abstract reporting reinforcement-learning results for hybrid electric vehicle energy management. The full text provided, however, is an unrelated manuscript titled 'PriceFM: Foundation Model for Probabilistic Electricity Price Forecasting' (arXiv:2508.04875v4), with its own abstract, authors, and references. The body contains no Soft Actor-Critic, GRU, Decision Transformer, HEV, engine model, or Dynamic Programming baseline. The abstract's numerical claims (1.8%, 3.16%, 3.43% gaps to DP on HFET, and generalization to US06 and HHDDT) are therefore entirely unsupported by any methods or experiments in the submitted document.

Significance. If the claimed results were properly supported, the work would be a relevant contribution to sequence-aware RL for HEV energy management, and benchmarking against DP is a sound evaluation choice in principle. However, the manuscript as submitted provides no verifiable evidence for any of these claims. The complete mismatch between the abstract and the full text makes it impossible to assess the significance of the purported findings. The DP-gap design is a strength in the abstract, but without the actual manuscript the claimed optimality gaps cannot be checked.

major comments (2)
  1. [Full text (all sections)] The submitted body is an entirely different paper, 'PriceFM: Foundation Model for Probabilistic Electricity Price Forecasting', with its own title, author list, and arXiv number (2508.04875v4). The body contains no SAC, GRU, Decision Transformer, HEV, engine model, HFET/US06/HHDDT cycles, or DP baseline. The central claim of the abstract—that a DT-actor GRU-critic SAC agent is within 1.8% of DP on HFET—is therefore an unsupported assertion. This is load-bearing: none of the reported numerical results or generalization claims can be audited from the material supplied.
  2. [Abstract, results paragraph] Even if the correct full text were supplied, the abstract as written does not provide sufficient information to interpret the reported gaps. The reward function, fuel and battery plant model, state-of-charge constraints, and DP discretization are unspecified. The 1.8% gap is an honest optimality gap only if the RL reward and DP objective describe the same problem; without these details the claim is not auditable. The body text provides no definition of the reward or the DP setup, so this concern is presently unresolvable.
minor comments (2)
  1. [Page headers / metadata] The page headers display 'arXiv:2508.04875v4' and the PriceFM title, inconsistent with the claimed arXiv number and title. This is a presentation sign of the submission mismatch.
  2. [Abstract wording] The abstract uses phrases such as 'within 1.8% of Dynamic Programming (DP) in fuel savings' without defining whether the percentage refers to fuel consumption, fuel savings relative to a baseline, or a normalized cost. Clarification would be needed even if the correct manuscript were available.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity identifiable: the supplied full text is an unrelated manuscript, so no derivation chain exists that could reduce the abstract's DP gap to its own inputs.

full rationale

The central claim in the abstract—'the SAC agent with a DT-based actor and GRU-based critic was within 1.8% of Dynamic Programming (DP) in fuel savings on the Highway Fuel Economy Test (HFET) cycle'—is an empirical benchmark claim. A circularity finding would require quoting an equation or fitted parameter showing that the reported DP gap or the RL objective is equivalent to the RL inputs by construction. No such reduction appears in the submitted material. The full text of arXiv:2508.04874 as provided is not the SAC/HEV paper; it is 'PriceFM: Foundation Model for Probabilistic Electricity Price Forecasting' (arXiv:2508.04875v4), with different authors and no engine model, Soft Actor-Critic implementation, GRU/Decision-Transformer actor-critic, HFET/US06/HHDDT experiments, reward definition, or DP baseline. Consequently, there is no derivational chain to walk: the abstract's numerical claims are unsupported by the body, but unsupportedness is a verifiability/correctness problem, not circularity. The self-citations appearing in the PriceFM body (e.g., refs. [6], [12], [33]) are not load-bearing for the fuel-economy claim because they belong to a different paper and are not used to justify the SAC/DP comparison. Under the instruction not to speculate about unstated reward design, no circular step can be exhibited, so the honest score is 0.

Assumptions & free parameters 2 free parameters · 2 assumptions · 0 invented entities

The ledger is populated from the abstract alone because the manuscript body is a different paper (PriceFM, arXiv 2508.04875v4) that contains no content on hybrid powertrains or SAC. The two free parameters listed would be the main hidden knobs of the claimed result, and both are unspecified. No new physical entities are introduced by the abstract.

free parameters (2)
  • Reward shaping weights (fuel consumption terms vs. battery state-of-charge maintenance and other penalties) = not stated
    The claimed fuel savings are relative to the optimized objective; the abstract provides no reward structure, and the body is an unrelated paper.
  • SAC, GRU, and Decision Transformer hyperparameters (learning rate, hidden sizes, sequence lengths, temperature) = not stated
    The abstract reports results under diverse input sequence lengths but gives no configuration; reproduction is impossible.
assumptions (2)
  • domain assumption The powertrain plant model used for RL training adequately represents the real engine and battery
    Fuel savings are simulation results; the abstract names no plant model and the body contains no description.
  • domain assumption The Dynamic Programming benchmark is solved over the same discretized state and action space as the RL agents
    A gap of 1.8% to DP is only meaningful under matched problem definitions; DP discretization is never described.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Sequence Aware SAC Control for Engine Fuel Consumption Optimization in Electrified Powertrain." pith.science (2026). https://pith.science/paper/OK53M57H

@misc{pith2026250804874,
  author       = {Pith},
  title        = {Pith review of: Sequence Aware SAC Control for Engine Fuel Consumption Optimization in Electrified Powertrain},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/OK53M57H}},
  note         = {Machine review of arXiv:2508.04874}
}
read the original abstract

As hybrid electric vehicles (HEVs) gain traction in heavy-duty trucks, adaptive and efficient energy management is critical for reducing fuel consumption while maintaining battery charge for long operation times. We present a new reinforcement learning (RL) framework based on the Soft Actor-Critic (SAC) algorithm to optimize engine control in series HEVs. We reformulate the control task as a sequential decision-making problem and enhance SAC by incorporating Gated Recurrent Units (GRUs) and Decision Transformers (DTs) into both actor and critic networks to capture temporal dependencies and improve planning over time. To evaluate robustness and generalization, we train the models under diverse initial battery states, drive cycle durations, power demands, and input sequence lengths. Experiments show that the SAC agent with a DT-based actor and GRU-based critic was within 1.8% of Dynamic Programming (DP) in fuel savings on the Highway Fuel Economy Test (HFET) cycle, while the SAC agent with GRUs in both actor and critic networks, and FFN actor-critic agent were within 3.16% and 3.43%, respectively. On unseen drive cycles (US06 and Heavy Heavy-Duty Diesel Truck (HHDDT) cruise segment), generalized sequence-aware agents consistently outperformed feedforward network (FFN)-based agents, highlighting their adaptability and robustness in real-world settings.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Refutation of Elmasry's $\tilde{O}(m \sqrt{n})$-Time Algorithm for Single-Source Shortest Paths

    cs.DS 2025-08 unverdicted novelty 7.0 of 10

    A proposed counterexample graph forces Elmasry's SSSP algorithm to run in Ω(mn), refuting the claimed Õ(m√n) bound.

Reference graph

Works this paper leans on

34 extracted references · 17 canonical work pages · cited by 1 Pith paper

  1. [1]

    May 2025 for testing

    Jan 2025 to 1. May 2025 for testing. Each subsequent fold advances by 4 months, ending at 1. Jan 2026, so that the testing windows jointly cover one full year. Data Scaling.To scale the data while being robust to extreme values, we employ a������������fitted on the training data, using������������. The fitted scaler is then used to transform validation an...

    work page 2025

  2. [2]

    Addressing wind power forecast errors in day-ahead pricing with energy storage systems: A distributionally robust joint chance-constrained approach,

    A. Zhou, M. Yang, X. Fang, and Y . Zhang, “Addressing wind power forecast errors in day-ahead pricing with energy storage systems: A distributionally robust joint chance-constrained approach,”IEEE Transactions on Sustainable Energy, vol. 15, no. 3, pp. 1754–1767, 2024.DOI: 10.1109/TSTE.2024.3374212

    work page arXiv 2024

  3. [3]

    Es- timating the price impact of proposed wind farms in competitive electricity markets,

    P. Zamani-Dehkordi, L. Rakai, and H. Zareipour, “Es- timating the price impact of proposed wind farms in competitive electricity markets,”IEEE Transactions on Sustainable Energy, vol. 8, no. 1, pp. 291–303, 2017. DOI: 10.1109/TSTE.2016.2598265

    arXiv 2017

  4. [4]

    Forecasting day-ahead electricity prices in europe: The importance of considering market integration,

    J. Lago, F. De Ridder, P. Vrancx, and B. De Schutter, “Forecasting day-ahead electricity prices in europe: The importance of considering market integration,”Applied energy, vol. 211, pp. 890–903, 2018. 9 TABLE V DIRECT NEIGHBORS BY REGION. Code Direct Neighbors AT CZ, DE-LU, HU, IT-NORD, SI BE DE-LU, FR, NL BG GR, RO CZ AT, DE-LU, PL, SK DE-LU AT, BE, CZ,...

    work page 2018

  5. [5]

    Impact of flow based market coupling on the european electricity markets,

    R. Finck, “Impact of flow based market coupling on the european electricity markets,” inSustainability Man- agement Forum— NachhaltigkeitsManagementForum, Springer, vol. 29, 2021, pp. 173–186

    work page 2021

  6. [6]

    Electricity market crisis in europe and cross border price effects: A quantile return connectedness analysis,

    H. X. Do, R. Nepal, S. D. Pham, and T. Jamasb, “Electricity market crisis in europe and cross border price effects: A quantile return connectedness analysis,” Energy Economics, vol. 135, p. 107 633, 2024

    work page 2024

  7. [7]

    Yu et al.,Deep learning for electricity price fore- casting: A review of day-ahead, intraday, and bal- ancing electricity markets, 2026

    R. Yu et al.,Deep learning for electricity price fore- casting: A review of day-ahead, intraday, and bal- ancing electricity markets, 2026. arXiv: 2602 . 10071 ����������. [Online]. Available: https://arxiv.org/ abs/2602.10071

    arXiv 2026

  8. [8]

    Probabilistic forecasting in day- ahead electricity markets: Simulating peak and off-peak prices,

    P. Muniain and F. Ziel, “Probabilistic forecasting in day- ahead electricity markets: Simulating peak and off-peak prices,”International Journal of Forecasting, vol. 36, no. 4, pp. 1193–1210, 2020,ISSN: 0169-2070.DOI: https : / / doi . org / 10 . 1016 / j . ijforecast . 2019 . 11 . 006 [Online]. Available: https : / / www. sciencedirect . com / science/ar...

    work page 2020

Show all 34 references
  1. [9]

    Enhancing load, wind and solar generation for day-ahead forecast- ing of electricity prices,

    K. Maciejowska, W. Nitka, and T. Weron, “Enhancing load, wind and solar generation for day-ahead forecast- ing of electricity prices,”Energy Economics, vol. 99, TABLE VI HYPERPARAMETER SEARCH SPACE. Model Search Space PriceFM hidden size:�24, 72, 168� n layers:�2, 3, 4� n expe...

  2. [10]

    An ensemble approach for enhanced Day-Ahead price forecasting in electricity markets,

    A. Kitsatoglou, G. Georgopoulos, P. Papadopoulos, and H. Antonopoulos, “An ensemble approach for enhanced Day-Ahead price forecasting in electricity markets,” Expert Systems with Applications, vol. 256, p. 124 971, Dec. 2024,ISSN: 0957-4174.DOI: 10.1016/j.eswa.2024. 124971 Acc...

    2024 doi

  3. [11]

    Day-ahead electricity price fore- casting with high-dimensional structures: Univariate vs. multivariate modeling frameworks,

    F. Ziel and R. Weron, “Day-ahead electricity price fore- casting with high-dimensional structures: Univariate vs. multivariate modeling frameworks,”Energy Economics, vol. 70, pp. 396–420, 2018,ISSN: 0140-9883.DOI: https://doi.org/10.1016/j.eneco.2017.12.016 [Online]. 10 Availa...

    2018 doi

  4. [12]

    Electricity market price forecasting using ELM and Bootstrap analysis: A case study of the German and Finnish Day-Ahead markets,

    S. Loizidis, A. Kyprianou, and G. E. Georghiou, “Electricity market price forecasting using ELM and Bootstrap analysis: A case study of the German and Finnish Day-Ahead markets,”Applied Energy, vol. 363, p. 123 058, Jun. 2024,ISSN: 0306-2619.DOI: 10.1016/ j.apenergy.2024.12305...

    2024

  5. [13]

    R. Yu, R. Wu, Y . Han, and J. L. Cremer,Orderbook feature learning and asymmetric generalization in in- traday electricity markets, 2026. arXiv: 2510 . 12685 ����������. [Online]. Available: https://arxiv.org/ abs/2510.12685

    2026

  6. [14]

    Forecasting day-ahead electricity prices with spatial dependence,

    Y . Yang, J. Guo, Y . Li, and J. Zhou, “Forecasting day-ahead electricity prices with spatial dependence,” International Journal of Forecasting, vol. 40, no. 3, pp. 1255–1270, 2024

    2024

  7. [15]

    Day-ahead electricity price prediction in multi-price zones based on multi-view fusion spatio-temporal graph neural net- work,

    A. Meng, J. Zhu, B. Yan, and H. Yin, “Day-ahead electricity price prediction in multi-price zones based on multi-view fusion spatio-temporal graph neural net- work,”Applied Energy, vol. 369, p. 123 553, 2024

    2024

  8. [16]

    Chronos: Learning the language of time series,

    A. F. Ansari et al., “Chronos: Learning the language of time series,”Transactions on Machine Learning Research, 2024, Expert Certification,ISSN: 2835-8856. [Online]. Available: https://openreview.net/forum?id= gerNCVqqtR

    2024

  9. [17]

    A decoder-only foundation model for time-series forecasting,

    A. Das, W. Kong, R. Sen, and Y . Zhou, “A decoder-only foundation model for time-series forecasting,” inForty- first International Conference on Machine Learning, 2024

    2024

  10. [18]

    Moirai-moe: Empowering time series foundation models with sparse mixture of experts,

    X. Liu et al., “Moirai-moe: Empowering time series foundation models with sparse mixture of experts,” inForty-second International Conference on Machine Learning, 2025. [Online]. Available: https://openreview. net/forum?id=SrEOUSyJcR

    2025

  11. [19]

    Shi et al.,Time-moe: Billion-scale time series foun- dation models with mixture of experts, 2025

    X. Shi et al.,Time-moe: Billion-scale time series foun- dation models with mixture of experts, 2025. arXiv: 2409 . 16040�������. [Online]. Available: https : / / arxiv.org/abs/2409.16040

    2025 arXiv

  12. [20]

    Forecasting day-ahead electricity prices: A review of state-of-the-art algorithms, best practices and an open-access benchmark,

    J. Lago, G. Marcjasz, B. De Schutter, and R. Weron, “Forecasting day-ahead electricity prices: A review of state-of-the-art algorithms, best practices and an open-access benchmark,”Applied Energy, vol. 293, p. 116 983, 2021

    2021

  13. [21]

    Fedformer: Frequency enhanced decomposed transformer for long-term series forecasting,

    T. Zhou, Z. Ma, Q. Wen, X. Wang, L. Sun, and R. Jin, “Fedformer: Frequency enhanced decomposed transformer for long-term series forecasting,” inInter- national conference on machine learning, PMLR, 2022, pp. 27 268–27 286

    2022

  14. [22]

    Itransformer: Inverted transformers are effective for time series forecasting,

    Y . Liu et al., “Itransformer: Inverted transformers are effective for time series forecasting,”arXiv preprint arXiv:2310.06625, 2023

    2023 arXiv

  15. [23]

    A time series is worth 64 words: Long-term forecast- ing with transformers,

    Y . Nie, N. H. Nguyen, P. Sinthong, and J. Kalagnanam, “A time series is worth 64 words: Long-term forecast- ing with transformers,” inInternational Conference on Learning Representations, 2023

    2023

  16. [24]

    Timesnet: Temporal 2d-variation modeling for general time series analysis,

    H. Wu, T. Hu, Y . Liu, H. Zhou, J. Wang, and M. Long, “Timesnet: Temporal 2d-variation modeling for general time series analysis,” inThe Eleventh Interna- tional Conference on Learning Representations, 2023. [Online]. Available: https://openreview.net/forum?id= ju Uqw384Oq

    2023

  17. [25]

    Timexer: Empowering transformers for time series forecasting with exogenous variables,

    Y . Wang et al., “Timexer: Empowering transformers for time series forecasting with exogenous variables,” inAdvances in Neural Information Processing Sys- tems, A. Globerson et al., Eds., vol. 37, Curran As- sociates, Inc., 2024, pp. 469–498. [Online]. Available: https : / / p...

    2024

  18. [26]

    Semi-supervised classification with graph con- volutional networks,

    T. Kipf, “Semi-supervised classification with graph con- volutional networks,”arXiv preprint arXiv:1609.02907, 2016

    2016 arXiv

  19. [27]

    Graph attention networks,

    P. Veli ˇckovi´c, G. Cucurull, A. Casanova, A. Romero, P. Lio, and Y . Bengio, “Graph attention networks,”arXiv preprint arXiv:1710.10903, 2017

    2017 arXiv

  20. [28]

    Inductive representation learning on large graphs,

    W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” inAdvances in Neural Information Processing Systems, I. Guyon et al., Eds., vol. 30, Curran Associates, Inc., 2017. [Online]. Available: https://proceedings.neurips.cc/paper files/ pape...

    2017

  21. [29]

    Diffusion con- volutional recurrent neural network: Data-driven traffic forecasting,

    Y . Li, R. Yu, C. Shahabi, and Y . Liu, “Diffusion con- volutional recurrent neural network: Data-driven traffic forecasting,” inInternational Conference on Learning Representations, 2018. [Online]. Available: https : / / openreview.net/forum?id=SJiHXGW AZ

    2018

  22. [30]

    Graph neural networks with convolutional arma fil- ters,

    F. M. Bianchi, D. Grattarola, L. Livi, and C. Alippi, “Graph neural networks with convolutional arma fil- ters,”IEEE transactions on pattern analysis and ma- chine intelligence, vol. 44, no. 7, pp. 3496–3507, 2021

    2021

  23. [31]

    Assessing the impact of renewable energy sources on the electricity price level and vari- ability – a quantile regression approach,

    K. Maciejowska, “Assessing the impact of renewable energy sources on the electricity price level and vari- ability – a quantile regression approach,”Energy Eco- nomics, vol. 85, p. 104 532, 2020,ISSN: 0140-9883. DOI: https : / / doi . org / 10 . 1016 / j . eneco . 2019 . 10453...

    2020

  24. [32]

    Regularized quantile regression averaging for probabilistic electricity price forecasting,

    B. Uniejewski and R. Weron, “Regularized quantile regression averaging for probabilistic electricity price forecasting,”Energy Economics, vol. 95, p. 105 121, Mar. 2021,ISSN: 0140-9883.DOI: 10 . 1016 / j . eneco . 2021.105121 Accessed: May 25, 2025

    2021

  25. [33]

    Optimal wind power uncertainty intervals for electricity market operation,

    Y . Wang, Z. Zhou, A. Botterud, and K. Zhang, “Optimal wind power uncertainty intervals for electricity market operation,”IEEE Transactions on Sustainable Energy, vol. 9, no. 1, pp. 199–210, 2018.DOI: 10.1109/TSTE. 2017.2723907

    2018

  26. [34]

    Yu et al.,Orderfusion: Encoding orderbook for end- to-end probabilistic intraday electricity price forecast- ing, 2026

    R. Yu et al.,Orderfusion: Encoding orderbook for end- to-end probabilistic intraday electricity price forecast- ing, 2026. arXiv: 2502.06830����������. [Online]. Available: https://arxiv.org/abs/2502.06830

    2026 arXiv

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.