arXiv subjects

Dongjin Lee

Publications and source records attributed to Dongjin Lee.

At least 19 recordsLinked to original sources

arXiv2026

Risk-averse design optimization with CVaR constraints via multifidelity tail-region correction

Risk-averse design optimization with conditional value-at-risk (CVaR) constraints requires accurate tail estimates, but repeated high-fidelity (HF) evaluations are costly. We propose a multifidelity (MF) tail-region correction method that uses dimensionally decomposed generalized polynomial chaos expansion (DD-GPCE) as a global surrogate and directs a limited HF budget to responses that most strongly influence CVaR. Covariance of the estimated DD-GPCE coefficients quantifies finite-sample prediction uncertainty and defines a confidence-interval-based tail region. Within this region, a two-stage strategy explores locations with high prediction uncertainty and then exploits locations with large correction-induced shifts. A Tikhonov-regularized residual expansion using the same polynomial basis yields a unified tail-corrected surrogate. For a ten-bar truss, the method produced a design close to the crude-MCS reference with approximately 72 to 274 times fewer HF evaluations than the considered MF importance sampling configurations. For a suction valve, it reduced mass by 1.05% and bending and bulging CVaR by 17.68% and 21.53%, respectively, while satisfying the valve-opening requirement. The results demonstrate accurate, HF-sample-efficient CVaR-constrained design through localized MF correction.

math.OC↗

arXiv2026

SSDi8: Accurate and Efficient 8-bit Quantization for State Space Duality

Recent advances in sequence modeling have highlighted Mamba as a state space architecture offering efficient long-range dependency modeling and providing a viable alternative to Transformers. Building upon this, Mamba-2 introduces the Structured State Space Duality (SSD), which integrates recurrent and attention modes to achieve efficiency and scalability. However, this architectural expansion substantially increases memory and latency overhead, underscoring the need for efficient compression strategies tailored to SSD. In this work, we present SSDi8, the first post-training quantization framework specifically designed for SSD to maintain a persistent INT8 path. SSDi8 introduces a reformulation that decouples element-wise multiplications from matrix multiplications, enabling reuse of quantized activations across modules. Moreover, SSDi8 adaptively quantizes channel-varying activations at cost-effective points, further reducing latency. On the accuracy side, SSDi8 explicitly leverages the intrinsic dimensional decomposition of SSD, exploiting distinct outlier distributions across axes, and incorporates an error correction term based on per-channel error statistics. Comprehensive experiments demonstrate that SSDi8 achieves accuracy comparable to FP16 while delivering up to 1.4x speedup in W4A8 and W8A8 settings. We further validate its robustness in resource-constrained environments by deploying it on the Orin NX device.

cs.AI↗

arXiv2026

Gradient-enhanced spline dimensional decomposition for uncertainty quantification with limited training samples

A spline dimensional decomposition (SDD) surrogate effectively represents high-dimensional engineering responses with localized features and complex nonlinearities in uncertainty quantification (UQ). However, limited training data can make coefficient estimation from function values severely ill-conditioned. We propose gradient-enhanced SDD (GE-SDD), which trains the surrogate using function values and partial derivatives. A diagonal row-weight matrix balances the function and derivative blocks by their Frobenius norms. We solve the balanced system through ridge regression in probability-weighted Sobolev coordinates and select the regularization parameter using grouped K-fold cross-validation to prevent information leakage. Mapping the solution back to the L2-orthonormal SDD basis preserves closed-form mean and variance estimates. We evaluate the proposed GE-SDD on a two-dimensional continuous exponential function, a linear dynamical system with three uncertain parameters, and a 30-dimensional 25-bar truss. GE-SDD is more accurate than standard SDD and uses gradients more robustly than gradient-enhanced Kriging. GE-SDD achieves a median NRMSE of 1.022% on the nonsmooth benchmark, compared with 8.731% for Kriging. For the truss, GE-SDD yields lower NRMSE and more accurate standard-deviation estimates than Kriging at moderate training sizes and above. Overall, the benefits of gradient augmentation depend on input dimension, basis resolution, training size, and the target UQ quantity.

math.NA↗

arXiv2026

Fine-Grained Open-Set Fault Diagnosis via Metric-Guided Time-Frequency Configuration Selection and Class-Specific Autoencoders

