Lin Yang

Lin Yang

Auto-generated profile, based on publicly available information

Lin Yang

Nanjing Universary, Suzhou, Jiangsu, China

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
8 December 2022 in Proceedings of the ACM on Measurement and Analysis of Computing Systems
Verified
Journal Article
Open access
BSBo Sun
Bo Sun
LYLin Yang
Lin Yang
MHMohammad Hajiesmaili
Mohammad Hajiesmaili
AWAdam Wierman
Adam Wierman
JLJohn C. S. Lui
John C. S. Lui
DTDanny H.K. Tsang
Danny H.K. Tsang
The online knapsack problem is a classic online resource allocation problem in networking and operations research. Its basic version studies how to pack online arriving items of different sizes and values into a capacity-limited knapsack. In this paper, we study a general version that includes item departures, while also considering multiple knapsacks and multi-dimensional item sizes. We design a threshold-based online algorithm and prove that the algorithm can achieve order-optimal competitive ratios. Beyond worst-case performance guarantees, we also aim to achieve near-optimal average performance under typical instances. Towards this goal, we propose a data-driven online algorithm that learns within a policy-class that guarantees a worst-case performance bound. In trace-driven experiments, we show that our data-driven algorithm outperforms other benchmark algorithms in an application of online knapsack to job scheduling for cloud computing.

12 June 2018
Verified
Conference Paper
Open access
LYLin Yang
Lin Yang
LDLei Deng
Lei Deng
MHMohammad H. Hajiesmaili
Mohammad H. Hajiesmaili
CTCheng Tan
Cheng Tan
WWWing Shing Wong
Wing Shing Wong

11 January 2026 in Expert Systems with Applications
Verified
Journal Article
Closed access
FHFei Hao
Fei Hao
LSLihua Song
Lihua Song
YLYepeng Liu
Yepeng Liu
YSYujuan Sun
Yujuan Sun
HWHua Wang
Hua Wang
RWRen Wang
Ren Wang

22 March 2022 in ACM SIGMETRICS Performance Evaluation Review
Verified
Journal Article
Open access
RLRussell Lee
Russell Lee
YZYutao Zhou
Yutao Zhou
LYLin Yang
Lin Yang
MHMohammad Hajiesmaili
Mohammad Hajiesmaili
RSRamesh Sitaraman
Ramesh Sitaraman
This paper develops competitive bidding strategies for an online linear optimization problem with inventory management constraints in both cost minimization and profit maximization settings. In the minimization problem, a decision maker should satisfy its time-varying demand by either purchasing units of an asset from the market or producing them from a local inventory with limited capacity. In the maximization problem, a decision maker has a time-varying supply of an asset that may be sold to the market or stored in the inventory to be sold later. In both settings, the market price is unknown in each timeslot and the decision maker can submit a finite number of bids to buy/sell the asset. Once all bids have been submitted, the market price clears and the amount bought/sold is determined based on the clearing price and submitted bids. From this setup, the decision maker must minimize/maximize their cost/profit in the market, while also devising a bidding strategy in the face of an unknown clearing price. We propose DEMBID and SUPBID, two competitive bidding strategies for these online linear optimization problems with inventory management constraints for the minimization and maximization setting respectively. We then analyze the competitive ratios of the proposed algorithms and show that the performance of our algorithms approaches the best possible competitive ratio as the maximum number of bids increases. As a case study, we use energy data traces from Akamai data centers, renewable outputs from NREL, and energy prices from NYISO to show the effectiveness of our bidding strategies in the context of energy storage management for a large energy customer participating in a real-time electricity market.

6 March 2025 in Proceedings of the ACM on Measurement and Analysis of Computing Systems
Verified
Journal Article
Open access
XWXuchuang Wang
Xuchuang Wang
YCYu-Zhen Janice Chen
Yu-Zhen Janice Chen
XLXutong Liu
Xutong Liu
LYLin Yang
Lin Yang
MHMohammad Hajiesmaili
Mohammad Hajiesmaili
JLJohn C.S. Lui
John C.S. Lui
We study the cooperative asynchronous multi-agent multi-armed bandits problem, where each agent's active (arm pulling) decision rounds are asynchronous. That is, in each round, only a subset of agents is active to pull arms, and this subset is unknown and time-varying. We consider two models of multi-agent cooperation, fully distributed and leader-coordinated, and propose algorithms for both models that attain near-optimal regret and communications bounds, both of which are almost as good as their synchronous counterparts. The fully distributed algorithm relies on a novel communication policy consisting of accuracy adaptive and on-demand components, and successive arm elimination for decision-making. For leader-coordinated algorithms, a single leader explores arms and recommends them to other agents (followers) to exploit. As agents' active rounds are unknown, a competent leader must be chosen dynamically. We propose a variant of the Tsallis-INF algorithm with low switches to choose such a leader sequence. Lastly, we report numerical simulations of our new asynchronous algorithms with other known baselines.

19 June 2023
Verified
Conference Paper
Open access
BSBo Sun
Bo Sun
LYLin Yang
Lin Yang
MHMohammad Hajiesmaili
Mohammad Hajiesmaili
AWAdam Wierman
Adam Wierman
JLJohn C.S. Lui
John C.S. Lui
DTDanny H.K. Tsang
Danny H.K. Tsang
The online knapsack problem is a classic online resource allocation problem in networking and operations research. Its basic version studies how to pack online arriving items of different sizes and values into a capacity-limited knapsack. In this paper, we study a general version that includes item departures, while also considering multiple knapsacks and multi-dimensional item sizes. We design a threshold-based online algorithm and prove that the algorithm can achieve order-optimal competitive ratios. Beyond worst-case optimized algorithms, we also propose a data-driven online algorithm that can achieve near-optimal average performance under typical instances while guaranteeing the worst-case performance.