Arrow Research search

Author name cluster

Di Yan

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

2 papers
1 author row

Possible papers

2

AAAI Conference 2026 Conference Paper

Partially Shared Concept Bottleneck Models

  • Delong Zhao
  • Qiang Huang
  • Di Yan
  • Yiqun Sun
  • Jun Yu

Concept Bottleneck Models (CBMs) enhance interpretability by introducing a layer of human-understandable concepts between inputs and predictions. While recent methods automate concept generation using Large Language Models (LLMs) and Vision-Language Models (VLMs), they still face three fundamental challenges: poor visual grounding, concept redundancy, and the absence of principled metrics to balance predictive accuracy and concept compactness. We introduce PS-CBM, a Partially Shared CBM framework that addresses these limitations through three core components: (1) a multimodal concept generator that integrates LLM-derived semantics with exemplar-based visual cues; (2) a Partially Shared Concept Strategy that merges concepts based on activation patterns to balance specificity and compactness; and (3) Concept-Efficient Accuracy (CEA), a post-hoc metric that jointly captures both predictive accuracy and concept compactness. Extensive experiments on eleven diverse datasets show that PS-CBM consistently outperforms state-of-the-art CBMs, improving classification accuracy by 1.0%–7.4% and CEA by 2.0%–9.5%, while requiring significantly fewer concepts. These results underscore PS-CBM’s effectiveness in achieving both high accuracy and strong interpretability.

TCS Journal 2021 Journal Article

An improved algorithm for learning sparse parities in the presence of noise

  • Di Yan
  • Yu Yu
  • Hanlin Liu
  • Shuoyao Zhao
  • Jiang Zhang

We revisit the Learning Sparse Parities with Noise (LSPN) problem on k out of n variables for k ≪ n, and present the following findings. 1. For true parity size k = n u for any 0 < u < 1, and noise rate η < 1 / 2, the first algorithm solves the (n, k, η)-LSPN problem with constant probability and time/sample complexity n ( 1 − u + o ( 1 ) ) k ( 1 / 2 − η ) 2. 2. For any 1 / 2 < c 1 < 1, k = o ( η n / log ⁡ n ), and η ≤ n − c 1 / 4, our second algorithm solves the (n, k, η)-LSPN problem with constant probability and time/sample complexity n 2 ( 1 − c 1 + o ( 1 ) ) k. 3. We show a “win-win” result about reducing the number of samples. If there is an algorithm that solves ( n, k, η ) -LSPN problem with probability Ω ( 1 ), time/sample complexity n O ( k ) for k = o ( n 1 − c ), any noise rate η = n 1 − 2 c / 3 and 1 / 2 ≤ c < 1. Then, either there exists an algorithm that solves the ( n, k, μ ) -LSPN problem under lower noise rate μ = n − c / 3 using only 2n samples, or there exists an algorithm that solves the ( n, k ′, μ ) -LSPN problem for a much larger k ′ = n 1 − c with probability n − O ( k ) / poly ( n ), and time complexity poly ( n ) ⋅ n O ( k ), using only n samples. Our algorithms are simple in concept by combining a few basic techniques such as majority voting, reduction from the LSPN problem to its decisional variant, Goldreich-Levin list decoding, and computational sample amplification.

v2026.09.13