Arrow Research search

Author name cluster

Russell Lee

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

2 papers
2 author rows

Possible papers

2

ICML Conference 2023 Conference Paper

Applied Online Algorithms with Heterogeneous Predictors

  • Jessica Maghakian
  • Russell Lee
  • Mohammad Hajiesmaili
  • Jian Li 0008
  • Ramesh K. Sitaraman
  • Zhenhua Liu 0002

For many application domains, the integration of machine learning (ML) models into decision making is hindered by the poor explainability and theoretical guarantees of black box models. Although the emerging area of algorithms with predictions offers a way to leverage ML while enjoying worst-case guarantees, existing work usually assumes access to only one predictor. We demonstrate how to more effectively utilize historical datasets and application domain knowledge by intentionally using predictors of different quantities. By leveraging the heterogeneity in our predictors, we are able to achieve improved performance, explainability and computational efficiency over predictor-agnostic methods. Theoretical results are supplemented by large-scale empirical evaluations with production data demonstrating the success of our methods on optimization problems occurring in large distributed computing systems.

NeurIPS Conference 2021 Conference Paper

Pareto-Optimal Learning-Augmented Algorithms for Online Conversion Problems

  • Bo Sun
  • Russell Lee
  • Mohammad Hajiesmaili
  • Adam Wierman
  • Danny Tsang

This paper leverages machine-learned predictions to design competitive algorithms for online conversion problems with the goal of improving the competitive ratio when predictions are accurate (i. e. , consistency), while also guaranteeing a worst-case competitive ratio regardless of the prediction quality (i. e. , robustness). We unify the algorithmic design of both integral and fractional conversion problems, which are also known as the 1-max-search and one-way trading problems, into a class of online threshold-based algorithms (OTA). By incorporating predictions into design of OTA, we achieve the Pareto-optimal trade-off of consistency and robustness, i. e. , no online algorithm can achieve a better consistency guarantee given for a robustness guarantee. We demonstrate the performance of OTA using numerical experiments on Bitcoin conversion.

v2026.09.13