NeurIPS · 2023

Anytime-Competitive Reinforcement Learning with Policy Prior

Jianyi Yang, Pengfei Li, Tongxin Li, Adam Wierman, Shaolei Ren

Advances in Neural Information Processing Systems

Can reinforcement learning enforce cost protection throughout an episode?

ACRL constrains cumulative costs relative to a policy prior at each round, rather than only in expectation over episodes. The analysis establishes cost guarantees and regret relative to the constrained optimum, with experiments in carbon aware computing.

Research themes

Cite this paper

Jianyi Yang, Pengfei Li, Tongxin Li, Adam Wierman, Shaolei Ren. Anytime-Competitive Reinforcement Learning with Policy Prior. Advances in Neural Information Processing Systems, 2023. https://papers.nips.cc/paper_files/paper/2023/hash/f53437debdd397c42929d929614bc705-Abstract-Conference.html

BibTeX
@inproceedings{tongxin-anytime-rl,
  title = {{Anytime-Competitive Reinforcement Learning with Policy Prior}},
  author = {Jianyi Yang and Pengfei Li and Tongxin Li and Adam Wierman and Shaolei Ren},
  year = {2023},
  booktitle = {Advances in Neural Information Processing Systems},
  url = {https://papers.nips.cc/paper\_files/paper/2023/hash/f53437debdd397c42929d929614bc705-Abstract-Conference.html}
}
2026Applied Energy

Counterfactual load forecasting with LLM-structured events and representation learning

Yujie Chen, Yifei Gao, Runyao Yu, Yuhe Wu, Guangyu Wang, Yue Chen, Tongxin Li

NACF turns news into structured treatments and estimates load trajectories under alternative event conditions. Reweighting and representation balancing address observed confounding. Experiments examine factual accuracy and interpretable demand perturbations without claiming that unobserved counterfactual outcomes can be directly validated.