← Search

Ziyang Wu

14 accepted papers

2025

Efficient Fine-tuning Strategies for Enhancing Face Recognition Performance in Challenging Scenarios

ICASSP 2025accepted

Face recognition plays a crucial role in human life, prompting numerous excellent research efforts. However, face recognition in real-world applications presents various scenarios such as occluded, overexposed and near-infrared face recognition. Due to domain discrepancy and a lack of large-scale tr…

Cited by 0SourceScholar
2025

Simplifying DINO via Coding Rate Regularization

ICML 2025poster

DINO and DINOv2 are two model families being widely used to learn representations from unlabeled imagery data at large scales. Their learned representations often enable state-of-the-art performance for downstream tasks, such as image classification and segmentation. However, they employ many empiri…

2025

Token Statistics Transformer: Linear-Time Attention via Variational Rate Reduction

ICLR 2025spotlight

The attention operator is arguably the key distinguishing factor of transformer architectures, which have demonstrated state-of-the-art performance on a variety of tasks. However, transformer attention operators often impose a significant computational burden, with the computational complexity scali…

2024

LLoCO: Learning Long Contexts Offline

EMNLP 2024main

Processing long contexts remains a challenge for large language models (LLMs) due to the quadratic computational and memory overhead of the self-attention mechanism and the substantial KV cache sizes during generation. We propose LLoCO, a novel approach to address this problem by learning contexts o…

2024

Masked Completion via Structured Diffusion with White-Box Transformers

ICLR 2024poster

Modern learning frameworks often train deep neural networks with massive amounts of unlabeled data to learn representations by solving simple pretext tasks, then use the representations as foundations for downstream tasks. These networks are empirically designed; as such, they are usually not interp…

2023

Incremental Learning of Structured Memory via Closed-Loop Transcription

ICLR 2023poster

This work proposes a minimal computational model for learning structured memories of multiple object classes in an incremental setting. Our approach is based on establishing a {\em closed-loop transcription} between the classes and a corresponding set of subspaces, known as a linear discriminative…

2023

White-Box Transformers via Sparse Rate Reduction

NeurIPS 2023poster

In this paper, we contend that the objective of representation learning is to compress and transform the distribution of the data, say sets of tokens, towards a mixture of low-dimensional Gaussian distributions supported on incoherent subspaces. The quality of the final representation can be measur…

2022

Efficient Maximal Coding Rate Reduction by Variational Forms

CVPR 2022poster

The principle of Maximal Coding Rate Reduction (MCR2) has recently been proposed as a training objective for learning discriminative low-dimensional structures intrinsic to high-dimensional data to allow for more robust training than standard approaches, such as cross-entropy minimization. However,…

Cited by 11PDFScholar
2022

How Low Can We Go: Trading Memory for Error in Low-Precision Training

ICLR 2022poster

Low-precision arithmetic trains deep learning models using less energy, less memory and less time. However, we pay a price for the savings: lower precision may yield larger round-off error and hence larger prediction error. As applications proliferate, users must choose which precision to use to tra…

2021

TenIPS: Inverse Propensity Sampling for Tensor Completion

AISTATS 2021poster

Tensors are widely used to represent multiway arrays of data. The recovery of missing entries in a tensor has been extensively studied, generally under the assumption that entries are missing completely at random (MCAR). However, in most practical settings, observations are missing not at random (MN…