Obserwuj
Binghui Peng
Binghui Peng
Columbia University
Zweryfikowany adres z columbia.edu - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Training (overparametrized) neural networks in near-linear time
J Brand, B Peng, Z Song, O Weinstein
arXiv preprint arXiv:2006.11648, 2020
562020
Tight competitive ratios of classic matching algorithms in the fully online model
Z Huang, B Peng, ZG Tang, R Tao, X Wu, Y Zhang
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
562019
Reinforcement mechanism design: With applications to dynamic pricing in sponsored search auctions
W Shen, B Peng, H Liu, M Zhang, R Qian, Y Hong, Z Guo, Z Ding, P Lu, ...
Proceedings of the AAAI Conference on Artificial Intelligence 34 (02), 2236-2243, 2020
522020
Mongoose: A learnable lsh framework for efficient neural network training
B Chen, Z Liu, B Peng, Z Xu, JL Li, T Dao, Z Song, A Shrivastava, C Re
International Conference on Learning Representations, 2021
402021
Learning optimal strategies to commit to
B Peng, W Shen, P Tang, S Zuo
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 2149-2156, 2019
372019
Hedging in games: Faster convergence of external and swap regrets
X Chen, B Peng
Thirty-fourth Advances in Neural Information Processing Systems, 2020
292020
Tight bounds for online edge coloring
IR Cohen, B Peng, D Wajc
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 1-25, 2019
212019
Adaptive influence maximization with myopic feedback
B Peng, W Chen
Advances in Neural Information Processing Systems 32, 2019
212019
Stochastic online metric matching
A Gupta, G Guruganesh, B Peng, D Wajc
46th International Colloquium on Automata, Languages, and Programming (ICALP …, 2019
182019
Adaptive greedy versus non-adaptive greedy for influence maximization
W Chen, B Peng, G Schoenebeck, B Tao
Journal of Artificial Intelligence Research 74, 303-351, 2022
162022
Self-Attention Networks Can Process Bounded Hierarchical Languages
S Yao, B Peng, C Papadimitriou, K Narasimhan
The 59th Annual Meeting of the Association for Computational Linguistics …, 2021
162021
Shuffle private stochastic convex optimization
A Cheu, M Joseph, J Mao, B Peng
arXiv preprint arXiv:2106.09805, 2021
132021
Public Good Games in Directed Networks
C Papadimitriou, B Peng
The Twenty-Second ACM Conference on Economics and Computation (EC 2021), 2021
132021
On adaptivity gaps of influence maximization under the independent cascade model with full adoption feedback
W Chen, B Peng
30th International Symposium on Algorithms and Computation (ISAAC 2019)., 2019
122019
Computational Hardness of the Hylland-Zeckhauser Scheme∗
T Chen, X Chen, B Peng, M Yannakakis
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
102022
Memory bounds for continual learning
X Chen, C Papadimitriou, B Peng
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
92022
On the complexity of dynamic submodular maximization
X Chen, B Peng
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
82022
Dynamic influence maximization
B Peng
Advances in Neural Information Processing Systems 34, 10718-10731, 2021
72021
Robust Load Balancing with Machine Learned Advice.
S Ahmadian, H Esfandiari, VS Mirrokni, B Peng
SODA, 20-34, 2022
62022
Dynamic least-squares regression
S Jiang, B Peng, O Weinstein
arXiv preprint arXiv:2201.00228, 2022
52022
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20