Arrow Research search

Author name cluster

Benben Jiang

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

NeurIPS Conference 2025 Conference Paper

FairNet: Dynamic Fairness Correction without Performance Loss via Contrastive Conditional LoRA

  • Songqi Zhou
  • Zeyuan Liu
  • Benben Jiang

Ensuring fairness in machine learning models is a critical challenge. Existing debiasing methods often compromise performance, rely on static correction strategies, and struggle with data sparsity, particularly within minority groups. Furthermore, their utilization of sensitive attributes is often suboptimal, either depending excessively on complete attribute labeling or disregarding these attributes entirely. To overcome these limitations, we propose FairNet, a novel framework for dynamic, instance-level fairness correction. FairNet integrates a bias detector with conditional low-rank adaptation (LoRA), which enables selective activation of the fairness correction mechanism exclusively for instances identified as biased, and thereby preserve performance on unbiased instances. A key contribution is a new contrastive loss function for training the LoRA module, specifically designed to minimize intra-class representation disparities across different sensitive groups and effectively address underfitting in minority groups. The FairNet framework can flexibly handle scenarios with complete, partial, or entirely absent sensitive attribute labels. Theoretical analysis confirms that, under moderate TPR/FPR for the bias detector, FairNet can enhance the performance of the worst group without diminishing overall model performance, and potentially yield slight performance improvements. Comprehensive empirical evaluations across diverse vision and language benchmarks validate the effectiveness of FairNet. Code is available at \url{https: //github. com/SongqiZhou/FairNet}.

EAAI Journal 2025 Journal Article

Parallel Bayesian optimization using satisficing Thompson sampling for fast charging design of lithium-ion batteries

  • Xiaobin Song
  • Benben Jiang

The rapid growth of the battery industry has increased the demand for fast charging strategies, which face two key optimization challenges: (i) the large space of the candidate charging strategy compared to the limited experiment budget, and (ii) the limited understanding of various degradation mechanisms. Existing optimization methods can be broadly classified into model-based and data-driven approaches. Model-based approaches are constrained by the accuracy of degradation models, while classical data-driven methods, such as Bayesian optimization (BO), may require many iterations to find the optimal solution. In this paper, we propose a data-driven approach named Blahut-Arimoto satisficing Thompson sampling-based parallel Bayesian optimization (BLASTS-PBO) for fast charging optimization. BLASTS-PBO shifts the target from the optimal solution to a satisficing solution that balances the informational requirements and optimality, which is particularly beneficial for time-sensitive optimization problems. We employ Gaussian processes as the surrogate model to capture the relationship between different charging strategies and utilize the BLASTS algorithm to compute the satisficing strategy. We also introduce the parallel technique to further improve time efficiency. Theoretical bounds on Bayesian cumulative regret confirm the method’s efficacy, and experiments using a porous electrode theory-based battery simulator demonstrate that BLASTS-PBO outperforms both sequential counterparts and parallel BO with traditional Thompson sampling in both synchronous and asynchronous settings. The results underscore BLASTS-PBO’s practical implication in accelerating the identification of effective charging strategies, offering a valuable solution for time-sensitive battery optimization problems.

v2026.09.13