Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Christianson, Nicolas"'
Power system operators must ensure that dispatch decisions remain feasible in case of grid outages or contingencies to prevent cascading failures and ensure reliable operation. However, checking the feasibility of all $N - k$ contingencies -- every p
Externí odkaz:
http://arxiv.org/abs/2410.00796
Machine learning can significantly improve performance for decision-making under uncertainty in a wide range of domains. However, ensuring robustness guarantees requires well-calibrated uncertainty estimates, which can be difficult to achieve in high
Externí odkaz:
http://arxiv.org/abs/2409.20534
Autor:
Lechowicz, Adam, Christianson, Nicolas, Sun, Bo, Bashir, Noman, Hajiesmaili, Mohammad, Wierman, Adam, Shenoy, Prashant
We study carbon-aware spatiotemporal workload management, which seeks to address the growing environmental impact of data centers. We formalize this as an online problem called spatiotemporal online allocation with deadline constraints ($\mathsf{SOAD
Externí odkaz:
http://arxiv.org/abs/2408.07831
We study the design of risk-sensitive online algorithms, in which risk measures are used in the competitive analysis of randomized online algorithms. We introduce the CVaR$_\delta$-competitive ratio ($\delta$-CR) using the conditional value-at-risk o
Externí odkaz:
http://arxiv.org/abs/2405.09859
Autor:
Lechowicz, Adam, Christianson, Nicolas, Sun, Bo, Bashir, Noman, Hajiesmaili, Mohammad, Wierman, Adam, Shenoy, Prashant
We introduce and study a family of online metric problems with long-term constraints. In these problems, an online player makes decisions $\mathbf{x}_t$ in a metric space $(X,d)$ to simultaneously minimize their hitting cost $f_t(\mathbf{x}_t)$ and s
Externí odkaz:
http://arxiv.org/abs/2402.14012
Autor:
Lechowicz, Adam, Christianson, Nicolas, Sun, Bo, Bashir, Noman, Hajiesmaili, Mohammad, Wierman, Adam, Shenoy, Prashant
We introduce and study online conversion with switching costs, a family of online problems that capture emerging problems at the intersection of energy and sustainability. In this problem, an online player attempts to purchase (alternatively, sell) f
Externí odkaz:
http://arxiv.org/abs/2310.20598
Autor:
Sun, Bo, Huang, Jerry, Christianson, Nicolas, Hajiesmaili, Mohammad, Wierman, Adam, Boutaba, Raouf
The burgeoning field of algorithms with predictions studies the problem of using possibly imperfect machine learning predictions to improve online algorithm performance. While nearly all existing algorithms in this framework make no assumptions on pr
Externí odkaz:
http://arxiv.org/abs/2310.11558
Autor:
Lechowicz, Adam, Christianson, Nicolas, Zuo, Jinhang, Bashir, Noman, Hajiesmaili, Mohammad, Wierman, Adam, Shenoy, Prashant
Publikováno v:
Proc. ACM Meas. Anal. Comput. Syst. Volume 7, Issue 3, Article 45 (December 2023), 32 pages
We introduce and study the online pause and resume problem. In this problem, a player attempts to find the $k$ lowest (alternatively, highest) prices in a sequence of fixed length $T$, which is revealed sequentially. At each time step, the player is
Externí odkaz:
http://arxiv.org/abs/2303.17551
The structure of knowledge is commonly described as a network of key concepts and semantic relations between them. A learner of a particular domain can discover this network by navigating the nodes and edges presented by instructional material, such
Externí odkaz:
http://arxiv.org/abs/2207.02177
We consider the problem of convex function chasing with black-box advice, where an online decision-maker aims to minimize the total cost of making and switching between decisions in a normed vector space, aided by black-box advice such as the decisio
Externí odkaz:
http://arxiv.org/abs/2206.11780