Tom Tseng

Orcid: 0000-0002-6422-288X

According to our database1, Tom Tseng authored at least 9 papers between 2019 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Exploring Scaling Trends in LLM Robustness.
CoRR, 2024

Can Go AIs be adversarially robust?
CoRR, 2024

2023
Inverse Scaling: When Bigger Isn't Better.
Trans. Mach. Learn. Res., 2023

Adversarial Policies Beat Superhuman Go AIs.
Proceedings of the International Conference on Machine Learning, 2023

2022
Adversarial Policies Beat Professional-Level Go AIs.
CoRR, 2022

Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering.
Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

2021
Parallel Index-Based Structural Graph Clustering and Its Approximation.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

2020
The Graph Based Benchmark Suite (GBBS).
Proceedings of the GRADES-NDA'20: Proceedings of the 3rd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA), 2020

2019
Batch-Parallel Euler Tour Trees.
Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, 2019


  Loading...