Reliable fault diagnosis of rotating machinery is essential for the safe and stable operation of industrial systems. Although deep learning methods perform well under closed-set conditions, real machinery may encounter previously unseen fault states. Existing open-set fault diagnosis (OSFD) methods remain limited in fine-grained severity diagnosis because they often rely on coarse type levels, heuristically selected Short-Time Fourier Transform (STFT) settings, and global class boundaries. We propose a fine-grained OSFD method that combines metric-guided data-centric (MGDC) STFT configuration selection with class-specific autoencoder (CSAE)-based anomaly rejection. MGDC screens candidate STFT configurations using the Silhouette score computed from spectrogram representations, identifying promising time-frequency representations before network training. The diagnostic model then uses a bank of CSAEs to learn compact class-specific manifolds for known degradation states. During inference, reconstruction-error-based class affinity identifies known classes, while a dual-criteria mechanism based on latent dimension-wise boundaries and class-specific reconstruction error rejects unknown samples. Experiments on the Case Western Reserve University (CWRU) and Paderborn University (PU) bearing datasets show that the proposed method achieves H-scores of 0.9924 and 0.9509 for fine-grained fault severity diagnosis. MGDC also identifies the best-performing configuration found by exhaustive search while evaluating only 9 of 38 candidates on CWRU and 2 of 39 candidates on PU, reducing the selection cost by factors of 5.69 and 29.87, respectively. These results indicate that the proposed method supports accurate open-set severity diagnosis with substantially lower configuration-selection cost.

eess.SP↗

arXiv2026

Many-body chirality of topological stabilizer states

A defining feature of chirality is the distinction between a system and its mirror image. Despite extensive experimental observations of chiral phases and theoretical advances, a quantum-information theoretic characterization of chirality based solely on the entanglement structure of many-body quantum states remains elusive. Here, we introduce the notion of many-body chirality by formulating it as an obstruction to transforming a quantum state into its complex conjugate through finite-depth local operations. We rigorously establish many-body chirality for stabilizer realizations of $\mathbb{Z}_d^{(k)}$ anyon theories, proving that complex conjugation can be implemented by local quantum channels if and only if the underlying anyon data are mirror invariant. This reveals forms of chirality that evade conventional diagnostics, including examples with vanishing modular commutator, vanishing chiral central charge, and commuting-projector realizations. We further show that this obstruction is intrinsically four-partite, while invisible to tripartite entanglement structure. Finally, we prove that $\mathbb{Z}_d^{(k)}$ states with $d>2$ possess intrinsic many-body imaginarity: their complex phase structure cannot be removed by finite-depth local unitaries. Remarkably, this includes states that are not many-body chiral.

quant-ph↗

arXiv2026

FairQE: Multi-Agent Framework for Mitigating Gender Bias in Translation Quality Estimation

Quality Estimation (QE) aims to assess machine translation quality without reference translations, but recent studies have shown that existing QE models exhibit systematic gender bias. In particular, they tend to favor masculine realizations in gender-ambiguous contexts and may assign higher scores to gender-misaligned translations even when gender is explicitly specified. To address these issues, we propose FairQE, a multi-agent-based, fairness-aware QE framework that mitigates gender bias in both gender-ambiguous and gender-explicit scenarios. FairQE detects gender cues, generates gender-flipped translation variants, and combines conventional QE scores with LLM-based bias-mitigating reasoning through a dynamic bias-aware aggregation mechanism. This design preserves the strengths of existing QE models while calibrating their gender-related biases in a plug-and-play manner. Extensive experiments across multiple gender bias evaluation settings demonstrate that FairQE consistently improves gender fairness over strong QE baselines. Moreover, under MQM-based meta-evaluation following the WMT 2023 Metrics Shared Task, FairQE achieves competitive or improved general QE performance. These results show that gender bias in QE can be effectively mitigated without sacrificing evaluation accuracy, enabling fairer and more reliable translation evaluation.

cs.AI↗

arXiv2026

Robust design optimization for a nonlinear system via Bayesian neural network enhanced polynomial dimensional decomposition

