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

The-Anh Vu-Le

dblp:241/1832 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2023
0000-0002-4480-5535ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Artificial 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
2 papers
Vision and language · 40% Transfer learning and domain adaptation · 34% Representation and self-supervised learning · 20%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › Vision and language
grounded language learning
0.712023
Expand BERT Representation with Visual Information via Grounded Language Learning with Multimodal Partial Alignment · ACM Multimedia 2023
Machine learning › Representation and self-supervised learning
multimodal representation learning
0.712023
Expand BERT Representation with Visual Information via Grounded Language Learning with Multimodal Partial Alignment · ACM Multimedia 2023
Computer vision › Vision and language
visual grounding
0.712023
Expand BERT Representation with Visual Information via Grounded Language Learning with Multimodal Partial Alignment · ACM Multimedia 2023
Machine learning › Transfer learning and domain adaptation
domain adaptation
0.612022
Improving Mini-batch Optimal Transport via Partial Transportation · ICML 2022
Machine learning › Transfer learning and domain adaptation › domain adaptation › unsupervised domain adaptation
partial domain adaptation
0.612022
Improving Mini-batch Optimal Transport via Partial Transportation · ICML 2022
Mathematical optimization
optimal transport
0.612022
Improving Mini-batch Optimal Transport via Partial Transportation · ICML 2022

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

partial optimal transport · 1.1misspecified mapping analysis · 1.1partial alignment · 0.7optimal transport · 0.7
YearPublicationVenuePosition
2023 Expand BERT Representation with Visual Information via Grounded Language Learning with Multimodal Partial Alignment
abstract
Language models have been supervised with both language-only objective and visual grounding in existing studies of visual-grounded language learning. However, due to differences in the distribution and scale of visual-grounded datasets and language corpora, the language model tends to mix up the context of the tokens that occurred in the grounded data with those that do not. As a result, during representation learning, there is a mismatch between the visual information and the contextual meaning of the sentence. To overcome this limitation, we propose GroundedBERT - a grounded language learning method that enhances the BERT representation with visually grounded information. GroundedBERT comprises two components: (i) the original BERT which captures the contextual representation of words learned from the language corpora, and (ii) a visual grounding module which captures visual information learned from visual-grounded datasets. Moreover, we employ Optimal Transport (OT), specifically its partial variant, to solve the fractional alignment problem between the two modalities. Our proposed method significantly outperforms the baseline language models on various language tasks of the GLUE and SQuAD datasets.
Cong-Duy Nguyen, The-Anh Vu-Le, Thong Nguyen 0003, Thanh Tho Quan, Anh Tuan Luu
ACM Multimedia2
2022 Improving Mini-batch Optimal Transport via Partial Transportation
abstract
Mini-batch optimal transport (m-OT) has been widely used recently to deal with the memory issue of OT in large-scale applications. Despite their practicality, m-OT suffers from misspecified mappings, namely, mappings that are optimal on the mini-batch level but are partially wrong in the comparison with the optimal transportation plan between the original measures. Motivated by the misspecified mappings issue, we propose a novel mini-batch method by using partial optimal transport (POT) between mini-batch empirical measures, which we refer to as mini-batch partial optimal transport (m-POT). Leveraging the insight from the partial transportation, we explain the source of misspecified mappings from the m-OT and motivate why limiting the amount of transported masses among mini-batches via POT can alleviate the incorrect mappings. Finally, we carry out extensive experiments on various applications such as deep domain adaptation, partial domain adaptation, deep generative model, color transfer, and gradient flow to demonstrate the favorable performance of m-POT compared to current mini-batch methods.
Dang Nguyen 0002, The-Anh Vu-Le, Tung Pham 0001, Nhat Ho
ICML3
2021 SHREC 2021: Retrieval of cultural heritage objects
Ivan Sipiran, Patrick Lazo, Cristian López 0001, Milagritos Jimenez, Nihar Bagewadi, Benjamin Bustos, Hieu Dao, Shankar Gangisetty, Martin Hanik, Ngoc-Phuong Ho-Thi, Mike Holenderski, Dmitri Jarnikov, Arniel Labrada, Stefan Lengauer, Roxane Licandro, Dinh-Huan Nguyen, Thang-Long Nguyen-Ho, Luis A. Pérez Rey, Bang-Dang Pham, Reinhold Preiner, Tobias Schreck, Quoc-Huy Trinh, Loek Tonnaer, Christoph von Tycowicz, The-Anh Vu-Le
Comput. Graph.25