1 June 2014 in Robotics and Autonomous Systems
13 September 2024 in IEEE Transactions on Industrial Informatics
Missing data imputation is a critical aspect of the Industrial Internet-of-Things (IIoT), which is uniquely challenged by local relationships within data due to different operational contexts and phases. Current imputation methods struggle to accommodate local relationships due to their black-box nature or limited capacity. To bridge this gap, we approach data imputation as a distribution alignment problem and leverage optimal transport to instantiate it for enhanced capacity. Specifically, we first introduce the similarity preserved optimal transport (SPOT) problem, with a conditional gradient solution to compute the transport cost. Subsequently, we propose the SPOT for imputation (SPOT-I) framework. It minimizes the transport cost of SPOT for distribution alignment and uses the gradient to update imputations, which maintains local similarity and refines imputation due to the characteristics of SPOT. Experiments on IIoT datasets showcase the superiority of SPOT-I over state-of-the-art imputation methods.
13 March 2025 in IEEE Transactions on Instrumentation and Measurement
Data-driven soft sensors, which estimate quality variables from process variables, are very important to industrial processes. However, there remains significant room for enhancement in terms of accuracy in the deep learning (DL) era, and one of the promising solutions is embedding graph structure to delineate process variable relationships for feature extraction part and modify network architecture for label inference to make it as close to those industrial (semi-)empirical equations as possible. However, the ground-truth 1) graph structure and 2) (semi-)empirical equations are unavailable in industrial practice. To alleviate these challenges, this paper introduces a novel DL-based soft sensor model termed adaptive Kolmogorov Arnold-based graph neural network (AKGNN). Specifically, for issue 1), the AKGNN first formulates the graph structure construction as a constrained optimization problem, reformulates the metric space with the help of the entropy function, and derives a novel DL-backend compatible graph construction strategy. Consequently, for issue 2), the Kolmogorov-Arnold network is then designed to enable the label inference to be consistent with the (semi)empirical equations. Finally, the detailed algorithm for AKGNN is summarised and various experiments are conducted to demonstrate the effectiveness of the proposed AKGNN.
12 December 2024 in IEEE Transactions on Information Forensics and Security
Post-click conversion rate (CVR) estimation is a fundamental task in developing effective recommender systems, yet it faces challenges from data sparsity and sample selection bias. To handle both challenges, employ entire space multitask models decompose the user behavior track into a sequence of exposure → click → conversion, to foster construct auxiliary learning tasks for CVR estimation. However, these methods suffer from two significant defects: (1) intrinsic estimation bias (IEB), where CVR estimates are in overestimated; (2) false independence prior (FIP), where the causal relationship between clicks and subsequent conversions might be overlooked. To overcome these limitations, we develop a model-agnostic framework, namely Entire Space Counterfactual Multitask Model (ESCM2), which incorporates a counterfactual risk minimizer within the ESMM framework to regularize CVR estimation. Experiments conducted on large-scale industrial recommendation datasets and an online industrial recommendation service demonstrate ESCM 2 effectively mitigates IEB and FIP defects and substantially enhances recommendation performance.
4 December 2024 in IEEE Transactions on Automation Science and Engineering
Accurate imputation of missing data is pivotal in real-world industrial applications. Traditional direct imputers, which utilize basic statistics to replace missing elements, offer a practical solution but struggle to adapt to the complex patterns in industrial data, leaving a gap in the research landscape. This study explores the untapped potential of direct imputers, enhancing their adaptability and capacity to handle complex patterns in industrial data through optimal transport (OT) theory, with a focus on preserving local sample-wise similarity as an exemplar. To these ends, we construct a Local Similarity Preserved Transport (LSPT) problem, with a solution algorithm based on the Frank-Wolfe technique to compute transport cost. Subsequently, we propose the LSPT-D framework, which employs the transport cost of LSPT for distribution matching, directing the gradient flow to the missing data points to update the imputations directly. This strategy maintains local similarity throughout the imputation process thereby enhancing the overall imputation quality. Our experiments demonstrate that LSPT-D outperform various baselines in industrial missing data imputation. Note to Practitioners —Accurate missing data imputation is essential for enhancing the reliability of data analytics and reducing decision-making risks in industrial automation. This study introduces LSPT-D, a non-parametric imputation technique based on OT technology. Unique to LSPT-D is its ability to preserve local similarity during the imputation process, rendering it particularly advantageous for datasets with varying operational phases and load conditions. In industrial applications, LSPT-D not only significantly improves imputation quality compared to various baseline methods but also maintains modest running costs. Additionally, it serves as an exemplar for developing OT-based imputation strategies that capitalize on the inherent properties of data to improve imputation performance. However, LSPT-D operates under the independent and identically distributed assumption and is thus best applied in scenarios where temporal dependencies, such as trends and seasonality, are minimal or have been previously neutralized.