Demo Data from SIGIR 2026 / reviewers in the wild / expert
Chau Tran
dblp:239/5173
· DBLP profile ↗
8ranked-venue papers
6as first author
6since 2021 · last 2024
0000-0002-2992-3728ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 3 first-author · 4 since 2021Human-computer interaction and ubiquitous computing · 2 · 2 first-author · 2 since 2021Security and privacy · 1 · 1 first-author
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
5 papers |
Efficient and distributed learning · 24% Machine translation · 24% Probabilistic and Bayesian machine learning · 21% | |
| Network and information security
1 paper |
Network security · 100% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 20 heaviest of 22, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Deep learning architectures and training › transformer
efficient transformer |
0.8 | 1 | 2024 | Accelerating Transformers with Spectrum-Preserving Token Merging · NeurIPS 2024 |
Machine learning › Efficient and distributed learning
model compression |
0.8 | 1 | 2024 | Accelerating Transformers with Spectrum-Preserving Token Merging · NeurIPS 2024 |
Machine learning › Efficient and distributed learning › model compression › token compression
token merging |
0.8 | 1 | 2024 | Accelerating Transformers with Spectrum-Preserving Token Merging · NeurIPS 2024 |
Machine learning › Transfer learning and domain adaptation
cross-lingual transfer |
0.6 | 1 | 2022 | Alternative Input Signals Ease Transfer in Multilingual Machine Translation · ACL (1) 2022 |
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
gaussian graphical model |
0.6 | 1 | 2022 | A Completely Tuning-Free and Robust Approach to Sparse Precision Matrix Estimation · ICML 2022 |
Machine learning › Probabilistic and Bayesian machine learning › structured models
graphical models |
0.6 | 1 | 2022 | A Completely Tuning-Free and Robust Approach to Sparse Precision Matrix Estimation · ICML 2022 |
Natural language and speech › Machine translation › neural machine translation
multilingual neural machine translation |
0.6 | 1 | 2022 | Alternative Input Signals Ease Transfer in Multilingual Machine Translation · ACL (1) 2022 |
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models › gaussian graphical model
sparse precision matrix estimation |
0.6 | 1 | 2022 | A Completely Tuning-Free and Robust Approach to Sparse Precision Matrix Estimation · ICML 2022 |
Mathematical optimization › continuous optimization
convex optimization |
0.6 | 1 | 2022 | A Completely Tuning-Free and Robust Approach to Sparse Precision Matrix Estimation · ICML 2022 |
Mathematical optimization
linear programming |
0.6 | 1 | 2022 | A Completely Tuning-Free and Robust Approach to Sparse Precision Matrix Estimation · ICML 2022 |
Natural language and speech › Machine translation › speech translation
multilingual speech translation |
0.5 | 1 | 2021 | Multilingual Speech Translation from Efficient Finetuning of Pretrained Models · ACL/IJCNLP (1) 2021 |
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning |
0.5 | 1 | 2021 | Multilingual Speech Translation from Efficient Finetuning of Pretrained Models · ACL/IJCNLP (1) 2021 |
Machine learning › Transfer learning and domain adaptation › fine-tuning
pre-trained model fine-tuning |
0.5 | 1 | 2021 | Multilingual Speech Translation from Efficient Finetuning of Pretrained Models · ACL/IJCNLP (1) 2021 |
Natural language and speech › Machine translation
speech translation |
0.5 | 1 | 2021 | Multilingual Speech Translation from Efficient Finetuning of Pretrained Models · ACL/IJCNLP (1) 2021 |
Natural language and speech › Machine translation
unsupervised machine translation |
0.4 | 1 | 2020 | Cross-lingual Retrieval for Iterative Self-Supervised Training · NeurIPS 2020 |
Network security
anonymity networks |
0.4 | 1 | 2020 | Are anonymity-seekers just like everybody else? An analysis of contributions to Wikipedia from Tor · SP 2020 |
Network security › anonymity networks
tor |
0.4 | 1 | 2020 | Are anonymity-seekers just like everybody else? An analysis of contributions to Wikipedia from Tor · SP 2020 |
Computer vision › Vision and language
vision-language model |
0.2 | 1 | 2024 | Accelerating Transformers with Spectrum-Preserving Token Merging · NeurIPS 2024 |
Machine learning › Representation and self-supervised learning › representation matching › feature alignment › embedding alignment
cross-lingual alignment |
0.1 | 1 | 2020 | Cross-lingual Retrieval for Iterative Self-Supervised Training · NeurIPS 2020 |
Computational social science and digital humanities › social computing
online community analysis |
0.1 | 1 | 2020 | Are anonymity-seekers just like everybody else? An analysis of contributions to Wikipedia from Tor · SP 2020 |
Methods — techniques the papers use, named apart from their topics
non-convex penalty · 1.1minimax optimal estimation · 1.1data analysis · 0.9contribution comparison · 0.9spectral preservation · 0.8energy score · 0.8bipartite soft matching · 0.8input signal augmentation · 0.6pre-trained model · 0.5fine-tuning · 0.5iterative self-supervised training · 0.4cross-lingual retrieval · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Accelerating Transformers with Spectrum-Preserving Token MergingabstractIncreasing the throughput of the Transformer architecture, a foundational component used in numerous state-of-the-art models for vision and language tasks (e.g., GPT, LLaVa), is an important problem in machine learning. One recent and effective strategy is to merge token representations within Transformer models, aiming to reduce computational and memory requirements while maintaining accuracy. Prior work has proposed algorithms based on Bipartite Soft Matching (BSM), which divides tokens into distinct sets and merges the top $k$ similar tokens. However, these methods have significant drawbacks, such as sensitivity to token-splitting strategies and damage to informative tokens in later layers. This paper presents a novel paradigm called PiToMe, which prioritizes the preservation of informative tokens using an additional metric termed the \textit{energy score}. This score identifies large clusters of similar tokens as high-energy, indicating potential candidates for merging, while smaller (unique and isolated) clusters are considered as low-energy and preserved. Experimental findings demonstrate that PiToMe saved from 40-60\% FLOPs of the base models while exhibiting superior off-the-shelf performance on image classification (0.5\% average performance drop of ViT-MAEH compared to 2.6\% as baselines), image-text retrieval (0.3\% average performance drop of Clip on Flick30k compared to 4.5\% as others), and analogously in visual questions answering with LLaVa-7B. Furthermore, PiToMe is theoretically shown to preserve intrinsic spectral properties to the original token space under mild conditions. Chau Tran, Duy M. H. Nguyen, Duy Nguyen 0003, TrungTin Nguyen, T. Hoang Ngan Le, Pengtao Xie, Daniel Sonntag, James Zou 0001, Mathias Niepert |
NeurIPS | 1 |
| 2024 | Challenges in Restructuring Community-based ModerationabstractContent moderation practices and technologies need to change over time as requirements and community expectations shift. However, attempts to restructure the existing moderation practices can be difficult, especially for platforms that rely on their communities to moderate, because changes can transform the workflow and workload participants' reward systems. By examining the extensive archival discussions around a prepublication moderation technology on Wikipedia named Flagged Revisions, complemented by seven semi-structured interviews, we identify various challenges in restructuring community-based moderation practices. Thus, we find that while a new system might sound good in theory and perform well in terms of quantitative metrics, it may conflict with existing social norms. Furthermore, our findings underscore how the relationship between platforms and self-governed communities can hinder the ability to assess the performance of any new system and introduce considerable costs related to maintaining, overhauling, or scrapping any piece of infrastructure. Chau Tran, Kejsi Take, Kaylea Champion, Benjamin Mako Hill, Rachel Greenstadt |
Proc. ACM Hum. Comput. Interact. | 1 |
| 2022 | Alternative Input Signals Ease Transfer in Multilingual Machine TranslationabstractSimeng Sun, Angela Fan, James Cross, Vishrav Chaudhary, Chau Tran, Philipp Koehn, Francisco Guzmán. Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2022. Simeng Sun, Angela Fan, James Cross 0003, Vishrav Chaudhary, Chau Tran, Philipp Koehn, Francisco Guzmán |
ACL (1) | 5 |
| 2022 | A Completely Tuning-Free and Robust Approach to Sparse Precision Matrix EstimationabstractDespite the vast literature on sparse Gaussian graphical models, current methods either are asymptotically tuning-free (which still require fine-tuning in practice) or hinge on computationally expensive methods (e.g., cross-validation) to determine the proper level of regularization. We propose a completely tuning-free approach for estimating sparse Gaussian graphical models. Our method uses model-agnostic regularization parameters to estimate each column of the target precision matrix and enjoys several desirable properties. Computationally, our estimator can be computed efficiently by linear programming. Theoretically, the proposed estimator achieves minimax optimal convergence rates under various norms. We further propose a second-stage enhancement with non-convex penalties which possesses the strong oracle property. Through comprehensive numerical studies, our methods demonstrate favorable statistical performance. Remarkably, our methods exhibit strong robustness to the violation of the Gaussian assumption and significantly outperform competing methods in the heavy-tailed settings. Chau Tran |
ICML | 1 |
| 2022 | The Risks, Benefits, and Consequences of Prepublication Moderation: Evidence from 17 Wikipedia Language EditionsabstractMany online communities rely on postpublication moderation where contributors-even those that are perceived as being risky-are allowed to publish material immediately and where moderation takes place after the fact. An alternative arrangement involves moderating content before publication. A range of communities have argued against prepublication moderation by suggesting that it makes contributing less enjoyable for new members and that it will distract established community members with extra moderation work. We present an empirical analysis of the effects of a prepublication moderation system called FlaggedRevs that was deployed by several Wikipedia language editions. We used panel data from 17 large Wikipedia editions to test a series of hypotheses related to the effect of the system on activity levels and contribution quality. We found that the system was very effective at keeping low-quality contributions from ever becoming visible. Although there is some evidence that the system discouraged participation among users without accounts, our analysis suggests that the system's effects on contribution volume and quality were moderate at most. Our findings imply that concerns regarding the major negative effects of prepublication moderation systems on contribution quality and project productivity may be overstated. Chau Tran, Kaylea Champion, Benjamin Mako Hill, Rachel Greenstadt |
Proc. ACM Hum. Comput. Interact. | 1 |
| 2021 | Multilingual Speech Translation from Efficient Finetuning of Pretrained ModelsabstractXian Li, Changhan Wang, Yun Tang, Chau Tran, Yuqing Tang, Juan Pino, Alexei Baevski, Alexis Conneau, Michael Auli. Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers). 2021. Xian Li 0003, Changhan Wang, Yun Tang 0002, Chau Tran, Juan Pino 0001, Alexei Baevski, Alexis Conneau, Michael Auli |
ACL/IJCNLP (1) | 4 |
| 2020 | Cross-lingual Retrieval for Iterative Self-Supervised TrainingabstractRecent studies have demonstrated the cross-lingual alignment ability of multilingual pretrained language models. In this work, we found that the cross-lingual alignment can be further improved by training seq2seq models on sentence pairs mined using their own encoder outputs. We utilized these findings to develop a new approach --- cross-lingual retrieval for iterative self-supervised training (CRISS), where mining and training processes are applied iteratively, improving cross-lingual alignment and translation ability at the same time. Using this method, we achieved state-of-the-art unsupervised machine translation results on 9 language directions with an average improvement of 2.4 BLEU, and on the Tatoeba sentence retrieval task in the XTREME benchmark on 16 languages with an average improvement of 21.5% in absolute accuracy. Furthermore, CRISS also brings an additional 1.8 BLEU improvement on average compared to mBART, when finetuned on supervised machine translation downstream tasks. Chau Tran, Xian Li 0003, Jiatao Gu |
NeurIPS | 1 |
| 2020 | Are anonymity-seekers just like everybody else? An analysis of contributions to Wikipedia from TorabstractUser-generated content sites routinely block contributions from users of privacy-enhancing proxies like Tor because of a perception that proxies are a source of vandalism, spam, and abuse. Although these blocks might be effective, collateral damage in the form of unrealized valuable contributions from anonymity seekers is invisible. One of the largest and most important user-generated content sites, Wikipedia, has attempted to block contributions from Tor users since as early as 2005. We demonstrate that these blocks have been imperfect and that thousands of attempts to edit on Wikipedia through Tor have been successful. We draw upon several data sources and analytical techniques to measure and describe the history of Tor editing on Wikipedia over time and to compare contributions from Tor users to those from other groups of Wikipedia users. Our analysis suggests that although Tor users who slip through Wikipedia's ban contribute content that is more likely to be reverted and to revert others, their contributions are otherwise similar in quality to those from other unregistered participants and to the initial contributions of registered users. Chau Tran, Kaylea Champion, Andrea Forte, Benjamin Mako Hill, Rachel Greenstadt |
SP | 1 |