Nhat Ho

35
Papers
60
Total Citations
1
Affiliations

Affiliations

University of Texas, Austin

Papers (35)

Quasi-Monte Carlo for 3D Sliced Wasserstein

ICLR 2024
24
citations

Integrating Efficient Optimal Transport and Functional Maps For Unsupervised Shape Correspondence Learning

CVPR 2024
10
citations

X-Drive: Cross-modality Consistent Multi-Sensor Data Synthesis for Driving Scenarios

ICLR 2025
8
citations

Diffeomorphic Mesh Deformation via Efficient Optimal Transport for Cortical Surface Reconstruction

ICLR 2024
7
citations

Lightspeed Geometric Dataset Distance via Sliced Optimal Transport

ICML 2025
4
citations

Improving Generalization with Flat Hilbert Bayesian Inference

ICML 2025
3
citations

Attack on Prompt: Backdoor Attack in Prompt-Based Continual Learning

AAAI 2025
2
citations

Towards Marginal Fairness Sliced Wasserstein Barycenter

ICLR 2025
2
citations

Point-Set Distances for Learning Representations of 3D Point Clouds

ICCV 2021arXiv
0
citations

Beyond Losses Reweighting: Empowering Multi-Task Learning via the Generalization Perspective

ICCV 2025
0
citations

Neural Collapse for Cross-entropy Class-Imbalanced Learning with Unconstrained ReLU Features Model

ICML 2024
0
citations

Is Temperature Sample Efficient for Softmax Gaussian Mixture of Experts?

ICML 2024
0
citations

A General Theory for Softmax Gating Multinomial Logistic Mixture of Experts

ICML 2024
0
citations

On Least Square Estimation in Softmax Gating Mixture of Experts

ICML 2024
0
citations

Sliced Wasserstein with Random-Path Projecting Directions

ICML 2024
0
citations

Improving Computational Complexity in Statistical Models with Local Curvature Information

ICML 2024
0
citations

Structure-Aware E(3)-Invariant Molecular Conformer Aggregation Networks

ICML 2024
0
citations

Multilevel Clustering via Wasserstein Means

ICML 2017
0
citations

On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithms

ICML 2019
0
citations

Fixed-Support Wasserstein Barycenters: Computational Hardness and Fast Algorithm

NeurIPS 2020
0
citations

Projection Robust Wasserstein Distance and Riemannian Optimization

NeurIPS 2020
0
citations

Structured Dropout Variational Inference for Bayesian Neural Networks

NeurIPS 2021
0
citations

On Robust Optimal Transport: Computational Complexity and Barycenter Computation

NeurIPS 2021
0
citations

Revisiting Sliced Wasserstein on Images: From Vectorization to Convolution

NeurIPS 2022
0
citations

Stochastic Multiple Target Sampling Gradient Descent

NeurIPS 2022
0
citations

Improving Transformer with an Admixture of Attention Heads

NeurIPS 2022
0
citations

Beyond black box densities: Parameter learning for the deviated components

NeurIPS 2022
0
citations

FourierFormer: Transformer Meets Generalized Fourier Integral Theorem

NeurIPS 2022
0
citations

Amortized Projection Optimization for Sliced Wasserstein Generative Models

NeurIPS 2022
0
citations

Demystifying Softmax Gating Function in Gaussian Mixture of Experts

NeurIPS 2023
0
citations

Energy-Based Sliced Wasserstein Distance

NeurIPS 2023
0
citations

LVM-Med: Learning Large-Scale Self-Supervised Vision Models for Medical Imaging via Second-order Graph Matching

NeurIPS 2023
0
citations

Minimax Optimal Rate for Parameter Estimation in Multivariate Deviated Models

NeurIPS 2023
0
citations

Markovian Sliced Wasserstein Distances: Beyond Independent Projections

NeurIPS 2023
0
citations

Designing Robust Transformers using Robust Kernel Density Estimation

NeurIPS 2023
0
citations