default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThuan Nguyen 0001
Person information
- affiliation: East Tennessee State University, Department of Engineering, Engineering Technology, and Surveying, TN, USA
- affiliation: Tufts University, Boston, MA, USA
- affiliation (PhD 2021): Oregon State University, School of Electrical Engineering and Computer Science, OR, USA
Other persons with the same name
- Thuan Nguyen — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[j10]Thuan Nguyen
, Hoang Le, Thinh Nguyen:
Bounded guaranteed algorithms for concave impurity minimization via maximum likelihood. Signal Process. 238: 110151 (2026)- 2025
- [j9]Ruijie Jiang, Thuan Nguyen, Shuchin Aeron, Prakash Ishwar:
Hard-Negative Sampling for Contrastive Learning: Optimal Representation Geometry and Neural- vs Dimensional-Collapse. Trans. Mach. Learn. Res. 2025 (2025) - [i17]Nam Nguyen, Thuan Nguyen, Thinh Nguyen, Bella Bose:
Universal Rate-Distortion-Classification Representations for Lossy Compression. CoRR abs/2504.09025 (2025) - 2024
- [j8]Matthias Scheutz, Shuchin Aeron, Ayca Aygun, J. P. de Ruiter, Sergio Fantini, Cristianne Fernandez, Zachary Haga, Thuan Nguyen, Boyang Lyu:
Estimating Systemic Cognitive States from a Mixture of Physiological and Brain Signals. Top. Cogn. Sci. 16(3): 485-526 (2024) - [c24]Thuan Nguyen, D. Richard Brown:
On Contrastive Learning for Domain Generalization. ICMLA 2024: 288-295 - [c23]Ruijie Jiang, Thuan Nguyen, Prakash Ishwar, Shuchin Aeron:
Supervised Contrastive Learning with Hard Negative Samples. IJCNN 2024: 1-8 - [c22]Thuan Nguyen, Ruijie Jiang, Shuchin Aeron, Prakash Ishwar, D. Richard Brown:
On Neural Collapse in Contrastive Learning with Imbalanced Datasets. MLSP 2024: 1-6 - [c21]Nam Nguyen, An Vuong, Thuan Nguyen, Thinh Nguyen:
On Minimizing Symbol Error Probability for Antipodal Beamforming in MIMO Gaussian Wiretap Channels. VTC Fall 2024: 1-5 - 2023
- [j7]Boyang Lyu, Thuan Nguyen, Prakash Ishwar, Matthias Scheutz, Shuchin Aeron:
Barycentric-Alignment and Reconstruction Loss Minimization for Domain Generalization. IEEE Access 11: 49226-49240 (2023) - [c20]Boyang Lyu, Thuan Nguyen, Matthias Scheutz, Prakash Ishwar, Shuchin Aeron:
A Principled Approach to Model Validation in Domain Generalization. ICASSP 2023: 1-5 - [c19]Thuan Nguyen, Matthias Scheutz, Shuchin Aeron:
On The Failure of Invariant Risk Minimization and an Effective fix via Classification Error Control. MLSP 2023: 1-6 - [c18]An Vuong, Thuan Nguyen, Thinh Nguyen:
Capacity achieving quantizer design for multiple-input multiple-output thresholding channels. VTC2023-Spring 2023: 1-6 - [i16]Boyang Lyu, Thuan Nguyen, Matthias Scheutz, Prakash Ishwar, Shuchin Aeron:
A principled approach to model validation in domain generalization. CoRR abs/2304.00629 (2023) - [i15]Ruijie Jiang, Thuan Nguyen, Shuchin Aeron, Prakash Ishwar:
On neural and dimensional collapse in supervised and unsupervised contrastive learning with hard negative sampling. CoRR abs/2311.05139 (2023) - 2022
- [j6]Ayca Aygun, Thuan Nguyen, Zachary Haga, Shuchin Aeron, Matthias Scheutz:
Investigating Methods for Cognitive Workload Estimation for Assistive Robots. Sensors 22(18): 6834 (2022) - [c17]Ayca Aygun, Boyang Lyu, Thuan Nguyen, Zachary Haga, Shuchin Aeron, Matthias Scheutz:
Cognitive Workload Assessment via Eye Gaze and EEG in an Interactive Multi-Modal Driving Task. ICMI 2022: 337-348 - [c16]Thuan Nguyen, Boyang Lyu, Prakash Ishwar, Matthias Scheutz, Shuchin Aeron:
Trade-off between reconstruction loss and feature alignment for domain generalization. ICMLA 2022: 794-801 - [c15]Thuan Nguyen, Boyang Lyu, Prakash Ishwar, Matthias Scheutz, Shuchin Aeron:
Conditional entropy minimization principle for learning domain invariant representation features. ICPR 2022: 3000-3006 - [c14]Thuan Nguyen, Boyang Lyu, Prakash Ishwar, Matthias Scheutz, Shuchin Aeron:
Joint Covariate-Alignment and Concept-Alignment: A Framework for Domain Generalization. MLSP 2022: 1-6 - [i14]Thuan Nguyen, Boyang Lyu, Prakash Ishwar, Matthias Scheutz, Shuchin Aeron:
Conditional entropy minimization principle for learning domain invariant representation features. CoRR abs/2201.10460 (2022) - [i13]Thuan Nguyen, Boyang Lyu, Prakash Ishwar, Matthias Scheutz, Shuchin Aeron:
Joint covariate-alignment and concept-alignment: a framework for domain generalization. CoRR abs/2208.00898 (2022) - [i12]Ruijie Jiang, Thuan Nguyen, Prakash Ishwar, Shuchin Aeron:
Supervised Contrastive Learning with Hard Negative Samples. CoRR abs/2209.00078 (2022) - [i11]Thuan Nguyen, Boyang Lyu, Prakash Ishwar, Matthias Scheutz, Shuchin Aeron:
Trade-off between reconstruction loss and feature alignment for domain generalization. CoRR abs/2210.15000 (2022) - [i10]Thuan Nguyen, Hoang Le, Thinh Nguyen:
Bounded Guaranteed Algorithms for Concave Impurity Minimization Via Maximum Likelihood. CoRR abs/2211.04430 (2022) - 2021
- [j5]Thuan Nguyen, Thinh Nguyen:
Capacity Achieving Quantizer Design for Binary Channels. IEEE Commun. Lett. 25(3): 759-763 (2021) - [j4]Thuan Nguyen, Duong Nguyen-Huu, Thinh Nguyen:
Achievable zero-error rate regions using novel location assisted coding (LAC) for short range FSO communications. J. Commun. Networks 23(4): 237-249 (2021) - [j3]Thuan Nguyen, Thinh Nguyen:
Optimal Quantizer Structure for Maximizing Mutual Information Under Constraints. IEEE Trans. Commun. 69(11): 7406-7413 (2021) - [c13]Thuan Nguyen, Thinh Nguyen:
Minimizing Weighted Concave Impurity Partition Under Constraints. ICASSP 2021: 3630-3634 - [c12]Thuan Nguyen, Hoang Le, Thinh Nguyen:
Constant Approximation Algorithm for Minimizing Concave Impurity. ICASSP 2021: 3635-3639 - [c11]Thuan Nguyen, Thinh Nguyen:
Optimal Thresholding Quantizer Maximizing Mutual Information of Discrete Multiple-Input Continuous One-Bit Output Quantization. ISIT 2021: 646-651 - [i9]Boyang Lyu, Thuan Nguyen, Prakash Ishwar, Matthias Scheutz, Shuchin Aeron:
Barycenteric distribution alignment and manifold-restricted invertibility for domain generalization. CoRR abs/2109.01902 (2021) - 2020
- [j2]Thuan Nguyen, Thinh Nguyen:
On Binary Quantizer For Maximizing Mutual Information. IEEE Trans. Commun. 68(9): 5435-5445 (2020) - [j1]Thuan Nguyen, Thinh Nguyen:
On Bounds and Closed-Form Expressions for Capacities of Discrete Memoryless Channels With Invertible Positive Matrices. IEEE Trans. Veh. Technol. 69(9): 9910-9920 (2020) - [c10]Thuan Nguyen, Thinh Nguyen:
Communication-Channel Optimized Impurity Partition. GLOBECOM 2020: 1-5 - [c9]Thuan Nguyen, Thinh Nguyen:
A Linear Time Partitioning Algorithm for Frequency Weighted Impurity Functions. ICASSP 2020: 5375-5379 - [c8]Thuan Nguyen, Yu-Jung Chu, Thinh Nguyen:
A New Fast Algorithm for Finding Capacity of Discrete Memoryless Thresholding Channels. ICNC 2020: 56-60 - [c7]Thuan Nguyen, Thinh Nguyen:
Structure of Optimal Quantizer for Binary-Input Continuous-Output Channels with Output Constraints. ISIT 2020: 1450-1455 - [c6]Thuan Nguyen, Thinh Nguyen:
Thresholding Quantizer Design for Mutual Information Maximization Under Output Constraint. VTC Spring 2020: 1-5 - [c5]Thuan Nguyen, Thinh Nguyen:
On Thresholding Quantizer Design for Mutual Information Maximization: Optimal Structures and Algorithms. VTC Spring 2020: 1-5 - [i8]Thuan Nguyen, Thinh Nguyen:
Communication-Channel Optimized Partition. CoRR abs/2001.01708 (2020) - [i7]Thuan Nguyen, Thinh Nguyen:
Entropy-Constrained Maximizing Mutual Information Quantization. CoRR abs/2001.01830 (2020) - [i6]Thuan Nguyen, Thinh Nguyen:
On the Uniqueness of Binary Quantizers for Maximizing Mutual Information. CoRR abs/2001.01836 (2020) - [i5]Thuan Nguyen, Thinh Nguyen:
Single-bit Quantization Capacity of Binary-input Continuous-output Channels. CoRR abs/2001.01842 (2020) - [i4]Thuan Nguyen, Thinh Nguyen:
On Bounds and Closed Form Expressions for Capacities of Discrete Memoryless Channels with Invertible Positive Matrices. CoRR abs/2001.01847 (2020) - [i3]Thuan Nguyen, Thinh Nguyen:
Optimal quantizer structure for binary discrete input continuous output channels under an arbitrary quantized-output constraint. CoRR abs/2001.02999 (2020)
2010 – 2019
- 2019
- [i2]Thuan Nguyen, Thinh Nguyen:
Minimizing Impurity Partition Under Constraints. CoRR abs/1912.13141 (2019) - 2018
- [c4]Thuan Nguyen, Yu-Jung Chu, Thinh Nguyen:
On the Capacities of Discrete Memoryless Thresholding Channels. VTC Spring 2018: 1-5 - [c3]Thuan Nguyen, Thinh Nguyen:
On Closed Form Capacities of Discrete Memoryless Channels. VTC Spring 2018: 1-5 - 2017
- [c2]Thuan Nguyen, Thinh Nguyen:
Embedded Coding Techniques for FSO Communication. VTC Fall 2017: 1-5 - [c1]Thuan Nguyen, Duong Nguyen-Huu, Thinh Nguyen:
On Achievable Rate Region Using Location Assisted Coding (LAC) for FSO Communication. VTC Fall 2017: 1-5 - [i1]Thuan Nguyen, Thinh Nguyen:
Achievable Rate Regions Using Novel Location Assisted Coding (LAC). CoRR abs/1702.01198 (2017)
Coauthor Index
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 2025-09-09 03:10 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:
