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

Ssu-Rui Lee

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

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

Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1

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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 100%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › physical design › placement
circuit placement
0.612022
Flexible chip placement via reinforcement learning: late breaking results · DAC 2022
Electronic design automation › physical design › placement › module placement
macro placement
0.612022
Flexible chip placement via reinforcement learning: late breaking results · DAC 2022
Electronic design automation
physical design
0.612022
Flexible chip placement via reinforcement learning: late breaking results · DAC 2022
Information retrieval › web search › web information retrieval › web content quality
credibility assessment
0.412020
Conquering Cross-source Failure for News Credibility: Learning Generalizable Representations beyond Content Embedding · WWW 2020
Mathematical optimization
multi-objective optimization
0.212022
Flexible chip placement via reinforcement learning: late breaking results · DAC 2022
Mathematical optimization › multi-objective optimization
pareto front
0.212022
Flexible chip placement via reinforcement learning: late breaking results · DAC 2022

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

reinforcement learning · 1.1multi-objective reinforcement learning · 1.1syntactic networks · 0.4
YearPublicationVenuePosition
2022 Flexible chip placement via reinforcement learning: late breaking results
abstract
Recently, successful applications of reinforcement learning to chip placement have emerged. Pretrained models are necessary to improve efficiency and effectiveness. Currently, the weights of objective metrics (e.g., wirelength, congestion, and timing) are fixed during pretraining. However, fixed-weighed models cannot generate the diversity of placements required for engineers to accommodate changing requirements as they arise. This paper proposes flexible multiple-objective reinforcement learning (MORL) to support objective functions with inference-time variable weights using just a single pretrained model. Our macro placement results show that MORL can generate the Pareto frontier of multiple objectives effectively.
Fu-Chieh Chang 0001, Yu-Wei Tseng, Ya-Wen Yu, Ssu-Rui Lee, Alexandru Cioba, I-Lun Tseng, Da-Shan Shiu, Jhih-Wei Hsu, Cheng-Yuan Wang, Chien-Yi Yang, Ren-Chu Wang, Yao-Wen Chang, Tai-Chen Chen, Tung-Chieh Chen
DAC4
2020 Conquering Cross-source Failure for News Credibility: Learning Generalizable Representations beyond Content Embedding
abstract
False information on the Internet has caused severe damage to society. Researchers have proposed methods to determine the credibility of news and have obtained good results. As different media sources (publishers) have different content generators (writers) and may focus on different topics or aspects, the word/topic distribution for each media source is divergent from others. We expose a challenge in the generalizability of existing content-based methods to perform consistently when applied to news from media sources non-existing in the training set, namely the cross-source failure. A cross-source setting can cause a decrease beyond in accuracy for current methods; content-sensitive features are considered one of the major causes of cross-source failure for a content-based approach. To overcome this challenge, we propose a syntactic network for news credibility (SYNC), which focuses on function words and syntactic structure to learn generalizable representations for news credibility and further reinforce the cross-source robustness for different media. Experiments with cross-validation on 194 real-world media sources showed that the proposed method could learn the generalizable features and outperformed the state-of-the-art methods on unseen media sources. Extensive analysis on the embedding feature representation represents a strength of the proposed method compared to current content embedding feature approaches. We envision that the proposed method is more robust for real-life application with SYNC on account of its good generalizability.
Yen-Hao Huang, Ting-Wei Liu, Ssu-Rui Lee, Fernando Calderon, Yi-Shin Chen
WWW3