Binghui Peng

According to our database1, Binghui Peng authored at least 36 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On Limitations of the Transformer Architecture.
CoRR, 2024

2023
Public goods games in directed networks.
Games Econ. Behav., May, 2023

Robust Load Balancing with Machine Learned Advice.
J. Mach. Learn. Res., 2023

The sample complexity of multi-distribution learning.
CoRR, 2023

Fast swap regret minimization and applications to approximate correlated equilibria.
CoRR, 2023

The complexity of non-stationary reinforcement learning.
CoRR, 2023

Memory-Query Tradeoffs for Randomized Convex Optimization.
CoRR, 2023

Complexity of Equilibria in First-Price Auctions under General Tie-Breaking Rules.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Fully-dynamic-to-incremental reductions with known deletion order (e.g. sliding window).
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

Online Prediction in Sub-linear Space.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Near Optimal Memory-Regret Tradeoff for Online Learning.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

The Complexity of Dynamic Least-Squares Regression.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Memory-Query Tradeoffs for Randomized Convex Optimization.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Primal-Dual Schemes for Online Matching in Bounded Degree Graphs.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
Adaptive Greedy versus Non-adaptive Greedy for Influence Maximization.
J. Artif. Intell. Res., 2022

Dynamic Least-Squares Regression.
CoRR, 2022

On the complexity of dynamic submodular maximization.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Computational Hardness of the Hylland-Zeckhauser Scheme.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Continual learning: a feature extraction formalization, an efficient algorithm, and fundamental obstructions.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Shuffle Private Stochastic Convex Optimization.
Proceedings of the Tenth International Conference on Learning Representations, 2022

Memory Bounds for Continual Learning.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
Public Good Games in Directed Networks.
CoRR, 2021

Dynamic influence maximization.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Training (Overparametrized) Neural Networks in Near-Linear Time.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Distributed Load Balancing: A New Framework and Improved Guarantees.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

MONGOOSE: A Learnable LSH Framework for Efficient Neural Network Training.
Proceedings of the 9th International Conference on Learning Representations, 2021

Self-Attention Networks Can Process Bounded Hierarchical Languages.
Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, 2021

2020
MixCon: Adjusting the Separability of Data Representations for Harder Data Recovery.
CoRR, 2020

Hedging in games: Faster convergence of external and swap regrets.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Reinforcement Mechanism Design: With Applications to Dynamic Pricing in Sponsored Search Auctions.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Adaptive Influence Maximization with Myopic Feedback.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

On Adaptivity Gaps of Influence Maximization Under the Independent Cascade Model with Full-Adoption Feedback.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Stochastic Online Metric Matching.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Tight Bounds for Online Edge Coloring.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Learning Optimal Strategies to Commit To.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019


  Loading...