← Search

Zhiquan Tan

10 accepted papers

2026

Cost-Aware Dynamic Tree Construction for Efficient Large Language Model Inference

ICLR 2026poster

Large Language Models (LLMs) face significant inference latency challenges stemming from their autoregressive design and large size. To address this, speculative decoding emerges as a solution, enabling the simultaneous generation and validation of multiple tokens. While recent approaches like EAGLE…

Cited by 0SourcecodeScholar
2025

Generalized Category Discovery via Reciprocal Learning and Class-Wise Distribution Regularization

ICML 2025poster

Generalized Category Discovery (GCD) aims to identify unlabeled samples by leveraging the base knowledge from labeled ones, where the unlabeled set consists of both base and novel classes. Since clustering methods are time-consuming at inference, parametric-based approaches have become more popular…

2024

Contrastive Learning is Spectral Clustering on Similarity Graph

ICLR 2024poster

Contrastive learning is a powerful self-supervised learning method, but we have a limited theoretical understanding of how it works and why it works. In this paper, we prove that contrastive learning with the standard InfoNCE loss is equivalent to spectral clustering on the similarity graph. Using t…

2024

Diff-eRank: A Novel Rank-Based Metric for Evaluating Large Language Models

NeurIPS 2024poster

Large Language Models (LLMs) have transformed natural language processing and extended their powerful capabilities to multi-modal domains. As LLMs continue to advance, it is crucial to develop diverse and appropriate metrics for their evaluation. In this paper, we introduce a novel rank-based metric…

2024

Information Flow in Self-Supervised Learning

ICML 2024poster

In this paper, we conduct a comprehensive analysis of two dual-branch (Siamese architecture) self-supervised learning approaches, namely Barlow Twins and spectral contrastive learning, through the lens of matrix mutual information. We prove that the loss functions of these methods implicitly optimiz…

2024

Matrix Information Theory for Self-Supervised Learning

ICML 2024poster

The maximum entropy encoding framework provides a unified perspective for many non-contrastive learning methods like SimSiam, Barlow Twins, and MEC. Inspired by this framework, we introduce Matrix-SSL, a novel approach that leverages matrix information theory to interpret the maximum entropy encodin…

Cited by 18SourcePDFScholar
2024

Unveiling the Dynamics of Information Interplay in Supervised Learning

ICML 2024poster

In this paper, we use matrix information theory as an analytical tool to analyze the dynamics of the information interplay between data representations and classification head vectors in the supervised learning process. Specifically, inspired by the theory of Neural Collapse, we introduce matrix mut…

Cited by 3SourcePDFScholar
2023

Trade-off Between Efficiency and Consistency for Removal-based Explanations

NeurIPS 2023poster

In the current landscape of explanation methodologies, most predominant approaches, such as SHAP and LIME, employ removal-based techniques to evaluate the impact of individual features by simulating various scenarios with specific features omitted. Nonetheless, these methods primarily emphasize effi…