← Search

YiZhen Wang

7 accepted papers

2026

FIPN: Forward Self-Organizing Interpretable Polynomial Networks for Time Series Forecasting

ICML 2026poster

Most existing time series forecasting models are trained with backpropagation, which often brings high computational cost and limited transparency, so it can be hard to understand why a model makes a given prediction. This paper presents FIPN, a forward self-organizing interpretable polynomial netwo…

Cited by 0SourceScholar
2025

Certainty in Uncertainty: Reasoning over Uncertain Knowledge Graphs with Statistical Guarantees

EMNLP 2025

Uncertain knowledge graph embedding (UnKGE) methods learn vector representations that capture both structural and uncertainty information to predict scores of unseen triples. However, existing methods produce only point estimates, without quantifying predictive uncertainty—limiting their reliability

2025

DualGuard: A Parameter Space Transformation Approach for Bidirectional Defense in Split-Based LLM Fine-Tuning

ACL 2025long

Integrating split learning with large language model fine-tuning (LLM-FT) enables secure collaboration between a trusted local client and a well-equipped remote server, but it is vulnerable to data reconstruction attacks (DRAs) that exploit transmitted activations and gradients. Current defense meth…

Cited by 0SourcePDFScholar
2022

Robust Learning against Relational Adversaries

NeurIPS 2022accept

Test-time adversarial attacks have posed serious challenges to the robustness of machine-learning models, and in many settings the adversarial perturbation need not be bounded by small $\ell_p$-norms. Motivated by attacks in program analysis and security tasks, we investigate $\textit{relational adv…

Cited by 8SourcePDFScholar
2021

Adversarial Example Detection Using Latent Neighborhood Graph

ICCV 2021poster

Detection of adversarial examples with high accuracy is critical for the security of deployed deep neural network-based models. We present the first graph-based adversarial detection method that constructs a Latent Neighborhood Graph (LNG) around an input example to determine if the input example is…

Cited by 74PDFScholar
2020

Robustness for Non-Parametric Classification: A Generic Attack and Defense

AISTATS 2020poster

Adversarially robust machine learning has received much recent attention. However, prior attacks and defenses for non-parametric classifiers have been developed in an ad-hoc or classifier-specific basis. In this work, we take a holistic look at adversarial examples for non-parametric classifiers, in…

2018

Analyzing the Robustness of Nearest Neighbors to Adversarial Examples

ICML 2018oral

Motivated by safety-critical applications, test-time attacks on classifiers via adversarial examples has recently received a great deal of attention. However, there is a general lack of understanding on why adversarial examples arise; whether they originate due to inherent properties of data or due…