← Search

Hailiang Zhao

6 accepted papers

2026

Frequency Matching in Spiking Neural Networks for mmWave Sensing

ICML 2026poster

Millimeter-wave (mmWave) sensing enables privacy-preserving, always-on edge perception, but its measurements are often sparse, temporally irregular, and corrupted by high-frequency noise. Existing mmWave pipelines predominantly rely on artificial neural networks (ANNs), which achieve robustness thro…

Cited by 0SourceScholar
2026

SegQuant: A Semantics-Aware and Generalizable Quantization Framework for Diffusion Models

CVPR 2026

Diffusion models have demonstrated exceptional generative capabilities but are computationally intensive, posing significant challenges for deployment in resource-constrained or latency-sensitive environments.Quantization offers an effective means to reduce model size and computational cost, with po

Cited by 0SourcecodeScholar
2026

Towards Optimal Robustness in Learning-Augmented Paging

ICML 2026spotlight

Learning-augmented paging has been extensively studied in recent years. A key advantage over naive ML-based approaches is \emph{bounded robustness}, which guarantees worst-case performance even when predictions are inaccurate, making these algorithms valuable for real-world systems. Prior work achie…

Cited by 0SourceScholar
2025

CADRef: Robust Out-of-Distribution Detection via Class-Aware Decoupled Relative Feature Leveraging

CVPR 2025poster

Deep neural networks (DNNs) have been widely criticized for their overconfidence when dealing with out-of-distribution (OOD) samples, highlighting the critical need for effective OOD detection to ensure the safe deployment of DNNs in real-world settings. Existing post-hoc OOD detection methods prima…

2025

Robustifying Learning-Augmented Caching Efficiently without Compromising 1-Consistency

NeurIPS 2025poster

The online caching problem aims to minimize cache misses when serving a sequence of requests under a limited cache size. While naive learning-augmented caching algorithms achieve ideal $1$-consistency, they lack robustness guarantees. Existing robustification methods either sacrifice $1$-consistency…

Cited by 0SourceScholar