← Search

Siyang Wu

5 accepted papers

2026

Mapping Overlaps in Benchmarks through Perplexity in the Wild

ICLR 2026poster

We construct benchmark signatures that capture the capacity required for strong performance to characterize large language model (LLM) benchmarks and their meaningful overlaps. Formally, we define them as sets of salient tokens drawn from **in-the-wild** corpora whose LLM token perplexity, reflectin…

Cited by 0SourcecodeScholar
2025

Evaluating Robustness of Monocular Depth Estimation with Procedural Scene Perturbations

NeurIPS 2025poster

Recent years have witnessed substantial progress on monocular depth estimation, particularly as measured by the success of large models on standard benchmarks. However, performance on standard benchmarks does not offer a complete assessment, because most evaluate accuracy but not robustness. In thi…

Cited by 0SourcecodeScholar
2025

How do Language Models Generate Slang: A Systematic Comparison between Human and Machine-Generated Slang Usages

EMNLP 2025

Slang is a commonly used type of informal language that poses a daunting challenge to NLP systems. Recent advances in large language models (LLMs), however, have made the problem more approachable. While LLM agents are becoming more widely applied to intermediary tasks such as slang detection and sl

Cited by 0SourcePDFScholar
2024

NAPGuard: Towards Detecting Naturalistic Adversarial Patches

CVPR 2024poster

Recently the emergence of naturalistic adversarial patch (NAP) which possesses a deceptive appearance and various representations underscores the necessity of developing robust detection strategies. However existing approaches fail to differentiate the deep-seated natures in adversarial patches i.e.…

Cited by 8SourcePDFScholar
2023

Automatic Truss Design with Reinforcement Learning

IJCAI 2023poster

Truss layout design, namely finding a lightweight truss layout satisfying all the physical constraints, is a fundamental problem in the building industry. Generating the optimal layout is a challenging combinatorial optimization problem, which can be extremely expensive to solve by exhaustive search…