Get our free extension to see links to code for papers anywhere online!

Chrome logo  Add to Chrome

Firefox logo Add to Firefox

Finding Optimal Policy for Queueing Models: New Parameterization



Trang H. Tran , Lam M. Nguyen , Katya Scheinberg


   Access Paper or Ask Questions

On the Convergence to a Global Solution of Shuffling-Type Gradient Algorithms



Lam M. Nguyen , Trang H. Tran

* 19 pages, 1 figure 

   Access Paper or Ask Questions

On the Convergence of Gradient Extrapolation Methods for Unbalanced Optimal Transport



Quang Minh Nguyen , Hoang H. Nguyen , Yi Zhou , Lam M. Nguyen


   Access Paper or Ask Questions

Evaluating Robustness of Cooperative MARL: A Model-based Approach



Nhan H. Pham , Lam M. Nguyen , Jie Chen , Hoang Thanh Lam , Subhro Das , Tsui-Wei Weng


   Access Paper or Ask Questions

Nesterov Accelerated Shuffling Gradient Method for Convex Optimization



Trang H. Tran , Lam M. Nguyen , Katya Scheinberg


   Access Paper or Ask Questions

Finite-Sum Optimization: A New Perspective for Convergence to a Global Solution



Lam M. Nguyen , Trang H. Tran , Marten van Dijk


   Access Paper or Ask Questions

Interpretable Clustering via Multi-Polytope Machines



Connor Lawless , Jayant Kalagnanam , Lam M. Nguyen , Dzung Phan , Chandra Reddy

* Accepted to the 36th AAAI Conference on Artificial Intelligence (AAAI 2022) 

   Access Paper or Ask Questions

On the Equivalence between Neural Network and Support Vector Machine



Yilan Chen , Wei Huang , Lam M. Nguyen , Tsui-Wei Weng

* 35th Conference on Neural Information Processing Systems (NeurIPS 2021) 

   Access Paper or Ask Questions

Ensembling Graph Predictions for AMR Parsing



Hoang Thanh Lam , Gabriele Picco , Yufang Hou , Young-Suk Lee , Lam M. Nguyen , Dzung T. Phan , Vanessa López , Ramon Fernandez Astudillo

* Accepted at NeurIPS 2021 

   Access Paper or Ask Questions

Federated Learning with Randomized Douglas-Rachford Splitting Methods



Nhan H. Pham , Lam M. Nguyen , Dzung T. Phan , Quoc Tran-Dinh


   Access Paper or Ask Questions

1
2
3
4
>>