Uncertainties such as manufacturing tolerances cause performance variations in complex engineering systems, making robust design optimization (RDO) essential. However, simulation-based RDO faces high computational cost for statistical moment estimation, and strong nonlinearity limits the accuracy of conventional surrogate models. This study proposes a novel RDO method that integrates Bayesian neural networks (BNN) with polynomial dimensional decomposition (PDD). The method employs uncertainty-based active learning to enhance BNN surrogate accuracy and a multi-point single-step strategy that partitions the design space into dynamically adjusted subregions, within which PDD analytically estimates statistical moments from BNN predictions. Validation through a mathematical benchmark and an electric motor shape optimization demonstrates that the method converges to robust optimal solutions with significantly fewer function evaluations. In the ten-dimensional benchmark, the proposed method achieved a 99.97% mean reduction, while Gaussian process-based and Monte Carlo approaches failed to locate the global optimum. In the motor design problem, the method reduced cogging torque by 94.75% with only 6644 finite element evaluations, confirming its computational efficiency for high-dimensional, strongly nonlinear engineering problems.

math.OC↗

arXiv2026

Data-driven dimensionally decomposed generalized polynomial chaos expansion for forward uncertainty quantification

Dimensionally decomposed generalized polynomial chaos expansion (DD-GPCE) efficiently performs forward uncertainty quantification (UQ) in complex engineering systems with high-dimensional random inputs of arbitrary distributions. However, constructing the measure-consistent orthonormal polynomial bases in DD-GPCE requires prior knowledge of input distributions, which is often unavailable in practice. This work introduces a data-driven DD-GPCE method that eliminates the need for such prior knowledge, extending its applicability to UQ with high-dimensional inputs. Input distributions are inferred directly from sample data using smoothed-bootstrap kernel density estimation (KDE), while the DD-GPCE framework enables KDE to handle high-dimensional inputs through low-dimensional marginal estimation. We then use the estimated input distributions to perform a whitening transformation via Monte Carlo Simulation, which enables generation of measure-consistent orthonormal basis functions. We demonstrate the accuracy of the proposed method in both mathematical examples and stochastic dynamic analysis for a practical three-dimensional mobility design involving twenty random inputs. The results indicate that the proposed method produces more accurate estimates of the output mean and variance compared to the conventional data-driven approach that assumes Gaussian input distributions.

math.NA↗

arXiv2025

Inherently unpredictable beam steering for quantum LiDAR

Quantum LiDAR offers noise resilience and stealth observation capabilities in low-light conditions. In prior demonstrations, the telescope pointing was raster-scanned, making the observation direction predictable from the pointing direction. However, while Quantum LiDAR can enable stealth observation, operational stealth is enhanced by inherently unpredictable beam steering. Here, we introduce a novel stealth beam steering method that is fundamentally immune to prediction. In a photon pair, the probe photon undergoes diffraction in an unpredictable direction at a grating due to wavelength randomness. The arrival time of the heralding photon, delayed by propagation through a dispersive medium, enables the determination of the probe photon's diffraction direction. Our method successfully detects multiple targets in parallel, demonstrating up to a 1000-fold enhancement in signal-to-noise ratio compared to classical LiDAR. This breakthrough establishes a new paradigm for quantum-enhanced sensing, with far-reaching implications for quantum metrology, secure communications, and beyond.

quant-ph↗

arXiv2025

Investigating the Effects of Point Source Injection Strategies on KMTNet Real/Bogus Classification

Recently, machine learning-based real/bogus (RB) classifiers have demonstrated effectiveness in filtering out artifacts and identifying genuine transients in real-time astronomical surveys. However, the rarity of transient events and the extensive human labeling required for a large number of samples pose significant challenges in constructing training datasets for RB classification. Given these challenges, point source injection techniques, which inject simulated point sources into optical images, provide a promising solution. This paper presents the first detailed comparison of different point source injection strategies and their effects on classification performance within a simulation-to-reality framework. To this end, we first construct various training datasets based on Random Injection (RI), Near Galaxy Injection (NGI), and a combined approach by using the Korea Microlensing Telescope Network datasets. Subsequently, we train convolutional neural networks on simulated cutout samples and evaluate them on real, imbalanced datasets from gravitational wave follow-up observations for GW190814 and S230518h. Extensive experimental results show that RI excels at asteroid detection and bogus filtering but underperforms on transients occurring near galaxies (e.g., supernovae). In contrast, NGI is effective for detecting transients near galaxies but tends to misclassify variable stars as transients, resulting in a high false positive rate. The combined approach effectively handles these trade-offs, thereby balancing between detection rate and false positive rate. Our results emphasize the importance of point source injection strategy in developing robust RB classifiers for transient (or multi-messenger) follow-up campaigns.

