Source author record

Bo Zeng

Bo Zeng appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

11works
8topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

11 published item(s)

preprint2026arXiv

DuetFair: Coupling Inter- and Intra-Subgroup Robustness for Fair Medical Image Segmentation

Medical image segmentation models can perform unevenly across subgroups. Most existing fairness methods focus on improving average subgroup performance, implicitly treating each subgroup as internally homogeneous. However, this can hide difficult cases within a subgroup, where high-loss samples are obscured by the subgroup mean. We call this problem \textbf{intra-group hidden failure}. To solve this, we propose \textbf{DuetFair} mechanism, a dual-axis fairness framework that jointly considers inter-subgroup adaptation and intra-subgroup robustness. Based on DuetFair, we introduce \textbf{FairDRO}, which combines distribution-aware mixture-of-experts (dMoE) with subgroup-conditioned distributionally robust optimization (DRO) loss aggregation. This design allows the model to adapt across subgroups while also reducing hidden failures within each subgroup. We evaluate FairDRO on three medical image segmentation benchmarks with varying degrees of within-group heterogeneity. FairDRO achieves the best equity-scaled performance on Harvard-FairSeg and improves worst-case subgroup performance on HAM10000 under both age- and race-based grouping schemes. On the 3D radiotherapy target cohort, FairDRO further improves worst-group Dice by 3.5 points ($\uparrow 6.0\%$) under the tumor-stage grouping and by 4.1 points ($\uparrow 7.4\%$) under the institution grouping over the strongest baseline.

preprint2025arXiv

Two-Stage Robust Optimal Operation of Distribution Networks Considering Renewable Energy and Demand Asymmetric Uncertainties

This paper presents a confidence level-based distributionally information gap decision theory (CL-DIGDT) framework for the two-stage robust optimal operation of distribution networks, aiming at deriving an optimal operational scheme capable of addressing asymmetric uncertainties related to renewable energy and load demands. Building on conventional IGDT, the proposed framework utilizes the confidence level to capture the asymmetric characteristics of uncertainties and maximize the risk-averse capability of the solution in a probabilistic manner. To account for the probabilistic consideration, the imprecise Dirichlet model is employed to construct the ambiguity sets of uncertainties, reducing reliance on precise probability distributions. Consequently, a two-stage robust optimal operation model for distribution networks using CL-DIGDT is developed. An iterative method is proposed to solve the model and determine the upper and lower bounds of the objective function. Case study demonstrates that the proposed approach yields a more robust and statistically optimized solution with required accuracy compared to existing method, contributing to a reduction in first-stage cost by 0.84%, second-stage average cost by 6.7%, and significantly increasing the reliability of the solution by 8%.

preprint2022arXiv

Two-Stage Robust Optimization with Decision Dependent Uncertainty

The type of decision dependent uncertainties (DDUs) imposes a great challenge in decision making, while existing methodologies are not sufficient to support many real practices. In this paper, we present a systematic study to handle this challenge in two-stage robust optimization~(RO). Our main contributions include three sophisticated variants of column-and-constraint generation method to exactly compute DDU-based two-stage RO. By a novel application of core concepts of linear programming, we provide rigorous analyses on their computational behaviors. Interestingly, in terms of the iteration complexity of those algorithms, DDU-based two-stage RO is not more demanding than its decision independent uncertainty (DIU) based counterpart. It is worth highlighting a counterintuitive discovery that converting a DIU set into a DDU set by making use of "deep knowledge" and then computing the resulting DDU-based formulation may lead to a significant improvement. Indeed, as shown in this paper, in addition to capturing the actual dependence existing in the real world, DDU is a powerful and flexible tool to represent and leverage analytical properties or simply domain expertise to achieve a strong solution capacity. So, we believe it will open a new direction to solve large-scale DIU- or DDU-based RO. Other important results include basic structural properties for two-stage RO, an approximation scheme to deal with mixed integer recourse, and a couple of enhancement techniques for the developed algorithms, as well as an organized numerical study to help us appreciate all algorithms and enhancement techniques' computational performances.

preprint2022arXiv

Two-Stage Robust Unit Commitment Problem with Complex Temperature and Demand Uncertainties

In this paper, we present and study a robust unit commitment model and some variants that consider complex temperature and demand uncertainties. Since there is a strong relationship among the efficiency of gas generators, demand, and temperature in practical systems, our robust models have both left- and right-hand-side (LHS and RHS, respectively) uncertainties. Unlike many existing robust models with RHS uncertainty only, the introduction of LHS uncertainty imposes a huge challenge in computing robust solutions. For those complex formulations, we analyze their structures, derive important properties, and design exact and fast approximation solution strategies under the column-and-constraint generation framework. Numerical experiments are conducted on typical IEEE test systems, which showcase the great performance of our solution methods and demonstrate a clear impact of complex and correlated uncertainties in system operations.

preprint2020arXiv

Adversarial Attack on Hierarchical Graph Pooling Neural Networks

Recent years have witnessed the emergence and development of graph neural networks (GNNs), which have been shown as a powerful approach for graph representation learning in many tasks, such as node classification and graph classification. The research on the robustness of these models has also started to attract attentions in the machine learning field. However, most of the existing work in this area focus on the GNNs for node-level tasks, while little work has been done to study the robustness of the GNNs for the graph classification task. In this paper, we aim to explore the vulnerability of the Hierarchical Graph Pooling (HGP) Neural Networks, which are advanced GNNs that perform very well in the graph classification in terms of prediction accuracy. We propose an adversarial attack framework for this task. Specifically, we design a surrogate model that consists of convolutional and pooling operators to generate adversarial samples to fool the hierarchical GNN-based graph classification models. We set the preserved nodes by the pooling operator as our attack targets, and then we perturb the attack targets slightly to fool the pooling operator in hierarchical GNNs so that they will select the wrong nodes to preserve. We show the adversarial samples generated from multiple datasets by our surrogate model have enough transferability to attack current state-of-art graph classification models. Furthermore, we conduct the robust train on the target models and demonstrate that the retrained graph classification models are able to better defend against the attack from the adversarial samples. To the best of our knowledge, this is the first work on the adversarial attack against hierarchical GNN-based graph classification models.

