Nicolas Christianson
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
Nicolas Christianson has a total of 39 co-authors. Here are the top co-authors by number of shared publications:
- Adam Wierman
California Institute of Technology, Pasadena, California, United States
19 shared publications - Mohammad Hajiesmaili
University of Massachusetts Amherst, Amherst, USA
14 shared publications - Prashant Shenoy
University of Massachusetts Amherst, Amherst, Massachusetts, USA
12 shared publications - Adam Lechowicz
University of Massachusetts Amherst, Amherst, USA
11 shared publications - Noman Bashir
Massachusetts Institute of Technology, Cambridge, Massachusetts, USA
8 shared publications - Bo Sun
University of Ottawa, Ottawa, ON, Canada
5 shared publications
Latest Publications
- Open Access
- 20 July 2026
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 54 (1) , 82-84
Prediction-Specific Design of Learning-Augmented Algorithms
Algorithms with predictions have emerged as a powerful framework to combine the robustness of traditional online algorithms with the data-driven performance benefits of machine-learned (ML) predictions. However, most existing approaches in this paradigm are overly conservative, as they do not leverage problem structure to optimize performance in a prediction-specific manner. In this paper, we show that prediction-specific performance criteria can enable significant improvements over the coarser notions of consistency and robustness considered in prior work. We propose a notion of strongly-optimal algorithms with predictions, which obtain Pareto optimality not just in the worst-case tradeoff between robustness and consistency, but also in the prediction-specific tradeoff between these metrics. We develop a general bi-level optimization framework that enables systematically designing strongly-optimal algorithms in a wide variety of problem settings, and we propose explicit strongly-optimal algorithms for several classic online problems: deterministic and randomized ski rental, and one-max search. Our analysis reveals new structural insights into how predictions can be optimally integrated into online algorithms by leveraging a prediction-specific design. Empirical evaluations on dynamic power management and VIX trading validate the practical benefits of our framework.
- 20 July 2026
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 54 (1) , 82-84
Open AccessPrediction-Specific Design of Learning-Augmented Algorithms
Algorithms with predictions have emerged as a powerful framework to combine the robustness of traditional online algorithms with the data-driven performance benefits of machine-learned (ML) predictions. However, most existing approaches in this paradigm are overly conservative, as they do not leverage problem structure to optimize performance in a prediction-specific manner. In this paper, we show that prediction-specific performance criteria can enable significant improvements over the coarser notions of consistency and robustness considered in prior work. We propose a notion of strongly-optimal algorithms with predictions, which obtain Pareto optimality not just in the worst-case tradeoff between robustness and consistency, but also in the prediction-specific tradeoff between these metrics. We develop a general bi-level optimization framework that enables systematically designing strongly-optimal algorithms in a wide variety of problem settings, and we propose explicit strongly-optimal algorithms for several classic online problems: deterministic and randomized ski rental, and one-max search. Our analysis reveals new structural insights into how predictions can be optimally integrated into online algorithms by leveraging a prediction-specific design. Empirical evaluations on dynamic power management and VIX trading validate the practical benefits of our framework.
- Open Access
- 20 July 2026
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 54 (1) , 85-87
Online Smoothed Demand Management
We introduce and study a class of online problems called online smoothed demand management ( OSDM ), motivated by paradigm shifts in grid integration and energy storage for large energy consumers such as data centers. In OSDM , an operator makes two decisions at each time step: an amount of energy to be purchased, and an amount of energy to be delivered (i.e., used for computation). The difference between these decisions charges (or discharges) the operator's energy storage (e.g., a battery). Two types of demand arrive online: base demand, which must be covered at the current time, and flexible demand, which can be satisfied at any time steps before a demand-specific deadline Δ_t. The operator's goal is to minimize a cost (subject to the constraints above) that combines a cost of purchasing energy, a cost for delivering energy (if applicable), and smoothness penalties on the purchasing and delivery rates to discourage fluctuations and encourage ''grid healthy'' decisions. OSDM generalizes several problems in the online algorithms literature while being the first to fully model applications of interest. We propose a competitive algorithm for OSDM called PAAD (partitioned accounting & aggregated decisions) and show it achieves the optimal competitive ratio. To overcome the pessimism typical of worst-case analysis, we also propose a novel learning framework for OSDM that provides guarantees on the worst-case competitive ratio (i.e., to provide robustness against nonstationarity) while allowing end-to-end differentiable learning of the best algorithm on historical instances of the problem. We evaluate our algorithms in a case study of a grid-integrated data center with battery storage, showing that PAAD effectively solves the problem and end-to-end learning achieves substantial performance improvements compared to PAAD .
- 20 July 2026
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 54 (1) , 85-87
Open AccessOnline Smoothed Demand Management
We introduce and study a class of online problems called online smoothed demand management ( OSDM ), motivated by paradigm shifts in grid integration and energy storage for large energy consumers such as data centers. In OSDM , an operator makes two decisions at each time step: an amount of energy to be purchased, and an amount of energy to be delivered (i.e., used for computation). The difference between these decisions charges (or discharges) the operator's energy storage (e.g., a battery). Two types of demand arrive online: base demand, which must be covered at the current time, and flexible demand, which can be satisfied at any time steps before a demand-specific deadline Δ_t. The operator's goal is to minimize a cost (subject to the constraints above) that combines a cost of purchasing energy, a cost for delivering energy (if applicable), and smoothness penalties on the purchasing and delivery rates to discourage fluctuations and encourage ''grid healthy'' decisions. OSDM generalizes several problems in the online algorithms literature while being the first to fully model applications of interest. We propose a competitive algorithm for OSDM called PAAD (partitioned accounting & aggregated decisions) and show it achieves the optimal competitive ratio. To overcome the pessimism typical of worst-case analysis, we also propose a novel learning framework for OSDM that provides guarantees on the worst-case competitive ratio (i.e., to provide robustness against nonstationarity) while allowing end-to-end differentiable learning of the best algorithm on historical instances of the problem. We evaluate our algorithms in a case study of a grid-integrated data center with battery storage, showing that PAAD effectively solves the problem and end-to-end learning achieves substantial performance improvements compared to PAAD .
- Open Access
- 22 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 202-234
Competitive and Learned Online Algorithms for HVAC Demand Management in Thermal Networks
- 22 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 202-234
Open AccessCompetitive and Learned Online Algorithms for HVAC Demand Management in Thermal Networks
- Open Access
- 22 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 240-271
Risk-Sensitive Peak-Aware Energy Scheduling: Competitive and Learning-Augmented Algorithms
- 22 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 240-271
Open AccessRisk-Sensitive Peak-Aware Energy Scheduling: Competitive and Learning-Augmented Algorithms
- Open Access
- 8 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 85-87
Online Smoothed Demand Management
- 8 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 85-87
Open AccessOnline Smoothed Demand Management
- Open Access
- 8 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 82-84
Prediction-Specific Design of Learning-Augmented Algorithms
- 8 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 82-84
Open AccessPrediction-Specific Design of Learning-Augmented Algorithms
- Open Access
- 26 March 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Measurement and Analysis of Computing Systems
- Vol. 10 (1) , 1-57
Prediction-Specific Design of Learning-Augmented Algorithms
Algorithms with predictions have emerged as a powerful framework to combine the robustness of traditional online algorithms with the data-driven performance benefits of machine-learned (ML) predictions. However, most existing approaches in this paradigm are overly conservative, as they do not leverage problem structure to optimize performance in a prediction-specific manner. In this paper, we show that such prediction-specific performance criteria can enable significant performance improvements over the coarser notions of consistency and robustness considered in prior work. Specifically, we propose a notion of strongly-optimal algorithms with predictions, which obtain Pareto optimality not just in the worst-case tradeoff between robustness and consistency, but also in the prediction-specific tradeoff between these metrics. We develop a general bi-level optimization framework that enables systematically designing strongly-optimal algorithms in a wide variety of problem settings, and we propose explicit strongly-optimal algorithms for several classic online problems: deterministic and randomized ski rental, and one-max search. Our analysis reveals new structural insights into how predictions can be optimally integrated into online algorithms by leveraging a prediction-specific design. To validate the benefits of our proposed framework, we empirically evaluate our algorithms in case studies on problems including dynamic power management and volatility-based index trading. Our results demonstrate that prediction-specific, strongly-optimal algorithms can significantly improve performance across a variety of online decision-making settings.
- 26 March 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Measurement and Analysis of Computing Systems
- Vol. 10 (1) , 1-57
Open AccessPrediction-Specific Design of Learning-Augmented Algorithms
Algorithms with predictions have emerged as a powerful framework to combine the robustness of traditional online algorithms with the data-driven performance benefits of machine-learned (ML) predictions. However, most existing approaches in this paradigm are overly conservative, as they do not leverage problem structure to optimize performance in a prediction-specific manner. In this paper, we show that such prediction-specific performance criteria can enable significant performance improvements over the coarser notions of consistency and robustness considered in prior work. Specifically, we propose a notion of strongly-optimal algorithms with predictions, which obtain Pareto optimality not just in the worst-case tradeoff between robustness and consistency, but also in the prediction-specific tradeoff between these metrics. We develop a general bi-level optimization framework that enables systematically designing strongly-optimal algorithms in a wide variety of problem settings, and we propose explicit strongly-optimal algorithms for several classic online problems: deterministic and randomized ski rental, and one-max search. Our analysis reveals new structural insights into how predictions can be optimally integrated into online algorithms by leveraging a prediction-specific design. To validate the benefits of our proposed framework, we empirically evaluate our algorithms in case studies on problems including dynamic power management and volatility-based index trading. Our results demonstrate that prediction-specific, strongly-optimal algorithms can significantly improve performance across a variety of online decision-making settings.
- Open Access
- 16 June 2025
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 53 (1) , 169-171
Learning-Augmented Competitive Algorithms for Spatiotemporal Online Allocation with Deadline Constraints
We introduce and study spatiotemporal online allocation with deadline constraints (SOAD), a new online problem motivated by emerging challenges in sustainability and energy. In SOAD, an online player completes a workload by allocating and scheduling it on the points of a metric space ( X , d ) while subject to a deadline T . At each time step, a service cost function is revealed that represents the cost of servicing the workload at each point, and the player must irrevocably decide the current allocation of work to points. Whenever the player moves this allocation, they incur a movement cost defined by the distance metric d (•, •) that captures, e.g., an overhead cost. SOAD formalizes the open problem of combining general metrics and deadline constraints in the online algorithms literature, unifying problems such as metrical task systems and online search. We propose a competitive algorithm for SOAD along with a matching lower bound establishing its optimality. Our main algorithm, ST-CLIP, is a learning-augmented algorithm that takes advantage of predictions (e.g., forecasts of relevant costs) and achieves an optimal consistency-robustness trade-off. We evaluate our proposed algorithms in a simulated case study of carbon-aware spatiotemporal workload management, an application in sustainable computing that schedules a delay-tolerant batch compute job on a distributed network of data centers. In these experiments, we show that ST-CLIP substantially improves on heuristic baseline methods.
- 16 June 2025
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 53 (1) , 169-171
Open AccessLearning-Augmented Competitive Algorithms for Spatiotemporal Online Allocation with Deadline Constraints
We introduce and study spatiotemporal online allocation with deadline constraints (SOAD), a new online problem motivated by emerging challenges in sustainability and energy. In SOAD, an online player completes a workload by allocating and scheduling it on the points of a metric space ( X , d ) while subject to a deadline T . At each time step, a service cost function is revealed that represents the cost of servicing the workload at each point, and the player must irrevocably decide the current allocation of work to points. Whenever the player moves this allocation, they incur a movement cost defined by the distance metric d (•, •) that captures, e.g., an overhead cost. SOAD formalizes the open problem of combining general metrics and deadline constraints in the online algorithms literature, unifying problems such as metrical task systems and online search. We propose a competitive algorithm for SOAD along with a matching lower bound establishing its optimality. Our main algorithm, ST-CLIP, is a learning-augmented algorithm that takes advantage of predictions (e.g., forecasts of relevant costs) and achieves an optimal consistency-robustness trade-off. We evaluate our proposed algorithms in a simulated case study of carbon-aware spatiotemporal workload management, an application in sustainable computing that schedules a delay-tolerant batch compute job on a distributed network of data centers. In these experiments, we show that ST-CLIP substantially improves on heuristic baseline methods.
- Open Access
- 16 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 63-79
Learning for Sustainable Online Scheduling with Competitive Fairness Guarantees
- 16 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 63-79
Open AccessLearning for Sustainable Online Scheduling with Competitive Fairness Guarantees
- Open Access
- 9 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 169-171
Learning-Augmented Competitive Algorithms for Spatiotemporal Online Allocation with Deadline Constraints
- 9 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 169-171
Open AccessLearning-Augmented Competitive Algorithms for Spatiotemporal Online Allocation with Deadline Constraints