Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Li-Feng Lee

dblp:314/2829 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Efficient and distributed learning · 77% Optimization for machine learning · 23%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
distributed training
0.612022
Machine Learning on Volatile Instances: Convergence, Runtime, and Cost Tradeoffs · IEEE/ACM Trans. Netw. 2022
Cloud and datacenter computing › utility computing › cloud pricing
spot instance
0.612022
Machine Learning on Volatile Instances: Convergence, Runtime, and Cost Tradeoffs · IEEE/ACM Trans. Netw. 2022
Machine learning › Optimization for machine learning › convergence guarantees
stochastic gradient descent convergence
0.212022
Machine Learning on Volatile Instances: Convergence, Runtime, and Cost Tradeoffs · IEEE/ACM Trans. Netw. 2022

Methods — techniques the papers use, named apart from their topics

cost modeling · 1.1convergence analysis · 1.1
YearPublicationVenuePosition
2022 Machine Learning on Volatile Instances: Convergence, Runtime, and Cost Tradeoffs
abstract
Due to the massive size of the neural network models and training datasets used in machine learning today, it is imperative to distribute stochastic gradient descent (SGD) by splitting up tasks such as gradient evaluation across multiple worker nodes. However, running distributed SGD can be prohibitively expensive because it may require specialized computing resources such as GPUs for extended periods of time. We propose cost-effective strategies to exploit volatile cloud instances that are cheaper than standard instances, but may be interrupted by higher priority workloads. To the best of our knowledge, this work is the first to quantify how variations in the number of active worker nodes (as a result of preemption) affect SGD convergence and the time to train the model. By understanding these trade-offs between preemption probability of the instances, accuracy, and training time, we are able to derive practical strategies for configuring distributed SGD jobs on volatile instances such as Amazon EC2 spot instances and other preemptible cloud instances. Experimental results show that our strategies achieve good training performance at substantially lower cost.
Xiaoxi Zhang 0001, Jianyu Wang 0019, Li-Feng Lee, Tom Yang, Akansha Kalra, Gauri Joshi, Carlee Joe-Wong
IEEE/ACM Trans. Netw.3