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

Yiyun Luo

dblp:302/1254 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2023
0000-0001-9425-9678ORCID · reported

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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.

Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%
Artificial intelligence
1 paper
Learning theory · 50% Reinforcement learning · 50%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory
online learning
0.612022
Contextual Dynamic Pricing with Unknown Noise: Explore-then-UCB Strategy and Improved Regrets · NeurIPS 2022
Machine learning › Reinforcement learning
regret minimization
0.612022
Contextual Dynamic Pricing with Unknown Noise: Explore-then-UCB Strategy and Improved Regrets · NeurIPS 2022
Algorithmic game theory and mechanism design › dynamic pricing
contextual dynamic pricing
0.612022
Contextual Dynamic Pricing with Unknown Noise: Explore-then-UCB Strategy and Improved Regrets · NeurIPS 2022
Algorithmic game theory and mechanism design
dynamic pricing
0.612022
Contextual Dynamic Pricing with Unknown Noise: Explore-then-UCB Strategy and Improved Regrets · NeurIPS 2022
Algorithmic game theory and mechanism design
revenue maximization
0.212022
Contextual Dynamic Pricing with Unknown Noise: Explore-then-UCB Strategy and Improved Regrets · NeurIPS 2022

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

nonparametric estimation · 1.1explore-then-UCB · 1.1
YearPublicationVenuePosition
2023 Enhanced Mapping of Supraglacial Lakes Through Dual-attention Deep Neural Network
abstract
Supraglacial lakes in the Arctic undergo seasonal and glacial-activity-induced changes, providing profound insights into ice dynamics and climate changes in these sensitive regions. However, the morphological complexity of these lakes, compounded by the environmental obstructions like clouds and slush fields, poses significant challenges to accurate lake detection. The 31st ACM SIGSPATIAL 2023 initiated a competition, GISCUP 2023, focusing on supraglacial lake detection based on multipart, multi-temporal satellite imagery. This paper, distinguished as the 3rd place winner, introduces a pioneering dual-attention U-net algorithm. This approach synergizes deep learning with spectral and spatial knowledge, ensuring a streamlined pipeline structure that upholds methodological soundness and yields satisfying results.
Jiawei Wei, Xiaoyong Gao, Dexuan Sha, Yiyun Luo, Junliu Yang
SIGSPATIAL/GIS5
2022 Contextual Dynamic Pricing with Unknown Noise: Explore-then-UCB Strategy and Improved Regrets
abstract
Dynamic pricing is a fast-moving research area in machine learning and operations management. A lot of work has been done for this problem with known noise. In this paper, we consider a contextual dynamic pricing problem under a linear customer valuation model with an unknown market noise distribution $F$. This problem is very challenging due to the difficulty in balancing three tangled tasks of revenue-maximization, estimating the linear valuation parameter $\theta_{0}$, and learning the nonparametric $F$. To address this issue, we develop a novel {\it Explore-then-UCB} (ExUCB) strategy that includes an exploration for $\theta_{0}$-learning and a followed UCB procedure of joint revenue-maximization and $F$-learning. Under Lipschitz and 2nd-order smoothness assumptions on $F$, ExUCB is the first approach to achieve the $\tilde{O}(T^{2/3})$ regret rate. Under the Lipschitz assumption only, ExUCB matches the best existing regret of $\tilde{O}(T^{3/4})$ and is computationally more efficient. Furthermore, for regret lower bounds under the nonparametric $F$, not much work has been done beyond only assuming Lipschitz. To fill this gap, we provide the first $\tilde{\Omega}(T^{3/5})$ lower bound under Lipschitz and 2nd-order smoothness assumptions.
Yiyun Luo, Will Wei Sun
NeurIPS1