Physics-Enforced Modeling for Insertion Loss of Transmission Lines by Deep Neural Networks
Liang Chen, Lesley Tan

TL;DR
This paper introduces physics-enforced deep learning methods to accurately model the insertion loss of transmission lines, ensuring physically valid positive values and improving prediction speed.
Contribution
It proposes two novel deep learning approaches that incorporate physical constraints to model insertion loss, addressing the issue of negative predictions in data-driven models.
Findings
Both methods ensure positive insertion loss predictions.
The polynomial-based DeepONet is faster in training.
Methods achieve comparable prediction accuracy.
Abstract
In this paper, we investigate data-driven parameterized modeling of insertion loss for transmission lines with respect to design parameters. We first show that direct application of neural networks can lead to non-physics models with negative insertion loss. To mitigate this problem, we propose two deep learning solutions. One solution is to add a regulation term, which represents the passive condition, to the final loss function to enforce the negative quantity of insertion loss. In the second method, a third-order polynomial expression is defined first, which ensures positiveness, to approximate the insertion loss, then DeepONet neural network structure, which was proposed recently for function and system modeling, was employed to model the coefficients of polynomials. The resulting neural network is applied to predict the coefficients of the polynomial expression. The experimental…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsModel Reduction and Neural Networks · Real-time simulation and control systems · Vibration and Dynamic Analysis
MethodsPart-based Convolutional Baseline