astro-ph.IM↗

arXiv2025

Entanglement sharing schemes

We ask how quantum correlations can be distributed among many subsystems. To address this, we define entanglement sharing schemes (ESS) where certain pairs of subsystems allow entanglement to be recovered via local operations, while other pairs must not. ESS schemes come in two variants, one where the partner system with which entanglement should be prepared is known, and one where it is not. In the case of known partners, we fully characterize the access structures realizable for ESS when using stabilizer states, and construct efficient schemes for threshold access structures, and give a conjecture for the access structures realizable with general states. In the unknown partner case, we again give a complete characterization in the stabilizer setting, additionally give a complete characterization of the case where there are no restrictions on unauthorized pairs, and we prove a set of necessary conditions on general schemes which we conjecture are also sufficient. Finally, we give an application of the theory of entanglement sharing to resolve an open problem related to the distribution of entanglement in response to time-sensitive requests in quantum networks.

quant-ph↗

arXiv2025

Chiral Color Code : Single-shot error correction for exotic topological order

We present a family of simple three-dimensional stabilizer codes, called the chiral color codes, that realize fermionic and chiral topological orders. In the qubit case, the code realizes the topological phase of a single copy of the fermionic toric code. For qudit systems with local dimension $d$, the model features a chiral parameter $α$ and realizes 3D topological phases characterized by $\mathbb{Z}_d^{(α)}$ anyon theories with anomalous chiral surface topological order. On closed manifolds, the code has a unique ground state after removing bulk transparent fermions or bosons. Furthermore, we prove that the bulk is short-range entangled (for odd $d$, coprime $α$) by constructing an explicit local quantum channel that prepares the ground state. The chiral color codes are constructed within the gauge color code, and hence inherit its fault-tolerant features: they admit single-shot error correction and allow code switching to other stabilizer color codes. These properties position the chiral color codes as particularly useful platforms for realizing and manipulating fermions and chiral anyons.

quant-ph↗

arXiv2025

Spline Dimensional Decomposition with Interpolation-based Optimal Knot Selection for Stochastic Dynamic Analysis

Forward uncertainty quantification in dynamical systems is challenging due to non-smooth or locally oscillating nonlinear behaviors. Spline dimensional decomposition (SDD) addresses such nonlinearity by partitioning input coordinates via knot placement, but its accuracy is highly sensitive to internal knot locations. Optimizing knots using sequential quadratic programming is effective, yet computationally expensive. We propose a computationally efficient, interpolation-based method for optimal knot selection in SDD. The method includes: (1) interpolating input-output profiles, (2) defining subinterval-based reference regions, and (3) selecting knots at maximum gradient points within each region. The resulting knot vector is then applied to SDD for accurate approximation of non-smooth and oscillatory responses. A modal analysis of a lower control arm shows that SDD with the proposed knots yields higher accuracy than SDD with uniformly or randomly spaced knots and a Gaussian process model. In this example, the proposed SDD achieves the lowest relative variance error (2.89%) for the first natural frequency distribution, compared to uniformly spaced knots (12.310%), randomly spaced knots (15.274%), and Gaussian process (5.319%). All surrogates are constructed using the same 401 simulation datasets, and errors are evaluated against a 2000-sample Monte Carlo simulation. Scalability and applicability are demonstrated through stochastic and reliability analyses of one- and three-dimensional benchmark functions, and a ten-dimensional lower control arm model. Results confirm that second-moment statistics and reliability estimates can be accurately obtained with only a few hundred function evaluations or finite element simulations.

stat.ML↗

arXiv2025

How much entanglement is needed for quantum error correction?

It is commonly believed that logical states of quantum error-correcting codes have to be highly entangled such that codes capable of correcting more errors require more entanglement to encode a qubit. Here, we show that the validity of this belief depends on the specific code and the choice of entanglement measure. To this end, we characterize a tradeoff between the code distance $d$ quantifying the number of correctable errors, and the geometric entanglement measure of logical states quantifying their maximal overlap with product states or more general ``topologically trivial" states. The maximum overlap is shown to be exponentially small in $d$ for three families of codes: (1) low-density parity check codes with commuting check operators, (2) stabilizer codes, and (3) codes with a constant encoding rate. Equivalently, the geometric entanglement of any logical state of these codes grows at least linearly with $d$. On the opposite side, we also show that this distance-entanglement tradeoff does not hold in general. For any constant $d$ and $k$ (number of logical qubits), we show there exists a family of codes such that the geometric entanglement of some logical states approaches zero in the limit of large code length.

