受强制性开放获取政策约束的文章 - Tung Mai了解详情
可在其他位置公开访问的文章：13 篇
Graph neural networks with heterophily
J Zhu, RA Rossi, A Rao, T Mai, N Lipka, NK Ahmed, D Koutra
Proceedings of the AAAI conference on artificial intelligence 35 (12), 11168 …, 2021
强制性开放获取政策： US National Science Foundation
Convex program duality, Fisher markets, and Nash social welfare
R Cole, NR Devanur, V Gkatzelis, K Jain, T Mai, VV Vazirani, ...
Proceedings of the 2017 ACM Conference on Economics and Computation, 459-460, 2016
强制性开放获取政策： US National Science Foundation
Machine unlearning via algorithmic stability
E Ullah, T Mai, A Rao, RA Rossi, R Arora
Conference on Learning Theory, 4126-4142, 2021
强制性开放获取政策： US National Science Foundation
Nash social welfare for indivisible items under separable, piecewise-linear concave utilities
N Anari, T Mai, SO Gharan, VV Vazirani
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
强制性开放获取政策： US National Science Foundation
Coresets for classification–simplified and strengthened
T Mai, C Musco, A Rao
Advances in Neural Information Processing Systems 34, 11643-11654, 2021
强制性开放获取政策： US National Science Foundation
Fundamental tradeoffs in distributionally adversarial training
M Mehrabi, A Javanmard, RA Rossi, A Rao, T Mai
International Conference on Machine Learning, 7544-7554, 2021
强制性开放获取政策： US National Science Foundation
Cycles in zero-sum differential games and biological diversity
T Mai, M Mihail, I Panageas, W Ratcliff, V Vazirani, P Yunker
Proceedings of the 2018 ACM Conference on Economics and Computation, 339-350, 2018
强制性开放获取政策： US National Science Foundation
Sample constrained treatment effect estimation
R Addanki, D Arbour, T Mai, C Musco, A Rao
Advances in Neural Information Processing Systems 35, 5417-5430, 2022
强制性开放获取政策： US National Science Foundation
Interactive audience expansion on large scale online visitor data
GYY Chan, T Mai, AB Rao, RA Rossi, F Du, CT Silva, J Freire
Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data …, 2021
强制性开放获取政策： US National Science Foundation
Optimal sketching bounds for sparse linear regression
T Mai, A Munteanu, C Musco, A Rao, C Schwiegelshohn, D Woodruff
International Conference on Artificial Intelligence and Statistics, 11288-11316, 2023
强制性开放获取政策： US National Science Foundation, US Department of Defense, German Research …
Asymptotics of ridge regression in convolutional models
M Sahraee-Ardakan, T Mai, A Rao, RA Rossi, S Rangan, AK Fletcher
International Conference on Machine Learning, 9265-9275, 2021
强制性开放获取政策： US National Science Foundation, US Department of Defense
One-pass algorithms for map inference of nonsymmetric determinantal point processes
A Reddy, RA Rossi, Z Song, A Rao, T Mai, N Lipka, G Wu, E Koh, ...
International Conference on Machine Learning, 18463-18482, 2022
强制性开放获取政策： US National Science Foundation
A Structural and Algorithmic Study of Stable Matching Lattices of Multiple Instances
RR Gangam, T Mai, N Raju, VV Vazirani
arXiv preprint 2304, 2023
强制性开放获取政策： US National Science Foundation
出版信息和资助信息由计算机程序自动确定