preprint2019arXiv

A Study on the Block Relocation Problem: Lower Bound Derivations and Strong Formulations

The block relocation problem (BRP) is a fundamental operational issue in modern warehouse and yard management, which, however, is very challenging to solve. In this paper, to advance our understanding on this problem and to provide a substantial assistance to practice, we (i) introduce a classification scheme and present a rather comprehensive review on all 16 BRP variants; (ii) develop a general framework to derive lower bounds on the number of necessary relocations and demonstrate its connection to existing lower bounds of the unrestricted BRP variants; (iii) propose and employ a couple of new critical substructures concepts to analyze the BRP and obtain a lower bound that dominates all existing ones; (iv) build a new and strong mixed integer programming (MIP) formulation that is adaptable to compute 8 BRP variants, and design a novel MIP-formulation-based iterative procedure to compute exact BRP solutions; (v) extend the MIP formulation to address four typical industrial considerations. Computational results on standard test instances show that the new lower bound is significantly stronger, and our new MIP computational methods have superior performances over a state-of-the-art formulation.

preprint2016arXiv

Chance-Constrained Two-Stage Unit Commitment under Uncertain Load and Wind Power Output Using Bilinear Benders Decomposition

In this paper, we study unit commitment (UC) problems considering the uncertainty of load and wind power generation. UC problem is formulated as a chance-constrained two-stage stochastic programming problem where the chance constraint is used to restrict the probability of load imbalance. In addition to the conventional mixed integer linear programming formulation using Big-M, we present the bilinear mixed integer formulation of chance constraint, and then derive its linear counterpart using McCormick linearization method. Then, we develop a bilinear variant of Benders decomposition method, which is an easy-to-implement algorithm, to solve the resulting large-scale linear counterpart. Our results on typical IEEE systems demonstrate that (i) the bilinear mixed integer programming formula-tion is stronger than the conventional one; (ii) the proposed Benders decomposition algorithm is generally an order of magnitude faster than using a professional solver to directly compute both linear and bilinear chance-constrained UC models.

preprint2015arXiv

A Modification of Sufficient Conditions to Ensure the Exact Conic Relaxation

To solve the AC optimal power flow problem, it is proposed in [1,2] that a convex conic approximation to branch flow model (BFM) can be obtained if we first eliminate phase angles of voltages and currents and then relax a set of equality constraints to second order conic ones. In particular, provided a set of sufficient conditions are satisfied, the conic relaxation is exact. We note, however, that those conditions do not always guarantee the exactness. In this letter, we analyze the argument of exactness and include a new condition that there is no line with negative reactance to ensure the conic formulation's exactness.

preprint2015arXiv

Amplitude- and phase-resolved nano-spectral imaging of phonon polaritons in hexagonal boron nitride

Phonon polaritons are quasiparticles resulting from strong coupling of photons with optical phonons. Excitation and control of these quasiparticles in 2D materials offer the opportunity to confine and transport light at the nanoscale. Here, we image the phonon polariton (PhP) spectral response in thin hexagonal boron nitride (hBN) crystals as a representative 2D material using amplitude- and phase-resolved near-field interferometry with broadband mid-IR synchrotron radiation. The large spectral bandwidth enables the simultaneous measurement of both out-of-plane (780 cm-1) and in-plane (1370 cm-1) hBN phonon modes. In contrast to the strong and dispersive in-plane mode, the out-of-plane mode PhP response is weak. Measurements of the PhP wavelength reveal a proportional dependence on sample thickness for thin hBN flakes, which can be understood by a general model describing two-dimensional polariton excitation in ultrathin materials.

preprint2015arXiv

Dual Decomposition-Based Privacy-Preserving Multi-Horizon Utility-Community Decision Making Paradigms

Two types of privacy-preserving decision making paradigms for utility-community interactions for multi-horizon operation are examined in this paper. In both designs, communities with renewable energy sources, distributed generators, and energy storage systems minimize their costs with limited information exchange with the utility. The utility makes decision based on the information provided from the communities. Through an iterative process, all parties achieve agreement. The authors' previous research results on subgradient and lower-upper-bound switching (LUBS)-based distributed optimization oriented multi-agent control strategies are examined and the convergence analysis of both strategies are provided. The corresponding decision making architectures, including information flow among agents and learning (or iteration) procedure, are developed for multi-horizon decision making scenarios. Numerical results illustrate the decision making procedures and demonstrate their feasibility of practical implementation. The two decision making architectures are compared for their implementation requirements as well as performance.

preprint2014arXiv

Chance Constrained Mixed Integer Program: Bilinear and Linear Formulations, and Benders Decomposition

In this paper, we study chance constrained mixed integer program with consideration of recourse decisions and their incurred cost, developed on a finite discrete scenario set. Through studying a non-traditional bilinear mixed integer formulation, we derive its linear counterparts and show that they could be stronger than existing linear formulations. We also develop a variant of Jensen's inequality that extends the one for stochastic program. To solve this challenging problem, we present a variant of Benders decomposition method in bilinear form, which actually provides an easy-to-use algorithm framework for further improvements, along with a few enhancement strategies based on structural properties or Jensen's inequality. Computational study shows that the presented Benders decomposition method, jointly with appropriate enhancement techniques, outperforms a commercial solver by an order of magnitude on solving chance constrained program or detecting its infeasibility.