quant-ph↗

arXiv2025

How Much Entanglement Is Needed for Topological Codes and Mixed States with Anomalous Symmetry?

It is known that particles with exotic properties can emerge in systems made of simple constituents such as qubits, due to long-range quantum entanglement. In this paper, we provide quantitative characterizations of entanglement necessary for emergent anyons and fermions by using the geometric entanglement measure (GEM), which quantifies the maximal overlap between a given state and any short-range-entangled states. For systems with emergent anyons, based on the braiding statistics, we show that the GEM scales linearly in the system size regardless of microscopic details. The phenomenon of emergent anyons can also be understood within the framework of quantum error correction (QEC). Specifically, we show that the GEM of any 2D stabilizer codes must be at least quadratic in the code distance. Our proof is based on a generic prescription for constructing string operators, establishing a rigorous and direct connection between emergent anyons and QEC. For systems with emergent fermions, despite that the ground state subspaces could be exponentially huge and their coding properties could be rather poor, we show that the GEM also scales linearly in the system size. Our analysis establishes an intriguing link between quantum anomaly and entanglement: A quantum state respecting anomalous 1-form symmetries, must be long-range-entangled and have large GEM. Our results also extend to mixed states, such as the $ZX$-dephased toric code, providing a provably nontrivial class of intrinsically mixed-state phases.

quant-ph↗

arXiv2025

A Robust Method for Fault Detection and Severity Estimation in Mechanical Vibration Data

This paper proposes a robust method for fault detection and severity estimation in multivariate time-series data to enhance predictive maintenance of mechanical systems. We use the Temporal Graph Convolutional Network (T-GCN) model to capture both spatial and temporal dependencies among variables. This enables accurate future state predictions under varying operational conditions. To address the challenge of fluctuating anomaly scores that reduce fault severity estimation accuracy, we introduce a novel fault severity index based on the mean and standard deviation of anomaly scores. This generates a continuous and reliable severity measurement. We validate the proposed method using two experimental datasets: an open IMS bearing dataset and data collected from a fanjet electric propulsion system. Results demonstrate that our method significantly reduces abrupt fluctuations and inconsistencies in anomaly scores. This provides a more dependable foundation for maintenance planning and risk management in safety-critical applications.

eess.SY↗

arXiv2025

Predicting passenger injury distributions under uncertainty variables using Gaussian process modeling with GHBMC

This work presents a Gaussian Process (GP) modeling method to predict statistical characteristics of injury kinematics responses using Human Body Models (HBM) more accurately and efficiently. We validate the GHBMC model against a 50\%tile male Post-Mortem Human Surrogate (PMHS) test. Using this validated model, we create various postured models and generate injury prediction data across different postures and personalized D-ring heights through parametric crash simulations. We then train the GP using this simulation data, implementing a novel adaptive sampling approach to improve accuracy. The trained GP model demonstrates robustness by achieving target prediction accuracy at points with high uncertainty. The proposed method performs continuous injury prediction for various crash scenarios using just 27 computationally expensive simulation runs. This method can be effectively applied to designing highly reliable occupant restraint systems across diverse crash conditions.

stat.AP↗

arXiv2025

Robust Design Optimization with Limited Data for Char Combustion

This work presents a robust design optimization approach for a char combustion process in a limited-data setting, where simulations of the fluid-solid coupled system are computationally expensive. We integrate a polynomial dimensional decomposition (PDD) surrogate model into the design optimization and induce computational efficiency in three key areas. First, we transform the input random variables to have fixed probability measures, which eliminates the need to recalculate the PDD's basis functions associated with these probability quantities. Second, using the limited data available from a physics-based high-fidelity solver, we estimate the PDD coefficients via sparsity-promoting diffeomorphic modulation under observable response preserving homotopy regression. Third, we propose a single-pass surrogate model training that avoids the need to generate new training data and update the PDD coefficients during the derivative-free optimization. The results provide insights for optimizing process parameters to ensure consistently high energy production from char combustion.

math.OC↗