default search action
Viet Anh Nguyen
- > Home > Persons > Viet Anh Nguyen
Publications
- 2026
- [c76]Ly Tran Ho Khanh, Dongxuan Zhu, Man-Chung Yue, Viet Anh Nguyen:
Test-time Diverse Reasoning by Riemannian Activation Steering. AAAI 2026: 31429-31437 - [i57]Dongxuan Zhu, Ly Tran Ho Khanh, Andy Yat-Ming Cheung, Man-Chung Yue, Viet Anh Nguyen:
Exploring Diverse Generation Paths via Inference-time Stiefel Activation Steering. CoRR abs/2601.22010 (2026) - 2025
- [j32]Ngoc Bui, Duy Nguyen, Man-Chung Yue
, Viet Anh Nguyen
Coverage-Validity-Aware Algorithmic Recourse. Oper. Res. 73(6): 3294-3310 (2025) - [i45]Ly Tran Ho Khanh, Dongxuan Zhu, Man-Chung Yue, Viet Anh Nguyen:
Test-time Diverse Reasoning by Riemannian Activation Steering. CoRR abs/2511.08305 (2025) - 2024
- [i41]Man-Chung Yue, Yves Rychener, Daniel Kuhn, Viet Anh Nguyen:
A Geometric Unification of Distributionally Robust Covariance Estimators: Shrinking the Spectrum by Inflating the Ambiguity Set. CoRR abs/2405.20124 (2024) - 2023
- [i29]Ngoc Bui, Duy Nguyen, Man-Chung Yue, Viet Anh Nguyen:
Coverage-Validity-Aware Algorithmic Recourse. CoRR abs/2311.11349 (2023) - 2022
- [c53]Hieu Vu, Toan Tran, Man-Chung Yue, Viet Anh Nguyen:
Distributionally Robust Fair Principal Components via Geodesic Descents. ICLR 2022 - [c51]Tuan-Duy H. Nguyen, Ngoc Bui, Duy Nguyen, Man-Chung Yue, Viet Anh Nguyen:
Robust Bayesian recourse. UAI 2022: 1498-1508 - [i26]Hieu Vu, Toan Tran, Man-Chung Yue, Viet Anh Nguyen:
Distributionally Robust Fair Principal Components via Geodesic Descents. CoRR abs/2202.03071 (2022) - [i24]Tuan-Duy H. Nguyen, Ngoc Bui, Duy Nguyen, Man-Chung Yue, Viet Anh Nguyen:
Robust Bayesian Recourse. CoRR abs/2206.10833 (2022) - 2021
- [c46]Bahar Taskesen, Man-Chung Yue, Jose H. Blanchet, Daniel Kuhn, Viet Anh Nguyen:
Sequential Domain Adaptation by Synthesizing Distributionally Robust Experts. ICML 2021: 10162-10172 - [i18]Bahar Taskesen, Man-Chung Yue, Jose H. Blanchet, Daniel Kuhn, Viet Anh Nguyen:
Sequential Domain Adaptation by Synthesizing Distributionally Robust Experts. CoRR abs/2106.00322 (2021) - 2019
- [c35]Viet Anh Nguyen, Soroosh Shafieezadeh-Abadeh, Man-Chung Yue, Daniel Kuhn, Wolfram Wiesemann:
Calculating Optimistic Likelihoods Using (Geodesically) Convex Optimization. NeurIPS 2019: 13920-13931 - [c34]Viet Anh Nguyen, Soroosh Shafieezadeh-Abadeh, Man-Chung Yue, Daniel Kuhn, Wolfram Wiesemann:
Optimistic Distributionally Robust Optimization for Nonparametric Likelihood Approximation. NeurIPS 2019: 15846-15856 - [i7]Viet Anh Nguyen, Soroosh Shafieezadeh-Abadeh, Man-Chung Yue, Daniel Kuhn, Wolfram Wiesemann:
Calculating Optimistic Likelihoods Using (Geodesically) Convex Optimization. CoRR abs/1910.07817 (2019) - [i6]Viet Anh Nguyen, Soroosh Shafieezadeh-Abadeh, Man-Chung Yue, Daniel Kuhn, Wolfram Wiesemann:
Optimistic Distributionally Robust Optimization for Nonparametric Likelihood Approximation. CoRR abs/1910.10583 (2019)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-05-21 01:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: