Jie Wang

Hongyuan Zha

Oper. Res., 2024

Statistical and Computational Guarantees of Kernel Max-Sliced Wasserstein Distances.

[BibT_eX]

[DOI]

March Boedihardjo

CoRR, 2024

Non-Convex Robust Hypothesis Testing using Sinkhorn Uncertainty Sets.

[BibT_eX]

[DOI]

CoRR, 2024

Distributionally Robust Degree Optimization for BATS Codes.

[BibT_eX]

[DOI]

Hoover H. F. Yin

Sherman S. M. Chow

Proceedings of the IEEE International Symposium on Information Theory, 2024

Throughput and Latency of Network Coding in Line Networks with Outages.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

Contextual Stochastic Bilevel Optimization.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Reliable Adaptive Recoding for Batched Network Coding with Burst-Noise Channels.

[BibT_eX]

[DOI]

Proceedings of the 57th Asilomar Conference on Signals, Systems, and Computers, ACSSC 2023, Pacific Grove, CA, USA, October 29, 2023

2022

A Manifold Two-Sample Test Study: Integral Probability Metric with Neural Networks.

[BibT_eX]

[DOI]

CoRR, 2022

Improving Sepsis Prediction Model Generalization With Optimal Transport.

[BibT_eX]

[DOI]

Ronald Moore

Rishikesan Kamaleswaran

Proceedings of the Machine Learning for Health, 2022

A Data-Driven Approach to Robust Hypothesis Testing Using Sinkhorn Uncertainty Sets.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Two-Sample Test with Kernel Projected Wasserstein Distance.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021

Sinkhorn Distributionally Robust Optimization.

[BibT_eX]

[DOI]

CoRR, 2021

Capacity Scalability of Line Networks with Batched Codes.

[BibT_eX]

[DOI]

CoRR, 2021

Small-Sample Inferred Adaptive Recoding for Batched Network Coding.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Two-sample Test using Projected Wasserstein Distance.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Two-sample Test using Projected Wasserstein Distance: Breaking the Curse of Dimensionality.

[BibT_eX]

[DOI]

CoRR, 2020

Upper Bound Scalability on Achievable Rates of Batched Codes for Line Networks.

[BibT_eX]

[DOI]

Shenghao Yang

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Efficient Underwater Sensor Network Data Collection Employing Unmanned Ships.

[BibT_eX]

[DOI]

Proceedings of the WUWNET'19: International Conference on Underwater Networks & Systems, 2019

On the Capacity Scalability of Line Networks with Buffer Size Constraints.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

On the Tightness of a Cut-Set Bound on Network Function Computation.

[BibT_eX]

[DOI]