← Search

Yaofo Chen

10 accepted papers

2026

Intervene When It Doubts: Conjunction-Guided Interactive Reasoning

ICML 2026poster

Large Reasoning Models (LRMs) excel at complex reasoning but suffer from inefficient reasoning, like overthinking and overshoot. These issues stem from excessive or misdirected reasoning triggered by the model's "doubt", manifested as self-validation and exploratory extension, increasing computation…

Cited by 0SourceScholar
2026

LoKiFormer: Locality-aware Attention with Decoupled Knowledge Memory for Efficient Large Language Model Pretraining

ICML 2026poster

Large language models (LLMs) have achieved remarkable breakthroughs across various applications. However, their architectures remain inefficient in pretraining due to two main limitations: (i) self-attention lacks an explicit inductive bias for locality, leading to redundant modeling of sequence-int…

Cited by 0SourceScholar
2026

ProCache: Constraint-Aware Feature Caching with Selective Computation for Diffusion Transformer Acceleration

AAAI 2026technical

Diffusion Transformers (DiTs) have achieved state-of-the-art performance in generative modeling, yet their high computational cost hinders real-time deployment. While feature caching offers a promising training-free acceleration solution by exploiting temporal redundancy, existing methods suffer fro

Cited by 0SourcePDFScholar
2025

Core Context Aware Transformers for Long Context Language Modeling

ICML 2025poster

Transformer-based Large Language Models (LLMs) have exhibited remarkable success in extensive tasks primarily attributed to self-attention mechanism, which requires a token to consider all preceding tokens as its context to compute attention. However, when the context length L becomes very large (e.…

Cited by 12SourcePDFScholar
2025

Curse of High Dimensionality Issue in Transformer for Long Context Modeling

ICML 2025poster

Transformer-based large language models (LLMs) excel in natural language processing tasks by capturing long-range dependencies through self-attention mechanisms. However, long-context modeling faces significant computational inefficiencies due to redundant attention computations: while attention wei…

2024

Towards Robust and Efficient Cloud-Edge Elastic Model Adaptation via Selective Entropy Distillation

ICLR 2024poster

The conventional deep learning paradigm often involves training a deep model on a server and then deploying the model or its distilled ones to resource-limited edge devices. Usually, the models shall remain fixed once deployed (at least for some period) due to the potential high cost of model adapta…

2023

Towards Stable Test-time Adaptation in Dynamic Wild World

ICLR 2023top-5%

Test-time adaptation (TTA) has shown to be effective at tackling distribution shifts between training and testing data by adapting a given model on test samples. However, the online model updating of TTA may be unstable and this is often a key obstacle preventing existing TTA methods from being depl…

2022

Efficient Test-Time Model Adaptation without Forgetting

ICML 2022spotlight

Test-time adaptation provides an effective means of tackling the potential distribution shift between model training and inference, by dynamically updating the model at test time. This area has seen fast progress recently, at the effectiveness of handling test shifts. Nonetheless, prior methods stil…

2021

Contrastive Neural Architecture Search With Neural Architecture Comparators

CVPR 2021poster

One of the key steps in Neural Architecture Search (NAS) is to estimate the performance of candidate architectures. Existing methods either directly use the validation performance or learn a predictor to estimate the performance. However, these methods can be either computationally expensive or very…

Cited by 87PDFcodeScholar
2020

Breaking the Curse of Space Explosion: Towards Efficient NAS with Curriculum Search

ICML 2020poster

Neural architecture search (NAS) has become an important approach to automatically find effective architectures. To cover all possible good architectures, we need to search in an extremely large search space with billions of candidate architectures. More critically, given a large search space, we ma…