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

Justin C. I. Chuang

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

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

Artificial intelligence and machine learning · 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
3D vision · 67% Deep learning architectures and training · 33%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision › geometric deep learning › set learning
deep sets
0.812024
Stacking Deep Set Networks and Pooling by Quantiles · ICML 2024
Machine learning › Deep learning architectures and training › neural network layer design
pooling
0.812024
Stacking Deep Set Networks and Pooling by Quantiles · ICML 2024
Computer vision › 3D vision › geometric deep learning
set learning
0.812024
Stacking Deep Set Networks and Pooling by Quantiles · ICML 2024

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

permutation-invariant pooling · 0.8max pooling · 0.8average pooling · 0.8
YearPublicationVenuePosition
2024 Stacking Deep Set Networks and Pooling by Quantiles
abstract
We propose Stacked Deep Sets and Quantile Pooling for learning tasks on set data. We introduce Quantile Pooling, a novel permutation-invariant pooling operation that synergizes max and average pooling. Just like max pooling, quantile pooling emphasizes the most salient features of the data. Like average pooling, it captures the overall distribution and subtle features of the data. Like both, it is lightweight and fast. We demonstrate the effectiveness of our approach in a variety of tasks, showing that quantile pooling can outperform both max and average pooling in each of their respective strengths. We also introduce a variant of deep set networks that is more expressive and universal. While Quantile Pooling balances robustness and sensitivity, Stacked Deep Sets enhances learning with depth.
Zhuojun Chen, Xinghua Zhu, Dongzhe Su, Justin C. I. Chuang
ICML4