← Search

Anthony Widjaja Lin

7 accepted papers

2026

Probability Distributions Computed by Autoregressive Transformers

ICLR 2026poster

Most expressivity results for transformers treat them as language recognizers (which accept or reject strings), and not as they are used in practice, as language models (which generate strings autoregressively and probabilistically). We characterize the probability distributions that transformer lan…

Cited by 0SourceScholar
2025

Mitigating Spurious Features in Contrastive Learning with Spectral Regularization

NeurIPS 2025poster

Neural networks generally prefer simple and easy-to-learn features. When these features are spuriously correlated with the labels, the network's performance can suffer, particularly for underrepresented classes or concepts. Self-supervised representation learning methods, such as contrastive learnin…

Cited by 0SourcecodeScholar
2024

Logical Languages Accepted by Transformer Encoders with Hard Attention

ICLR 2024poster

We contribute to the study of formal languages that can be recognized by transformer encoders. We focus on two self-attention mechanisms: (1) UHAT (Unique Hard Attention Transformers) and (2) AHAT (Average Hard Attention Transformers). UHAT encoders are known to recognize only languages inside the…

Cited by 16SourcePDFScholar
2024

The Power of Hard Attention Transformers on Data Sequences: A formal language theoretic perspective

NeurIPS 2024poster

Formal language theory has recently been successfully employed to unravel the power of transformer encoders. This setting is primarily applicable in Natural Language Processing (NLP), as a token embedding function (where a bounded number of tokens is admitted) is first applied before fe…

Cited by 1SourcePDFScholar