Prati
Jieming Mao
Jieming Mao
Potvrđena adresa e-pošte na google.com - Početna stranica
Naslov
Citirano
Citirano
Godina
Differentially private fair learning
M Jagielski, M Kearns, J Mao, A Oprea, A Roth, S Sharifi-Malvajerdi, ...
International Conference on Machine Learning, 3000-3008, 2019
1632019
The role of interactivity in local differential privacy
M Joseph, J Mao, S Neel, A Roth
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
832019
Selling to a no-regret buyer
M Braverman, J Mao, J Schneider, M Weinberg
Proceedings of the 2018 ACM Conference on Economics and Computation, 523-538, 2018
642018
Parallel algorithms for select and partition with noisy comparisons
M Braverman, J Mao, SM Weinberg
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
642016
Coding for interactive communication correcting insertions and deletions
M Braverman, R Gelles, J Mao, R Ostrovsky
IEEE Transactions on Information Theory 63 (10), 6256-6270, 2017
542017
A Nearly Instance Optimal Algorithm for Top-k Ranking under the Multinomial Logit Model
X Chen, Y Li, J Mao
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
502018
Contextual pricing for lipschitz buyers
J Mao, R Leme, J Schneider
Advances in Neural Information Processing Systems 31, 2018
472018
Towards efficient auctions in an auto-bidding world
Y Deng, J Mao, V Mirrokni, S Zuo
Proceedings of the Web Conference 2021, 3965-3973, 2021
452021
Connecting robust shuffle privacy and pan-privacy
V Balcer, A Cheu, M Joseph, J Mao
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
422021
Bayesian exploration with heterogeneous agents
N Immorlica, J Mao, A Slivkins, ZS Wu
The world wide web conference, 751-761, 2019
422019
Incentivizing exploration with selective data disclosure
N Immorlica, J Mao, A Slivkins, ZS Wu
arXiv preprint arXiv:1811.06026, 2018
422018
Locally private gaussian estimation
M Joseph, J Kulkarni, J Mao, SZ Wu
Advances in Neural Information Processing Systems 32, 2019
412019
Near-optimal bounds on the bounded-round quantum communication complexity of disjointness
M Braverman, A Garg, YK Ko, J Mao, D Touchette
SIAM Journal on Computing 47 (6), 2277-2314, 2018
402018
Competitive analysis of the top-K ranking problem
X Chen, S Gopi, J Mao, J Schneider
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
402017
Robust auction design in the auto-bidding world
S Balseiro, Y Deng, J Mao, V Mirrokni, S Zuo
Advances in Neural Information Processing Systems 34, 17777-17788, 2021
372021
The landscape of auto-bidding auctions: Value versus utility maximization
SR Balseiro, Y Deng, J Mao, VS Mirrokni, S Zuo
Proceedings of the 22nd ACM Conference on Economics and Computation, 132-133, 2021
362021
Pan-private uniformity testing
K Amin, M Joseph, J Mao
Conference on Learning Theory, 183-218, 2020
342020
Exponential separations in local differential privacy
M Joseph, J Mao, A Roth
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
332020
Tighter relations between sensitivity and other complexity measures
A Ambainis, M Bavarian, Y Gao, J Mao, X Sun, S Zuo
Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014
322014
Multi-armed bandit problems with strategic arms
M Braverman, J Mao, J Schneider, SM Weinberg
Conference on Learning Theory, 383-416, 2019
302019
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20