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

Do Yoon Kim

dblp:76/6531 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2024
0000-0001-5097-504XORCID · corroborated

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

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Theory of computation · 1 · 1 first-author · 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.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational finance and economics · 44% Computational social science and digital humanities · 44% Smart cities and intelligent transportation · 13%
Artificial intelligence
1 paper
Optimization for machine learning · 50% Efficient and distributed learning · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 50% Parallel and multicore computing · 50%

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

TopicWeightPapersLastEvidence papers
Computational social science and digital humanities
field experiments
0.812024
How effective is the High Stock Delivery Windows Information Sharing Policy for Online Platforms · EC 2024
Computational finance and economics
platform economics
0.812024
How effective is the High Stock Delivery Windows Information Sharing Policy for Online Platforms · EC 2024
Machine learning › Efficient and distributed learning
computation reuse
0.612022
Hippo: Sharing Computations in Hyper-Parameter Optimization · Proc. VLDB Endow. 2022
Machine learning › Optimization for machine learning
hyperparameter optimization
0.612022
Hippo: Sharing Computations in Hyper-Parameter Optimization · Proc. VLDB Endow. 2022
Cloud and datacenter computing
cluster resource management and scheduling
0.612022
Hippo: Sharing Computations in Hyper-Parameter Optimization · Proc. VLDB Endow. 2022
Parallel and multicore computing › task scheduling › task graph scheduling
critical path scheduling
0.612022
Hippo: Sharing Computations in Hyper-Parameter Optimization · Proc. VLDB Endow. 2022

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

stage tree · 1.1search plan · 1.1randomized field experiment · 0.8
YearPublicationVenuePosition
2024 How effective is the High Stock Delivery Windows Information Sharing Policy for Online Platforms
abstract
In this paper, we analyze a novel information-sharing policy to reduce stockouts and improve performance on online grocery retail platforms. Stockouts are particularly relevant to our setting, as online platforms lack control over retailers' inventory management, and consequently when/whether items are in stock. Our policy involves leveraging the digital interface of online platforms to disseminate information about delivery windows when retailer stock levels are at their peak. Ex-ante, it is unclear if such a policy would positively influence customers' purchasing patterns, particularly in terms of its impact on platforms' fundamentals. On the one hand, this information might not be informative to customers, having already been factored into their optimal delivery window decision. Alternatively, customers may be limited in their cognitive abilities and ignore stock information when choosing delivery windows. In addition, sharing information about high-stock delivery windows might raise customer awareness (or aversion) regarding stockouts, potentially decreasing the conversion rate. We conducted a large-scale field experiment on over 1M users on Instacart, an online grocery delivery platform. In this experiment, customers in the treatment group were prompted "Higher stock at this time" under delivery windows corresponding to peak supermarket stock levels. We find our cost-free information-sharing policy significantly affected customer behavior, as well as order fulfillment rates. Our main results can be summarized as follows:
Do Yoon Kim, Benjamin Knight, Dmitry Mitrofanov
EC1
2022 Hippo: Sharing Computations in Hyper-Parameter Optimization
abstract
Hyper-parameter optimization is crucial for pushing the accuracy of a deep learning model to its limits. However, a hyper-parameter optimization job, referred to as a study, involves numerous trials of training a model using different training knobs, and therefore is very computation-heavy, typically taking hours and days to finish. We observe that trials issued from hyper-parameter optimization algorithms often share common hyper-parameter sequence prefixes. Based on this observation, we propose Hippo, a hyper-parameter optimization system that reuses computation across trials to reduce the overall amount of computation significantly. Instead of treating each trial independently as in existing hyper-parameter optimization systems, Hippo breaks down the hyper-parameter sequences into stages and merges common stages to form a tree of stages (a stage tree). Hippo maintains an internal data structure, search plan, to manage the current status and history of a study, and employs a critical path based scheduler to minimize the overall study completion time. Hippo applies to not only single studies but multi-study scenarios as well. Evaluations show that Hippo's stage-based execution strategy outperforms trial-based methods for several models and hyper-parameter optimization algorithms, reducing end-to-end training time by up to 2.76X (3.53x) and GPU-hours by up to 4.81X (6.77x), for single (multiple) studies.
Ahnjae Shin, Joo Seong Jeong, Do Yoon Kim, Soyoung Jung, Byung-Gon Chun
Proc. VLDB Endow.3