Adam Lechowicz

Adam Lechowicz

Auto-generated profile, based on publicly available information

Adam Lechowicz

University of Massachusetts Amherst, Amherst, USA

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 December 2023 in Proceedings of the ACM on Measurement and Analysis of Computing Systems
Verified
Journal Article
Open access
ALAdam Lechowicz
Adam Lechowicz
NCNicolas Christianson
Nicolas Christianson
JZJinhang Zuo
Jinhang Zuo
NBNoman Bashir
Noman Bashir
MHMohammad Hajiesmaili
Mohammad Hajiesmaili
PSPrashant Shenoy
Prashant Shenoy
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 presented with a price and decides whether to accept or reject it. The player incurs aswitching cost whenever their decision changes in consecutive time steps, i.e., whenever they pause or resume purchasing. This online problem is motivated by the goal of carbon-aware load shifting, where a workload may be paused during periods of high carbon intensity and resumed during periods of low carbon intensity and incurs a cost when saving or restoring its state. It has strong connections to existing problems studied in the literature on online optimization, though it introduces unique technical challenges that prevent the direct application of existing algorithms. Extending prior work on threshold-based algorithms, we introducedouble-threshold algorithms for both the minimization and maximization variants of this problem. We further show that the competitive ratios achieved by these algorithms are the best achievable by any deterministic online algorithm. Finally, we empirically validate our proposed algorithm through case studies on the application of carbon-aware load shifting using real carbon trace data and existing baseline algorithms.

27 August 2025
Verified
Conference Paper
Open access
ALAdam Lechowicz
Adam Lechowicz
RSRohan Shenoy
Rohan Shenoy
NBNoman Bashir
Noman Bashir
MHMohammad Hajiesmaili
Mohammad Hajiesmaili
AWAdam Wierman
Adam Wierman
CDChristina Delimitrou
Christina Delimitrou

27 February 2023
Verified
Conference Paper
Open access
NBNikita Bhalla
Nikita Bhalla
ALAdam Lechowicz
Adam Lechowicz
CMCameron Musco
Cameron Musco
The proliferation of social media platforms, recommender systems, and their joint societal impacts have prompted significant interest in opinion formation and evolution within social networks. We study how local edge dynamics can drive opinion polarization. In particular, we introduce a variant of the classic Friedkin-Johnsen opinion dynamics, augmented with a simple time-evolving network model. Edges are iteratively added or deleted according to simple rules, modeling decisions based on individual preferences and network recommendations. Via simulations on synthetic and real-world graphs, we find that the combined presence of two dynamics gives rise to high polarization: 1) confirmation bias -- i.e., the preference for nodes to connect to other nodes with similar expressed opinions and 2) friend-of-friend link recommendations, which encourage new connections between closely connected nodes. We show that our model is tractable to theoretical analysis, which helps explain how these local dynamics erode connectivity across opinion groups, affecting polarization and a related measure of disagreement across edges. Finally, we validate our model against real-world data, showing that our edge dynamics drive the structure of arbitrary graphs, including random graphs, to more closely resemble real social networks. Our code and supplemental materials are available at https://github.com/adamlechowicz/opinion-polarization/.

31 May 2024
Verified
Conference Paper
Open access
RBRoozbeh Bostandoost
Roozbeh Bostandoost
ALAdam Lechowicz
Adam Lechowicz
WHWalid A. Hanafy
Walid A. Hanafy
NBNoman Bashir
Noman Bashir
PSPrashant Shenoy
Prashant Shenoy
MHMohammad Hajiesmaili
Mohammad Hajiesmaili
Motivated by an imperative to reduce the carbon emissions of cloud data centers, this paper studies the online carbon-aware resource scaling problem with unknown job lengths (OCSU) and applies it to carbon-aware resource scaling for executing computing workloads. The task is to dynamically scale resources (e.g., the number of servers) assigned to a job of unknown length such that it is completed before a deadline, with the objective of reducing the carbon emissions of executing the workload. The total carbon emissions of executing a job originate from the emissions of running the job and excess carbon emitted while switching between different scales (e.g., due to checkpoint and resume). Prior work on carbon-aware resource scaling has assumed accurate job length information, while other approaches have ignored switching losses and require carbon intensity forecasts. These assumptions prohibit the practical deployment of prior work for online carbon-aware execution of scalable computing workload. We propose LACS, a theoretically robust, learning-augmented algorithm that solves OCSU. To achieve improved practical average-case performance, LACS integrates machine-learned predictions of job length. To achieve solid theoretical performance, LACS extends the recent theoretical advances on online conversion with switching costs to handle a scenario where the job length is unknown. Our experimental evaluations demonstrate that, on average, the carbon footprint of LACS lies within 1.2% of the online baseline that assumes perfect job length information and within 16% of the offline baseline that, in addition to the job length, also requires accurate carbon intensity forecasts. Furthermore, LACS achieves a 32% reduction in carbon footprint compared to the deadline-aware carbon-agnostic execution of the job.

10 June 2024
Verified
Conference Paper
Open access
ALAdam Lechowicz
Adam Lechowicz
NCNicolas Christianson
Nicolas Christianson
BSBo Sun
Bo Sun
NBNoman Bashir
Noman Bashir
MHMohammad Hajiesmaili
Mohammad Hajiesmaili
PSPrashant Shenoy
Prashant Shenoy
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) fractional shares of an asset during a fixed time horizon with length T. At each time step, a cost function (alternatively, price function) is revealed, and the player must irrevocably decide an amount of asset to convert. The player also incurs a switching cost whenever their decision changes in consecutive time steps, i.e., when they increase or decrease their purchasing amount. We introduce competitive (robust) threshold-based algorithms for both the minimization and maximization variants of this problem, and show they are optimal among deterministic online algorithms. We then propose learning-augmented algorithms that take advantage of untrusted black-box advice (such as predictions from a machine learning model) to achieve significantly better average-case performance without sacrificing worst-case competitive guarantees. Finally, we empirically evaluate our proposed algorithms using a carbon-aware EV charging case study, showing that our algorithms substantially improve on baseline methods for this problem.

11 June 2024 in ACM SIGMETRICS Performance Evaluation Review
Verified
Journal Article
Open access
ALAdam Lechowicz
Adam Lechowicz
NCNicolas Christianson
Nicolas Christianson
BSBo Sun
Bo Sun
NBNoman Bashir
Noman Bashir
MHMohammad Hajiesmaili
Mohammad Hajiesmaili
PSPrashant Shenoy
Prashant Shenoy
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) fractional shares of an asset during a fixed time horizon with length T. At each time step, a cost function (alternatively, price function) is revealed, and the player must irrevocably decide an amount of asset to convert. The player also incurs a switching cost whenever their decision changes in consecutive time steps, i.e., when they increase or decrease their purchasing amount. We introduce competitive (robust) threshold-based algorithms for both the minimization and maximization variants of this problem, and show they are optimal among deterministic online algorithms. We then propose learning-augmented algorithms that take advantage of untrusted black-box advice (such as predictions from a machine learning model) to achieve significantly better average-case performance without sacrificing worst-case competitive guarantees. Finally, we empirically evaluate our proposed algorithms using a carbon-aware EV charging case study, showing that our algorithms substantially improve on baseline methods for this problem.