mlsanityData to 7 Oct 2026

TMoE-P: Towards the Pareto Optimum for Multivariate Soft Sensors

arXiv 2302.10477 ↗First posted 21 Feb 2023cs.AI stat.APcited by 0

On the map: Mixture-of-experts → MoE theory and gating functions

Abstract (arXiv)

Multi-variate soft sensor seeks accurate estimation of multiple quality variables using measurable process variables, which have emerged as a key factor in improving the quality of industrial manufacturing. The current progress stays in some direct applications of multitask network architectures; however, there are two fundamental issues remain yet to be investigated with these approaches: (1) negative transfer, where sharing representations despite the difference of discriminate representations for different objectives degrades performance; (2) seesaw phenomenon, where the optimizer focuses on one dominant yet simple objective at the expense of others. In this study, we reformulate the multi-variate soft sensor to a multi-objective problem, to address both issues and advance state-of-the-art performance. To handle the negative transfer issue, we first propose an Objective-aware Mixture-of-Experts (OMoE) module, utilizing objective-specific and objective-shared experts for parameter sharing while maintaining the distinction between objectives. To address the seesaw phenomenon, we then propose a Pareto Objective Routing (POR) module, adjusting the weights of learning objectives dynamically to achieve the Pareto optimum, with solid theoretical supports. We further present a Task-aware Mixture-of-Experts framework for achieving the Pareto optimum (TMoE-P) in multi-variate soft sensor, which consists of a stacked OMoE module and a POR module. We illustrate the efficacy of TMoE-P with an open soft sensor benchmark, where TMoE-P effectively alleviates the negative transfer and seesaw issues and outperforms the baseline models.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in MoE theory and gating functions, one of 12 directions in Mixture-of-experts. Builds on 7 of its 44 references that are in the map. First posted on arXiv 21 Feb 2023.

Builds on

7 of 44 references.

References · 7

  1. 2018Multi-Task Learning as Multi-Objective Optimizationcited by 809
  2. 2016Cross-stitch Networks for Multi-task Learningcited by 466
  3. 2016UberNet: Training a `Universal' Convolutional Neural Network for Low-, Mid-, and High-Level Vision using Diverse Datasets and Limited Memorycited by 200
  4. 2022ESCM2: Entire Space Counterfactual Multi-Task Model for Post-Click Conversion Rate Estimationcited by 47
  5. 2019Stochastic Filter Groups for Multi-Task CNNs: Learning Specialist and Generalist Convolution Kernelscited by 42
  6. 2017Latent Multi-task Architecture Learningcited by 29
  7. 2021GraSSNet: Graph Soft Sensing Neural Networkscited by 5

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2023Modeling Task Relationships in Multi-variate Soft Sensor with Balanced Mixture-of-Experts
  2. 2026ParetoPilot: Zero-Surrogate Offline Multi-Objective Optimization via Infer-Perturb-Guide Diffusion
  3. 2026Pareto-Conditioned Diffusion Models for Offline Multi-Objective Optimization
  4. 2024ParetoFlow: Guided Flows in Multi-Objective Optimization
  5. 2025Preference-Guided Diffusion for Multi-Objective Offline Optimization
  6. 2026Learning Where to Steer: Noise-Space Geometry for Efficient Offline Multi-Objective Optimization with Generative Models
  7. 2024Towards Efficient Pareto Set Approximation via Mixture of Experts Based Model Fusion
  8. 2026The Inference Engineering Pareto Atlas: Which Optimizations Dominate the Cost, Quality, and Latency Frontier?