Institution profile

FPT Corporation

Industry researchasia · vn
Official website
Research library13linked papers
Opportunities0open roles
Selected work

Representative Papers

Do RUL explanations hold up? Faithfulness and stability of attributions on C-MAPSS

Oct 03, 2026

This study addresses the limitations of existing explanation methods for deep remaining useful life (RUL) prediction models in terms of faithfulness and stability evaluation. For the first time, it systematically evaluates deletion/insertion faithfulness and cross-seed stability, explicitly distinguishing noise robustness from retraining consistency. Based on CNN, LSTM, and Transformer architectures, this work comparatively analyzes the explainable AI (XAI) performance of attribution algorithms, including Integrated Gradients, Occlusion, and attention mechanisms. The results demonstrate that Occlusion and Integrated Gradients achieve superior faithfulness, rendering them suitable for practical engineering maintenance reports, whereas raw attention should serve solely as a visualization aid. These findings provide a reliable foundation for interpretable predictive maintenance.

0 citationsRead paper

Nearly Optimal Fixed-Confidence Best-Arm Identification with 1-Bit Feedback

Oct 01, 2026

This study addresses the fixed-confidence best-arm identification problem under strict 1-bit feedback constraints within a distribution-free setting with finite variance. To this end, it proposes a time-uniform 1-bit mean estimation primitive based on randomized threshold queries, which is embedded into a successive elimination-style candidate-challenger algorithmic framework. Furthermore, a phase-adaptive clipping strategy is designed to dynamically match the current resolution, fundamentally leveraging a clipped tail integral identity to achieve efficient estimation. Theoretically, this work establishes an information-theoretic lower bound up to logarithmic penalties and demonstrates that the proposed algorithm attains near-optimal sample complexity. Specifically, its leading term differs from the theoretical lower bound only by lower-order logarithmic factors, thereby achieving information-theoretic near-optimality under such stringent communication constraints.

0 citationsRead paper
Recent publications

Latest Papers

Do RUL explanations hold up? Faithfulness and stability of attributions on C-MAPSS

Oct 03, 2026

This study addresses the limitations of existing explanation methods for deep remaining useful life (RUL) prediction models in terms of faithfulness and stability evaluation. For the first time, it systematically evaluates deletion/insertion faithfulness and cross-seed stability, explicitly distinguishing noise robustness from retraining consistency. Based on CNN, LSTM, and Transformer architectures, this work comparatively analyzes the explainable AI (XAI) performance of attribution algorithms, including Integrated Gradients, Occlusion, and attention mechanisms. The results demonstrate that Occlusion and Integrated Gradients achieve superior faithfulness, rendering them suitable for practical engineering maintenance reports, whereas raw attention should serve solely as a visualization aid. These findings provide a reliable foundation for interpretable predictive maintenance.

0 citationsRead paper

Nearly Optimal Fixed-Confidence Best-Arm Identification with 1-Bit Feedback

Oct 01, 2026

This study addresses the fixed-confidence best-arm identification problem under strict 1-bit feedback constraints within a distribution-free setting with finite variance. To this end, it proposes a time-uniform 1-bit mean estimation primitive based on randomized threshold queries, which is embedded into a successive elimination-style candidate-challenger algorithmic framework. Furthermore, a phase-adaptive clipping strategy is designed to dynamically match the current resolution, fundamentally leveraging a clipped tail integral identity to achieve efficient estimation. Theoretically, this work establishes an information-theoretic lower bound up to logarithmic penalties and demonstrates that the proposed algorithm attains near-optimal sample complexity. Specifically, its leading term differs from the theoretical lower bound only by lower-order logarithmic factors, thereby achieving information-theoretic near-optimality under such stringent communication constraints.

0 citationsRead paper