Physics-Informed Neural Networks without Loss Balancing: A Direct Term Scaling Approach for Nonlinear 1D Problems

Physics-Informed Neural Networks without Loss... | F1000Research "use strict";function _typeof(t){return(_typeof="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t})(t)}!function(){var t=function(){var t,e,o=[],n=window,r=n;for(;r;){try{if(r.frames.__tcfapiLocator){t=r;break}}catch(t){}if(r===n.top)break;r=r.parent}t||(!function t(){var e=n.document,o=!!n.frames.__tcfapiLocator;if(!o)if(e.body){var r=e.createElement("iframe");r.style.cssText="display:none",r.name="__tcfapiLocator",e.body.appendChild(r)}else setTimeout(t,5);return!o}(),n.__tcfapi=function(){for(var t=arguments.length,n=new Array(t),r=0;r 3&&2===parseInt(n[1],10)&&"boolean"==typeof n[3]&&(e=n[3],"function"==typeof n[2]&&n[2]("set",!0)):"ping"===n[0]?"function"==typeof n[2]&&n[2]({gdprApplies:e,cmpLoaded:!1,cmpStatus:"stub"}):o.push(n)},n.addEventListener("message",(function(t){var e="string"==typeof t.data,o={};if(e)try{o=JSON.parse(t.data)}catch(t){}else o=t.data;var n="object"===_typeof(o)&&null!==o?o.__tcfapiCall:null;n&&window.__tcfapi(n.command,n.version,(function(o,r){var a={__tcfapiReturn:{returnValue:o,success:r,callId:n.callId}};t&&t.source&&t.source.postMessage&&t.source.postMessage(e?JSON.stringify(a):a,"*")}),n.parameter)}),!1))};"undefined"!=typeof module?module.exports=t:t()}(); dataLayer = dataLayer || []; // Standard GTM initialization - Google Consent Mode handles consent automatically (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start': new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0], j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src= 'https://www.googletagmanager.com/gtm.js?id='+i+dl+ '>m_auth=hzk0Vc3qFsQYhCrIoHz68A>m_preview=env-1>m_cookies_win=x';f.parentNode.insertBefore(j,f); })(window,document,'script','dataLayer','GTM-MWFK8L5J'); ;window.NREUM||(NREUM={});NREUM.init={distributed_tracing:{enabled:true},privacy:{cookies_enabled:true},ajax:{deny_list:["bam.nr-data.net"]}}; ;NREUM.loader_config={accountID:"438030",trustKey:"438030",agentID:"772317073",licenseKey:"97f8f67f26",applicationID:"772317073"} ;NREUM.info={beacon:"bam.nr-data.net",errorBeacon:"bam.nr-data.net",licenseKey:"97f8f67f26",applicationID:"772317073",sa:1} ;/*! For license information please see nr-loader-spa-1.236.0.min.js.LICENSE.txt */ (()=>{"use strict";var e,t,r={5763:(e,t,r)=>{r.d(t,{P_:()=>l,Mt:()=>g,C5:()=>s,DL:()=>v,OP:()=>T,lF:()=>D,Yu:()=>y,Dg:()=>h,CX:()=>c,GE:()=>b,sU:()=>_});var n=r(8632),i=r(9567);const o={beacon:n.ce.beacon,errorBeacon:n.ce.errorBeacon,licenseKey:void 0,applicationID:void 0,sa:void 0,queueTime:void 0,applicationTime:void 0,ttGuid:void 0,user:void 0,account:void 0,product:void 0,extra:void 0,jsAttributes:{},userAttributes:void 0,atts:void 0,transactionName:void 0,tNamePlain:void 0},a={};function s(e){if(!e)throw new Error("All info objects require an agent identifier!");if(!a[e])throw new Error("Info for ".concat(e," was never set"));return a[e]}function c(e,t){if(!e)throw new Error("All info objects require an agent identifier!");a[e]=(0,i.D)(t,o),(0,n.Qy)(e,a[e],"info")}var u=r(7056);const d=()=>{const e={blockSelector:"[data-nr-block]",maskInputOptions:{password:!0}};return{allow_bfcache:!0,privacy:{cookies_enabled:!0},ajax:{deny_list:void 0,enabled:!0,harvestTimeSeconds:10},distributed_tracing:{enabled:void 0,exclude_newrelic_header:void 0,cors_use_newrelic_header:void 0,cors_use_tracecontext_headers:void 0,allowed_origins:void 0},session:{domain:void 0,expiresMs:u.oD,inactiveMs:u.Hb},ssl:void 0,obfuscate:void 0,jserrors:{enabled:!0,harvestTimeSeconds:10},metrics:{enabled:!0},page_action:{enabled:!0,harvestTimeSeconds:30},page_view_event:{enabled:!0},page_view_timing:{enabled:!0,harvestTimeSeconds:30,long_task:!1},session_trace:{enabled:!0,harvestTimeSeconds:10},harvest:{tooManyRequestsDelay:60},session_replay:{enabled:!1,harvestTimeSeconds:60,sampleRate:.1,errorSampleRate:.1,maskTextSelector:"*",maskAllInputs:!0,get blockClass(){return"nr-block"},get ignoreClass(){return"nr-ignore"},get maskTextClass(){return"nr-mask"},get blockSelector(){return e.blockSelector},set blockSelector(t){e.blockSelector+=",".concat(t)},get maskInputOptions(){return e.maskInputOptions},set maskInputOptions(t){e.maskInputOptions={...t,password:!0}}},spa:{enabled:!0,harvestTimeSeconds:10}}},f={};function l(e){if(!e)throw new Error("All configuration objects require an agent identifier!");if(!f[e])throw new Error("Configuration for ".concat(e," was never set"));return f[e]}function h(e,t){if(!e)throw new Error("All configuration objects require an agent identifier!");f[e]=(0,i.D)(t,d()),(0,n.Qy)(e,f[e],"config")}function g(e,t){if(!e)throw new Error("All configuration objects require an agent identifier!");var r=l(e);if(r){for(var n=t.split("."),i=0;i {r.d(t,{D:()=>i});var n=r(50);function i(e,t){try{if(!e||"object"!=typeof e)return(0,n.Z)("Setting a Configurable requires an object as input");if(!t||"object"!=typeof t)return(0,n.Z)("Setting a Configurable requires a model to set its initial properties");const r=Object.create(Object.getPrototypeOf(t),Object.getOwnPropertyDescriptors(t)),o=0===Object.keys(r).length?e:r;for(let a in o)if(void 0!==e[a])try{"object"==typeof e[a]&&"object"==typeof t[a]?r[a]=i(e[a],t[a]):r[a]=e[a]}catch(e){(0,n.Z)("An error occurred while setting a property of a Configurable",e)}return r}catch(e){(0,n.Z)("An error occured while setting a Configurable",e)}}},6818:(e,t,r)=>{r.d(t,{Re:()=>i,gF:()=>o,q4:()=>n});const n="1.236.0",i="PROD",o="CDN"},385:(e,t,r)=>{r.d(t,{FN:()=>a,IF:()=>u,Nk:()=>f,Tt:()=>s,_A:()=>o,il:()=>n,pL:()=>c,v6:()=>i,w1:()=>d});const n="undefined"!=typeof window&&!!window.document,i="undefined"!=typeof WorkerGlobalScope&&("undefined"!=typeof self&&self instanceof WorkerGlobalScope&&self.navigator instanceof WorkerNavigator||"undefined"!=typeof globalThis&&globalThis instanceof WorkerGlobalScope&&globalThis.navigator instanceof WorkerNavigator),o=n?window:"undefined"!=typeof WorkerGlobalScope&&("undefined"!=typeof self&&self instanceof WorkerGlobalScope&&self||"undefined"!=typeof globalThis&&globalThis instanceof WorkerGlobalScope&&globalThis),a=""+o?.location,s=/iPad|iPhone|iPod/.test(navigator.userAgent),c=s&&"undefined"==typeof SharedWorker,u=(()=>{const e=navigator.userAgent.match(/Firefox[/\s](\d+\.\d+)/);return Array.isArray(e)&&e.length>=2?+e[1]:0})(),d=Boolean(n&&window.document.documentMode),f=!!navigator.sendBeacon},1117:(e,t,r)=>{r.d(t,{w:()=>o});var n=r(50);const i={agentIdentifier:"",ee:void 0};class o{constructor(e){try{if("object"!=typeof e)return(0,n.Z)("shared context requires an object as input");this.sharedContext={},Object.assign(this.sharedContext,i),Object.entries(e).forEach((e=>{let[t,r]=e;Object.keys(i).includes(t)&&(this.sharedContext[t]=r)}))}catch(e){(0,n.Z)("An error occured while setting SharedContext",e)}}}},8e3:(e,t,r)=>{r.d(t,{L:()=>d,R:()=>c});var n=r(2177),i=r(1284),o=r(4322),a=r(3325);const s={};function c(e,t){const r={staged:!1,priority:a.p[t]||0};u(e),s[e].get(t)||s[e].set(t,r)}function u(e){e&&(s[e]||(s[e]=new Map))}function d(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:"",t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:"feature";if(u(e),!e||!s[e].get(t))return a(t);s[e].get(t).staged=!0;const r=[...s[e]];function a(t){const r=e?n.ee.get(e):n.ee,a=o.X.handlers;if(r.backlog&&a){var s=r.backlog[t],c=a[t];if(c){for(var u=0;s&&u {let[t,r]=e;return r.staged}))&&(r.sort(((e,t)=>e[1].priority-t[1].priority)),r.forEach((e=>{let[t]=e;a(t)})))}function f(e,t){var r=e[1];(0,i.D)(t[r],(function(t,r){var n=e[0];if(r[0]===n){var i=r[1],o=e[3],a=e[2];i.apply(o,a)}}))}},2177:(e,t,r)=>{r.d(t,{c:()=>f,ee:()=>u});var n=r(8632),i=r(2210),o=r(1284),a=r(5763),s="nr@context";let c=(0,n.fP)();var u;function d(){}function f(e){return(0,i.X)(e,s,l)}function l(){return new d}function h(){u.aborted=!0,u.backlog={}}c.ee?u=c.ee:(u=function e(t,r){var n={},c={},f={},g=!1;try{g=16===r.length&&(0,a.OP)(r).isolatedBacklog}catch(e){}var p={on:b,addEventListener:b,removeEventListener:y,emit:v,get:x,listeners:w,context:m,buffer:A,abort:h,aborted:!1,isBuffering:E,debugId:r,backlog:g?{}:t&&"object"==typeof t.backlog?t.backlog:{}};return p;function m(e){return e&&e instanceof d?e:e?(0,i.X)(e,s,l):l()}function v(e,r,n,i,o){if(!1!==o&&(o=!0),!u.aborted||i){t&&o&&t.emit(e,r,n);for(var a=m(n),s=w(e),d=s.length,f=0;fn,p:()=>i});var n=r(2177).ee.get("handle");function i(e,t,r,i,o){o?(o.buffer([e],i),o.emit(e,t,r)):(n.buffer([e],i),n.emit(e,t,r))}},4322:(e,t,r)=>{r.d(t,{X:()=>o});var n=r(5546);o.on=a;var i=o.handlers={};function o(e,t,r,o){a(o||n.E,i,e,t,r)}function a(e,t,r,i,o){o||(o="feature"),e||(e=n.E);var a=t[o]=t[o]||{};(a[r]=a[r]||[]).push([e,i])}},3239:(e,t,r)=>{r.d(t,{bP:()=>s,iz:()=>c,m$:()=>a});var n=r(385);let i=!1,o=!1;try{const e={get passive(){return i=!0,!1},get signal(){return o=!0,!1}};n._A.addEventListener("test",null,e),n._A.removeEventListener("test",null,e)}catch(e){}function a(e,t){return i||o?{capture:!!e,passive:i,signal:t}:!!e}function s(e,t){let r=arguments.length>2&&void 0!==arguments[2]&&arguments[2],n=arguments.length>3?arguments[3]:void 0;window.addEventListener(e,t,a(r,n))}function c(e,t){let r=arguments.length>2&&void 0!==arguments[2]&&arguments[2],n=arguments.length>3?arguments[3]:void 0;document.addEventListener(e,t,a(r,n))}},4402:(e,t,r)=>{r.d(t,{Ht:()=>u,M:()=>c,Rl:()=>a,ky:()=>s});var n=r(385);const i="xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx";function o(e,t){return e?15&e[t]:16*Math.random()|0}function a(){const e=n._A?.crypto||n._A?.msCrypto;let t,r=0;return e&&e.getRandomValues&&(t=e.getRandomValues(new Uint8Array(31))),i.split("").map((e=>"x"===e?o(t,++r).toString(16):"y"===e?(3&o()|8).toString(16):e)).join("")}function s(e){const t=n._A?.crypto||n._A?.msCrypto;let r,i=0;t&&t.getRandomValues&&(r=t.getRandomValues(new Uint8Array(31)));const a=[];for(var s=0;s {r.d(t,{Bq:()=>n,Hb:()=>o,oD:()=>i});const n="NRBA",i=144e5,o=18e5},7894:(e,t,r)=>{function n(){return Math.round(performance.now())}r.d(t,{z:()=>n})},7243:(e,t,r)=>{r.d(t,{e:()=>o});var n=r(385),i={};function o(e){if(e in i)return i[e];if(0===(e||"").indexOf("data:"))return{protocol:"data"};let t;var r=n._A?.location,o={};if(n.il)t=document.createElement("a"),t.href=e;else try{t=new URL(e,r.href)}catch(e){return o}o.port=t.port;var a=t.href.split("://");!o.port&&a[1]&&(o.port=a[1].split("/")[0].split("@").pop().split(":")[1]),o.port&&"0"!==o.port||(o.port="https"===a[0]?"443":"80"),o.hostname=t.hostname||r.hostname,o.pathname=t.pathname,o.protocol=a[0],"/"!==o.pathname.charAt(0)&&(o.pathname="/"+o.pathname);var s=!t.protocol||":"===t.protocol||t.protocol===r.protocol,c=t.hostname===r.hostname&&t.port===r.port;return o.sameOrigin=s&&(!t.hostname||c),"/"===o.pathname&&(i[e]=o),o}},50:(e,t,r)=>{function n(e,t){"function"==typeof console.warn&&(console.warn("New Relic: ".concat(e)),t&&console.warn(t))}r.d(t,{Z:()=>n})},2587:(e,t,r)=>{r.d(t,{N:()=>c,T:()=>u});var n=r(2177),i=r(5546),o=r(8e3),a=r(3325);const s={stn:[a.D.sessionTrace],err:[a.D.jserrors,a.D.metrics],ins:[a.D.pageAction],spa:[a.D.spa],sr:[a.D.sessionReplay,a.D.sessionTrace]};function c(e,t){const r=n.ee.get(t);e&&"object"==typeof e&&(Object.entries(e).forEach((e=>{let[t,n]=e;void 0===u[t]&&(s[t]?s[t].forEach((e=>{n?(0,i.p)("feat-"+t,[],void 0,e,r):(0,i.p)("block-"+t,[],void 0,e,r),(0,i.p)("rumresp-"+t,[Boolean(n)],void 0,e,r)})):n&&(0,i.p)("feat-"+t,[],void 0,void 0,r),u[t]=Boolean(n))})),Object.keys(s).forEach((e=>{void 0===u[e]&&(s[e]?.forEach((t=>(0,i.p)("rumresp-"+e,[!1],void 0,t,r))),u[e]=!1)})),(0,o.L)(t,a.D.pageViewEvent))}const u={}},2210:(e,t,r)=>{r.d(t,{X:()=>i});var n=Object.prototype.hasOwnProperty;function i(e,t,r){if(n.call(e,t))return e[t];var i=r();if(Object.defineProperty&&Object.keys)try{return Object.defineProperty(e,t,{value:i,writable:!0,enumerable:!1}),i}catch(e){}return e[t]=i,i}},1284:(e,t,r)=>{r.d(t,{D:()=>n});const n=(e,t)=>Object.entries(e||{}).map((e=>{let[r,n]=e;return t(r,n)}))},4351:(e,t,r)=>{r.d(t,{P:()=>o});var n=r(2177);const i=()=>{const e=new WeakSet;return(t,r)=>{if("object"==typeof r&&null!==r){if(e.has(r))return;e.add(r)}return r}};function o(e){try{return JSON.stringify(e,i())}catch(e){try{n.ee.emit("internal-error",[e])}catch(e){}}}},3960:(e,t,r)=>{r.d(t,{K:()=>a,b:()=>o});var n=r(3239);function i(){return"undefined"==typeof document||"complete"===document.readyState}function o(e,t){if(i())return e();(0,n.bP)("load",e,t)}function a(e){if(i())return e();(0,n.iz)("DOMContentLoaded",e)}},8632:(e,t,r)=>{r.d(t,{EZ:()=>u,Qy:()=>c,ce:()=>o,fP:()=>a,gG:()=>d,mF:()=>s});var n=r(7894),i=r(385);const o={beacon:"bam.nr-data.net",errorBeacon:"bam.nr-data.net"};function a(){return i._A.NREUM||(i._A.NREUM={}),void 0===i._A.newrelic&&(i._A.newrelic=i._A.NREUM),i._A.NREUM}function s(){let e=a();return e.o||(e.o={ST:i._A.setTimeout,SI:i._A.setImmediate,CT:i._A.clearTimeout,XHR:i._A.XMLHttpRequest,REQ:i._A.Request,EV:i._A.Event,PR:i._A.Promise,MO:i._A.MutationObserver,FETCH:i._A.fetch}),e}function c(e,t,r){let i=a();const o=i.initializedAgents||{},s=o[e]||{};return Object.keys(s).length||(s.initializedAt={ms:(0,n.z)(),date:new Date}),i.initializedAgents={...o,[e]:{...s,[r]:t}},i}function u(e,t){a()[e]=t}function d(){return function(){let e=a();const t=e.info||{};e.info={beacon:o.beacon,errorBeacon:o.errorBeacon,...t}}(),function(){let e=a();const t=e.init||{};e.init={...t}}(),s(),function(){let e=a();const t=e.loader_config||{};e.loader_config={...t}}(),a()}},7956:(e,t,r)=>{r.d(t,{N:()=>i});var n=r(3239);function i(e){let t=arguments.length>1&&void 0!==arguments[1]&&arguments[1],r=arguments.length>2?arguments[2]:void 0,i=arguments.length>3?arguments[3]:void 0;return void(0,n.iz)("visibilitychange",(function(){if(t)return void("hidden"==document.visibilityState&&e());e(document.visibilityState)}),r,i)}},1214:(e,t,r)=>{r.d(t,{em:()=>v,u5:()=>N,QU:()=>S,_L:()=>I,Gm:()=>L,Lg:()=>M,gy:()=>U,BV:()=>Q,Kf:()=>ee});var n=r(2177);const i="nr@original";var o=Object.prototype.hasOwnProperty,a=!1;function s(e,t){return e||(e=n.ee),r.inPlace=function(e,t,n,i,o){n||(n="");var a,s,c,u="-"===n.charAt(0);for(c=0;c 2?n-2:0),o=2;o {r(A[T],e,w),r(E[T],e,w)})),r(l._A,"fetch",y),t.on(y+"end",(function(e,r){var n=this;if(r){var i=r.headers.get("content-length");null!==i&&(n.rxSize=i),t.emit(y+"done",[null,r],n)}else t.emit(y+"done",[e],n)})),t}const O={},j=["pushState","replaceState"];function S(e){const t=function(e){return(e||n.ee).get("history")}(e);return!l.il||O[t.debugId]++||(O[t.debugId]=1,s(t).inPlace(window.history,j,"-")),t}var P=r(3239);const C={},R=["appendChild","insertBefore","replaceChild"];function I(e){const t=function(e){return(e||n.ee).get("jsonp")}(e);if(!l.il||C[t.debugId])return t;C[t.debugId]=!0;var r=s(t),i=/[?&](?:callback|cb)=([^&#]+)/,o=/(.*)\.([^.]+)/,a=/^(\w+)(\.|$)(.*)$/;function c(e,t){var r=e.match(a),n=r[1],i=r[3];return i?c(i,t[n]):t[n]}return r.inPlace(Node.prototype,R,"dom-"),t.on("dom-start",(function(e){!function(e){if(!e||"string"!=typeof e.nodeName||"script"!==e.nodeName.toLowerCase())return;if("function"!=typeof e.addEventListener)return;var n=(a=e.src,s=a.match(i),s?s[1]:null);var a,s;if(!n)return;var u=function(e){var t=e.match(o);if(t&&t.length>=3)return{key:t[2],parent:c(t[1],window)};return{key:e,parent:window}}(n);if("function"!=typeof u.parent[u.key])return;var d={};function f(){t.emit("jsonp-end",[],d),e.removeEventListener("load",f,(0,P.m$)(!1)),e.removeEventListener("error",l,(0,P.m$)(!1))}function l(){t.emit("jsonp-error",[],d),t.emit("jsonp-end",[],d),e.removeEventListener("load",f,(0,P.m$)(!1)),e.removeEventListener("error",l,(0,P.m$)(!1))}r.inPlace(u.parent,[u.key],"cb-",d),e.addEventListener("load",f,(0,P.m$)(!1)),e.addEventListener("error",l,(0,P.m$)(!1)),t.emit("new-jsonp",[e.src],d)}(e[0])})),t}var k=r(5763);const H={};function L(e){const t=function(e){return(e||n.ee).get("mutation")}(e);if(!l.il||H[t.debugId])return t;H[t.debugId]=!0;var r=s(t),i=k.Yu.MO;return i&&(window.MutationObserver=function(e){return this instanceof i?new i(r(e,"fn-")):i.apply(this,arguments)},MutationObserver.prototype=i.prototype),t}const z={};function M(e){const t=function(e){return(e||n.ee).get("promise")}(e);if(z[t.debugId])return t;z[t.debugId]=!0;var r=n.c,o=s(t),a=k.Yu.PR;return a&&function(){function e(r){var n=t.context(),i=o(r,"executor-",n,null,!1);const s=Reflect.construct(a,[i],e);return t.context(s).getCtx=function(){return n},s}l._A.Promise=e,Object.defineProperty(e,"name",{value:"Promise"}),e.toString=function(){return a.toString()},Object.setPrototypeOf(e,a),["all","race"].forEach((function(r){const n=a[r];e[r]=function(e){let i=!1;[...e||[]].forEach((e=>{this.resolve(e).then(a("all"===r),a(!1))}));const o=n.apply(this,arguments);return o;function a(e){return function(){t.emit("propagate",[null,!i],o,!1,!1),i=i||!e}}}})),["resolve","reject"].forEach((function(r){const n=a[r];e[r]=function(e){const r=n.apply(this,arguments);return e!==r&&t.emit("propagate",[e,!0],r,!1,!1),r}})),e.prototype=a.prototype;const n=a.prototype.then;a.prototype.then=function(){var e=this,i=r(e);i.promise=e;for(var a=arguments.length,s=new Array(a),c=0;c e())),t};function m(e,t){i.inPlace(t,["onreadystatechange"],"fn-",E)}function b(){var e=this,t=r.context(e);e.readyState>3&&!t.resolved&&(t.resolved=!0,r.emit("xhr-resolved",[],e)),i.inPlace(e,f,"fn-",E)}if(function(e,t){for(var r in e)t[r]=e[r]}(o,p),p.prototype=o.prototype,i.inPlace(p.prototype,J,"-xhr-",E),r.on("send-xhr-start",(function(e,t){m(e,t),function(e){h.push(e),a&&(y?y.then(A):u?u(A):(w=-w,x.data=w))}(t)})),r.on("open-xhr-start",m),a){var y=c&&c.resolve();if(!u&&!c){var w=1,x=document.createTextNode(w);new a(A).observe(x,{characterData:!0})}}else t.on("fn-end",(function(e){e[0]&&e[0].type===d||A()}));function A(){for(var e=0;e {r.d(t,{t:()=>n});const n=r(3325).D.ajax},6660:(e,t,r)=>{r.d(t,{A:()=>i,t:()=>n});const n=r(3325).D.jserrors,i="nr@seenError"},3081:(e,t,r)=>{r.d(t,{gF:()=>o,mY:()=>i,t9:()=>n,vz:()=>s,xS:()=>a});const n=r(3325).D.metrics,i="sm",o="cm",a="storeSupportabilityMetrics",s="storeEventMetrics"},4649:(e,t,r)=>{r.d(t,{t:()=>n});const n=r(3325).D.pageAction},7633:(e,t,r)=>{r.d(t,{Dz:()=>i,OJ:()=>a,qw:()=>o,t9:()=>n});const n=r(3325).D.pageViewEvent,i="firstbyte",o="domcontent",a="windowload"},9251:(e,t,r)=>{r.d(t,{t:()=>n});const n=r(3325).D.pageViewTiming},3614:(e,t,r)=>{r.d(t,{BST_RESOURCE:()=>i,END:()=>s,FEATURE_NAME:()=>n,FN_END:()=>u,FN_START:()=>c,PUSH_STATE:()=>d,RESOURCE:()=>o,START:()=>a});const n=r(3325).D.sessionTrace,i="bstResource",o="resource",a="-start",s="-end",c="fn"+a,u="fn"+s,d="pushState"},7836:(e,t,r)=>{r.d(t,{BODY:()=>A,CB_END:()=>E,CB_START:()=>u,END:()=>x,FEATURE_NAME:()=>i,FETCH:()=>_,FETCH_BODY:()=>v,FETCH_DONE:()=>m,FETCH_START:()=>p,FN_END:()=>c,FN_START:()=>s,INTERACTION:()=>l,INTERACTION_API:()=>d,INTERACTION_EVENTS:()=>o,JSONP_END:()=>b,JSONP_NODE:()=>g,JS_TIME:()=>T,MAX_TIMER_BUDGET:()=>a,REMAINING:()=>f,SPA_NODE:()=>h,START:()=>w,originalSetTimeout:()=>y});var n=r(5763);const i=r(3325).D.spa,o=["click","submit","keypress","keydown","keyup","change"],a=999,s="fn-start",c="fn-end",u="cb-start",d="api-ixn-",f="remaining",l="interaction",h="spaNode",g="jsonpNode",p="fetch-start",m="fetch-done",v="fetch-body-",b="jsonp-end",y=n.Yu.ST,w="-start",x="-end",A="-body",E="cb"+x,T="jsTime",_="fetch"},5938:(e,t,r)=>{r.d(t,{W:()=>o});var n=r(5763),i=r(2177);class o{constructor(e,t,r){this.agentIdentifier=e,this.aggregator=t,this.ee=i.ee.get(e,(0,n.OP)(this.agentIdentifier).isolatedBacklog),this.featureName=r,this.blocked=!1}}},9144:(e,t,r)=>{r.d(t,{j:()=>m});var n=r(3325),i=r(5763),o=r(5546),a=r(2177),s=r(7894),c=r(8e3),u=r(3960),d=r(385),f=r(50),l=r(3081),h=r(8632);function g(){const e=(0,h.gG)();["setErrorHandler","finished","addToTrace","inlineHit","addRelease","addPageAction","setCurrentRouteName","setPageViewName","setCustomAttribute","interaction","noticeError","setUserId"].forEach((t=>{e[t]=function(){for(var r=arguments.length,n=new Array(r),i=0;i 1?r-1:0),i=1;i {e.exposed&&e.api[t]&&o.push(e.api[t](...n))})),o.length>1?o:o[0]}(t,...n)}}))}var p=r(2587);function m(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{},m=arguments.length>2?arguments[2]:void 0,v=arguments.length>3?arguments[3]:void 0,{init:b,info:y,loader_config:w,runtime:x={loaderType:m},exposed:A=!0}=t;const E=(0,h.gG)();y||(b=E.init,y=E.info,w=E.loader_config),(0,i.Dg)(e,b||{}),(0,i.GE)(e,w||{}),(0,i.sU)(e,x),y.jsAttributes??={},d.v6&&(y.jsAttributes.isWorker=!0),(0,i.CX)(e,y),g();const T=function(e,t){t||(0,c.R)(e,"api");const h={};var g=a.ee.get(e),p=g.get("tracer"),m="api-",v=m+"ixn-";function b(t,r,n,o){const a=(0,i.C5)(e);return null===r?delete a.jsAttributes[t]:(0,i.CX)(e,{...a,jsAttributes:{...a.jsAttributes,[t]:r}}),x(m,n,!0,o||null===r?"session":void 0)(t,r)}function y(){}["setErrorHandler","finished","addToTrace","inlineHit","addRelease"].forEach((e=>h[e]=x(m,e,!0,"api"))),h.addPageAction=x(m,"addPageAction",!0,n.D.pageAction),h.setCurrentRouteName=x(m,"routeName",!0,n.D.spa),h.setPageViewName=function(t,r){if("string"==typeof t)return"/"!==t.charAt(0)&&(t="/"+t),(0,i.OP)(e).customTransaction=(r||"http://custom.transaction")+t,x(m,"setPageViewName",!0)()},h.setCustomAttribute=function(e,t){let r=arguments.length>2&&void 0!==arguments[2]&&arguments[2];if("string"==typeof e){if(["string","number"].includes(typeof t)||null===t)return b(e,t,"setCustomAttribute",r);(0,f.Z)("Failed to execute setCustomAttribute.\nNon-null value must be a string or number type, but a type of was provided."))}else(0,f.Z)("Failed to execute setCustomAttribute.\nName must be a string type, but a type of was provided."))},h.setUserId=function(e){if("string"==typeof e||null===e)return b("enduser.id",e,"setUserId",!0);(0,f.Z)("Failed to execute setUserId.\nNon-null value must be a string type, but a type of was provided."))},h.interaction=function(){return(new y).get()};var w=y.prototype={createTracer:function(e,t){var r={},i=this,a="function"==typeof t;return(0,o.p)(v+"tracer",[(0,s.z)(),e,r],i,n.D.spa,g),function(){if(p.emit((a?"":"no-")+"fn-start",[(0,s.z)(),i,a],r),a)try{return t.apply(this,arguments)}catch(e){throw p.emit("fn-err",[arguments,this,"string"==typeof e?new Error(e):e],r),e}finally{p.emit("fn-end",[(0,s.z)()],r)}}}};function x(e,t,r,i){return function(){return(0,o.p)(l.xS,["API/"+t+"/called"],void 0,n.D.metrics,g),i&&(0,o.p)(e+t,[(0,s.z)(),...arguments],r?null:this,i,g),r?void 0:this}}function A(){r.e(439).then(r.bind(r,7438)).then((t=>{let{setAPI:r}=t;r(e),(0,c.L)(e,"api")})).catch((()=>(0,f.Z)("Downloading runtime APIs failed...")))}return["actionText","setName","setAttribute","save","ignore","onEnd","getContext","end","get"].forEach((e=>{w[e]=x(v,e,void 0,n.D.spa)})),h.noticeError=function(e,t){"string"==typeof e&&(e=new Error(e)),(0,o.p)(l.xS,["API/noticeError/called"],void 0,n.D.metrics,g),(0,o.p)("err",[e,(0,s.z)(),!1,t],void 0,n.D.jserrors,g)},d.il?(0,u.b)((()=>A()),!0):A(),h}(e,v);return(0,h.Qy)(e,T,"api"),(0,h.Qy)(e,A,"exposed"),(0,h.EZ)("activatedFeatures",p.T),T}},3325:(e,t,r)=>{r.d(t,{D:()=>n,p:()=>i});const n={ajax:"ajax",jserrors:"jserrors",metrics:"metrics",pageAction:"page_action",pageViewEvent:"page_view_event",pageViewTiming:"page_view_timing",sessionReplay:"session_replay",sessionTrace:"session_trace",spa:"spa"},i={[n.pageViewEvent]:1,[n.pageViewTiming]:2,[n.metrics]:3,[n.jserrors]:4,[n.ajax]:5,[n.sessionTrace]:6,[n.pageAction]:7,[n.spa]:8,[n.sessionReplay]:9}}},n={};function i(e){var t=n[e];if(void 0!==t)return t.exports;var o=n[e]={exports:{}};return r[e](o,o.exports,i),o.exports}i.m=r,i.d=(e,t)=>{for(var r in t)i.o(t,r)&&!i.o(e,r)&&Object.defineProperty(e,r,{enumerable:!0,get:t[r]})},i.f={},i.e=e=>Promise.all(Object.keys(i.f).reduce(((t,r)=>(i.f[r](e,t),t)),[])),i.u=e=>(({78:"page_action-aggregate",147:"metrics-aggregate",242:"session-manager",317:"jserrors-aggregate",348:"page_view_timing-aggregate",412:"lazy-feature-loader",439:"async-api",538:"recorder",590:"session_replay-aggregate",675:"compressor",733:"session_trace-aggregate",786:"page_view_event-aggregate",873:"spa-aggregate",898:"ajax-aggregate"}[e]||e)+"."+{78:"ac76d497",147:"3dc53903",148:"1a20d5fe",242:"2a64278a",317:"49e41428",348:"bd6de33a",412:"2f55ce66",439:"30bd804e",538:"1b18459f",590:"cf0efb30",675:"ae9f91a8",733:"83105561",786:"06482edd",860:"03a8b7a5",873:"e6b09d52",898:"998ef92b"}[e]+"-1.236.0.min.js"),i.o=(e,t)=>Object.prototype.hasOwnProperty.call(e,t),e={},t="NRBA:",i.l=(r,n,o,a)=>{if(e[r])e[r].push(n);else{var s,c;if(void 0!==o)for(var u=document.getElementsByTagName("script"),d=0;d {s.onerror=s.onload=null,clearTimeout(h);var i=e[r];if(delete e[r],s.parentNode&&s.parentNode.removeChild(s),i&&i.forEach((e=>e(n))),t)return t(n)},h=setTimeout(l.bind(null,void 0,{type:"timeout",target:s}),12e4);s.onerror=l.bind(null,s.onerror),s.onload=l.bind(null,s.onload),c&&document.head.appendChild(s)}},i.r=e=>{"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(e,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(e,"__esModule",{value:!0})},i.j=364,i.p="https://js-agent.newrelic.com/",(()=>{var e={364:0,953:0};i.f.j=(t,r)=>{var n=i.o(e,t)?e[t]:void 0;if(0!==n)if(n)r.push(n[2]);else{var o=new Promise(((r,i)=>n=e[t]=[r,i]));r.push(n[2]=o);var a=i.p+i.u(t),s=new Error;i.l(a,(r=>{if(i.o(e,t)&&(0!==(n=e[t])&&(e[t]=void 0),n)){var o=r&&("load"===r.type?"missing":r.type),a=r&&r.target&&r.target.src;s.message="Loading chunk "+t+" failed.\n("+o+": "+a+")",s.name="ChunkLoadError",s.type=o,s.request=a,n[1](s)}}),"chunk-"+t,t)}};var t=(t,r)=>{var n,o,[a,s,c]=r,u=0;if(a.some((t=>0!==e[t]))){for(n in s)i.o(s,n)&&(i.m[n]=s[n]);if(c)c(i)}for(t&&t(r);u {i.r(o);var e=i(3325),t=i(5763);const r=Object.values(e.D);function n(e){const n={};return r.forEach((r=>{n[r]=function(e,r){return!1!==(0,t.Mt)(r,"".concat(e,".enabled"))}(r,e)})),n}var a=i(9144);var s=i(5546),c=i(385),u=i(8e3),d=i(5938),f=i(3960),l=i(50);class h extends d.W{constructor(e,t,r){let n=!(arguments.length>3&&void 0!==arguments[3])||arguments[3];super(e,t,r),this.auto=n,this.abortHandler,this.featAggregate,this.onAggregateImported,n&&(0,u.R)(e,r)}importAggregator(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:{};if(this.featAggregate||!this.auto)return;const r=c.il&&!0===(0,t.Mt)(this.agentIdentifier,"privacy.cookies_enabled");let n;this.onAggregateImported=new Promise((e=>{n=e}));const o=async()=>{let t;try{if(r){const{setupAgentSession:e}=await Promise.all([i.e(860),i.e(242)]).then(i.bind(i,3228));t=e(this.agentIdentifier)}}catch(e){(0,l.Z)("A problem occurred when starting up session manager. This page will not start or extend any session.",e)}try{if(!this.shouldImportAgg(this.featureName,t))return void(0,u.L)(this.agentIdentifier,this.featureName);const{lazyFeatureLoader:r}=await i.e(412).then(i.bind(i,8582)),{Aggregate:o}=await r(this.featureName,"aggregate");this.featAggregate=new o(this.agentIdentifier,this.aggregator,e),n(!0)}catch(e){(0,l.Z)("Downloading and initializing ".concat(this.featureName," failed..."),e),this.abortHandler?.(),n(!1)}};c.il?(0,f.b)((()=>o()),!0):o()}shouldImportAgg(r,n){return r!==e.D.sessionReplay||!1!==(0,t.Mt)(this.agentIdentifier,"session_trace.enabled")&&(!!n?.isNew||!!n?.state.sessionReplay)}}var g=i(7633),p=i(7894);class m extends h{static featureName=g.t9;constructor(r,n){let i=!(arguments.length>2&&void 0!==arguments[2])||arguments[2];if(super(r,n,g.t9,i),("undefined"==typeof PerformanceNavigationTiming||c.Tt)&&"undefined"!=typeof PerformanceTiming){const n=(0,t.OP)(r);n[g.Dz]=Math.max(Date.now()-n.offset,0),(0,f.K)((()=>n[g.qw]=Math.max((0,p.z)()-n[g.Dz],0))),(0,f.b)((()=>{const t=(0,p.z)();n[g.OJ]=Math.max(t-n[g.Dz],0),(0,s.p)("timing",["load",t],void 0,e.D.pageViewTiming,this.ee)}))}this.importAggregator()}}var v=i(1117),b=i(1284);class y extends v.w{constructor(e){super(e),this.aggregatedData={}}store(e,t,r,n,i){var o=this.getBucket(e,t,r,i);return o.metrics=function(e,t){t||(t={count:0});return t.count+=1,(0,b.D)(e,(function(e,r){t[e]=w(r,t[e])})),t}(n,o.metrics),o}merge(e,t,r,n,i){var o=this.getBucket(e,t,n,i);if(o.metrics){var a=o.metrics;a.count+=r.count,(0,b.D)(r,(function(e,t){if("count"!==e){var n=a[e],i=r[e];i&&!i.c?a[e]=w(i.t,n):a[e]=function(e,t){if(!t)return e;t.c||(t=x(t.t));return t.min=Math.min(e.min,t.min),t.max=Math.max(e.max,t.max),t.t+=e.t,t.sos+=e.sos,t.c+=e.c,t}(i,a[e])}}))}else o.metrics=r}storeMetric(e,t,r,n){var i=this.getBucket(e,t,r);return i.stats=w(n,i.stats),i}getBucket(e,t,r,n){this.aggregatedData[e]||(this.aggregatedData[e]={});var i=this.aggregatedData[e][t];return i||(i=this.aggregatedData[e][t]={params:r||{}},n&&(i.custom=n)),i}get(e,t){return t?this.aggregatedData[e]&&this.aggregatedData[e][t]:this.aggregatedData[e]}take(e){for(var t={},r="",n=!1,i=0;i t.max&&(t.max=e),e 2&&void 0!==arguments[2])||arguments[2];super(e,r,j.t,n),c.il&&((0,t.OP)(e).initHidden=Boolean("hidden"===document.visibilityState),(0,N.N)((()=>(0,s.p)("docHidden",[(0,p.z)()],void 0,j.t,this.ee)),!0),(0,O.bP)("pagehide",(()=>(0,s.p)("winPagehide",[(0,p.z)()],void 0,j.t,this.ee))),this.importAggregator())}}var P=i(3081);class C extends h{static featureName=P.t9;constructor(e,t){let r=!(arguments.length>2&&void 0!==arguments[2])||arguments[2];super(e,t,P.t9,r),this.importAggregator()}}var R,I=i(2210),k=i(1214),H=i(2177),L={};try{R=localStorage.getItem("__nr_flags").split(","),console&&"function"==typeof console.log&&(L.console=!0,-1!==R.indexOf("dev")&&(L.dev=!0),-1!==R.indexOf("nr_dev")&&(L.nrDev=!0))}catch(e){}function z(e){try{L.console&&z(e)}catch(e){}}L.nrDev&&H.ee.on("internal-error",(function(e){z(e.stack)})),L.dev&&H.ee.on("fn-err",(function(e,t,r){z(r.stack)})),L.dev&&(z("NR AGENT IN DEVELOPMENT MODE"),z("flags: "+(0,b.D)(L,(function(e,t){return e})).join(", ")));var M=i(6660);class B extends h{static featureName=M.t;constructor(r,n){let i=!(arguments.length>2&&void 0!==arguments[2])||arguments[2];super(r,n,M.t,i),this.skipNext=0;try{this.removeOnAbort=new AbortController}catch(e){}const o=this;o.ee.on("fn-start",(function(e,t,r){o.abortHandler&&(o.skipNext+=1)})),o.ee.on("fn-err",(function(t,r,n){o.abortHandler&&!n[M.A]&&((0,I.X)(n,M.A,(function(){return!0})),this.thrown=!0,(0,s.p)("err",[n,(0,p.z)()],void 0,e.D.jserrors,o.ee))})),o.ee.on("fn-end",(function(){o.abortHandler&&!this.thrown&&o.skipNext>0&&(o.skipNext-=1)})),o.ee.on("internal-error",(function(t){(0,s.p)("ierr",[t,(0,p.z)(),!0],void 0,e.D.jserrors,o.ee)})),this.origOnerror=c._A.onerror,c._A.onerror=this.onerrorHandler.bind(this),c._A.addEventListener("unhandledrejection",(t=>{const r=function(e){let t="Unhandled Promise Rejection: ";if(e instanceof Error)try{return e.message=t+e.message,e}catch(t){return e}if(void 0===e)return new Error(t);try{return new Error(t+(0,D.P)(e))}catch(e){return new Error(t)}}(t.reason);(0,s.p)("err",[r,(0,p.z)(),!1,{unhandledPromiseRejection:1}],void 0,e.D.jserrors,this.ee)}),(0,O.m$)(!1,this.removeOnAbort?.signal)),(0,k.gy)(this.ee),(0,k.BV)(this.ee),(0,k.em)(this.ee),(0,t.OP)(r).xhrWrappable&&(0,k.Kf)(this.ee),this.abortHandler=this.#e,this.importAggregator()}#e(){this.removeOnAbort?.abort(),this.abortHandler=void 0}onerrorHandler(t,r,n,i,o){"function"==typeof this.origOnerror&&this.origOnerror(...arguments);try{this.skipNext?this.skipNext-=1:(0,s.p)("err",[o||new F(t,r,n),(0,p.z)()],void 0,e.D.jserrors,this.ee)}catch(t){try{(0,s.p)("ierr",[t,(0,p.z)(),!0],void 0,e.D.jserrors,this.ee)}catch(e){}}return!1}}function F(e,t,r){this.message=e||"Uncaught error with no additional information",this.sourceURL=t,this.line=r}let U=1;const q="nr@id";function G(e){const t=typeof e;return!e||"object"!==t&&"function"!==t?-1:e===c._A?0:(0,I.X)(e,q,(function(){return U++}))}function V(e){if("string"==typeof e&&e.length)return e.length;if("object"==typeof e){if("undefined"!=typeof ArrayBuffer&&e instanceof ArrayBuffer&&e.byteLength)return e.byteLength;if("undefined"!=typeof Blob&&e instanceof Blob&&e.size)return e.size;if(!("undefined"!=typeof FormData&&e instanceof FormData))try{return(0,D.P)(e).length}catch(e){return}}}var X=i(7243);class W{constructor(e){this.agentIdentifier=e,this.generateTracePayload=this.generateTracePayload.bind(this),this.shouldGenerateTrace=this.shouldGenerateTrace.bind(this)}generateTracePayload(e){if(!this.shouldGenerateTrace(e))return null;var r=(0,t.DL)(this.agentIdentifier);if(!r)return null;var n=(r.accountID||"").toString()||null,i=(r.agentID||"").toString()||null,o=(r.trustKey||"").toString()||null;if(!n||!i)return null;var a=(0,_.M)(),s=(0,_.Ht)(),c=Date.now(),u={spanId:a,traceId:s,timestamp:c};return(e.sameOrigin||this.isAllowedOrigin(e)&&this.useTraceContextHeadersForCors())&&(u.traceContextParentHeader=this.generateTraceContextParentHeader(a,s),u.traceContextStateHeader=this.generateTraceContextStateHeader(a,c,n,i,o)),(e.sameOrigin&&!this.excludeNewrelicHeader()||!e.sameOrigin&&this.isAllowedOrigin(e)&&this.useNewrelicHeaderForCors())&&(u.newrelicHeader=this.generateTraceHeader(a,s,c,n,i,o)),u}generateTraceContextParentHeader(e,t){return"00-"+t+"-"+e+"-01"}generateTraceContextStateHeader(e,t,r,n,i){return i+"@nr=0-1-"+r+"-"+n+"-"+e+"----"+t}generateTraceHeader(e,t,r,n,i,o){if(!("function"==typeof c._A?.btoa))return null;var a={v:[0,1],d:{ty:"Browser",ac:n,ap:i,id:e,tr:t,ti:r}};return o&&n!==o&&(a.d.tk=o),btoa((0,D.P)(a))}shouldGenerateTrace(e){return this.isDtEnabled()&&this.isAllowedOrigin(e)}isAllowedOrigin(e){var r=!1,n={};if((0,t.Mt)(this.agentIdentifier,"distributed_tracing")&&(n=(0,t.P_)(this.agentIdentifier).distributed_tracing),e.sameOrigin)r=!0;else if(n.allowed_origins instanceof Array)for(var i=0;i 2&&void 0!==arguments[2])||arguments[2];super(r,n,Z.t,i),(0,t.OP)(r).xhrWrappable&&(this.dt=new W(r),this.handler=(e,t,r,n)=>(0,s.p)(e,t,r,n,this.ee),(0,k.u5)(this.ee),(0,k.Kf)(this.ee),function(r,n,i,o){function a(e){var t=this;t.totalCbs=0,t.called=0,t.cbTime=0,t.end=E,t.ended=!1,t.xhrGuids={},t.lastSize=null,t.loadCaptureCalled=!1,t.params=this.params||{},t.metrics=this.metrics||{},e.addEventListener("load",(function(r){_(t,e)}),(0,O.m$)(!1)),c.IF||e.addEventListener("progress",(function(e){t.lastSize=e.loaded}),(0,O.m$)(!1))}function s(e){this.params={method:e[0]},T(this,e[1]),this.metrics={}}function u(e,n){var i=(0,t.DL)(r);i.xpid&&this.sameOrigin&&n.setRequestHeader("X-NewRelic-ID",i.xpid);var a=o.generateTracePayload(this.parsedOrigin);if(a){var s=!1;a.newrelicHeader&&(n.setRequestHeader("newrelic",a.newrelicHeader),s=!0),a.traceContextParentHeader&&(n.setRequestHeader("traceparent",a.traceContextParentHeader),a.traceContextStateHeader&&n.setRequestHeader("tracestate",a.traceContextStateHeader),s=!0),s&&(this.dt=a)}}function d(e,t){var r=this.metrics,i=e[0],o=this;if(r&&i){var a=V(i);a&&(r.txSize=a)}this.startTime=(0,p.z)(),this.listener=function(e){try{"abort"!==e.type||o.loadCaptureCalled||(o.params.aborted=!0),("load"!==e.type||o.called===o.totalCbs&&(o.onloadCalled||"function"!=typeof t.onload)&&"function"==typeof o.end)&&o.end(t)}catch(e){try{n.emit("internal-error",[e])}catch(e){}}};for(var s=0;s 1?e[1]=i:e.push(i)}else e[0]&&e[0].headers&&s(e[0].headers,n)&&(this.dt=n);function s(e,t){var r=!1;return t.newrelicHeader&&(e.set("newrelic",t.newrelicHeader),r=!0),t.traceContextParentHeader&&(e.set("traceparent",t.traceContextParentHeader),t.traceContextStateHeader&&e.set("tracestate",t.traceContextStateHeader),r=!0),r}}function x(e,t){this.params={},this.metrics={},this.startTime=(0,p.z)(),this.dt=t,e.length>=1&&(this.target=e[0]),e.length>=2&&(this.opts=e[1]);var r,n=this.opts||{},i=this.target;"string"==typeof i?r=i:"object"==typeof i&&i instanceof Y?r=i.url:c._A?.URL&&"object"==typeof i&&i instanceof URL&&(r=i.href),T(this,r);var o=(""+(i&&i instanceof Y&&i.method||n.method||"GET")).toUpperCase();this.params.method=o,this.txSize=V(n.body)||0}function A(t,r){var n;this.endTime=(0,p.z)(),this.params||(this.params={}),this.params.status=r?r.status:0,"string"==typeof this.rxSize&&this.rxSize.length>0&&(n=+this.rxSize);var o={txSize:this.txSize,rxSize:n,duration:(0,p.z)()-this.startTime};i("xhr",[this.params,o,this.startTime,this.endTime,"fetch"],this,e.D.ajax)}function E(t){var r=this.params,n=this.metrics;if(!this.ended){this.ended=!0;for(var o=0;o 2&&void 0!==arguments[2])||arguments[2];super(e,t,we.t,r),this.importAggregator()}}new class{constructor(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:(0,_.ky)(16);c._A?(this.agentIdentifier=t,this.sharedAggregator=new y({agentIdentifier:this.agentIdentifier}),this.features={},this.desiredFeatures=new Set(e.features||[]),this.desiredFeatures.add(m),Object.assign(this,(0,a.j)(this.agentIdentifier,e,e.loaderType||"agent")),this.start()):(0,l.Z)("Failed to initial the agent. Could not determine the runtime environment.")}get config(){return{info:(0,t.C5)(this.agentIdentifier),init:(0,t.P_)(this.agentIdentifier),loader_config:(0,t.DL)(this.agentIdentifier),runtime:(0,t.OP)(this.agentIdentifier)}}start(){const t="features";try{const r=n(this.agentIdentifier),i=[...this.desiredFeatures];i.sort(((t,r)=>e.p[t.featureName]-e.p[r.featureName])),i.forEach((t=>{if(r[t.featureName]||t.featureName===e.D.pageViewEvent){const n=function(t){switch(t){case e.D.ajax:return[e.D.jserrors];case e.D.sessionTrace:return[e.D.ajax,e.D.pageViewEvent];case e.D.sessionReplay:return[e.D.sessionTrace];case e.D.pageViewTiming:return[e.D.pageViewEvent];default:return[]}}(t.featureName);n.every((e=>r[e]))||(0,l.Z)("".concat(t.featureName," is enabled but one or more dependent features has been disabled (").concat((0,D.P)(n),"). This may cause unintended consequences or missing data...")),this.features[t.featureName]=new t(this.agentIdentifier,this.sharedAggregator)}})),(0,T.Qy)(this.agentIdentifier,this.features,t)}catch(e){(0,l.Z)("Failed to initialize all enabled instrument classes (agent aborted) -",e);for(const e in this.features)this.features[e].abortHandler?.();const r=(0,T.fP)();return delete r.initializedAgents[this.agentIdentifier]?.api,delete r.initializedAgents[this.agentIdentifier]?.[t],delete this.sharedAggregator,r.ee?.abort(),delete r.ee?.get(this.agentIdentifier),!1}}}({features:[J,m,S,class extends h{static featureName=oe;constructor(t,r){if(super(t,r,oe,!(arguments.length>2&&void 0!==arguments[2])||arguments[2]),!c.il)return;const n=this.ee;let i;(0,k.QU)(n),this.eventsEE=(0,k.em)(n),this.eventsEE.on(se,(function(e,t){this.bstStart=(0,p.z)()})),this.eventsEE.on(ae,(function(t,r){(0,s.p)("bst",[t[0],r,this.bstStart,(0,p.z)()],void 0,e.D.sessionTrace,n)})),n.on(ce+ne,(function(e){this.time=(0,p.z)(),this.startPath=location.pathname+location.hash})),n.on(ce+ie,(function(t){(0,s.p)("bstHist",[location.pathname+location.hash,this.startPath,this.time],void 0,e.D.sessionTrace,n)}));try{i=new PerformanceObserver((t=>{const r=t.getEntries();(0,s.p)(te,[r],void 0,e.D.sessionTrace,n)})),i.observe({type:re,buffered:!0})}catch(e){}this.importAggregator({resourceObserver:i})}},C,xe,B,class extends h{static featureName=de;constructor(e,r){if(super(e,r,de,!(arguments.length>2&&void 0!==arguments[2])||arguments[2]),!c.il)return;if(!(0,t.OP)(e).xhrWrappable)return;try{this.removeOnAbort=new AbortController}catch(e){}let n,i=0;const o=this.ee.get("tracer"),a=(0,k._L)(this.ee),s=(0,k.Lg)(this.ee),u=(0,k.BV)(this.ee),d=(0,k.Kf)(this.ee),f=this.ee.get("events"),l=(0,k.u5)(this.ee),h=(0,k.QU)(this.ee),g=(0,k.Gm)(this.ee);function m(e,t){h.emit("newURL",[""+window.location,t])}function v(){i++,n=window.location.hash,this[ve]=(0,p.z)()}function b(){i--,window.location.hash!==n&&m(0,!0);var e=(0,p.z)();this[pe]=~~this[pe]+e-this[ve],this[ye]=e}function y(e,t){e.on(t,(function(){this[t]=(0,p.z)()}))}this.ee.on(ve,v),s.on(be,v),a.on(be,v),this.ee.on(ye,b),s.on(ge,b),a.on(ge,b),this.ee.buffer([ve,ye,"xhr-resolved"],this.featureName),f.buffer([ve],this.featureName),u.buffer(["setTimeout"+le,"clearTimeout"+fe,ve],this.featureName),d.buffer([ve,"new-xhr","send-xhr"+fe],this.featureName),l.buffer([me+fe,me+"-done",me+he+fe,me+he+le],this.featureName),h.buffer(["newURL"],this.featureName),g.buffer([ve],this.featureName),s.buffer(["propagate",be,ge,"executor-err","resolve"+fe],this.featureName),o.buffer([ve,"no-"+ve],this.featureName),a.buffer(["new-jsonp","cb-start","jsonp-error","jsonp-end"],this.featureName),y(l,me+fe),y(l,me+"-done"),y(a,"new-jsonp"),y(a,"jsonp-end"),y(a,"cb-start"),h.on("pushState-end",m),h.on("replaceState-end",m),window.addEventListener("hashchange",m,(0,O.m$)(!0,this.removeOnAbort?.signal)),window.addEventListener("load",m,(0,O.m$)(!0,this.removeOnAbort?.signal)),window.addEventListener("popstate",(function(){m(0,i>1)}),(0,O.m$)(!0,this.removeOnAbort?.signal)),this.abortHandler=this.#e,this.importAggregator()}#e(){this.removeOnAbort?.abort(),this.abortHandler=void 0}}],loaderType:"spa"})})(),window.NRBA=o})(); window.jQuery || document.write(' ') CKEDITOR_BASEPATH='https://f1000research.com/js/vendor/ckeditor/' window.reactTheme = 'research'; window.MathJax = { CommonHTML: { linebreaks: { automatic: true } }, 'HTML-CSS': { linebreaks: { automatic: true } }, SVG: { linebreaks: { automatic: true } }, AuthorInit: function() { MathJax.Hub.Register.MessageHook('End Process', function () { let timeout = false; // holder for timeout id const delay = 250; // delay after event is "complete" to run callback const reflowMath = function() { const dispFormulas = document.querySelectorAll('.disp-formula.panel'); if (!dispFormulas) { return; } for (const dispFormula of dispFormulas) { const child = dispFormula.querySelector('.MathJax_Preview').nextSibling.firstChild; const isMultiline = MathJax.Hub.getAllJax(dispFormula)[0].root.isMultiline; if (dispFormula.offsetWidth < child.offsetWidth || isMultiline) { MathJax.Hub.Queue(['Rerender', MathJax.Hub, dispFormula]); } } }; window.addEventListener('resize', function() { clearTimeout(timeout); // clear the timeout timeout = setTimeout(reflowMath, delay); // start timing for event "completion" }); }); }, }; if (window.location.hash == '#_=_'){ window.location = window.location.href.split('#')[0] } !function(f,b,e,v,n,t,s){if(f.fbq)return;n=f.fbq=function() {n.callMethod? n.callMethod.apply(n,arguments):n.queue.push(arguments)} ;if(!f._fbq)f._fbq=n; n.push=n;n.loaded=!0;n.version='2.0';n.queue=[];t=b.createElement(e);t.async=!0; t.src=v;s=b.getElementsByTagName(e)[0];s.parentNode.insertBefore(t,s)}(window, document,'script','https://connect.facebook.net/en_US/fbevents.js'); fbq('init', '1641728616063202'); fbq('track', "PixelInitialized", {}); (function(h,o,t,j,a,r){ h.hj=h.hj||function(){(h.hj.q=h.hj.q||[]).push(arguments)}; h._hjSettings={hjid:2318163,hjsv:6}; a=o.getElementsByTagName('head')[0]; r=o.createElement('script');r.async=1; r.src=t+h._hjSettings.hjid+j+h._hjSettings.hjsv; a.appendChild(r); })(window,document,'https://static.hotjar.com/c/hotjar-','.js?sv='); search file_upload Submit your research search menu close search Browse Gateways & Collections How to Publish Submit your Research My Submissions Article Guidelines Article Guidelines (New Versions) Open Data, Software and Code Guidelines Open Data and Accessible Source Materials Guidelines (HSS) Open Data, Software and Code Guidelines (PSE) Prepublication Checks Production Process Posters and Slides Guidelines Document Guidelines Article Processing Charges Peer Review Finding Article Reviewers About How it Works For Reviewers Our Advisors Policies Glossary FAQs For Developers Newsroom Contact My Research Submissions Content and Tracking Alerts My Details Sign In file_upload Submit your research { "@context": "https://schema.org", "@type": "ScholarlyArticle", "mainEntityOfPage": { "@type": "WebPage", "@id": "https://f1000research.com/articles/14-1252" }, "headline": "Physics-Informed Neural Networks without Loss Balancing: A Direct Term Scaling Approach for Nonlinear 1D...", "datePublished": "2025-11-14T16:25:06", "dateModified": "2026-01-24T06:59:55", "author": [ { "@type": "Person", "name": "Theodosios Theodosiou" }, { "@type": "Person", "name": "Christoforos Rekatsinas" } ], "publisher": { "@type": "Organization", "name": "F1000Research", "logo": { "@type": "ImageObject", "url": "https://f1000research.com/img/AMP/F1000Research_image.png", "height": 480, "width": 60 } }, "image": { "@type": "ImageObject", "url": "https://f1000research.com/img/AMP/F1000Research_image.png", "height": 1200, "width": 150 }, "description": "Physics-Informed Neural Networks (PINNs) have gained significant attention for solving differential equations, yet their efficiency is often hindered by the need for intricate and computationally costly loss-balancing techniques to address residual term imbalance. This paper introduces a direct differential equation term scaling framework that removes the loss-balancing bottleneck entirely. By scaling each term in the governing equations using characteristic physical dimensions, the proposed method ensures numerical consistency across all contributions, eliminating the need for adaptive weighting during training. This not only simplifies the PINN formulation but also improves stability and convergence. The approach is validated on challenging nonlinear one-dimensional elasticity problems, demonstrating that high-accuracy solutions can be obtained with compact neural network architectures and reducing floating-point operations by at least two orders of magnitude. A reverse scaling step restores the solution to the original physical domain, preserving physical interpretability. The results demonstrate that direct term scaling transforms PINN training into an efficient, and easily deployable process, paving the way for broader adoption in computational mechanics and other physics-driven domains." } { "@context": "http://schema.org", "@type": "BreadcrumbList", "itemListElement": [ { "@type": "ListItem", "position": "1", "item": { "@id": "https://f1000research.com/", "name": "Home" } }, { "@type": "ListItem", "position": "2", "item": { "@id": "https://f1000research.com/browse/articles", "name": "Browse" } }, { "@type": "ListItem", "position": "3", "item": { "@id": "https://f1000research.com/articles/14-1252/v1", "name": "Physics-Informed Neural Networks without Loss Balancing: A Direct..." } } ] } Home Browse Physics-Informed Neural Networks without Loss Balancing: A Direct... ALL Metrics - Views Downloads Get PDF Get XML Cite How to cite this article Theodosiou T and Rekatsinas C. Physics-Informed Neural Networks without Loss Balancing: A Direct Term Scaling Approach for Nonlinear 1D Problems [version 1; peer review: 1 approved with reservations] . F1000Research 2025, 14 :1252 ( https://doi.org/10.12688/f1000research.169129.1 ) NOTE: If applicable, it is important to ensure the information in square brackets after the title is included in all citations of this article. Close Copy Citation Details Export Export Citation Sciwheel EndNote Ref. Manager Bibtex ProCite Sente EXPORT Select a format first Track Share ▬ ✚ Research Article Physics-Informed Neural Networks without Loss Balancing: A Direct Term Scaling Approach for Nonlinear 1D Problems [version 1; peer review: 1 approved with reservations] Theodosios Theodosiou https://orcid.org/0000-0001-6938-1399 1 , Christoforos Rekatsinas https://orcid.org/0000-0001-5538-2497 2 Theodosios Theodosiou https://orcid.org/0000-0001-6938-1399 1 , Christoforos Rekatsinas https://orcid.org/0000-0001-5538-2497 2 PUBLISHED 14 Nov 2025 Author details Author details 1 Dept. of Energy Systems, University of Thessaly - Larissa, Larissa, Thessalia - Larissa, 41500, Greece 2 Institute of Informatics and Telecommunications, Ethniko Kentro Ereunas Physikon Epistemon Demokritos, Athens, Attica, 15341, Greece Theodosios Theodosiou Roles: Conceptualization, Formal Analysis, Investigation, Methodology, Software, Supervision, Validation, Visualization, Writing – Original Draft Preparation, Writing – Review & Editing Christoforos Rekatsinas Roles: Conceptualization, Formal Analysis, Investigation, Methodology, Validation, Writing – Original Draft Preparation, Writing – Review & Editing OPEN PEER REVIEW DETAILS REVIEWER STATUS This article is included in the HEAL1000 gateway. Abstract Physics-Informed Neural Networks (PINNs) have gained significant attention for solving differential equations, yet their efficiency is often hindered by the need for intricate and computationally costly loss-balancing techniques to address residual term imbalance. This paper introduces a direct differential equation term scaling framework that removes the loss-balancing bottleneck entirely. By scaling each term in the governing equations using characteristic physical dimensions, the proposed method ensures numerical consistency across all contributions, eliminating the need for adaptive weighting during training. This not only simplifies the PINN formulation but also improves stability and convergence. The approach is validated on challenging nonlinear one-dimensional elasticity problems, demonstrating that high-accuracy solutions can be obtained with compact neural network architectures and reducing floating-point operations by at least two orders of magnitude. A reverse scaling step restores the solution to the original physical domain, preserving physical interpretability. The results demonstrate that direct term scaling transforms PINN training into an efficient, and easily deployable process, paving the way for broader adoption in computational mechanics and other physics-driven domains. READ ALL READ LESS Keywords Compact High-Accuracy PINNs, Physics-Consistent Normalization, Loss-Balancing Elimination Corresponding Author(s) Theodosios Theodosiou ( [email protected] ) Close Corresponding author: Theodosios Theodosiou Competing interests: No competing interests were disclosed. Grant information: The author(s) declared that no grants were involved in supporting this work. Copyright: © 2025 Theodosiou T and Rekatsinas C. This is an open access article distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. How to cite: Theodosiou T and Rekatsinas C. Physics-Informed Neural Networks without Loss Balancing: A Direct Term Scaling Approach for Nonlinear 1D Problems [version 1; peer review: 1 approved with reservations] . F1000Research 2025, 14 :1252 ( https://doi.org/10.12688/f1000research.169129.1 ) First published: 14 Nov 2025, 14 :1252 ( https://doi.org/10.12688/f1000research.169129.1 ) Latest published: 24 Jan 2026, 14 :1252 ( https://doi.org/10.12688/f1000research.169129.2 )  There is a newer version of this article available. Suppress this message for one day. 1. Introduction Current state of the art. Physics-Informed Neural Networks (PINNs) 1 have emerged as a powerful and innovative approach to solving ordinary and partial differential equations (ODEs/PDEs). By integrating deep or shallow machine learning with physical principles, PINNs approximate solutions to these differential equations through optimization techniques. The process involves constructing a composite loss function that includes several components: (a) the residual of the ODE/PDE, which measures how well the solution satisfies the equation, (b) the initial conditions, which represent the state at the starting point, and (c) the boundary conditions, which describe the behavior at the edges of the domain. This method has shown great promise in various fields, such as fluid dynamics, material science, and inverse problems, because it can effectively handle complex, high-dimensional systems without relying on traditional numerical discretization methods. However, despite their potential, PINNs face a significant challenge: unbalanced loss terms. This issue can slow down convergence, reduce accuracy, and limit scalability. The challenge of unbalanced loss terms arises from the fact that different components of the loss function frequently operate on significantly varying scales. For example, the magnitude of the residual may be substantially larger or smaller than that of the boundary condition term. This imbalance results in uneven gradients during the backpropagation process, which may lead to the optimization process favoring one term over the others. Consequently, the neural network may converge to a suboptimal solution or, in some cases, fail to converge entirely. To mitigate this issue, researchers have proposed a range of strategies, each exhibiting distinct advantages and disadvantages. Recent advancements have explored regularization strategies and specialized network architectures aimed at enhancing the performance of PINNs. For instance, grouping regularization strategies alter the conventional loss function by implementing distinct scaling factors for each loss term, thereby ensuring that all terms are of similar magnitude and can be optimized concurrently. 2 DN-PINNs 3 have been designed to facilitate an even distribution of multiple back-propagated gradient components throughout the training process. By assessing the relative weights of initial or boundary condition losses in accordance with gradient norms, DN-PINNs dynamically adjust these weights to guarantee balanced training. An extension of loss-term scaling involves adaptive weighting schemes, which adjust the weights of loss terms dynamically throughout the training process. For instance, Gaussian probabilistic models employ maximum likelihood estimation to update the weights of each loss term during each training epoch, thereby ensuring that the network concentrates on the most critical terms. 4 Another notable method is the min-max algorithm, which identifies data points that present greater difficulty for training and mandates that the network prioritizes these challenging instances in subsequent iterations. 5 The wbPINN method 6 introduces an adaptive loss weighting strategy and a newly developed loss function that incorporates a correlation loss term and a penalty term to effectively address the interrelationships among the various loss terms . Furthermore, weighting schemes based on gradient statistics evaluate the gradients of individual loss terms during backpropagation and make necessary adjustments to their weights, promoting balanced training 7 ; this work has been further refined through the introduction of kurtosis-standard deviation-based weighting and combined mean and standard deviation-based schemes, both of which enhance the accuracy of solutions to partial differential equations. Improved adaptive weighting PINNs based on Gaussian likelihood estimation have been applied to solve nonlinear PDEs. 8 Learning rate annealing algorithms also employ gradient statistics during training to balance the contributions of different loss terms, thus, reducing the risk of training failure. 9 Another innovative approach is the Stochastic Dimension Gradient Descent (SDGD) method, 10 which decomposes the gradient of the residual into smaller components corresponding to various dimensions. The SDGD method then randomly samples subsets of these components, thereby ensuring efficient optimization for high-dimensional challenges. Gradient-enhanced PINNs (gPINNs) incorporate gradient information of the PDE residual into the loss function to improve accuracy, especially for problems with steep gradients. 11 Residual-Quantile Adjustment (RQA), reassigns weights based on the distribution of residuals, ensuring a more balanced training process. 12 Another line of inquiry examines optimization-driven methodologies aimed at balancing loss components. For instance, the augmented Lagrangian relaxation technique converts the constrained optimization problem into a series of max-min problems, enabling the network to adaptively equilibrate each loss term. 13 Numerical treatments of the PDE and tweaking the neural network architecture is another promising path. The normalized reduced-order physics-informed neural network (nr-PINN) 14 converts the original PDE into a system of normalized lower-order equations. This technique employs scaling factors to mitigate gradient failures resulting from substantial PDE parameters or source functions and introduces a mechanism to automatically fulfill boundary conditions by redefining the outputs of the neural network. Integration of derivative information into the loss function has been further explored in. 15 This study constructs a loss function that includes both the differential equation and its derivative, enabling the network to automatically satisfy boundary conditions without explicit training at boundary points. Challenges & Research gap. Despite their notable success, the selected method categories still encounter various challenges. For instance, PINNs based on Gaussian likelihood estimation struggle with solutions that exhibit sharp changes or discontinuities and gPINNs often require integration with other methods to achieve optimal performance. Moreover, these methodologies heavily depend on machine learning components while often overlooking the treatment of mathematical formulations. As a result, demonstrating their efficacy typically requires complex optimization processes and extensive hyperparameter tuning, which imposes significant computational demands. In consideration of the challenges mentioned above, this study proposes a novel approach for addressing the issue of unbalanced loss terms in PINNs by regularizing the values of the differential equation terms prior to the construction of the loss function. Contrary to existing methodologies that concentrate on adjusting weights during the training phase or modifying network architectures, our approach involves preprocessing the PDE terms to ensure that they function on comparably scaled values. This strategy alleviates the burden on the machine learning component during the optimization process, thereby enhancing convergence, accuracy, and scalability while preserving the flexibility and robustness inherent in PINNs. By bridging the existing research gap regarding the treatment of unbalanced loss terms, our methodology offers an efficient framework for solving differential equations utilizing PINNs. Furthermore, our proposed method is straightforward to implement, as demonstrated through a step-by-step application to two distinct mechanical problems: an elastic rod and an Euler beam. In both cases, we follow the exact same procedural framework, highlighting the method’s consistency and ease of use. The only variation lies in the number of variables and functions that require normalization, reinforcing the generality and adaptability of our approach across different types of differential equations. It has to be noted that the benchmark problem refer to cases with variable material and geometrical properties, which cannot be solved using traditional finite element methods. The remainder of this paper is organized as follows: Section 2 presents the theoretical foundations of neural networks and PINNs. As these are well-established methodologies, only a brief introduction is provided, with appropriate references for further details. The section also introduces a general approach for scaling terms in differential equations, with specific examples applied to fundamental elasticity problems. Additionally, it explores extensions to more complex cases where analytical solutions are unavailable. Section 3 provides a comprehensive presentation of numerical experiments and results, covering validation cases ranging from simple models with constant properties to those with varying and nonlinear characteristics. The methodology’s efficiency is evaluated through comparisons with case studies from the literature. Finally, Section 5 summarizes the key findings, discusses current limitations, and outlines potential directions for future research. 2. Theoretical background 2.1 Neural networks and PINNs Neural networks are computational models inspired by the structure and function of biological neural systems, specifically designed to learn complex patterns and relationships from data. 16 The fundamental unit of a neural network is the neuron or perceptron, which processes an input x to produce an output y ̂ through the function y ̂ = σ ( w · x + b ) , where the parameters w and b are referred to as the weight and bias, respectively, learnt during training. 17 The ‘activation function’ σ introduces nonlinearity and the network to model complex problems. Multiple neurons are clustered into groups known as layers, collectively forming a neural network ( Figure 1 ). Each layer may have several inputs and outputs, which are connected through an extension of the fundamental neuron equation. (1) y ̂ j = σ ( ∑ i = 1 N in x i w ij + b j ) , i ∈ [ 1 , N out ] where N in is the number of inputs of each neuron and N out is the number of neurons of the layer; since each neuron produces a single output, the number of outputs for the layer is equal to the number of neurons, hence the use of N out . The sequence of calculations from input, through the network, to the output is termed as forward pass. Figure 1. The general structure of a neural network. According to the universal approximation theorem, a neural network has the capacity to approximate any function with arbitrary precision 18 ; however, the required connectivity of the neurons, referred to as network architecture, must be thoroughly examined. Generally, deep architectures, consisting of a multiple hidden layers, are utilized to capture hierarchical features, whereas shallow networks, which consist of fewer layers, are deployed in scenarios where data or computational resources are limited. 19 The training process entails the formulation of a ‘Loss function’ to compare the outputs generated by the neural network ( y ̂ ) against an established ground truth ( y ) , followed by the targeted adjustment of weights and biases. In the context of PINNs, neural networks are extended to incorporate physical constraints directly into the training process. Unlike conventional neural networks that rely solely on data-driven learning, PINNs integrate information from governing equations and boundary conditions into the loss function, ensuring that the learned solutions adhere to underlying physical laws. 1 The loss function in PINNs comprises three main components: (i) a data loss term that ensures consistency with available observations, (ii) a physics loss term that enforces compliance with differential equations, and (iii) a boundary/initial condition loss term that satisfies prescribed constraints. PINNs can be categorized into two main types: data-driven approaches, which infer hidden relationships from experimental data, and physics-driven approaches, which directly solve differential equations while enforcing physical consistency. 20 , 21 It has been demonstrated that the integration of physical principles into neural network architectures improves their interpretability, generalizability, and applicability across a diverse array of scientific and engineering challenges. 22 This study focuses on the latter category, specifically employing physics-driven PINNs to solve differential equations while addressing challenges associated with unbalanced loss terms. 2.2 Term scaling An effective introduction to the scaling treatment of differential equations is presented herein, based on generalized scaling methods. 23 The objective of scaling is to render both the dependent and independent variables dimensionless, while simultaneously positioning them within the unit range. Each variable is normalized using a characteristic quantity relevant to the specific problem. For instance, the spatial variable may be normalized in relation to the length of a structure. Subsequently, all terms and derivatives appearing in the differential equation are expressed in terms of their dimensionless equivalents. Any unestablished scaling coefficients are approximated by requiring that the corresponding terms of the equation remain proximate to unity. Upon resolving the equation in its normalized form, a reverse process is employed to retrieve the solution in the physical domain. The proposed method, referred to as Scaled Equation-Enhanced Physics Informed Neural Network (SEE-PINN), for handling unbalanced loss terms in PINNs, is built directly on this scaling framework. By ensuring that all terms of the differential equation operate on comparable scales before constructing the loss function, our approach simplifies implementation while improving optimization efficiency. This is demonstrated through its application to two distinct mechanical problems: an elastic rod and an Euler beam. In both cases, the exact same procedural steps are followed, emphasizing the method’s consistency and ease of use. The only variation lies in the number of variables and functions requiring normalization, reinforcing its generality and adaptability across different types of differential equations. The following paragraphs provide the numerical formulation of equations typically encountered in the literature, incorporating this systematic scaling approach. 2.2.1 Elastic rod The response of an elastic rod is described by the 1D Poisson equation: (2) d dx [ E ( x ) · A ( x ) · du dx ] + p ( x ) = 0 , x ∈ [ 0 , L ] where L is the length, E is the Young’s modulus, A is the cross-sectional area, p is the applied load and u corresponds to the pursued axial displacement. The fact that all quantities are presumed to vary arbitrarily with respect to x , prevents the derivation of general analytic solutions. Eq. (2) can be expanded as (3) E x A u x + E A x u x + EA u xx + p = 0 where subscript x indicates differentiation. To derive the normalized formulation of Eq. (3) each term is normalized using a characteristic quantity. Initially, the normalized spatial variable is defined as (4) x ¯ = x x c → x = x c · x ¯ → d x ¯ dx = 1 x c where x c is the scaling coefficient. In the same sense, the Young’s modulus, the cross-sectional area, the axial displacement and the applied load can be expressed in their respective normalized forms: (5) E ¯ ≡ E ¯ ( x ¯ ) = E ( x ) e c → E ( x ) = e c · E ¯ ( x ¯ ) (6) A ¯ ≡ A ¯ ( x ¯ ) = A ( x ) a c → A ( x ) = a c · A ¯ ( x ¯ ) (7) u ¯ ≡ u ¯ ( x ¯ ) = u ( x ) u c → u ( x ) = u c · u ¯ ( x ¯ ) (8) p ¯ ≡ p ¯ ( x ¯ ) = p ( x ) p c → p ( x ) = p c · p ¯ ( x ¯ ) where e c , a c , u c , p c are scaling coefficients to ensure that the range of E ¯ , A ¯ , u ¯ and p ¯ is normalized to [ 0 , 1 ] . The following reasonable assumptions are made for Eqs. (4)-(8) : (9) x c = L , e c = max E ( x ) , a c = max A ( x ) , p c = max | p ( x ) | For u c no assumption can be made at this point, since the value of u ( x ) remains unknown; consequently, it must be approximated through an alternative method. The respective spatial derivatives appearing in Eq. (3) are expressed in normalized form using Eqs.(4)-(8) : (10) E x ( x ) = dE ( x ) dx = d dx [ e c E ¯ ( x ¯ ) ] = e c d E ¯ ( x ¯ ) d x ¯ d x ¯ dx = e c x c E ¯ x ¯ ( x ¯ ) (11) A x ( x ) = dA ( x ) dx = d dx [ a c A ¯ ( x ¯ ) ] = a c d A ¯ ( x ¯ ) d x ¯ d x ¯ dx = a c x c A ¯ x ¯ ( x ¯ ) (12) u x ( x ) = du ( x ) dx = d dx [ u c u ¯ ( x ¯ ) ] = u c d u ¯ ( x ¯ ) d x ¯ d x ¯ dx = u x c u ¯ x ¯ ( x ¯ ) (13) u xx ( x ) = d u x ( x ) dx = d dx [ u c x c u ¯ x ¯ ( x ¯ ) ] = u c x c d u ¯ x ¯ ( x ¯ ) d x ¯ d x ¯ dx = u x c 2 u ¯ x ¯ x ¯ ( x ¯ ) Then, Eq. (3) can be reformulated utilizing the normalized quantities: (14) e c x c E ¯ x ¯ · a c A ¯ · u c x c u ¯ x ¯ + e c E ¯ · a c x c A ¯ x ¯ · u c x c u ¯ x ¯ + e c E ¯ · a c A ¯ · u c x c 2 u ¯ x ¯ x ¯ + p c p ¯ = 0 After simplifying the equation: (15) E ¯ x ¯ · A ¯ · u ¯ x ¯ + E ¯ · A ¯ x ¯ · u ¯ x ¯ + E ¯ · A ¯ · u ¯ x ¯ x ¯ + p c · x c 2 · p ¯ e c · a c · u c = 0 To confine the last term within the interval [0,1] as well, its coefficient is set equal unity, yielding the value of the normalizing parameter u c : (16) p c · x c 2 e c · a c · u c = 1 → u c = p c · x c 2 e c · a c 2.2.2 Elastic Euler beam The response of an elastic Euler beam is described by the well-known equation: (17) d 2 d x 2 [ E ( x ) · I ( x ) · d 2 w d x 2 ] − p ( x ) = 0 , x ∈ [ 0 , L ] where L is the length, E is the Young’s modulus, I is moment of inertia, p is the applied load and w is the pursued transverse deflection. All quantities are presumed to vary with respect to x , which precludes general analytic solutions. Eq. (17) can be expanded as (18) ( E xx I + 2 E x I x + E I xx ) · w xx + 2 ( E x I + E I x ) · w xxx + EI · w xxxx − p = 0 where subscript x indicates differentiation. To derive the normalized formulation of Eq. (18) , each term is normalized using a characteristic quantity. The normalized spatial variable, Young modulus and applied load are defined again as in Eqs. (4), (5) and (8) using the same scaling coefficients as in Eq. (9) . In the same sense the normalized inertial moment and transverse deflection are defined as: (19) I ¯ ≡ I ¯ ( x ¯ ) = I ( x ) i c → I ( x ) = i c · I ¯ ( x ¯ ) (20) w ¯ ≡ w ¯ ( x ¯ ) = w ( x ) w c → w ( x ) = w c · w ¯ ( x ¯ ) where i c , w c are scaling coefficients to ensure that the range of I ¯ and w ¯ is normalized to [ 0 , 1 ] . A reasonable assumption for i c is: (21) i c = max I ( x ) but, again, no assumption can be made for w c , and it needs to be determined. The respective spatial derivatives appearing in Eq. (18) are expressed in normalized form: (22) E x ( x ) = dE ( x ) dx = d dx [ e c E ¯ ( x ¯ ) ] = e c d E ¯ ( x ¯ ) d x ¯ · d x ¯ dx = e c x c · E ¯ x ¯ ( x ¯ ) (23) E xx ( x ) = d E x ( x ) dx = d d x ¯ [ e c x c E ¯ x ¯ ( x ¯ ) ] · d x ¯ dx = e c x c 2 E ¯ x ¯ x ¯ ( x ¯ ) (24) I x ( x ) = dI ( x ) dx = d dx [ i c I ¯ ( x ¯ ) ] = i c d I ¯ ( x ¯ ) d x ¯ · d x ¯ dx = i c x c · I ¯ x ¯ ( x ¯ ) (25) I xx ( x ) = d I x ( x ) dx = d d x ¯ [ i c x c I ¯ x ¯ ( x ¯ ) ] · d x ¯ dx = i c x c 2 I ¯ x ¯ x ¯ ( x ¯ ) (26) w x ( x ) = dw ( x ) dx = d dx [ w c w ¯ ( x ¯ ) ] = w c d w ¯ ( x ¯ ) d x ¯ · d x ¯ dx = w c x c · w ¯ x ¯ ( x ¯ ) (27) w xx ( x ) = d w x ( x ) dx = d d x ¯ [ w c x c w ¯ x ¯ ( x ¯ ) ] · d x ¯ dx = w c x c 2 w ¯ x ¯ x ¯ ( x ¯ ) (28) w xxx ( x ) = d w xx ( x ) dx = d d x ¯ [ w c x c 2 w ¯ x ¯ x ¯ ( x ¯ ) ] · d x ¯ dx = w c x c 3 w ¯ x ¯ x ¯ x ¯ ( x ¯ ) (29) w xxxx ( x ) = d w xxx ( x ) dx = d d x ¯ [ w c x c 3 w ¯ x ¯ x ¯ x ¯ ( x ¯ ) ] · d x ¯ dx = w c x c 4 w ¯ x ¯ x ¯ x ¯ x ¯ ( x ¯ ) Then, Eq. (18) can then be recast using the normalized quantities: (30) E ¯ I ¯ w ¯ x ¯ x ¯ x ¯ x ¯ + 2 ( E ¯ x ¯ I ¯ + E ¯ I ¯ x ¯ ) w ¯ x ¯ x ¯ x ¯ + ( E ¯ x ¯ x ¯ I ¯ + 2 E ¯ x ¯ I ¯ x ¯ + E ¯ I ¯ x ¯ x ¯ ) w ¯ x ¯ x ¯ − p c · x c 4 e c · i c · w c p ¯ = 0 In order to constrain the last term in [0,1] as well, its coefficient is set equal unity, yielding the value of the normalizing parameter w c : (31) p c · x c 4 e c · i c · w c = 1 → w c = p c · x c 4 e c · i c 3. Technical aspects and performance assessment In this section, the architecture of the proposed SEE-PINN framework is first introduced, detailing the network structure, activation functions, training procedure, and implementation of the term-scaling approach. This ensures a comprehensive understanding of the methodology before proceeding to validation and performance evaluation. Following this, the proposed method is validated through a series of test cases and subsequently compared to solutions found in the literature to illustrate its computational efficiency. The objective is not to undermine existing methods but to demonstrate that they can benefit from our approach and achieve enhanced accuracy and robustness. Both simple and complex case studies are examined concerning the problems associated with the elastic rod and the elastic Euler beam to validate the proposed method. For straightforward cases, the solution obtained through PINNs is compared against analytical solutions. In more complex scenarios, where no analytical solution is available, the PINN solution is contrasted with numerical solutions. 3.1 Network architecture Following the term scaling methodology description, a comprehensive architecture is provided here. The fundamental framework is presented for the rod and beam problems. This design is intended to be easily adaptable, enabling other researchers to extend it to various problems with minimal effort. The proposed approach begins with a normalization step applied to the coefficients of the ODE terms before they are introduced into the input layer. These normalized coefficients, together with the neural network outputs, undergo automatic differentiation to compute the gradients of the required to form the ODE. The resulting terms are then incorporated into the loss function, which typically consists of one term for the ODE residual and additional terms for each boundary condition. In this work, the mean squared error is employed for the terms of the loss function. If the total loss converges below a predefined threshold, the process proceeds to de-normalization, producing the final solution. Otherwise, backpropagation updates the network’s weights and biases until convergence is reached. The architecture for the elastic rod is illustrated in Figure 2 and can be readily adapted to the beam problem (or other related problems) by modifying the predicted quantities and the computed gradients. Specifically, for the beam, the output variable changes from the axial displacement u (for the rod) to the transverse deflection w , while the required gradients expand significantly. The rod problem involves computing E x , A x , u x and u xx , whereas the beam problem requires additional terms, namely E xx , I x , I xx , w x , w xx , w xxx and w xxxx . Likewise, the rod problem is solved using two boundary conditions, e.g. a Dirichlet and a Neumann condition (denoted in Figure 2 by L D and L N respectively), while the beam problem requires four boundary conditions. Although the mathematical complexity increases significantly (as detailed in the respective sections), the transition from the rod to the beam remains conceptually straightforward. The same principle applies when extending the approach to other problems. Figure 2. Network architecture for the problem of the elastic rod. The network is implemented in PyTorch, to take advantage of computational optimizations, and automatic computing (Autograd) of derivatives in the loss function. 3.2 Validations 3.2.1 Fixed uniform rod with distributed load Statement of the problem. This represents a straightforward scenario. A homogenous rod with a uniform cross-section is subjected to an axially distributed load. The left end of the rod is fixed, while the right one is free. The axial displacement along the rod is analyzed. Numerical values are: (32) E = 200 GPa , A = 1 c m 2 , p ( x ) = 1000 x 2 N m , L = 1 m Since properties are constant along the rod, Eq. (2) is diminished to (33) EA d 2 u d x 2 + p ( x ) = 0 with boundary conditions (34) Displacement at x = 0 : u ( 0 ) = 0 Force at x = L : EA u x ( L ) = 0 The analytic solution is (35) u ( x ) = − x 4 240000 + x 60000 SEE-PINN solution. An appropriate neural network is designed to approximate the displacement field of the rod. The input of the neural network is the spatial coordinate x , and its output is the predicted displacement u ̂ ( x ) . The network consists of only one fully connected layer, with 10 neurons, and each neuron employs the tanh activation function. The network is trained at 75 points using the Adam optimizer with learning rate 0.01 for 5000 epochs. Comparison and error analysis. The predicted solution the PINN is validated against the analytical solution – Eq. (35) . Figure 3a demonstrates that the analytic and the PINN solution are indistinguishable from each other, as verified by the parity plot in Figure 3b . The prediction quality is further assessed using the normalized relative error, where the relative error is scaled according to the magnitude of the displacement values to prevent numerical artifacts from division by very small numbers. (36) e ( x ) = | u ( x ) − u ̂ ( x ) | | u ( x ) + O ( u ) | · 100 % Figure 3. SEE-PINN vs. Analytic solution for case 3.2.1. (a) Direct comparison of predictions. (b) Parity plot of predicted vs. reference solution. The maximum relative error is ca. 0.4%, which demonstrates the PINN approach achieves nearly exact agreement with the analytical solution. 3.2.2 Fixed rod with variable cross-section and distributed load Statement of the problem. This case builds upon the previous problem by introducing a nonlinear variation in the cross-sectional area. (37) A ( x ) = [ 2 + sin ( 2 π x L ) ] c m 2 while keeping all other parameters unchanged, increasing the complexity of the analysis. SEE-PINN solution. The same neural network has been employed to approximate the displacement field of the rod; i.e. one fully connected layer, with 10 neurons, and each neuron employs the tanh activation function. The network is trained at 75 points using the Adam optimizer with learning rate 0.01 for 5000 epochs. Comparison and error analysis. The predicted solution is compared against a numerical reference for validation. Figure 4 illustrates that the analytic and the PINN solution are again indistinguishable. With a maximum relative error of approximately 0.04%, the PINN approach demonstrates an excellent agreement with the analytical solution. Figure 4. SEE-PINN vs. Analytic solution for case 3.2.2. (a) Direct comparison of predictions. (b) Parity plot of predicted vs. reference solution. 3.2.3 Fixed rod with variable Young’s modulus and cross-section, and distributed load Statement of the problem. The complexity is further increased by incorporating a nonlinear variation in the Young’s modulus of the rod. (38) E ( x ) = 200 · ( 1 − tanh x ) GPa while preserving the other parameters; the cross-sectional area still varies according to Eq. (37) . This variation is designed to mimic the behavior of exotic materials, similar to those found in advanced metamaterials, or the properties of damaged materials. SEE-PINN solution. The same neural network has been employed to approximate the displacement field of the rod; i.e. one fully connected layer, with 10 neurons, and each neuron employs the tanh activation function. The network is trained at 75 points using the Adam optimizer with learning rate 0.01 for 5000 epochs. Comparison and error analysis. The predicted solution validated against is validated against a numerical reference. As shown in Figure 5 , the analytical and PINN solutions are virtually identical. The maximum relative error is approximately 0.05%, indicating that the PINN approach achieves an almost exact match with the analytical solution. Figure 5. SEE-PINN vs. Analytic solution for case 3.2.3. (a) Direct comparison of predictions. (b) Parity plot of predicted vs. reference solution. 3.2.4 Uniform Euler beam with distributed load Statement of the problem. The second part of the validation examines three beam problems. The first case considers a uniform, homogeneous elastic beam with a length of L = 1 m. The beam has a rectangular cross-section of b = 6 cm , h = 1 cm and is composed of a material with E = 200 GPa . The left end of the rod is fixed, while the right one is simply supported. The beam is subjected to a transverse load of p ( x ) = 100 N / m , and its transverse deflection is analyzed. This problem can be easily solved through the analytical solution of Eq. (17) with constant properties and boundary conditions: (39) Deflection at x = 0 : w ( 0 ) = 0 Rotation at x = 0 : w ′ ( 0 ) = 0 Deflection at x = L : w ( L ) = 0 Moment at x = L : EI w ′ ′ ( L ) = 0 The analytic solution is: (40) w ( x ) = x 4 240 − x 3 96 + x 2 160 SEE-PINN solution. An appropriate neural network is designed to approximate the deflection of the beam. The input of the neural network is the spatial coordinate x , and its output is the predicted transverse displacement w ̂ ( x ) . The network consists of only one fully connected layer, with 10 neurons, and each neuron employs the tanh activation function. The network is trained at 75 points using the Adam optimizer with learning rate 0.001 for 10000 epochs. Comparison and error analysis. The predicted solution is validated against the analytical reference ( Figure 6 ), showing that the analytical and PINN solutions are virtually identical ( Figure 6a ); this is further supported by the parity plot ( Figure 6b ), where all data points practically lay along the diagonal. With a maximum relative error of approximately 0.2%, the PINN approach achieves exceptional accuracy in comparison to the analytical solution. Figure 6. SEE-PINN vs. Analytic solution for case 3.2.4. (a) Direct comparison of predictions. (b) Parity plot of predicted vs. reference solution. 3.2.5 Euler beam with variable cross-section and distributed load Statement of the problem. This case builds upon the previous problem by introducing a nonlinear transition in the inertial moment of the cross-section, represented by I : (41) I ( x ) = I 0 · [ 1 + 0.5 x − 0.25 x 2 ] , I 0 = b · h 3 12 while keeping all other parameters unchanged, increasing the complexity of the analysis. PINN solution. A shallow architecture has been employed to approximate the deflection of the beam; i.e. one fully connected layer, with 10 neurons, and each neuron employs the tanh activation function. The network is trained at 75 points using the Adam optimizer with learning rate 0.001 for 10000 epochs. Comparison and error analysis. The predicted solution is compared against a numerical reference for validation. Figure 7 illustrates that the analytic and the PINN solution are again indistinguishable. With a maximum relative error of approximately 0.35%, the PINN approach demonstrates an excellent agreement with the analytical solution. Figure 7. SEE-PINN vs. Numerical solution for case 3.2.5. (a) Direct comparison of predictions. (b) Parity plot of predicted vs. reference solution. 3.2.6 Euler beam with variable Young’s modulus and cross-section, and distributed load Statement of the problem. The complexity is further enhanced by introducing a nonlinear variation in the Young’s modulus of the beam, (42) E ( x ) = 200 · ( 1 − 0.25 x − 0.5 x 2 ) GPa while keeping all other parameters unchanged. The cross-sectional area continues to vary according to Eq. (41) . SEE-PINN solution. The same neural network has been employed to approximate the deflection of the beam; one fully connected layer, with 10 neurons, and each neuron employs the tanh activation function. The network is trained at 75 points using the Adam optimizer with learning rate 0.001 for 10000 epochs. Comparison and error analysis. The predicted solution is compared against a numerical reference for validation. Figure 8 illustrates that the analytic and the PINN solution are again indistinguishable. With a maximum relative error of approximately 0.4%, the PINN approach demonstrates an excellent agreement with the analytical solution. Figure 8. SEE-PINN vs. Numerical solution for case 3.2.6. (a) Direct comparison of predictions. (b) Parity plot of predicted vs. reference solution. 3.3 Performance The performance of the introduced methodology is assessed by comparison to existing models. The objective is to demonstrate that the suggested approach yields the same solution while utilizing significantly fewer computational resources. Given that the precise technical details of each study are not known, theoretical estimates of computational requirements and complexity have been derived from the respective network architectures. 3.3.1 Performance metric This analysis evaluates the floating point operations (FLOPs) required for both the forward and backward passes as a key metric for assessing the performance of a neural network. While other metrics, such as the memory needed to store weights, biases, and intermediate results, could also be considered, a more detailed examination of these factors is beyond the scope of this paper. According to Eq. (1) , a neuron in fully connected layer performs three basic operations: (a) multiplication of every input with a weight, i.e. N in operations, (b) summation of all input-weight products, i.e. N in − 1 operations, and (c) addition of a bias, i.e. 1 operation. Thus, for a layer with N in inputs an N out outputs, the required number of FLOPs for a forward pass is: (43) F FWD L ( N in , N out ) = [ N in + ( N in − 1 ) + 1 ] · N out = 2 N in N out The backpropagation process is more complex than the forward pass and is assumed to require three times as many FLOPs; F BKD = 3 F FWD . For simplicity, the computations needed for activation functions are considered minimal, so any additional overhead calculations—which may vary by implementation—are not included. Therefore, the total computational load is calculated by multiplying the total number of FLOPs required for both the forward pass and backpropagation by the number of training points and the number of epochs. 3.3.2 Case studies Case 1. Wang et al. 24 have conducted simulations on a 10 m long homogeneous rod featuring a cross-sectional area of 1 m 2 , composed of a material characterized by a Young’s modulus of 175 Pa. The rod was fixed at both ends and subjected to a distributed load: (44) b ( x ) = − 4 π 2 ( x − 2.5 ) 2 − 2 π e π ( x − 2.5 ) 2 − 8 π 2 ( x − 7.5 ) 2 − 4 π e π ( x − 7.5 ) 2 The authors addressed the problem by utilizing a PINN comprising 6 hidden layers, with each layer containing 512 neurons employing the ReLU activation function. The model was trained for N e = 50,000 epochs using N p = 100 data points. The computational cost for a forward pass is the total sum of FLOPs for the input layer, the six hidden layers, and the output layer, i.e. (45) F FWD = F FWD L ( 1 , 512 ) + 6 F FWD L ( 512 , 512 ) + F FWD L ( 512 , 1 ) = [ 2 · 1 · 512 ] + 6 · [ 2 · 512 · 512 ] + [ 2 · 512 · 1 ] = 3 147 776 FLOPs When including the cost of back-propagation and considering the number of training points, the total computational cost becomes: (46) F tot = ( F FWD + F BKD ) · N p · N e = 4 F FWD · N p · N e ≈ 63 TFLOPs The solution was subsequently validated against an analytical benchmark solution: (47) u ( x ) = 1 EA · ( e − π ( x − 2.5 ) 2 − e − 6.25 π ) + 2 EA ( e − π ( x − 7.5 ) 2 − e − 6.25 π ) The same problem was solved using the proposed approach but with a significantly smaller network, specifically two layers containing 20 neurons each, trained on 100 points for 30,000 epochs. A comparison of the predictions with the provided analytical solution in Figure 9 shows excellent agreement. Figure 9. SEE-PINN vs. Analytical solution for case study 1. (a) Direct comparison of predictions. (b) Parity plot of predicted vs. reference solution. The computational cost for a forward pass in this configuration is given: (48) F FWD = F FWD L ( 1 , 20 ) + 2 F FWD L ( 20 , 20 ) + F FWD L ( 20 , 1 ) = [ 2 · 1 · 20 ] + 2 · [ 2 · 20 · 20 ] + [ 2 · 20 · 1 ] = 1600 FLOPs and the total cost is F tot = 20.16 GFLOPs which is three orders of magnitude lower than the original approach. Case 2. Singh et al. 25 simulated the bending of a 1 m long homogeneous Euler beam with a moment of inertia I = 1.0, made of a material with Young’s modulus of 1.0 Pa. The beam was fixed at one end and subjected to a distributed load: (49) p ( x ) = 1 − x To solve this problem, the authors employed a PINN with 5 hidden layers, each containing 50 neurons using the tanh activation function. The model was trained for N e = 300 epochs using N p = 51 data points. The computational cost for a forward pass is the total sum of FLOPs for the input layer, the five hidden layers, and the output layer, i.e. (50) F FWD = F FWD L ( 1 , 50 ) + 5 F FWD L ( 50 , 50 ) + F FWD L ( 50 , 1 ) = [ 2 · 1 · 50 ] + 5 · [ 2 · 50 · 50 ] + [ 2 · 50 · 1 ] = 25 200 FLOPs Taking into account the cost of back-propagation, the number of training points and the number of epochs, the total computational cost is given by: (51) F tot = ( F FWD + F BKD ) · N p · N e = 4 F FWD · N p · N e ≈ 1.54 GFLOPs The solution was validated against an analytical benchmark solution: (52) w ( x ) = − x 5 120 + x 4 24 The same problem was solved using the proposed approach but with a significantly smaller network: a single hidden layer with 10 neurons, trained on 75 points for 1,000 epochs. As shown in Figure 10 , the predictions closely match the analytical solution, demonstrating excellent agreement. Figure 10. SEE-PINN vs. Analytical solution for case study 2. (a) Direct comparison of predictions. (b) Parity plot of predicted vs. reference solution. The computational cost for a forward pass using the SEE-PINN configuration is given: (53) F FWD = F FWD L ( 1 , 10 ) + 1 F FWD L ( 10 , 10 ) + F FWD L ( 10 , 1 ) = [ 2 · 1 · 10 ] + 5 · [ 2 · 10 · 10 ] + [ 2 · 10 · 1 ] = 240 FLOPs and the total cost is F tot = 72 MFLOPs which is two orders of magnitude lower than the original approach. Performance efficiency is visually demonstrated by comparison in Figure 11 . Figure 11. Performance comparisons between SEE-PINN and SOA models in literature (Lower is better). The proposed approach requires 2-3 times less FLOPs. 4. Summary and discussion The proposed methodology offers an efficient and streamlined approach for solving ordinary differential equations (ODEs) with Physics-Informed Neural Networks (PINNs) by directly scaling the terms of the governing equations, rather than introducing balancing weights within the loss function. Each term is normalized using characteristic physical dimensions, bringing all contributions to a similar order of magnitude close to unity. This ensures numerical consistency and eliminates the need for complex and computationally intensive loss-balancing procedures. The scaled equations are solved within a PINN framework, after which a reverse scaling step restores the solution to the physical domain. The method has been demonstrated through nonlinear one-dimensional elasticity problems, including rod and Euler–Bernoulli beam cases. The results show that high accuracy can be achieved with extremely compact network architectures – even a single hidden layer with ten nodes – while maintaining negligible maximum percentage error across collocation points. Benchmarking against existing PINN approaches reveals that the proposed scaling strategy reduces floating-point operations (FLOPs) by at least two orders of magnitude, underscoring its potential to deliver substantial computational savings without compromising precision. While promising, the method also presents opportunities for further development: 1. Optimal Hyperparameter Selection: Automated, self-tuning strategies remain an open research goal to avoid case-by-case manual tuning. 2. Extension to Higher Dimensions: Applying the methodology to 2D and 3D problems, where term coupling increases complexity, is a priority. 3. Highly Nonlinear and Discontinuous Cases: Future work will target problems with sharp gradients, contact conditions, discontinuities, and dynamic effects. 4. Time-Dependent Problems: These can be addressed by treating time as an additional dimension or by adopting time-aware neural architectures such as LSTMs. In conclusion, the proposed scaling-based PINN framework (SEE-PINN) demonstrates that direct differential equation term scaling can fundamentally simplify and accelerate the training of PINNs for nonlinear problems. By completely removing the reliance on elaborate and costly loss-balancing mechanisms, it enables the use of compact, fast, and accurate models that are easier to deploy in real-world engineering settings. The combination of high accuracy, drastic computational savings, and straightforward implementation positions SEE-PINN as a practical and scalable tool, with the potential to reshape how machine learning is applied to challenging differential equation problems in computational mechanics and beyond. Ethics and consent Ethical approval and consent were not required. Data availability The data required to reproduce graphs and figures are available under CC-BY 4.0 license https://zenodo.org/records/16909058 , 10.5281/zenodo.16909058. 26 Acknowledgement The publication of the article in Open Access mode was financially supported by HEAL-Link (HEAL1000 Gateway). The authors employed ChatGPT 4 for proofreading specific paragraphs of this manuscript; however, all ideas, analyses, methods, results and conclusions presented remain solely those of the authors. References 1. Raissi M, Perdikaris P, Karniadakis GE: Physics-informed neural networks: A deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations. J Comput Phys. 2019; 378 : 686–707. Publisher Full Text 2. Wang Y, Yao Y, Guo J, et al. : A practical PINN framework for multi-scale problems with multi-magnitude loss terms. J Comput Phys. 2024; 510 : 113112. Publisher Full Text 3. Deguchi S, Asai M: Dynamic & norm-based weights to normalize imbalance in back-propagated gradients of physics-informed neural networks. J Phys Commun. 2023; 7 : 075005. Publisher Full Text 4. Xiang Z, Peng W, Liu X, et al. : Self-adaptive loss balanced Physics-informed neural networks. Neurocomputing. 2022; 496 : 11–34. Publisher Full Text 5. Li S, Feng X: Dynamic Weight Strategy of Physics-Informed Neural Networks for the 2D Navier–Stokes Equations. Entropy. 2022; 24 : 1254. PubMed Abstract | Publisher Full Text | Free Full Text 6. Cao F, Guo X, Dong X, et al. : wbPINN: Weight balanced physics-informed neural networks for multi-objective learning. Applied Soft Computing. 2025; 170 : 112632. Publisher Full Text 7. Vemuri SK, Denzler J: Gradient Statistics-Based Multi-Objective Optimization in Physics-Informed Neural Networks. Sensors. 2023; 23 : 8665. PubMed Abstract | Publisher Full Text | Free Full Text 8. Wang J, Xiao X, Feng X, et al. : An improved physics-informed neural network with adaptive weighting and mixed differentiation for solving the incompressible Navier–Stokes equations. Nonlinear Dynam. 2024; 112 : 16113–16134. Publisher Full Text 9. Wang S, Teng Y, Perdikaris P: Understanding and Mitigating Gradient Flow Pathologies in Physics-Informed Neural Networks. SIAM J Sci Comput. 2021; 43 : A3055–A3081. Publisher Full Text 10. Hu Z, Shukla K, Karniadakis GE, et al. : Tackling the curse of dimensionality with physics-informed neural networks. Neural Networks. 2024; 176 : 106369. PubMed Abstract | Publisher Full Text 11. Yu J, Lu L, Meng X, et al. : Gradient-enhanced physics-informed neural networks for forward and inverse PDE problems. Comput Methods Appl Mech Engrg. 2022; 393 : 114823. Publisher Full Text 12. Han J, Cai Z, Wu Z, et al. : Residual-Quantile Adjustment for Adaptive Training of Physics-informed Neural Network. 2022 IEEE International Conference on Big Data (Big Data). Osaka, Japan: IEEE; 2022; pp. 921–930. Publisher Full Text 13. Son H, Cho SW, Hwang HJ: Enhanced physics-informed neural networks with Augmented Lagrangian relaxation method (AL-PINNs). Neurocomputing. 2023; 548 : 126424. Publisher Full Text 14. Luong KA, Le-Duc T, Lee S, et al. : A novel normalized reduced-order physics-informed neural network for solving inverse problems. Engineering with Computers. 2024; 40 : 3253–3272. Publisher Full Text 15. Jha N, Mallik E: GPINN with Neural Tangent Kernel Technique for Nonlinear Two Point Boundary Value Problems. Neural Process Lett. 2024; 56 : 192. Publisher Full Text 16. Schmidhuber J: Deep learning in neural networks: An overview. Neural Networks. 2015; 61 : 85–117. Publisher Full Text 17. LeCun Y, Bengio Y, Hinton G: Deep learning. Nature. 2015; 521 : 436–444. Publisher Full Text 18. Cybenko G: Approximation by superpositions of a sigmoidal function. Math Control Signals Systems. 1989; 2 : 303–314. Publisher Full Text 19. Zhang C, Bengio S, Hardt M, et al. : Understanding deep learning (still) requires rethinking generalization. Commun ACM. 2021; 64 : 107–115. Publisher Full Text 20. Karniadakis GE, Kevrekidis IG, Lu L, et al. : Physics-informed machine learning. Nat Rev Phys. 2021; 3 : 422–440. Publisher Full Text 21. Kafkas P, Giannakopoulos G, Rekatsinas C: Solving Linear Elasticity Problems using Physics-Informed Neural Networks. Proceedings of the 13th Hellenic Conference on Artificial Intelligence. Piraeus Greece: ACM; 2024; pp. 1–8. Publisher Full Text 22. Mishra S, Molinaro R: Estimates on the generalization error of physics-informed neural networks for approximating PDEs. IMA J Numer Anal. 2023; 43 : 1–43. Publisher Full Text 23. Langtangen HP, Pedersen GK: Scaling of Differential Equations. Cham: Springer International Publishing; 2016. Publisher Full Text 24. Wang J, Mo YL, Izzuddin B, et al. : Exact Dirichlet boundary Physics-informed Neural Network EPINN for solid mechanics. Comput Methods Appl Mech Engrg. 2023; 414 : 116184. Publisher Full Text 25. Singh V, Harursampath D, Dhawan S, et al. : Physics-Informed Neural Network for Solving a One-Dimensional Solid Mechanics Problem. Modelling. 2024; 5 : 1532–1549. Publisher Full Text 26. Theodosiou T, Rekatsinas C: Dataset for Physics-Informed Neural Networks without Loss Balancing: A Direct Term Scaling Approach for Nonlinear 1D Problems.2025. Publisher Full Text Comments on this article Comments (0) Version 2 VERSION 2 PUBLISHED 14 Nov 2025 ADD YOUR COMMENT Comment Author details Author details 1 Dept. of Energy Systems, University of Thessaly - Larissa, Larissa, Thessalia - Larissa, 41500, Greece 2 Institute of Informatics and Telecommunications, Ethniko Kentro Ereunas Physikon Epistemon Demokritos, Athens, Attica, 15341, Greece Theodosios Theodosiou Roles: Conceptualization, Formal Analysis, Investigation, Methodology, Software, Supervision, Validation, Visualization, Writing – Original Draft Preparation, Writing – Review & Editing Christoforos Rekatsinas Roles: Conceptualization, Formal Analysis, Investigation, Methodology, Validation, Writing – Original Draft Preparation, Writing – Review & Editing Competing interests No competing interests were disclosed. Grant information The author(s) declared that no grants were involved in supporting this work. Article Versions (2) version 2 Revised Published: 24 Jan 2026, 14:1252 https://doi.org/10.12688/f1000research.169129.2 version 1 Published: 14 Nov 2025, 14:1252 https://doi.org/10.12688/f1000research.169129.1 Copyright © 2025 Theodosiou T and Rekatsinas C. This is an open access article distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Download Export To Sciwheel Bibtex EndNote ProCite Ref. Manager (RIS) Sente metrics Views Downloads F1000Research - - PubMed Central info_outline Data from PMC are received and updated monthly. - - Citations open_in_new 0 open_in_new 0 open_in_new SEE MORE DETAILS CITE how to cite this article Theodosiou T and Rekatsinas C. Physics-Informed Neural Networks without Loss Balancing: A Direct Term Scaling Approach for Nonlinear 1D Problems [version 1; peer review: 1 approved with reservations] . F1000Research 2025, 14 :1252 ( https://doi.org/10.12688/f1000research.169129.1 ) NOTE: If applicable, it is important to ensure the information in square brackets after the title is included in all citations of this article. COPY CITATION DETAILS track receive updates on this article Track an article to receive email alerts on any updates to this article. TRACK THIS ARTICLE Share Open Peer Review Current Reviewer Status: ? Key to Reviewer Statuses VIEW HIDE Approved The paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved Fundamental flaws in the paper seriously undermine the findings and conclusions Version 1 VERSION 1 PUBLISHED 14 Nov 2025 Views 0 Cite How to cite this report: Wijakmatee T. Reviewer Report For: Physics-Informed Neural Networks without Loss Balancing: A Direct Term Scaling Approach for Nonlinear 1D Problems [version 1; peer review: 1 approved with reservations] . F1000Research 2025, 14 :1252 ( https://doi.org/10.5256/f1000research.186415.r439115 ) The direct URL for this report is: https://f1000research.com/articles/14-1252/v1#referee-response-439115 NOTE: it is important to ensure the information in square brackets after the title is included in this citation. Close Copy Citation Details Reviewer Report 31 Dec 2025 Thossaporn Wijakmatee , Chemical Engineering, Institute of Science Tokyo, Meguro, Tokyo, Japan Approved with Reservations VIEWS 0 https://doi.org/10.5256/f1000research.186415.r439115 The authors propose a scaled equation-enhanced physics-informed neural network (SEE-PINN) for nonlinear one-dimensional problems, specifically mechanical systems such as an elastic rod and an Euler beam. The topic is interesting, and several computational aspects are explained in detail. However, several ... Continue reading READ ALL The authors propose a scaled equation-enhanced physics-informed neural network (SEE-PINN) for nonlinear one-dimensional problems, specifically mechanical systems such as an elastic rod and an Euler beam. The topic is interesting, and several computational aspects are explained in detail. However, several points require clarification to better articulate the originality, motivation, and logical structure of the study. After addressing the issues outlined below, the manuscript may be reconsidered for publication. Based on the statement, “Further more, our proposed method is straightforward to implement, as demonstrated through a step-by-step application to two distinct mechanical problems: an elastic rod and an Euler beam”, please clarify the motivation for selecting these two problems as representative case studies. The novelty of the SEE-PINN framework should be more clearly articulated. From the reviewer’s perspective, several scale-consistent or equation-enhanced learning approaches already exist in the literature. The authors should explicitly distinguish SEE-PINN from existing methods and emphasize its unique contributions. In Section 3.2 (Validation), the source of the data used for validation is unclear. Please clarify whether the data were obtained from experiments conducted by the authors or sourced from existing literature. In Section 3.2, is the use of 75 training data points appropriate for the PINN framework? Please justify the selection of this number. Please explain the rationale for choosing the Adam optimizer with a learning rate of 0.01 and 5000 training epochs throughout Section 3.2. The x- and y-axis scales in the parity plots (Figures 3b, 7b, and 8b) are not consistent, which makes comparison somewhat difficult. Please revise these figures for clarity. Although the relative error defined in Equation 36 is reported, metrics such as MAE or RMSE may be more informative for practical applications and acceptable error assessment in physical units. Please consider including these metrics. In Section 3.3.2 (Case Studies), reporting quantitative error metrics would better demonstrate that the proposed method reduces computational cost while maintaining acceptable accuracy. The term “the authors” used in Section 3.3.2 is ambiguous. Please clarify whether it refers to the authors of the current study or to authors of referenced works. In case 2 of Section 3.3.2, please explain the reason for using a different number of training data points compared with the reference study. Since SEE-PINN is the main contribution of this work, Section 4 should be revised to place greater emphasis on its advantages, limitations, and implications. Is the work clearly and accurately presented and does it cite the current literature? Partly Is the study design appropriate and is the work technically sound? Partly Are sufficient details of methods and analysis provided to allow replication by others? Yes If applicable, is the statistical analysis and its interpretation appropriate? Partly Are all the source data underlying the results available to ensure full reproducibility? Partly Are the conclusions drawn adequately supported by the results? Partly Competing Interests: No competing interests were disclosed. Reviewer Expertise: Engineering, Machine learning, Physics-informed method, Quantum mechanics I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard, however I have significant reservations, as outlined above. Close READ LESS CITE CITE HOW TO CITE THIS REPORT Wijakmatee T. Reviewer Report For: Physics-Informed Neural Networks without Loss Balancing: A Direct Term Scaling Approach for Nonlinear 1D Problems [version 1; peer review: 1 approved with reservations] . F1000Research 2025, 14 :1252 ( https://doi.org/10.5256/f1000research.186415.r439115 ) The direct URL for this report is: https://f1000research.com/articles/14-1252/v1#referee-response-439115 NOTE: it is important to ensure the information in square brackets after the title is included in all citations of this article. COPY CITATION DETAILS Report a concern Author Response 24 Jan 2026 Theodosios Theodosiou , Dept. of Energy Systems, University of Thessaly - Larissa, Larissa, 41500, Greece 24 Jan 2026 Author Response We would like to sincerely thank the reviewer for the time and effort devoted to the evaluation of our manuscript and for the constructive comments provided. All reviewer comments have ... Continue reading We would like to sincerely thank the reviewer for the time and effort devoted to the evaluation of our manuscript and for the constructive comments provided. All reviewer comments have been addressed in full. The changes referenced below pertain to the revised version of the manuscript (Version 2), which is currently under submission. Detailed point-by-point responses to each reviewer comment follow. Comment 1 “Based on the statement, ‘Furthermore, our proposed method is straightforward to implement, as demonstrated through a step-by-step application to two distinct mechanical problems: an elastic rod and an Euler beam’, please clarify the motivation for selecting these two problems as representative case studies.” Response: We thank the reviewer for this comment. The elastic rod and Euler–Bernoulli beam problems were deliberately selected as representative benchmarks for three main reasons. First, they constitute canonical one-dimensional boundary value problems in solid mechanics, widely used in the PINN literature, which enables direct comparison with existing methods. Second, although both problems are one-dimensional, they differ fundamentally in the order of their governing differential equations (second-order for the rod and fourth-order for the beam), as well as in the number and type of boundary conditions required. This allows us to demonstrate that the proposed SEE-PINN framework is not tailored to a specific equation order or boundary-condition structure. Third, both problems naturally admit spatially varying material and geometric properties, leading to strong coefficient imbalance across equation terms. This makes them particularly suitable for assessing the effectiveness of direct equation-term scaling, which is the core contribution of this work. By applying the same normalization and training procedure to both cases, we demonstrate that SEE-PINN is a general, systematic, and easily transferable framework rather than a problem-specific solution. Changes in the manuscript: Introduction - Added a new paragraph right after mentioning the rod and beam problems: “The selection of the elastic rod and Euler–Bernoulli beam as case studies is intentional. These problems represent canonical one-dimensional boundary value problems in computational mechanics and are frequently adopted as benchmarks in the PINN literature, allowing direct comparison with existing approaches. Although both problems are one-dimensional, they differ fundamentally in the order of their governing equations (second-order for the rod and fourth-order for the beam) and in the number and nature of boundary conditions. This enables a clear demonstration that the proposed PINN framework is not limited to a specific equation order or boundary-condition structure. Moreover, both formulations naturally allow for spatially varying material and geometric properties, which induce strong imbalance among equation terms and therefore provide an ideal testbed for evaluating the effectiveness of direct differential equation term scaling.” Comment 2 The novelty of the SEE-PINN framework should be more clearly articulated. From the reviewer’s perspective, several scale-consistent or equation-enhanced learning approaches already exist in the literature. The authors should explicitly distinguish SEE-PINN from existing methods and emphasize its unique contributions. Response: We appreciate the reviewer’s observation and agree that the distinction between SEE-PINN and existing scale-consistent or equation-enhanced approaches should be made more explicit. While several methods address imbalance in PINNs through normalization, adaptive weighting, or equation reformulation, the proposed SEE-PINN differs fundamentally in both philosophy and implementation. Existing scale-consistent or equation-enhanced approaches typically (i) introduce additional hyperparameters, (ii) modify the loss function through adaptive or data-driven weighting, or (iii) increase the complexity of the training process by incorporating gradient statistics, auxiliary optimization loops, or higher-order residuals. In contrast, SEE-PINN performs a (pre-training) physically motivated scaling of the governing differential equation itself, prior to the construction of the loss function. The key novelty of SEE-PINN lies in the fact that loss balancing is eliminated entirely, rather than mitigated or adaptively corrected during training. Once the governing equation is expressed in a normalized, scale-consistent form, all residual terms naturally contribute at comparable magnitudes, allowing standard optimization settings to be used without additional tuning. This results in a simpler, deterministic, and computationally efficient PINN formulation. Furthermore, unlike reduced-order or reformulated PINN variants, SEE-PINN does not alter the mathematical structure of the problem, introduce auxiliary constraints, or require problem-specific architectural modifications. A single reverse-scaling step restores the solution to the physical domain, preserving full physical interpretability. To clarify these distinctions, the manuscript has been revised to explicitly position SEE-PINN relative to existing scale-consistent and equation-enhanced PINN methodologies. Changes in the manuscript: Introduction - Added a new paragraph to describe the novelties: “Although several scale-consistent, normalized, or equation-enhanced PINN variants have been proposed in the literature, most of these approaches address imbalance indirectly by introducing adaptive weights, auxiliary optimization strategies, or additional loss terms. In contrast, the proposed Scaled Equation-Enhanced PINN (SEE-PINN) introduces a fundamentally different paradigm: the governing differential equation itself is rescaled prior to training using physically meaningful characteristic quantities. This preprocessing step ensures that all residual terms naturally operate at comparable magnitudes, thereby eliminating the need for loss-balancing mechanisms altogether. As a result, SEE-PINN transforms the PINN training process into a simpler, deterministic, and computationally efficient workflow, without altering the mathematical structure of the problem or introducing additional hyperparameters.” Section 2 - Added the following clarification at the end of 2.2 (right before starting to examine the elastic rod - 2.2.1): “It is important to distinguish the proposed SEE-PINN framework from existing approaches that aim to alleviate loss-term imbalance in PINNs. Adaptive weighting methods dynamically modify the contribution of each loss term during training, often relying on gradient statistics, probabilistic models, or auxiliary optimization loops. Gradient-enhanced or equation-augmented PINNs enrich the loss function by incorporating higher-order derivatives or additional residual constraints, increasing both computational cost and implementation complexity. In contrast, SEE-PINN operates exclusively at the level of the governing differential equation. By rescaling each term using characteristic physical quantities prior to training, the resulting normalized equation is inherently balanced. Consequently, the loss function remains simple and fixed throughout training, and standard optimizers can be employed without tuning or adaptive mechanisms. This shift of complexity from the optimization stage to a one-time, physics-driven preprocessing step constitutes the central novelty of the proposed framework.” Comment 3 In Section 3.2 (Validation), the source of the data used for validation is unclear. Please clarify whether the data were obtained from experiments conducted by the authors or sourced from existing literature. Response: We thank the reviewer for pointing out this lack of clarity. No experimental data are used in this study. All validation data are obtained either from closed-form analytical solutions (when available) or from high-resolution numerical solutions generated for reference purposes. Specifically, for validation cases with constant material and geometric properties, analytical solutions are employed as ground truth. For cases involving spatially varying or nonlinear properties, where analytical solutions are not available, reference solutions are obtained using conventional numerical methods. The manuscript has been revised to explicitly state the origin of the validation data in Section 3.2 to ensure full transparency and reproducibility. Changes in the manuscript: Section 3.2 - Added a new paragraph (right before the first rod analysis – 3.2.1): “The validation data employed in this section do not originate from experimental measurements. For problems with constant material and geometric properties, analytical solutions are available and are used as reference benchmarks. In cases involving spatially varying or nonlinear material and geometric properties, where closed-form solutions are not available, high-resolution numerical solutions are generated and used for validation. These numerical references serve solely as ground truth for assessing the accuracy of the proposed SEE-PINN framework.” Section ‘Data Availability’ - Added a clarification: “The reference numerical solutions used for validation were generated using conventional numerical methods and are included in the shared dataset to ensure full reproducibility.” Comment 4 In Section 3.2, is the use of 75 training data points appropriate for the PINN framework? Please justify the selection of this number. Response: We thank the reviewer for this important question. The selection of 75 training (collocation) points is intentional and directly linked to the objectives of this study. The primary aim of SEE-PINN is to demonstrate that physically consistent equation-term scaling significantly improves training efficiency, allowing accurate solutions to be obtained with compact network architectures and a limited number of collocation points. In all validation cases, the governing equations are one-dimensional, and the scaling procedure ensures that all residual terms operate at comparable magnitudes. Under these conditions, a relatively small number of uniformly distributed collocation points is sufficient to accurately capture the solution. Increasing the number of training points beyond this value was observed to yield negligible improvements in accuracy while proportionally increasing computational cost. Furthermore, the same number of training points is consistently used across multiple problems of increasing complexity, demonstrating the robustness of the proposed approach rather than problem-specific tuning. The manuscript has been revised to clarify the rationale behind this choice. Changes in the manuscript: Section 3.2 - Added a clarification (after the introductory paragraph): “All validation cases employ 75 uniformly distributed collocation points. This choice reflects a deliberate trade-off between accuracy and computational efficiency. Due to the physically consistent scaling of the governing equations, the residual terms are well-balanced, allowing accurate solutions to be obtained with a relatively small number of training points. Increasing the number of collocation points was found to provide marginal accuracy gains while significantly increasing computational cost. Using a fixed number of training points across problems of increasing complexity further highlights the robustness and generality of the proposed SEE-PINN framework.” Comment 5 Please explain the rationale for choosing the Adam optimizer with a learning rate of 0.01 and 5000 training epochs throughout Section 3.2. Response: We thank the reviewer for this comment. The Adam optimizer was selected due to its widespread use and demonstrated robustness in training PINNs, particularly for problems involving automatic differentiation and stiff residual landscapes. The learning rate and number of epochs were chosen to reflect a standard, non-optimized training configuration. A learning rate of 0.01 was found to provide stable and fast convergence for the scaled governing equations, while 5000 training epochs were sufficient for the loss to consistently converge below a prescribed tolerance across all validation cases. Importantly, these parameters were kept fixed across different problems to avoid case-specific tuning and to highlight the stability of the proposed SEE-PINN framework. The effectiveness of these simple and uniform training settings is a direct consequence of the proposed equation-term scaling, which ensures balanced residual contributions and mitigates training instability. The manuscript has been revised to clarify this rationale. Changes in the manuscript: Section 3.2 - Added a new paragraph after the paragraph supporting the use of 75 training points: “All validation cases employ the Adam optimizer, owing to its robustness and widespread adoption in PINN-based studies. A fixed learning rate of 0.01 and 5000 training epochs are used for the rod problems, as these values consistently lead to stable convergence of the loss function below a prescribed tolerance. These hyperparameters were intentionally kept constant across different validation cases to avoid problem-specific tuning and to demonstrate that the proposed equation-term scaling yields reliable convergence under standard optimization settings. The balanced magnitude of the scaled residual terms allows the use of simple training configurations without the need for adaptive learning rates or multi-stage optimization strategies.” Section 3.2.4 - Added a complementary clarification to justify section of learning rate and training epochs for the beam problems: “A smaller learning rate and a higher number of training epochs are adopted for the beam problems due to the higher-order derivatives involved in the governing equation, which increase stiffness in the optimization landscape.” Comment 6 The x- and y-axis scales in the parity plots (Figures 3b, 7b, and 8b) are not consistent, which makes comparison somewhat difficult. Please revise these figures for clarity. Response: We thank the reviewer for this observation. All parity plots have been revised so that the x- and y-axes use identical ranges and scaling, ensuring direct visual comparability between predicted and reference solutions. This revision improves clarity and avoids any potential misinterpretation of the results. The updated figures are included in the revised manuscript. No changes in made in plotted data. Comment 7 Although the relative error defined in Equation 36 is reported, metrics such as MAE or RMSE may be more informative for practical applications and acceptable error assessment in physical units. Please consider including these metrics. Response: We thank the reviewer for this constructive suggestion. In addition to the normalized relative error, we have now included the Mean Absolute Error (MAE) and Root Mean Square Error (RMSE) as complementary quantitative metrics. These measures provide error estimates directly in physical units and facilitate practical interpretation of the results. The manuscript has been revised accordingly, and the additional metrics are reported for the validation cases. Changes in the manuscript: Section 3.2 - Added a new paragraph: “In addition to the normalized relative error, two standard error metrics are employed to quantify prediction accuracy in physical units: the Mean Absolute Error (MAE) and the Root Mean Square Error (RMSE), defined as (MEA and RMSE definitions). These metrics complement the relative error by providing absolute measures of accuracy that are directly interpretable in the physical domain.” Figures: Figures in validation cases have been updated to include the MAE and RMSE. Also, these values are mentioned in the “Comparison and error analysis” paragraph of each case. Comment 8 In Section 3.3.2 (Case Studies), reporting quantitative error metrics would better demonstrate that the proposed method reduces computational cost while maintaining acceptable accuracy. Response: We thank the reviewer for this valuable suggestion. To better quantify the trade-off between computational efficiency and accuracy, quantitative error metrics have been added to the case studies in Section 3.3.2. Specifically, MAE and RMSE values are now reported alongside the computational cost estimates. These additions explicitly demonstrate that the proposed SEE-PINN framework achieves comparable accuracy to state-of-the-art PINN models while reducing computational cost by two to three orders of magnitude. The manuscript has been revised accordingly. Changes in the manuscript: Figure 9: Added error metrics. Section 3.2.2 – Case 1. Added an explanatory paragraph right after mentioning Fig. 9: “In addition to the visual agreement shown in Figure 9, quantitative error metrics confirm the accuracy of the proposed approach. Figure 10: Added error metrics. Section 3.2.2 – Case 2. Added an explanatory paragraph right after mentioning Fig. 10: “Quantitative error metrics further support this observation. The MAE and RMSE obtained using SEE-PINN remain within acceptable limits for engineering applications and are comparable to the reference PINN solution, while the computational cost is reduced by approximately two orders of magnitude. This confirms that the proposed scaling-based framework maintains accuracy while significantly improving computational efficiency.” Section 3.2.2 – After Case 2. Added Table 1 with summary of benchmarks. Comment 9 The term ‘the authors’ used in Section 3.3.2 is ambiguous. Please clarify whether it refers to the authors of the current study or to authors of referenced works. Response: We thank the reviewer for highlighting this ambiguity. The manuscript has been revised to explicitly distinguish between the authors of the present study and the authors of the referenced works. Ambiguous instances of the term “the authors” have been replaced with clearer phrasing to avoid any possible confusion. Changes in the manuscript: Section 3.2.2 – Case 1: Replaced “The authors addressed…” with “The authors of [24] addressed…”. Section 3.2.2 – Case 2: Replaced “The authors employed…” with “The authors of [25] employed…”. Comment 10 In case 2 of Section 3.3.2, please explain the reason for using a different number of training data points compared with the reference study. Response: We thank the reviewer for this comment. In Case 2, the number of training (collocation) points used in the present study differs from that of the reference work by Singh et al. because the objective is not to replicate the original training configuration, but to provide a conservative and fair assessment of the proposed SEE-PINN framework. Specifically, a slightly higher number of collocation points is employed in the present study to ensure that any observed reduction in computational cost arises from the compact network architecture and the proposed equation-term scaling, rather than from a reduced training dataset. Despite this conservative choice, the SEE-PINN framework achieves comparable accuracy while still requiring significantly fewer floating-point operations. The manuscript has been revised to clarify this rationale. Changes in the manuscript: Section 3.2.2-Case 2 (after description of the network architecture): It is noted that the number of training (collocation) points used in the present study differs from that reported by Singh et al. A slightly higher number of collocation points is intentionally adopted to provide a conservative comparison and to ensure that the observed reduction in computational cost stems from the compact network architecture and the proposed equation-term scaling, rather than from a reduced training dataset. Despite this choice, the SEE-PINN framework achieves comparable accuracy while maintaining a substantial reduction in computational cost. Comment 11 Since SEE-PINN is the main contribution of this work, Section 4 should be revised to place greater emphasis on its advantages, limitations, and implications. Response: We thank the reviewer for this important remark. Section 4 has been revised to explicitly focus on the advantages, limitations, and broader implications of the proposed SEE-PINN framework. The revised discussion clarifies the conditions under which the method is most effective, its current limitations, and its potential impact on the practical adoption of PINNs in computational mechanics and related fields. Changes in the manuscript: Section 4 has been revised based on the Reviewer’s comment. We would like to sincerely thank the reviewer for the time and effort devoted to the evaluation of our manuscript and for the constructive comments provided. All reviewer comments have been addressed in full. The changes referenced below pertain to the revised version of the manuscript (Version 2), which is currently under submission. Detailed point-by-point responses to each reviewer comment follow. Comment 1 “Based on the statement, ‘Furthermore, our proposed method is straightforward to implement, as demonstrated through a step-by-step application to two distinct mechanical problems: an elastic rod and an Euler beam’, please clarify the motivation for selecting these two problems as representative case studies.” Response: We thank the reviewer for this comment. The elastic rod and Euler–Bernoulli beam problems were deliberately selected as representative benchmarks for three main reasons. First, they constitute canonical one-dimensional boundary value problems in solid mechanics, widely used in the PINN literature, which enables direct comparison with existing methods. Second, although both problems are one-dimensional, they differ fundamentally in the order of their governing differential equations (second-order for the rod and fourth-order for the beam), as well as in the number and type of boundary conditions required. This allows us to demonstrate that the proposed SEE-PINN framework is not tailored to a specific equation order or boundary-condition structure. Third, both problems naturally admit spatially varying material and geometric properties, leading to strong coefficient imbalance across equation terms. This makes them particularly suitable for assessing the effectiveness of direct equation-term scaling, which is the core contribution of this work. By applying the same normalization and training procedure to both cases, we demonstrate that SEE-PINN is a general, systematic, and easily transferable framework rather than a problem-specific solution. Changes in the manuscript: Introduction - Added a new paragraph right after mentioning the rod and beam problems: “The selection of the elastic rod and Euler–Bernoulli beam as case studies is intentional. These problems represent canonical one-dimensional boundary value problems in computational mechanics and are frequently adopted as benchmarks in the PINN literature, allowing direct comparison with existing approaches. Although both problems are one-dimensional, they differ fundamentally in the order of their governing equations (second-order for the rod and fourth-order for the beam) and in the number and nature of boundary conditions. This enables a clear demonstration that the proposed PINN framework is not limited to a specific equation order or boundary-condition structure. Moreover, both formulations naturally allow for spatially varying material and geometric properties, which induce strong imbalance among equation terms and therefore provide an ideal testbed for evaluating the effectiveness of direct differential equation term scaling.” Comment 2 The novelty of the SEE-PINN framework should be more clearly articulated. From the reviewer’s perspective, several scale-consistent or equation-enhanced learning approaches already exist in the literature. The authors should explicitly distinguish SEE-PINN from existing methods and emphasize its unique contributions. Response: We appreciate the reviewer’s observation and agree that the distinction between SEE-PINN and existing scale-consistent or equation-enhanced approaches should be made more explicit. While several methods address imbalance in PINNs through normalization, adaptive weighting, or equation reformulation, the proposed SEE-PINN differs fundamentally in both philosophy and implementation. Existing scale-consistent or equation-enhanced approaches typically (i) introduce additional hyperparameters, (ii) modify the loss function through adaptive or data-driven weighting, or (iii) increase the complexity of the training process by incorporating gradient statistics, auxiliary optimization loops, or higher-order residuals. In contrast, SEE-PINN performs a (pre-training) physically motivated scaling of the governing differential equation itself, prior to the construction of the loss function. The key novelty of SEE-PINN lies in the fact that loss balancing is eliminated entirely, rather than mitigated or adaptively corrected during training. Once the governing equation is expressed in a normalized, scale-consistent form, all residual terms naturally contribute at comparable magnitudes, allowing standard optimization settings to be used without additional tuning. This results in a simpler, deterministic, and computationally efficient PINN formulation. Furthermore, unlike reduced-order or reformulated PINN variants, SEE-PINN does not alter the mathematical structure of the problem, introduce auxiliary constraints, or require problem-specific architectural modifications. A single reverse-scaling step restores the solution to the physical domain, preserving full physical interpretability. To clarify these distinctions, the manuscript has been revised to explicitly position SEE-PINN relative to existing scale-consistent and equation-enhanced PINN methodologies. Changes in the manuscript: Introduction - Added a new paragraph to describe the novelties: “Although several scale-consistent, normalized, or equation-enhanced PINN variants have been proposed in the literature, most of these approaches address imbalance indirectly by introducing adaptive weights, auxiliary optimization strategies, or additional loss terms. In contrast, the proposed Scaled Equation-Enhanced PINN (SEE-PINN) introduces a fundamentally different paradigm: the governing differential equation itself is rescaled prior to training using physically meaningful characteristic quantities. This preprocessing step ensures that all residual terms naturally operate at comparable magnitudes, thereby eliminating the need for loss-balancing mechanisms altogether. As a result, SEE-PINN transforms the PINN training process into a simpler, deterministic, and computationally efficient workflow, without altering the mathematical structure of the problem or introducing additional hyperparameters.” Section 2 - Added the following clarification at the end of 2.2 (right before starting to examine the elastic rod - 2.2.1): “It is important to distinguish the proposed SEE-PINN framework from existing approaches that aim to alleviate loss-term imbalance in PINNs. Adaptive weighting methods dynamically modify the contribution of each loss term during training, often relying on gradient statistics, probabilistic models, or auxiliary optimization loops. Gradient-enhanced or equation-augmented PINNs enrich the loss function by incorporating higher-order derivatives or additional residual constraints, increasing both computational cost and implementation complexity. In contrast, SEE-PINN operates exclusively at the level of the governing differential equation. By rescaling each term using characteristic physical quantities prior to training, the resulting normalized equation is inherently balanced. Consequently, the loss function remains simple and fixed throughout training, and standard optimizers can be employed without tuning or adaptive mechanisms. This shift of complexity from the optimization stage to a one-time, physics-driven preprocessing step constitutes the central novelty of the proposed framework.” Comment 3 In Section 3.2 (Validation), the source of the data used for validation is unclear. Please clarify whether the data were obtained from experiments conducted by the authors or sourced from existing literature. Response: We thank the reviewer for pointing out this lack of clarity. No experimental data are used in this study. All validation data are obtained either from closed-form analytical solutions (when available) or from high-resolution numerical solutions generated for reference purposes. Specifically, for validation cases with constant material and geometric properties, analytical solutions are employed as ground truth. For cases involving spatially varying or nonlinear properties, where analytical solutions are not available, reference solutions are obtained using conventional numerical methods. The manuscript has been revised to explicitly state the origin of the validation data in Section 3.2 to ensure full transparency and reproducibility. Changes in the manuscript: Section 3.2 - Added a new paragraph (right before the first rod analysis – 3.2.1): “The validation data employed in this section do not originate from experimental measurements. For problems with constant material and geometric properties, analytical solutions are available and are used as reference benchmarks. In cases involving spatially varying or nonlinear material and geometric properties, where closed-form solutions are not available, high-resolution numerical solutions are generated and used for validation. These numerical references serve solely as ground truth for assessing the accuracy of the proposed SEE-PINN framework.” Section ‘Data Availability’ - Added a clarification: “The reference numerical solutions used for validation were generated using conventional numerical methods and are included in the shared dataset to ensure full reproducibility.” Comment 4 In Section 3.2, is the use of 75 training data points appropriate for the PINN framework? Please justify the selection of this number. Response: We thank the reviewer for this important question. The selection of 75 training (collocation) points is intentional and directly linked to the objectives of this study. The primary aim of SEE-PINN is to demonstrate that physically consistent equation-term scaling significantly improves training efficiency, allowing accurate solutions to be obtained with compact network architectures and a limited number of collocation points. In all validation cases, the governing equations are one-dimensional, and the scaling procedure ensures that all residual terms operate at comparable magnitudes. Under these conditions, a relatively small number of uniformly distributed collocation points is sufficient to accurately capture the solution. Increasing the number of training points beyond this value was observed to yield negligible improvements in accuracy while proportionally increasing computational cost. Furthermore, the same number of training points is consistently used across multiple problems of increasing complexity, demonstrating the robustness of the proposed approach rather than problem-specific tuning. The manuscript has been revised to clarify the rationale behind this choice. Changes in the manuscript: Section 3.2 - Added a clarification (after the introductory paragraph): “All validation cases employ 75 uniformly distributed collocation points. This choice reflects a deliberate trade-off between accuracy and computational efficiency. Due to the physically consistent scaling of the governing equations, the residual terms are well-balanced, allowing accurate solutions to be obtained with a relatively small number of training points. Increasing the number of collocation points was found to provide marginal accuracy gains while significantly increasing computational cost. Using a fixed number of training points across problems of increasing complexity further highlights the robustness and generality of the proposed SEE-PINN framework.” Comment 5 Please explain the rationale for choosing the Adam optimizer with a learning rate of 0.01 and 5000 training epochs throughout Section 3.2. Response: We thank the reviewer for this comment. The Adam optimizer was selected due to its widespread use and demonstrated robustness in training PINNs, particularly for problems involving automatic differentiation and stiff residual landscapes. The learning rate and number of epochs were chosen to reflect a standard, non-optimized training configuration. A learning rate of 0.01 was found to provide stable and fast convergence for the scaled governing equations, while 5000 training epochs were sufficient for the loss to consistently converge below a prescribed tolerance across all validation cases. Importantly, these parameters were kept fixed across different problems to avoid case-specific tuning and to highlight the stability of the proposed SEE-PINN framework. The effectiveness of these simple and uniform training settings is a direct consequence of the proposed equation-term scaling, which ensures balanced residual contributions and mitigates training instability. The manuscript has been revised to clarify this rationale. Changes in the manuscript: Section 3.2 - Added a new paragraph after the paragraph supporting the use of 75 training points: “All validation cases employ the Adam optimizer, owing to its robustness and widespread adoption in PINN-based studies. A fixed learning rate of 0.01 and 5000 training epochs are used for the rod problems, as these values consistently lead to stable convergence of the loss function below a prescribed tolerance. These hyperparameters were intentionally kept constant across different validation cases to avoid problem-specific tuning and to demonstrate that the proposed equation-term scaling yields reliable convergence under standard optimization settings. The balanced magnitude of the scaled residual terms allows the use of simple training configurations without the need for adaptive learning rates or multi-stage optimization strategies.” Section 3.2.4 - Added a complementary clarification to justify section of learning rate and training epochs for the beam problems: “A smaller learning rate and a higher number of training epochs are adopted for the beam problems due to the higher-order derivatives involved in the governing equation, which increase stiffness in the optimization landscape.” Comment 6 The x- and y-axis scales in the parity plots (Figures 3b, 7b, and 8b) are not consistent, which makes comparison somewhat difficult. Please revise these figures for clarity. Response: We thank the reviewer for this observation. All parity plots have been revised so that the x- and y-axes use identical ranges and scaling, ensuring direct visual comparability between predicted and reference solutions. This revision improves clarity and avoids any potential misinterpretation of the results. The updated figures are included in the revised manuscript. No changes in made in plotted data. Comment 7 Although the relative error defined in Equation 36 is reported, metrics such as MAE or RMSE may be more informative for practical applications and acceptable error assessment in physical units. Please consider including these metrics. Response: We thank the reviewer for this constructive suggestion. In addition to the normalized relative error, we have now included the Mean Absolute Error (MAE) and Root Mean Square Error (RMSE) as complementary quantitative metrics. These measures provide error estimates directly in physical units and facilitate practical interpretation of the results. The manuscript has been revised accordingly, and the additional metrics are reported for the validation cases. Changes in the manuscript: Section 3.2 - Added a new paragraph: “In addition to the normalized relative error, two standard error metrics are employed to quantify prediction accuracy in physical units: the Mean Absolute Error (MAE) and the Root Mean Square Error (RMSE), defined as (MEA and RMSE definitions). These metrics complement the relative error by providing absolute measures of accuracy that are directly interpretable in the physical domain.” Figures: Figures in validation cases have been updated to include the MAE and RMSE. Also, these values are mentioned in the “Comparison and error analysis” paragraph of each case. Comment 8 In Section 3.3.2 (Case Studies), reporting quantitative error metrics would better demonstrate that the proposed method reduces computational cost while maintaining acceptable accuracy. Response: We thank the reviewer for this valuable suggestion. To better quantify the trade-off between computational efficiency and accuracy, quantitative error metrics have been added to the case studies in Section 3.3.2. Specifically, MAE and RMSE values are now reported alongside the computational cost estimates. These additions explicitly demonstrate that the proposed SEE-PINN framework achieves comparable accuracy to state-of-the-art PINN models while reducing computational cost by two to three orders of magnitude. The manuscript has been revised accordingly. Changes in the manuscript: Figure 9: Added error metrics. Section 3.2.2 – Case 1. Added an explanatory paragraph right after mentioning Fig. 9: “In addition to the visual agreement shown in Figure 9, quantitative error metrics confirm the accuracy of the proposed approach. Figure 10: Added error metrics. Section 3.2.2 – Case 2. Added an explanatory paragraph right after mentioning Fig. 10: “Quantitative error metrics further support this observation. The MAE and RMSE obtained using SEE-PINN remain within acceptable limits for engineering applications and are comparable to the reference PINN solution, while the computational cost is reduced by approximately two orders of magnitude. This confirms that the proposed scaling-based framework maintains accuracy while significantly improving computational efficiency.” Section 3.2.2 – After Case 2. Added Table 1 with summary of benchmarks. Comment 9 The term ‘the authors’ used in Section 3.3.2 is ambiguous. Please clarify whether it refers to the authors of the current study or to authors of referenced works. Response: We thank the reviewer for highlighting this ambiguity. The manuscript has been revised to explicitly distinguish between the authors of the present study and the authors of the referenced works. Ambiguous instances of the term “the authors” have been replaced with clearer phrasing to avoid any possible confusion. Changes in the manuscript: Section 3.2.2 – Case 1: Replaced “The authors addressed…” with “The authors of [24] addressed…”. Section 3.2.2 – Case 2: Replaced “The authors employed…” with “The authors of [25] employed…”. Comment 10 In case 2 of Section 3.3.2, please explain the reason for using a different number of training data points compared with the reference study. Response: We thank the reviewer for this comment. In Case 2, the number of training (collocation) points used in the present study differs from that of the reference work by Singh et al. because the objective is not to replicate the original training configuration, but to provide a conservative and fair assessment of the proposed SEE-PINN framework. Specifically, a slightly higher number of collocation points is employed in the present study to ensure that any observed reduction in computational cost arises from the compact network architecture and the proposed equation-term scaling, rather than from a reduced training dataset. Despite this conservative choice, the SEE-PINN framework achieves comparable accuracy while still requiring significantly fewer floating-point operations. The manuscript has been revised to clarify this rationale. Changes in the manuscript: Section 3.2.2-Case 2 (after description of the network architecture): It is noted that the number of training (collocation) points used in the present study differs from that reported by Singh et al. A slightly higher number of collocation points is intentionally adopted to provide a conservative comparison and to ensure that the observed reduction in computational cost stems from the compact network architecture and the proposed equation-term scaling, rather than from a reduced training dataset. Despite this choice, the SEE-PINN framework achieves comparable accuracy while maintaining a substantial reduction in computational cost. Comment 11 Since SEE-PINN is the main contribution of this work, Section 4 should be revised to place greater emphasis on its advantages, limitations, and implications. Response: We thank the reviewer for this important remark. Section 4 has been revised to explicitly focus on the advantages, limitations, and broader implications of the proposed SEE-PINN framework. The revised discussion clarifies the conditions under which the method is most effective, its current limitations, and its potential impact on the practical adoption of PINNs in computational mechanics and related fields. Changes in the manuscript: Section 4 has been revised based on the Reviewer’s comment. Competing Interests: No competing interests were disclosed. Close Report a concern Respond or Comment COMMENTS ON THIS REPORT Author Response 24 Jan 2026 Theodosios Theodosiou , Dept. of Energy Systems, University of Thessaly - Larissa, Larissa, 41500, Greece 24 Jan 2026 Author Response We would like to sincerely thank the reviewer for the time and effort devoted to the evaluation of our manuscript and for the constructive comments provided. All reviewer comments have ... Continue reading We would like to sincerely thank the reviewer for the time and effort devoted to the evaluation of our manuscript and for the constructive comments provided. All reviewer comments have been addressed in full. The changes referenced below pertain to the revised version of the manuscript (Version 2), which is currently under submission. Detailed point-by-point responses to each reviewer comment follow. Comment 1 “Based on the statement, ‘Furthermore, our proposed method is straightforward to implement, as demonstrated through a step-by-step application to two distinct mechanical problems: an elastic rod and an Euler beam’, please clarify the motivation for selecting these two problems as representative case studies.” Response: We thank the reviewer for this comment. The elastic rod and Euler–Bernoulli beam problems were deliberately selected as representative benchmarks for three main reasons. First, they constitute canonical one-dimensional boundary value problems in solid mechanics, widely used in the PINN literature, which enables direct comparison with existing methods. Second, although both problems are one-dimensional, they differ fundamentally in the order of their governing differential equations (second-order for the rod and fourth-order for the beam), as well as in the number and type of boundary conditions required. This allows us to demonstrate that the proposed SEE-PINN framework is not tailored to a specific equation order or boundary-condition structure. Third, both problems naturally admit spatially varying material and geometric properties, leading to strong coefficient imbalance across equation terms. This makes them particularly suitable for assessing the effectiveness of direct equation-term scaling, which is the core contribution of this work. By applying the same normalization and training procedure to both cases, we demonstrate that SEE-PINN is a general, systematic, and easily transferable framework rather than a problem-specific solution. Changes in the manuscript: Introduction - Added a new paragraph right after mentioning the rod and beam problems: “The selection of the elastic rod and Euler–Bernoulli beam as case studies is intentional. These problems represent canonical one-dimensional boundary value problems in computational mechanics and are frequently adopted as benchmarks in the PINN literature, allowing direct comparison with existing approaches. Although both problems are one-dimensional, they differ fundamentally in the order of their governing equations (second-order for the rod and fourth-order for the beam) and in the number and nature of boundary conditions. This enables a clear demonstration that the proposed PINN framework is not limited to a specific equation order or boundary-condition structure. Moreover, both formulations naturally allow for spatially varying material and geometric properties, which induce strong imbalance among equation terms and therefore provide an ideal testbed for evaluating the effectiveness of direct differential equation term scaling.” Comment 2 The novelty of the SEE-PINN framework should be more clearly articulated. From the reviewer’s perspective, several scale-consistent or equation-enhanced learning approaches already exist in the literature. The authors should explicitly distinguish SEE-PINN from existing methods and emphasize its unique contributions. Response: We appreciate the reviewer’s observation and agree that the distinction between SEE-PINN and existing scale-consistent or equation-enhanced approaches should be made more explicit. While several methods address imbalance in PINNs through normalization, adaptive weighting, or equation reformulation, the proposed SEE-PINN differs fundamentally in both philosophy and implementation. Existing scale-consistent or equation-enhanced approaches typically (i) introduce additional hyperparameters, (ii) modify the loss function through adaptive or data-driven weighting, or (iii) increase the complexity of the training process by incorporating gradient statistics, auxiliary optimization loops, or higher-order residuals. In contrast, SEE-PINN performs a (pre-training) physically motivated scaling of the governing differential equation itself, prior to the construction of the loss function. The key novelty of SEE-PINN lies in the fact that loss balancing is eliminated entirely, rather than mitigated or adaptively corrected during training. Once the governing equation is expressed in a normalized, scale-consistent form, all residual terms naturally contribute at comparable magnitudes, allowing standard optimization settings to be used without additional tuning. This results in a simpler, deterministic, and computationally efficient PINN formulation. Furthermore, unlike reduced-order or reformulated PINN variants, SEE-PINN does not alter the mathematical structure of the problem, introduce auxiliary constraints, or require problem-specific architectural modifications. A single reverse-scaling step restores the solution to the physical domain, preserving full physical interpretability. To clarify these distinctions, the manuscript has been revised to explicitly position SEE-PINN relative to existing scale-consistent and equation-enhanced PINN methodologies. Changes in the manuscript: Introduction - Added a new paragraph to describe the novelties: “Although several scale-consistent, normalized, or equation-enhanced PINN variants have been proposed in the literature, most of these approaches address imbalance indirectly by introducing adaptive weights, auxiliary optimization strategies, or additional loss terms. In contrast, the proposed Scaled Equation-Enhanced PINN (SEE-PINN) introduces a fundamentally different paradigm: the governing differential equation itself is rescaled prior to training using physically meaningful characteristic quantities. This preprocessing step ensures that all residual terms naturally operate at comparable magnitudes, thereby eliminating the need for loss-balancing mechanisms altogether. As a result, SEE-PINN transforms the PINN training process into a simpler, deterministic, and computationally efficient workflow, without altering the mathematical structure of the problem or introducing additional hyperparameters.” Section 2 - Added the following clarification at the end of 2.2 (right before starting to examine the elastic rod - 2.2.1): “It is important to distinguish the proposed SEE-PINN framework from existing approaches that aim to alleviate loss-term imbalance in PINNs. Adaptive weighting methods dynamically modify the contribution of each loss term during training, often relying on gradient statistics, probabilistic models, or auxiliary optimization loops. Gradient-enhanced or equation-augmented PINNs enrich the loss function by incorporating higher-order derivatives or additional residual constraints, increasing both computational cost and implementation complexity. In contrast, SEE-PINN operates exclusively at the level of the governing differential equation. By rescaling each term using characteristic physical quantities prior to training, the resulting normalized equation is inherently balanced. Consequently, the loss function remains simple and fixed throughout training, and standard optimizers can be employed without tuning or adaptive mechanisms. This shift of complexity from the optimization stage to a one-time, physics-driven preprocessing step constitutes the central novelty of the proposed framework.” Comment 3 In Section 3.2 (Validation), the source of the data used for validation is unclear. Please clarify whether the data were obtained from experiments conducted by the authors or sourced from existing literature. Response: We thank the reviewer for pointing out this lack of clarity. No experimental data are used in this study. All validation data are obtained either from closed-form analytical solutions (when available) or from high-resolution numerical solutions generated for reference purposes. Specifically, for validation cases with constant material and geometric properties, analytical solutions are employed as ground truth. For cases involving spatially varying or nonlinear properties, where analytical solutions are not available, reference solutions are obtained using conventional numerical methods. The manuscript has been revised to explicitly state the origin of the validation data in Section 3.2 to ensure full transparency and reproducibility. Changes in the manuscript: Section 3.2 - Added a new paragraph (right before the first rod analysis – 3.2.1): “The validation data employed in this section do not originate from experimental measurements. For problems with constant material and geometric properties, analytical solutions are available and are used as reference benchmarks. In cases involving spatially varying or nonlinear material and geometric properties, where closed-form solutions are not available, high-resolution numerical solutions are generated and used for validation. These numerical references serve solely as ground truth for assessing the accuracy of the proposed SEE-PINN framework.” Section ‘Data Availability’ - Added a clarification: “The reference numerical solutions used for validation were generated using conventional numerical methods and are included in the shared dataset to ensure full reproducibility.” Comment 4 In Section 3.2, is the use of 75 training data points appropriate for the PINN framework? Please justify the selection of this number. Response: We thank the reviewer for this important question. The selection of 75 training (collocation) points is intentional and directly linked to the objectives of this study. The primary aim of SEE-PINN is to demonstrate that physically consistent equation-term scaling significantly improves training efficiency, allowing accurate solutions to be obtained with compact network architectures and a limited number of collocation points. In all validation cases, the governing equations are one-dimensional, and the scaling procedure ensures that all residual terms operate at comparable magnitudes. Under these conditions, a relatively small number of uniformly distributed collocation points is sufficient to accurately capture the solution. Increasing the number of training points beyond this value was observed to yield negligible improvements in accuracy while proportionally increasing computational cost. Furthermore, the same number of training points is consistently used across multiple problems of increasing complexity, demonstrating the robustness of the proposed approach rather than problem-specific tuning. The manuscript has been revised to clarify the rationale behind this choice. Changes in the manuscript: Section 3.2 - Added a clarification (after the introductory paragraph): “All validation cases employ 75 uniformly distributed collocation points. This choice reflects a deliberate trade-off between accuracy and computational efficiency. Due to the physically consistent scaling of the governing equations, the residual terms are well-balanced, allowing accurate solutions to be obtained with a relatively small number of training points. Increasing the number of collocation points was found to provide marginal accuracy gains while significantly increasing computational cost. Using a fixed number of training points across problems of increasing complexity further highlights the robustness and generality of the proposed SEE-PINN framework.” Comment 5 Please explain the rationale for choosing the Adam optimizer with a learning rate of 0.01 and 5000 training epochs throughout Section 3.2. Response: We thank the reviewer for this comment. The Adam optimizer was selected due to its widespread use and demonstrated robustness in training PINNs, particularly for problems involving automatic differentiation and stiff residual landscapes. The learning rate and number of epochs were chosen to reflect a standard, non-optimized training configuration. A learning rate of 0.01 was found to provide stable and fast convergence for the scaled governing equations, while 5000 training epochs were sufficient for the loss to consistently converge below a prescribed tolerance across all validation cases. Importantly, these parameters were kept fixed across different problems to avoid case-specific tuning and to highlight the stability of the proposed SEE-PINN framework. The effectiveness of these simple and uniform training settings is a direct consequence of the proposed equation-term scaling, which ensures balanced residual contributions and mitigates training instability. The manuscript has been revised to clarify this rationale. Changes in the manuscript: Section 3.2 - Added a new paragraph after the paragraph supporting the use of 75 training points: “All validation cases employ the Adam optimizer, owing to its robustness and widespread adoption in PINN-based studies. A fixed learning rate of 0.01 and 5000 training epochs are used for the rod problems, as these values consistently lead to stable convergence of the loss function below a prescribed tolerance. These hyperparameters were intentionally kept constant across different validation cases to avoid problem-specific tuning and to demonstrate that the proposed equation-term scaling yields reliable convergence under standard optimization settings. The balanced magnitude of the scaled residual terms allows the use of simple training configurations without the need for adaptive learning rates or multi-stage optimization strategies.” Section 3.2.4 - Added a complementary clarification to justify section of learning rate and training epochs for the beam problems: “A smaller learning rate and a higher number of training epochs are adopted for the beam problems due to the higher-order derivatives involved in the governing equation, which increase stiffness in the optimization landscape.” Comment 6 The x- and y-axis scales in the parity plots (Figures 3b, 7b, and 8b) are not consistent, which makes comparison somewhat difficult. Please revise these figures for clarity. Response: We thank the reviewer for this observation. All parity plots have been revised so that the x- and y-axes use identical ranges and scaling, ensuring direct visual comparability between predicted and reference solutions. This revision improves clarity and avoids any potential misinterpretation of the results. The updated figures are included in the revised manuscript. No changes in made in plotted data. Comment 7 Although the relative error defined in Equation 36 is reported, metrics such as MAE or RMSE may be more informative for practical applications and acceptable error assessment in physical units. Please consider including these metrics. Response: We thank the reviewer for this constructive suggestion. In addition to the normalized relative error, we have now included the Mean Absolute Error (MAE) and Root Mean Square Error (RMSE) as complementary quantitative metrics. These measures provide error estimates directly in physical units and facilitate practical interpretation of the results. The manuscript has been revised accordingly, and the additional metrics are reported for the validation cases. Changes in the manuscript: Section 3.2 - Added a new paragraph: “In addition to the normalized relative error, two standard error metrics are employed to quantify prediction accuracy in physical units: the Mean Absolute Error (MAE) and the Root Mean Square Error (RMSE), defined as (MEA and RMSE definitions). These metrics complement the relative error by providing absolute measures of accuracy that are directly interpretable in the physical domain.” Figures: Figures in validation cases have been updated to include the MAE and RMSE. Also, these values are mentioned in the “Comparison and error analysis” paragraph of each case. Comment 8 In Section 3.3.2 (Case Studies), reporting quantitative error metrics would better demonstrate that the proposed method reduces computational cost while maintaining acceptable accuracy. Response: We thank the reviewer for this valuable suggestion. To better quantify the trade-off between computational efficiency and accuracy, quantitative error metrics have been added to the case studies in Section 3.3.2. Specifically, MAE and RMSE values are now reported alongside the computational cost estimates. These additions explicitly demonstrate that the proposed SEE-PINN framework achieves comparable accuracy to state-of-the-art PINN models while reducing computational cost by two to three orders of magnitude. The manuscript has been revised accordingly. Changes in the manuscript: Figure 9: Added error metrics. Section 3.2.2 – Case 1. Added an explanatory paragraph right after mentioning Fig. 9: “In addition to the visual agreement shown in Figure 9, quantitative error metrics confirm the accuracy of the proposed approach. Figure 10: Added error metrics. Section 3.2.2 – Case 2. Added an explanatory paragraph right after mentioning Fig. 10: “Quantitative error metrics further support this observation. The MAE and RMSE obtained using SEE-PINN remain within acceptable limits for engineering applications and are comparable to the reference PINN solution, while the computational cost is reduced by approximately two orders of magnitude. This confirms that the proposed scaling-based framework maintains accuracy while significantly improving computational efficiency.” Section 3.2.2 – After Case 2. Added Table 1 with summary of benchmarks. Comment 9 The term ‘the authors’ used in Section 3.3.2 is ambiguous. Please clarify whether it refers to the authors of the current study or to authors of referenced works. Response: We thank the reviewer for highlighting this ambiguity. The manuscript has been revised to explicitly distinguish between the authors of the present study and the authors of the referenced works. Ambiguous instances of the term “the authors” have been replaced with clearer phrasing to avoid any possible confusion. Changes in the manuscript: Section 3.2.2 – Case 1: Replaced “The authors addressed…” with “The authors of [24] addressed…”. Section 3.2.2 – Case 2: Replaced “The authors employed…” with “The authors of [25] employed…”. Comment 10 In case 2 of Section 3.3.2, please explain the reason for using a different number of training data points compared with the reference study. Response: We thank the reviewer for this comment. In Case 2, the number of training (collocation) points used in the present study differs from that of the reference work by Singh et al. because the objective is not to replicate the original training configuration, but to provide a conservative and fair assessment of the proposed SEE-PINN framework. Specifically, a slightly higher number of collocation points is employed in the present study to ensure that any observed reduction in computational cost arises from the compact network architecture and the proposed equation-term scaling, rather than from a reduced training dataset. Despite this conservative choice, the SEE-PINN framework achieves comparable accuracy while still requiring significantly fewer floating-point operations. The manuscript has been revised to clarify this rationale. Changes in the manuscript: Section 3.2.2-Case 2 (after description of the network architecture): It is noted that the number of training (collocation) points used in the present study differs from that reported by Singh et al. A slightly higher number of collocation points is intentionally adopted to provide a conservative comparison and to ensure that the observed reduction in computational cost stems from the compact network architecture and the proposed equation-term scaling, rather than from a reduced training dataset. Despite this choice, the SEE-PINN framework achieves comparable accuracy while maintaining a substantial reduction in computational cost. Comment 11 Since SEE-PINN is the main contribution of this work, Section 4 should be revised to place greater emphasis on its advantages, limitations, and implications. Response: We thank the reviewer for this important remark. Section 4 has been revised to explicitly focus on the advantages, limitations, and broader implications of the proposed SEE-PINN framework. The revised discussion clarifies the conditions under which the method is most effective, its current limitations, and its potential impact on the practical adoption of PINNs in computational mechanics and related fields. Changes in the manuscript: Section 4 has been revised based on the Reviewer’s comment. We would like to sincerely thank the reviewer for the time and effort devoted to the evaluation of our manuscript and for the constructive comments provided. All reviewer comments have been addressed in full. The changes referenced below pertain to the revised version of the manuscript (Version 2), which is currently under submission. Detailed point-by-point responses to each reviewer comment follow. Comment 1 “Based on the statement, ‘Furthermore, our proposed method is straightforward to implement, as demonstrated through a step-by-step application to two distinct mechanical problems: an elastic rod and an Euler beam’, please clarify the motivation for selecting these two problems as representative case studies.” Response: We thank the reviewer for this comment. The elastic rod and Euler–Bernoulli beam problems were deliberately selected as representative benchmarks for three main reasons. First, they constitute canonical one-dimensional boundary value problems in solid mechanics, widely used in the PINN literature, which enables direct comparison with existing methods. Second, although both problems are one-dimensional, they differ fundamentally in the order of their governing differential equations (second-order for the rod and fourth-order for the beam), as well as in the number and type of boundary conditions required. This allows us to demonstrate that the proposed SEE-PINN framework is not tailored to a specific equation order or boundary-condition structure. Third, both problems naturally admit spatially varying material and geometric properties, leading to strong coefficient imbalance across equation terms. This makes them particularly suitable for assessing the effectiveness of direct equation-term scaling, which is the core contribution of this work. By applying the same normalization and training procedure to both cases, we demonstrate that SEE-PINN is a general, systematic, and easily transferable framework rather than a problem-specific solution. Changes in the manuscript: Introduction - Added a new paragraph right after mentioning the rod and beam problems: “The selection of the elastic rod and Euler–Bernoulli beam as case studies is intentional. These problems represent canonical one-dimensional boundary value problems in computational mechanics and are frequently adopted as benchmarks in the PINN literature, allowing direct comparison with existing approaches. Although both problems are one-dimensional, they differ fundamentally in the order of their governing equations (second-order for the rod and fourth-order for the beam) and in the number and nature of boundary conditions. This enables a clear demonstration that the proposed PINN framework is not limited to a specific equation order or boundary-condition structure. Moreover, both formulations naturally allow for spatially varying material and geometric properties, which induce strong imbalance among equation terms and therefore provide an ideal testbed for evaluating the effectiveness of direct differential equation term scaling.” Comment 2 The novelty of the SEE-PINN framework should be more clearly articulated. From the reviewer’s perspective, several scale-consistent or equation-enhanced learning approaches already exist in the literature. The authors should explicitly distinguish SEE-PINN from existing methods and emphasize its unique contributions. Response: We appreciate the reviewer’s observation and agree that the distinction between SEE-PINN and existing scale-consistent or equation-enhanced approaches should be made more explicit. While several methods address imbalance in PINNs through normalization, adaptive weighting, or equation reformulation, the proposed SEE-PINN differs fundamentally in both philosophy and implementation. Existing scale-consistent or equation-enhanced approaches typically (i) introduce additional hyperparameters, (ii) modify the loss function through adaptive or data-driven weighting, or (iii) increase the complexity of the training process by incorporating gradient statistics, auxiliary optimization loops, or higher-order residuals. In contrast, SEE-PINN performs a (pre-training) physically motivated scaling of the governing differential equation itself, prior to the construction of the loss function. The key novelty of SEE-PINN lies in the fact that loss balancing is eliminated entirely, rather than mitigated or adaptively corrected during training. Once the governing equation is expressed in a normalized, scale-consistent form, all residual terms naturally contribute at comparable magnitudes, allowing standard optimization settings to be used without additional tuning. This results in a simpler, deterministic, and computationally efficient PINN formulation. Furthermore, unlike reduced-order or reformulated PINN variants, SEE-PINN does not alter the mathematical structure of the problem, introduce auxiliary constraints, or require problem-specific architectural modifications. A single reverse-scaling step restores the solution to the physical domain, preserving full physical interpretability. To clarify these distinctions, the manuscript has been revised to explicitly position SEE-PINN relative to existing scale-consistent and equation-enhanced PINN methodologies. Changes in the manuscript: Introduction - Added a new paragraph to describe the novelties: “Although several scale-consistent, normalized, or equation-enhanced PINN variants have been proposed in the literature, most of these approaches address imbalance indirectly by introducing adaptive weights, auxiliary optimization strategies, or additional loss terms. In contrast, the proposed Scaled Equation-Enhanced PINN (SEE-PINN) introduces a fundamentally different paradigm: the governing differential equation itself is rescaled prior to training using physically meaningful characteristic quantities. This preprocessing step ensures that all residual terms naturally operate at comparable magnitudes, thereby eliminating the need for loss-balancing mechanisms altogether. As a result, SEE-PINN transforms the PINN training process into a simpler, deterministic, and computationally efficient workflow, without altering the mathematical structure of the problem or introducing additional hyperparameters.” Section 2 - Added the following clarification at the end of 2.2 (right before starting to examine the elastic rod - 2.2.1): “It is important to distinguish the proposed SEE-PINN framework from existing approaches that aim to alleviate loss-term imbalance in PINNs. Adaptive weighting methods dynamically modify the contribution of each loss term during training, often relying on gradient statistics, probabilistic models, or auxiliary optimization loops. Gradient-enhanced or equation-augmented PINNs enrich the loss function by incorporating higher-order derivatives or additional residual constraints, increasing both computational cost and implementation complexity. In contrast, SEE-PINN operates exclusively at the level of the governing differential equation. By rescaling each term using characteristic physical quantities prior to training, the resulting normalized equation is inherently balanced. Consequently, the loss function remains simple and fixed throughout training, and standard optimizers can be employed without tuning or adaptive mechanisms. This shift of complexity from the optimization stage to a one-time, physics-driven preprocessing step constitutes the central novelty of the proposed framework.” Comment 3 In Section 3.2 (Validation), the source of the data used for validation is unclear. Please clarify whether the data were obtained from experiments conducted by the authors or sourced from existing literature. Response: We thank the reviewer for pointing out this lack of clarity. No experimental data are used in this study. All validation data are obtained either from closed-form analytical solutions (when available) or from high-resolution numerical solutions generated for reference purposes. Specifically, for validation cases with constant material and geometric properties, analytical solutions are employed as ground truth. For cases involving spatially varying or nonlinear properties, where analytical solutions are not available, reference solutions are obtained using conventional numerical methods. The manuscript has been revised to explicitly state the origin of the validation data in Section 3.2 to ensure full transparency and reproducibility. Changes in the manuscript: Section 3.2 - Added a new paragraph (right before the first rod analysis – 3.2.1): “The validation data employed in this section do not originate from experimental measurements. For problems with constant material and geometric properties, analytical solutions are available and are used as reference benchmarks. In cases involving spatially varying or nonlinear material and geometric properties, where closed-form solutions are not available, high-resolution numerical solutions are generated and used for validation. These numerical references serve solely as ground truth for assessing the accuracy of the proposed SEE-PINN framework.” Section ‘Data Availability’ - Added a clarification: “The reference numerical solutions used for validation were generated using conventional numerical methods and are included in the shared dataset to ensure full reproducibility.” Comment 4 In Section 3.2, is the use of 75 training data points appropriate for the PINN framework? Please justify the selection of this number. Response: We thank the reviewer for this important question. The selection of 75 training (collocation) points is intentional and directly linked to the objectives of this study. The primary aim of SEE-PINN is to demonstrate that physically consistent equation-term scaling significantly improves training efficiency, allowing accurate solutions to be obtained with compact network architectures and a limited number of collocation points. In all validation cases, the governing equations are one-dimensional, and the scaling procedure ensures that all residual terms operate at comparable magnitudes. Under these conditions, a relatively small number of uniformly distributed collocation points is sufficient to accurately capture the solution. Increasing the number of training points beyond this value was observed to yield negligible improvements in accuracy while proportionally increasing computational cost. Furthermore, the same number of training points is consistently used across multiple problems of increasing complexity, demonstrating the robustness of the proposed approach rather than problem-specific tuning. The manuscript has been revised to clarify the rationale behind this choice. Changes in the manuscript: Section 3.2 - Added a clarification (after the introductory paragraph): “All validation cases employ 75 uniformly distributed collocation points. This choice reflects a deliberate trade-off between accuracy and computational efficiency. Due to the physically consistent scaling of the governing equations, the residual terms are well-balanced, allowing accurate solutions to be obtained with a relatively small number of training points. Increasing the number of collocation points was found to provide marginal accuracy gains while significantly increasing computational cost. Using a fixed number of training points across problems of increasing complexity further highlights the robustness and generality of the proposed SEE-PINN framework.” Comment 5 Please explain the rationale for choosing the Adam optimizer with a learning rate of 0.01 and 5000 training epochs throughout Section 3.2. Response: We thank the reviewer for this comment. The Adam optimizer was selected due to its widespread use and demonstrated robustness in training PINNs, particularly for problems involving automatic differentiation and stiff residual landscapes. The learning rate and number of epochs were chosen to reflect a standard, non-optimized training configuration. A learning rate of 0.01 was found to provide stable and fast convergence for the scaled governing equations, while 5000 training epochs were sufficient for the loss to consistently converge below a prescribed tolerance across all validation cases. Importantly, these parameters were kept fixed across different problems to avoid case-specific tuning and to highlight the stability of the proposed SEE-PINN framework. The effectiveness of these simple and uniform training settings is a direct consequence of the proposed equation-term scaling, which ensures balanced residual contributions and mitigates training instability. The manuscript has been revised to clarify this rationale. Changes in the manuscript: Section 3.2 - Added a new paragraph after the paragraph supporting the use of 75 training points: “All validation cases employ the Adam optimizer, owing to its robustness and widespread adoption in PINN-based studies. A fixed learning rate of 0.01 and 5000 training epochs are used for the rod problems, as these values consistently lead to stable convergence of the loss function below a prescribed tolerance. These hyperparameters were intentionally kept constant across different validation cases to avoid problem-specific tuning and to demonstrate that the proposed equation-term scaling yields reliable convergence under standard optimization settings. The balanced magnitude of the scaled residual terms allows the use of simple training configurations without the need for adaptive learning rates or multi-stage optimization strategies.” Section 3.2.4 - Added a complementary clarification to justify section of learning rate and training epochs for the beam problems: “A smaller learning rate and a higher number of training epochs are adopted for the beam problems due to the higher-order derivatives involved in the governing equation, which increase stiffness in the optimization landscape.” Comment 6 The x- and y-axis scales in the parity plots (Figures 3b, 7b, and 8b) are not consistent, which makes comparison somewhat difficult. Please revise these figures for clarity. Response: We thank the reviewer for this observation. All parity plots have been revised so that the x- and y-axes use identical ranges and scaling, ensuring direct visual comparability between predicted and reference solutions. This revision improves clarity and avoids any potential misinterpretation of the results. The updated figures are included in the revised manuscript. No changes in made in plotted data. Comment 7 Although the relative error defined in Equation 36 is reported, metrics such as MAE or RMSE may be more informative for practical applications and acceptable error assessment in physical units. Please consider including these metrics. Response: We thank the reviewer for this constructive suggestion. In addition to the normalized relative error, we have now included the Mean Absolute Error (MAE) and Root Mean Square Error (RMSE) as complementary quantitative metrics. These measures provide error estimates directly in physical units and facilitate practical interpretation of the results. The manuscript has been revised accordingly, and the additional metrics are reported for the validation cases. Changes in the manuscript: Section 3.2 - Added a new paragraph: “In addition to the normalized relative error, two standard error metrics are employed to quantify prediction accuracy in physical units: the Mean Absolute Error (MAE) and the Root Mean Square Error (RMSE), defined as (MEA and RMSE definitions). These metrics complement the relative error by providing absolute measures of accuracy that are directly interpretable in the physical domain.” Figures: Figures in validation cases have been updated to include the MAE and RMSE. Also, these values are mentioned in the “Comparison and error analysis” paragraph of each case. Comment 8 In Section 3.3.2 (Case Studies), reporting quantitative error metrics would better demonstrate that the proposed method reduces computational cost while maintaining acceptable accuracy. Response: We thank the reviewer for this valuable suggestion. To better quantify the trade-off between computational efficiency and accuracy, quantitative error metrics have been added to the case studies in Section 3.3.2. Specifically, MAE and RMSE values are now reported alongside the computational cost estimates. These additions explicitly demonstrate that the proposed SEE-PINN framework achieves comparable accuracy to state-of-the-art PINN models while reducing computational cost by two to three orders of magnitude. The manuscript has been revised accordingly. Changes in the manuscript: Figure 9: Added error metrics. Section 3.2.2 – Case 1. Added an explanatory paragraph right after mentioning Fig. 9: “In addition to the visual agreement shown in Figure 9, quantitative error metrics confirm the accuracy of the proposed approach. Figure 10: Added error metrics. Section 3.2.2 – Case 2. Added an explanatory paragraph right after mentioning Fig. 10: “Quantitative error metrics further support this observation. The MAE and RMSE obtained using SEE-PINN remain within acceptable limits for engineering applications and are comparable to the reference PINN solution, while the computational cost is reduced by approximately two orders of magnitude. This confirms that the proposed scaling-based framework maintains accuracy while significantly improving computational efficiency.” Section 3.2.2 – After Case 2. Added Table 1 with summary of benchmarks. Comment 9 The term ‘the authors’ used in Section 3.3.2 is ambiguous. Please clarify whether it refers to the authors of the current study or to authors of referenced works. Response: We thank the reviewer for highlighting this ambiguity. The manuscript has been revised to explicitly distinguish between the authors of the present study and the authors of the referenced works. Ambiguous instances of the term “the authors” have been replaced with clearer phrasing to avoid any possible confusion. Changes in the manuscript: Section 3.2.2 – Case 1: Replaced “The authors addressed…” with “The authors of [24] addressed…”. Section 3.2.2 – Case 2: Replaced “The authors employed…” with “The authors of [25] employed…”. Comment 10 In case 2 of Section 3.3.2, please explain the reason for using a different number of training data points compared with the reference study. Response: We thank the reviewer for this comment. In Case 2, the number of training (collocation) points used in the present study differs from that of the reference work by Singh et al. because the objective is not to replicate the original training configuration, but to provide a conservative and fair assessment of the proposed SEE-PINN framework. Specifically, a slightly higher number of collocation points is employed in the present study to ensure that any observed reduction in computational cost arises from the compact network architecture and the proposed equation-term scaling, rather than from a reduced training dataset. Despite this conservative choice, the SEE-PINN framework achieves comparable accuracy while still requiring significantly fewer floating-point operations. The manuscript has been revised to clarify this rationale. Changes in the manuscript: Section 3.2.2-Case 2 (after description of the network architecture): It is noted that the number of training (collocation) points used in the present study differs from that reported by Singh et al. A slightly higher number of collocation points is intentionally adopted to provide a conservative comparison and to ensure that the observed reduction in computational cost stems from the compact network architecture and the proposed equation-term scaling, rather than from a reduced training dataset. Despite this choice, the SEE-PINN framework achieves comparable accuracy while maintaining a substantial reduction in computational cost. Comment 11 Since SEE-PINN is the main contribution of this work, Section 4 should be revised to place greater emphasis on its advantages, limitations, and implications. Response: We thank the reviewer for this important remark. Section 4 has been revised to explicitly focus on the advantages, limitations, and broader implications of the proposed SEE-PINN framework. The revised discussion clarifies the conditions under which the method is most effective, its current limitations, and its potential impact on the practical adoption of PINNs in computational mechanics and related fields. Changes in the manuscript: Section 4 has been revised based on the Reviewer’s comment. Competing Interests: No competing interests were disclosed. Close Report a concern COMMENT ON THIS REPORT Comments on this article Comments (0) Version 2 VERSION 2 PUBLISHED 14 Nov 2025 ADD YOUR COMMENT Comment keyboard_arrow_left keyboard_arrow_right Open Peer Review Reviewer Status info_outline Alongside their report, reviewers assign a status to the article: Approved The paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved Fundamental flaws in the paper seriously undermine the findings and conclusions Reviewer Reports Invited Reviewers 1 Version 2 (revision) 24 Jan 26 read Version 1 14 Nov 25 read Thossaporn Wijakmatee , Institute of Science Tokyo, Meguro, Japan Comments on this article All Comments (0) Add a comment Sign up for content alerts Sign Up You are now signed up to receive this alert Browse by related subjects keyboard_arrow_left Back to all reports Reviewer Report 0 Views copyright © 2026 Wijakmatee T. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 02 Feb 2026 | for Version 2 Thossaporn Wijakmatee , Chemical Engineering, Institute of Science Tokyo, Meguro, Tokyo, Japan 0 Views copyright © 2026 Wijakmatee T. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. format_quote Cite this report speaker_notes Responses (0) Approved info_outline Alongside their report, reviewers assign a status to the article: Approved The paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved Fundamental flaws in the paper seriously undermine the findings and conclusions After reviewing the revised content, I find that the authors have addressed the previous concerns and improved the article to meet the academic standards for indexing. ​​​​​​I have no further comments to make, and I am pleased to recommend it for indexing. Competing Interests No competing interests were disclosed. Reviewer Expertise Engineering, Machine learning, Physics-informed method, Quantum mechanics I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard. reply Respond to this report Responses (0) Wijakmatee T. Peer Review Report For: Physics-Informed Neural Networks without Loss Balancing: A Direct Term Scaling Approach for Nonlinear 1D Problems [version 1; peer review: 1 approved with reservations] . F1000Research 2025, 14 :1252 ( https://doi.org/10.5256/f1000research.194668.r452879) NOTE: it is important to ensure the information in square brackets after the title is included in this citation. The direct URL for this report is: https://f1000research.com/articles/14-1252/v2#referee-response-452879 keyboard_arrow_left Back to all reports Reviewer Report 0 Views copyright © 2026 Wijakmatee T. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 31 Dec 2025 | for Version 1 Thossaporn Wijakmatee , Chemical Engineering, Institute of Science Tokyo, Meguro, Tokyo, Japan 0 Views copyright © 2026 Wijakmatee T. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. format_quote Cite this report speaker_notes Responses (1) Approved With Reservations info_outline Alongside their report, reviewers assign a status to the article: Approved The paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved Fundamental flaws in the paper seriously undermine the findings and conclusions The authors propose a scaled equation-enhanced physics-informed neural network (SEE-PINN) for nonlinear one-dimensional problems, specifically mechanical systems such as an elastic rod and an Euler beam. The topic is interesting, and several computational aspects are explained in detail. However, several points require clarification to better articulate the originality, motivation, and logical structure of the study. After addressing the issues outlined below, the manuscript may be reconsidered for publication. Based on the statement, “Further more, our proposed method is straightforward to implement, as demonstrated through a step-by-step application to two distinct mechanical problems: an elastic rod and an Euler beam”, please clarify the motivation for selecting these two problems as representative case studies. The novelty of the SEE-PINN framework should be more clearly articulated. From the reviewer’s perspective, several scale-consistent or equation-enhanced learning approaches already exist in the literature. The authors should explicitly distinguish SEE-PINN from existing methods and emphasize its unique contributions. In Section 3.2 (Validation), the source of the data used for validation is unclear. Please clarify whether the data were obtained from experiments conducted by the authors or sourced from existing literature. In Section 3.2, is the use of 75 training data points appropriate for the PINN framework? Please justify the selection of this number. Please explain the rationale for choosing the Adam optimizer with a learning rate of 0.01 and 5000 training epochs throughout Section 3.2. The x- and y-axis scales in the parity plots (Figures 3b, 7b, and 8b) are not consistent, which makes comparison somewhat difficult. Please revise these figures for clarity. Although the relative error defined in Equation 36 is reported, metrics such as MAE or RMSE may be more informative for practical applications and acceptable error assessment in physical units. Please consider including these metrics. In Section 3.3.2 (Case Studies), reporting quantitative error metrics would better demonstrate that the proposed method reduces computational cost while maintaining acceptable accuracy. The term “the authors” used in Section 3.3.2 is ambiguous. Please clarify whether it refers to the authors of the current study or to authors of referenced works. In case 2 of Section 3.3.2, please explain the reason for using a different number of training data points compared with the reference study. Since SEE-PINN is the main contribution of this work, Section 4 should be revised to place greater emphasis on its advantages, limitations, and implications. Is the work clearly and accurately presented and does it cite the current literature? Partly Is the study design appropriate and is the work technically sound? Partly Are sufficient details of methods and analysis provided to allow replication by others? Yes If applicable, is the statistical analysis and its interpretation appropriate? Partly Are all the source data underlying the results available to ensure full reproducibility? Partly Are the conclusions drawn adequately supported by the results? Partly Competing Interests No competing interests were disclosed. Reviewer Expertise Engineering, Machine learning, Physics-informed method, Quantum mechanics I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard, however I have significant reservations, as outlined above. reply Respond to this report Responses (1) Author Response 24 Jan 2026 Theodosios Theodosiou, Dept. of Energy Systems, University of Thessaly - Larissa, Larissa, 41500, Greece We would like to sincerely thank the reviewer for the time and effort devoted to the evaluation of our manuscript and for the constructive comments provided. All reviewer comments have been addressed in full. The changes referenced below pertain to the revised version of the manuscript (Version 2), which is currently under submission. Detailed point-by-point responses to each reviewer comment follow. Comment 1 “Based on the statement, ‘Furthermore, our proposed method is straightforward to implement, as demonstrated through a step-by-step application to two distinct mechanical problems: an elastic rod and an Euler beam’, please clarify the motivation for selecting these two problems as representative case studies.” Response: We thank the reviewer for this comment. The elastic rod and Euler–Bernoulli beam problems were deliberately selected as representative benchmarks for three main reasons. First, they constitute canonical one-dimensional boundary value problems in solid mechanics, widely used in the PINN literature, which enables direct comparison with existing methods. Second, although both problems are one-dimensional, they differ fundamentally in the order of their governing differential equations (second-order for the rod and fourth-order for the beam), as well as in the number and type of boundary conditions required. This allows us to demonstrate that the proposed SEE-PINN framework is not tailored to a specific equation order or boundary-condition structure. Third, both problems naturally admit spatially varying material and geometric properties, leading to strong coefficient imbalance across equation terms. This makes them particularly suitable for assessing the effectiveness of direct equation-term scaling, which is the core contribution of this work. By applying the same normalization and training procedure to both cases, we demonstrate that SEE-PINN is a general, systematic, and easily transferable framework rather than a problem-specific solution. Changes in the manuscript: Introduction - Added a new paragraph right after mentioning the rod and beam problems: “The selection of the elastic rod and Euler–Bernoulli beam as case studies is intentional. These problems represent canonical one-dimensional boundary value problems in computational mechanics and are frequently adopted as benchmarks in the PINN literature, allowing direct comparison with existing approaches. Although both problems are one-dimensional, they differ fundamentally in the order of their governing equations (second-order for the rod and fourth-order for the beam) and in the number and nature of boundary conditions. This enables a clear demonstration that the proposed PINN framework is not limited to a specific equation order or boundary-condition structure. Moreover, both formulations naturally allow for spatially varying material and geometric properties, which induce strong imbalance among equation terms and therefore provide an ideal testbed for evaluating the effectiveness of direct differential equation term scaling.” Comment 2 The novelty of the SEE-PINN framework should be more clearly articulated. From the reviewer’s perspective, several scale-consistent or equation-enhanced learning approaches already exist in the literature. The authors should explicitly distinguish SEE-PINN from existing methods and emphasize its unique contributions. Response: We appreciate the reviewer’s observation and agree that the distinction between SEE-PINN and existing scale-consistent or equation-enhanced approaches should be made more explicit. While several methods address imbalance in PINNs through normalization, adaptive weighting, or equation reformulation, the proposed SEE-PINN differs fundamentally in both philosophy and implementation. Existing scale-consistent or equation-enhanced approaches typically (i) introduce additional hyperparameters, (ii) modify the loss function through adaptive or data-driven weighting, or (iii) increase the complexity of the training process by incorporating gradient statistics, auxiliary optimization loops, or higher-order residuals. In contrast, SEE-PINN performs a (pre-training) physically motivated scaling of the governing differential equation itself, prior to the construction of the loss function. The key novelty of SEE-PINN lies in the fact that loss balancing is eliminated entirely, rather than mitigated or adaptively corrected during training. Once the governing equation is expressed in a normalized, scale-consistent form, all residual terms naturally contribute at comparable magnitudes, allowing standard optimization settings to be used without additional tuning. This results in a simpler, deterministic, and computationally efficient PINN formulation. Furthermore, unlike reduced-order or reformulated PINN variants, SEE-PINN does not alter the mathematical structure of the problem, introduce auxiliary constraints, or require problem-specific architectural modifications. A single reverse-scaling step restores the solution to the physical domain, preserving full physical interpretability. To clarify these distinctions, the manuscript has been revised to explicitly position SEE-PINN relative to existing scale-consistent and equation-enhanced PINN methodologies. Changes in the manuscript: Introduction - Added a new paragraph to describe the novelties: “Although several scale-consistent, normalized, or equation-enhanced PINN variants have been proposed in the literature, most of these approaches address imbalance indirectly by introducing adaptive weights, auxiliary optimization strategies, or additional loss terms. In contrast, the proposed Scaled Equation-Enhanced PINN (SEE-PINN) introduces a fundamentally different paradigm: the governing differential equation itself is rescaled prior to training using physically meaningful characteristic quantities. This preprocessing step ensures that all residual terms naturally operate at comparable magnitudes, thereby eliminating the need for loss-balancing mechanisms altogether. As a result, SEE-PINN transforms the PINN training process into a simpler, deterministic, and computationally efficient workflow, without altering the mathematical structure of the problem or introducing additional hyperparameters.” Section 2 - Added the following clarification at the end of 2.2 (right before starting to examine the elastic rod - 2.2.1): “It is important to distinguish the proposed SEE-PINN framework from existing approaches that aim to alleviate loss-term imbalance in PINNs. Adaptive weighting methods dynamically modify the contribution of each loss term during training, often relying on gradient statistics, probabilistic models, or auxiliary optimization loops. Gradient-enhanced or equation-augmented PINNs enrich the loss function by incorporating higher-order derivatives or additional residual constraints, increasing both computational cost and implementation complexity. In contrast, SEE-PINN operates exclusively at the level of the governing differential equation. By rescaling each term using characteristic physical quantities prior to training, the resulting normalized equation is inherently balanced. Consequently, the loss function remains simple and fixed throughout training, and standard optimizers can be employed without tuning or adaptive mechanisms. This shift of complexity from the optimization stage to a one-time, physics-driven preprocessing step constitutes the central novelty of the proposed framework.” Comment 3 In Section 3.2 (Validation), the source of the data used for validation is unclear. Please clarify whether the data were obtained from experiments conducted by the authors or sourced from existing literature. Response: We thank the reviewer for pointing out this lack of clarity. No experimental data are used in this study. All validation data are obtained either from closed-form analytical solutions (when available) or from high-resolution numerical solutions generated for reference purposes. Specifically, for validation cases with constant material and geometric properties, analytical solutions are employed as ground truth. For cases involving spatially varying or nonlinear properties, where analytical solutions are not available, reference solutions are obtained using conventional numerical methods. The manuscript has been revised to explicitly state the origin of the validation data in Section 3.2 to ensure full transparency and reproducibility. Changes in the manuscript: Section 3.2 - Added a new paragraph (right before the first rod analysis – 3.2.1): “The validation data employed in this section do not originate from experimental measurements. For problems with constant material and geometric properties, analytical solutions are available and are used as reference benchmarks. In cases involving spatially varying or nonlinear material and geometric properties, where closed-form solutions are not available, high-resolution numerical solutions are generated and used for validation. These numerical references serve solely as ground truth for assessing the accuracy of the proposed SEE-PINN framework.” Section ‘Data Availability’ - Added a clarification: “The reference numerical solutions used for validation were generated using conventional numerical methods and are included in the shared dataset to ensure full reproducibility.” Comment 4 In Section 3.2, is the use of 75 training data points appropriate for the PINN framework? Please justify the selection of this number. Response: We thank the reviewer for this important question. The selection of 75 training (collocation) points is intentional and directly linked to the objectives of this study. The primary aim of SEE-PINN is to demonstrate that physically consistent equation-term scaling significantly improves training efficiency, allowing accurate solutions to be obtained with compact network architectures and a limited number of collocation points. In all validation cases, the governing equations are one-dimensional, and the scaling procedure ensures that all residual terms operate at comparable magnitudes. Under these conditions, a relatively small number of uniformly distributed collocation points is sufficient to accurately capture the solution. Increasing the number of training points beyond this value was observed to yield negligible improvements in accuracy while proportionally increasing computational cost. Furthermore, the same number of training points is consistently used across multiple problems of increasing complexity, demonstrating the robustness of the proposed approach rather than problem-specific tuning. The manuscript has been revised to clarify the rationale behind this choice. Changes in the manuscript: Section 3.2 - Added a clarification (after the introductory paragraph): “All validation cases employ 75 uniformly distributed collocation points. This choice reflects a deliberate trade-off between accuracy and computational efficiency. Due to the physically consistent scaling of the governing equations, the residual terms are well-balanced, allowing accurate solutions to be obtained with a relatively small number of training points. Increasing the number of collocation points was found to provide marginal accuracy gains while significantly increasing computational cost. Using a fixed number of training points across problems of increasing complexity further highlights the robustness and generality of the proposed SEE-PINN framework.” Comment 5 Please explain the rationale for choosing the Adam optimizer with a learning rate of 0.01 and 5000 training epochs throughout Section 3.2. Response: We thank the reviewer for this comment. The Adam optimizer was selected due to its widespread use and demonstrated robustness in training PINNs, particularly for problems involving automatic differentiation and stiff residual landscapes. The learning rate and number of epochs were chosen to reflect a standard, non-optimized training configuration. A learning rate of 0.01 was found to provide stable and fast convergence for the scaled governing equations, while 5000 training epochs were sufficient for the loss to consistently converge below a prescribed tolerance across all validation cases. Importantly, these parameters were kept fixed across different problems to avoid case-specific tuning and to highlight the stability of the proposed SEE-PINN framework. The effectiveness of these simple and uniform training settings is a direct consequence of the proposed equation-term scaling, which ensures balanced residual contributions and mitigates training instability. The manuscript has been revised to clarify this rationale. Changes in the manuscript: Section 3.2 - Added a new paragraph after the paragraph supporting the use of 75 training points: “All validation cases employ the Adam optimizer, owing to its robustness and widespread adoption in PINN-based studies. A fixed learning rate of 0.01 and 5000 training epochs are used for the rod problems, as these values consistently lead to stable convergence of the loss function below a prescribed tolerance. These hyperparameters were intentionally kept constant across different validation cases to avoid problem-specific tuning and to demonstrate that the proposed equation-term scaling yields reliable convergence under standard optimization settings. The balanced magnitude of the scaled residual terms allows the use of simple training configurations without the need for adaptive learning rates or multi-stage optimization strategies.” Section 3.2.4 - Added a complementary clarification to justify section of learning rate and training epochs for the beam problems: “A smaller learning rate and a higher number of training epochs are adopted for the beam problems due to the higher-order derivatives involved in the governing equation, which increase stiffness in the optimization landscape.” Comment 6 The x- and y-axis scales in the parity plots (Figures 3b, 7b, and 8b) are not consistent, which makes comparison somewhat difficult. Please revise these figures for clarity. Response: We thank the reviewer for this observation. All parity plots have been revised so that the x- and y-axes use identical ranges and scaling, ensuring direct visual comparability between predicted and reference solutions. This revision improves clarity and avoids any potential misinterpretation of the results. The updated figures are included in the revised manuscript. No changes in made in plotted data. Comment 7 Although the relative error defined in Equation 36 is reported, metrics such as MAE or RMSE may be more informative for practical applications and acceptable error assessment in physical units. Please consider including these metrics. Response: We thank the reviewer for this constructive suggestion. In addition to the normalized relative error, we have now included the Mean Absolute Error (MAE) and Root Mean Square Error (RMSE) as complementary quantitative metrics. These measures provide error estimates directly in physical units and facilitate practical interpretation of the results. The manuscript has been revised accordingly, and the additional metrics are reported for the validation cases. Changes in the manuscript: Section 3.2 - Added a new paragraph: “In addition to the normalized relative error, two standard error metrics are employed to quantify prediction accuracy in physical units: the Mean Absolute Error (MAE) and the Root Mean Square Error (RMSE), defined as (MEA and RMSE definitions). These metrics complement the relative error by providing absolute measures of accuracy that are directly interpretable in the physical domain.” Figures: Figures in validation cases have been updated to include the MAE and RMSE. Also, these values are mentioned in the “Comparison and error analysis” paragraph of each case. Comment 8 In Section 3.3.2 (Case Studies), reporting quantitative error metrics would better demonstrate that the proposed method reduces computational cost while maintaining acceptable accuracy. Response: We thank the reviewer for this valuable suggestion. To better quantify the trade-off between computational efficiency and accuracy, quantitative error metrics have been added to the case studies in Section 3.3.2. Specifically, MAE and RMSE values are now reported alongside the computational cost estimates. These additions explicitly demonstrate that the proposed SEE-PINN framework achieves comparable accuracy to state-of-the-art PINN models while reducing computational cost by two to three orders of magnitude. The manuscript has been revised accordingly. Changes in the manuscript: Figure 9: Added error metrics. Section 3.2.2 – Case 1. Added an explanatory paragraph right after mentioning Fig. 9: “In addition to the visual agreement shown in Figure 9, quantitative error metrics confirm the accuracy of the proposed approach. Figure 10: Added error metrics. Section 3.2.2 – Case 2. Added an explanatory paragraph right after mentioning Fig. 10: “Quantitative error metrics further support this observation. The MAE and RMSE obtained using SEE-PINN remain within acceptable limits for engineering applications and are comparable to the reference PINN solution, while the computational cost is reduced by approximately two orders of magnitude. This confirms that the proposed scaling-based framework maintains accuracy while significantly improving computational efficiency.” Section 3.2.2 – After Case 2. Added Table 1 with summary of benchmarks. Comment 9 The term ‘the authors’ used in Section 3.3.2 is ambiguous. Please clarify whether it refers to the authors of the current study or to authors of referenced works. Response: We thank the reviewer for highlighting this ambiguity. The manuscript has been revised to explicitly distinguish between the authors of the present study and the authors of the referenced works. Ambiguous instances of the term “the authors” have been replaced with clearer phrasing to avoid any possible confusion. Changes in the manuscript: Section 3.2.2 – Case 1: Replaced “The authors addressed…” with “The authors of [24] addressed…”. Section 3.2.2 – Case 2: Replaced “The authors employed…” with “The authors of [25] employed…”. Comment 10 In case 2 of Section 3.3.2, please explain the reason for using a different number of training data points compared with the reference study. Response: We thank the reviewer for this comment. In Case 2, the number of training (collocation) points used in the present study differs from that of the reference work by Singh et al. because the objective is not to replicate the original training configuration, but to provide a conservative and fair assessment of the proposed SEE-PINN framework. Specifically, a slightly higher number of collocation points is employed in the present study to ensure that any observed reduction in computational cost arises from the compact network architecture and the proposed equation-term scaling, rather than from a reduced training dataset. Despite this conservative choice, the SEE-PINN framework achieves comparable accuracy while still requiring significantly fewer floating-point operations. The manuscript has been revised to clarify this rationale. Changes in the manuscript: Section 3.2.2-Case 2 (after description of the network architecture): It is noted that the number of training (collocation) points used in the present study differs from that reported by Singh et al. A slightly higher number of collocation points is intentionally adopted to provide a conservative comparison and to ensure that the observed reduction in computational cost stems from the compact network architecture and the proposed equation-term scaling, rather than from a reduced training dataset. Despite this choice, the SEE-PINN framework achieves comparable accuracy while maintaining a substantial reduction in computational cost. Comment 11 Since SEE-PINN is the main contribution of this work, Section 4 should be revised to place greater emphasis on its advantages, limitations, and implications. Response: We thank the reviewer for this important remark. Section 4 has been revised to explicitly focus on the advantages, limitations, and broader implications of the proposed SEE-PINN framework. The revised discussion clarifies the conditions under which the method is most effective, its current limitations, and its potential impact on the practical adoption of PINNs in computational mechanics and related fields. Changes in the manuscript: Section 4 has been revised based on the Reviewer’s comment. View more View less Competing Interests No competing interests were disclosed. reply Respond Report a concern Wijakmatee T. Peer Review Report For: Physics-Informed Neural Networks without Loss Balancing: A Direct Term Scaling Approach for Nonlinear 1D Problems [version 1; peer review: 1 approved with reservations] . F1000Research 2025, 14 :1252 ( https://doi.org/10.5256/f1000research.186415.r439115) NOTE: it is important to ensure the information in square brackets after the title is included in this citation. The direct URL for this report is: https://f1000research.com/articles/14-1252/v1#referee-response-439115 Alongside their report, reviewers assign a status to the article: Approved - the paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations - A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved - fundamental flaws in the paper seriously undermine the findings and conclusions Adjust parameters to alter display View on desktop for interactive features Includes Interactive Elements View on desktop for interactive features Competing Interests Policy Provide sufficient details of any financial or non-financial competing interests to enable users to assess whether your comments might lead a reasonable person to question your impartiality. Consider the following examples, but note that this is not an exhaustive list: Examples of 'Non-Financial Competing Interests' Within the past 4 years, you have held joint grants, published or collaborated with any of the authors of the selected paper. You have a close personal relationship (e.g. parent, spouse, sibling, or domestic partner) with any of the authors. You are a close professional associate of any of the authors (e.g. scientific mentor, recent student). You work at the same institute as any of the authors. You hope/expect to benefit (e.g. favour or employment) as a result of your submission. You are an Editor for the journal in which the article is published. Examples of 'Financial Competing Interests' You expect to receive, or in the past 4 years have received, any of the following from any commercial organisation that may gain financially from your submission: a salary, fees, funding, reimbursements. You expect to receive, or in the past 4 years have received, shared grant support or other funding with any of the authors. You hold, or are currently applying for, any patents or significant stocks/shares relating to the subject matter of the paper you are commenting on. Stay Updated Sign up for content alerts and receive a weekly or monthly email with all newly published articles Register with F1000Research Already registered? Sign in Not now, thanks close PLEASE NOTE If you are an AUTHOR of this article, please check that you signed in with the account associated with this article otherwise we cannot automatically identify your role as an author and your comment will be labelled as a “User Comment”. If you are a REVIEWER of this article, please check that you have signed in with the account associated with this article and then go to your account to submit your report, please do not post your review here. If you do not have access to your original account, please contact us . All commenters must hold a formal affiliation as per our Policies . The information that you give us will be displayed next to your comment. User comments must be in English, comprehensible and relevant to the article under discussion. We reserve the right to remove any comments that we consider to be inappropriate, offensive or otherwise in breach of the User Comment Terms and Conditions . Commenters must not use a comment for personal attacks. When criticisms of the article are based on unpublished data, the data should be made available. I accept the User Comment Terms and Conditions Please confirm that you accept the User Comment Terms and Conditions. Affiliation ✕ refresh Please enter your institution. Note: To add your institution or organisation, start typing the name and then select the correct name from the list. Where applicable, the name will appear in both the original language and in English. Do not paste in the name. If the name does not appear in the drop-down list, we will display the information you have entered. ✕ refresh Country/Region * USA UK Canada China France Germany Afghanistan Aland Islands Albania Algeria American Samoa Andorra Angola Anguilla Antarctica Antigua and Barbuda Argentina Armenia Aruba Australia Austria Azerbaijan Bahamas Bahrain Bangladesh Barbados Belarus Belgium Belize Benin Bermuda Bhutan Bolivia Bosnia and Herzegovina Botswana Bouvet Island Brazil British Indian Ocean Territory British Virgin Islands Brunei Bulgaria Burkina Faso Burundi Cambodia Cameroon Canada Cape Verde Cayman Islands Central African Republic Chad Chile China Christmas Island Cocos (Keeling) Islands Colombia Comoros Congo Cook Islands Costa Rica Cote d'Ivoire Croatia Cuba Cyprus Czech Republic Democratic Republic of the Congo Denmark Djibouti Dominica Dominican Republic Ecuador Egypt El Salvador Equatorial Guinea Eritrea Estonia Ethiopia Falkland Islands Faroe Islands Federated States of Micronesia Fiji Finland France French Guiana French Polynesia French Southern Territories Gabon Georgia Germany Ghana Gibraltar Greece Greenland Grenada Guadeloupe Guam Guatemala Guernsey Guinea Guinea-Bissau Guyana Haiti Heard Island and Mcdonald Islands Holy See (Vatican City State) Honduras Hong Kong Hungary Iceland India Indonesia Iran Iraq Ireland Israel Italy Jamaica Japan Jersey Jordan Kazakhstan Kenya Kiribati Kosovo (Serbia and Montenegro) Kuwait Kyrgyzstan Lao People's Democratic Republic Latvia Lebanon Lesotho Liberia Libya Liechtenstein Lithuania Luxembourg Macao Madagascar Malawi Malaysia Maldives Mali Malta Marshall Islands Martinique Mauritania Mauritius Mayotte Mexico Minor Outlying Islands of the United States Moldova Monaco Mongolia Montenegro Montserrat Morocco Mozambique Myanmar Namibia Nauru Nepal Netherlands Antilles New Caledonia New Zealand Nicaragua Niger Nigeria Niue Norfolk Island North Korea North Macedonia Northern Mariana Islands Norway Oman Pakistan Palau Palestinian Territory Panama Papua New Guinea Paraguay Peru Philippines Pitcairn Poland Portugal Puerto Rico Qatar Reunion Romania Russian Federation Rwanda Saint Helena Saint Kitts and Nevis Saint Lucia Saint Pierre and Miquelon Saint Vincent and the Grenadines Samoa San Marino Sao Tome and Principe Saudi Arabia Senegal Serbia Seychelles Sierra Leone Singapore Slovakia Slovenia Solomon Islands Somalia South Africa South Georgia and the South Sandwich Is South Korea South Sudan Spain Sri Lanka Sudan Suriname Svalbard and Jan Mayen Swaziland Sweden Switzerland Syria Taiwan Tajikistan Tanzania Thailand The Gambia The Netherlands Timor-Leste Togo Tokelau Tonga Trinidad and Tobago Tunisia Turkey Turkmenistan Turks and Caicos Islands Tuvalu UK USA Uganda Ukraine United Arab Emirates United States Virgin Islands Uruguay Uzbekistan Vanuatu Venezuela Vietnam Wallis and Futuna West Bank and Gaza Strip Western Sahara Yemen Zambia Zimbabwe Please select your country/region. You must enter a comment. Competing Interests Please disclose any competing interests that might be construed to influence your judgment of the article's or peer review report's validity or importance. Competing Interests Policy Provide sufficient details of any financial or non-financial competing interests to enable users to assess whether your comments might lead a reasonable person to question your impartiality. Consider the following examples, but note that this is not an exhaustive list: Examples of 'Non-Financial Competing Interests' Within the past 4 years, you have held joint grants, published or collaborated with any of the authors of the selected paper. You have a close personal relationship (e.g. parent, spouse, sibling, or domestic partner) with any of the authors. You are a close professional associate of any of the authors (e.g. scientific mentor, recent student). You work at the same institute as any of the authors. You hope/expect to benefit (e.g. favour or employment) as a result of your submission. You are an Editor for the journal in which the article is published. Examples of 'Financial Competing Interests' You expect to receive, or in the past 4 years have received, any of the following from any commercial organisation that may gain financially from your submission: a salary, fees, funding, reimbursements. You expect to receive, or in the past 4 years have received, shared grant support or other funding with any of the authors. You hold, or are currently applying for, any patents or significant stocks/shares relating to the subject matter of the paper you are commenting on. Please state your competing interests The comment has been saved. An error has occurred. Please try again. Cancel Post var lTitle = "Physics-Informed Neural Networks without...".replace("'", ''); var linkedInUrl = "http://www.linkedin.com/shareArticle?url=https://f1000research.com/articles/14-1252/v1" + "&title=" + encodeURIComponent(lTitle) + "&summary=" + encodeURIComponent('Read the article by '); var deliciousUrl = "https://del.icio.us/post?url=https://f1000research.com/articles/14-1252/v1&title=" + encodeURIComponent(lTitle); var redditUrl = "http://reddit.com/submit?url=https://f1000research.com/articles/14-1252/v1" + "&title=" + encodeURIComponent(lTitle); linkedInUrl += encodeURIComponent('Theodosiou T and Rekatsinas C'); var offsetTop = /chrome/i.test( navigator.userAgent ) ? 4 : -10; var addthis_config = { ui_offset_top: offsetTop, services_compact : "facebook,twitter,www.linkedin.com,www.mendeley.com,reddit.com", services_expanded : "facebook,twitter,www.linkedin.com,www.mendeley.com,reddit.com", services_custom : [ { name: "LinkedIn", url: linkedInUrl, icon:"/img/icon/at_linkedin.svg" }, { name: "Mendeley", url: "http://www.mendeley.com/import/?url=https://f1000research.com/articles/14-1252/v1/mendeley", icon:"/img/icon/at_mendeley.svg" }, { name: "Reddit", url: redditUrl, icon:"/img/icon/at_reddit.svg" }, ] }; var addthis_share = { url: "https://f1000research.com/articles/14-1252", templates : { twitter : "Physics-Informed Neural Networks without Loss Balancing: A Direct.... Theodosiou T and Rekatsinas C, published by " + "@F1000Research" + ", https://f1000research.com/articles/14-1252/v1" } }; if (typeof(addthis) != "undefined"){ addthis.addEventListener('addthis.ready', checkCount); addthis.addEventListener('addthis.menu.share', checkCount); } $(".f1r-shares-twitter").attr("href", "https://twitter.com/intent/tweet?text=" + addthis_share.templates.twitter); $(".f1r-shares-facebook").attr("href", "https://www.facebook.com/sharer/sharer.php?u=" + addthis_share.url); $(".f1r-shares-linkedin").attr("href", addthis_config.services_custom[0].url); $(".f1r-shares-reddit").attr("href", addthis_config.services_custom[2].url); $(".f1r-shares-mendelay").attr("href", addthis_config.services_custom[1].url); function checkCount(){ setTimeout(function(){ $(".addthis_button_expanded").each(function(){ var count = $(this).text(); if (count !== "" && count != "0") $(this).removeClass("is-hidden"); else $(this).addClass("is-hidden"); }); }, 1000); } close How to cite this report {{reportCitation}} Cancel Copy Citation Details $(function(){R.ui.buttonDropdowns('.dropdown-for-downloads');}); $(function(){R.ui.toolbarDropdowns('.toolbar-dropdown-for-downloads');}); $.get("/articles/acj/169129/186415") new F1000.Clipboard(); new F1000.ThesaurusTermsDisplay("articles", "article", "186415"); $(document).ready(function() { $( "#frame1" ).on('load', function() { var mydiv = $(this).contents().find("div"); var h = mydiv.height(); console.log(h) }); var tooltipLivingFigure = jQuery(".interactive-living-figure-label .icon-more-info"), titleLivingFigure = tooltipLivingFigure.attr("title"); tooltipLivingFigure.simpletip({ fixed: true, position: ["-115", "30"], baseClass: 'small-tooltip', content:titleLivingFigure + " " }); tooltipLivingFigure.removeAttr("title"); $("body").on("click", ".cite-living-figure", function(e) { e.preventDefault(); var ref = $(this).attr("data-ref"); $(this).closest(".living-figure-list-container").find("#" + ref).fadeIn(200); }); $("body").on("click", ".close-cite-living-figure", function(e) { e.preventDefault(); $(this).closest(".popup-window-wrapper").fadeOut(200); }); $(document).on("mouseup", function(e) { var metricsContainer = $(".article-metrics-popover-wrapper"); if (!metricsContainer.is(e.target) && metricsContainer.has(e.target).length === 0) { $(".article-metrics-close-button").click(); } }); var articleId = $('#articleId').val(); if($("#main-article-count-box").attachArticleMetrics) { $("#main-article-count-box").attachArticleMetrics(articleId, { articleMetricsView: true }); } }); var figshareWidget = $(".new_figshare_widget"); if (figshareWidget.length > 0) { window.figshare.load("f1000", function(Widget) { // Select a tag/tags defined in your page. In this tag we will place the widget. _.map(figshareWidget, function(el){ var widget = new Widget({ articleId: $(el).attr("figshare_articleId") //height:300 // this is the height of the viewer part. [Default: 550] }); widget.initialize(); // initialize the widget widget.mount(el); // mount it in a tag that's on your page // this will save the widget on the global scope for later use from // your JS scripts. This line is optional. //window.widget = widget; }); }); } close Error Close Add Reset F1000.MICROSERVICES.AFFILIATION = ''; $(document).ready(function () { $('.js-affiliations-form').each((index, form) => { new AffiliationForm({ formId: form.id, institutionErrorSelector: '.comment-enter-institution', departmentErrorSelector: '.comment-enter-department', placeSelector: '.js-add-comment-place', stateSelector: '.js-add-comment-state', zipCodeSelector: '.js-add-comment-zipcode', countrySelector: '.js-add-comment-country', countryErrorSelector: '.comment-enter-country', }); }); }); $(document).ready(function () { var reportIds = { "444419": 0, "444416": 0, "464399": 0, "444430": 0, "452879": 9, "464398": 0, "444431": 0, "464397": 0, "444428": 0, "464396": 0, "444429": 0, "464395": 0, "464394": 0, "464403": 0, "444434": 0, "464402": 0, "444435": 0, "464401": 0, "444432": 0, "464400": 0, "444433": 0, "483103": 0, "441886": 0, "483102": 0, "441887": 0, "483101": 0, "441884": 0, "483100": 0, "441885": 0, "441882": 0, "441883": 0, "441881": 0, "483109": 0, "483108": 0, "483107": 0, "441890": 0, "483106": 0, "483105": 0, "441888": 0, "483104": 0, "441889": 0, "455214": 0, "455215": 0, "455212": 0, "455213": 0, "455210": 0, "455211": 0, "455208": 0, "455209": 0, "455216": 0, "455217": 0, "453702": 0, "453703": 0, "439111": 0, "453700": 0, "453701": 0, "453699": 0, "439118": 0, "457551": 0, "439119": 0, "453708": 0, "439116": 0, "439117": 0, "453706": 0, "439114": 0, "453707": 0, "439115": 30, "453704": 0, "439112": 0, "453705": 0, "439113": 0, "457554": 0, "457555": 0, "457552": 0, "439120": 0, "457553": 0, "457575": 0, "457573": 0, "457571": 0, "457569": 0, "457577": 0, "468407": 0, "460479": 0, "468415": 0, "460478": 0, "468414": 0, "460477": 0, "468413": 0, "460476": 0, "468412": 0, "460475": 0, "468411": 0, "460474": 0, "468410": 0, "460473": 0, "468409": 0, "468408": 0, "460482": 0, "460481": 0, "460480": 0, "468416": 0, "470751": 0, "433886": 0, "470750": 0, "433887": 0, "433884": 0, "433885": 0, "433882": 0, "433883": 0, "433880": 0, "433881": 0, "470759": 0, "470758": 0, "470757": 0, "470756": 0, "470755": 0, "470754": 0, "470753": 0, "433888": 0, "470752": 0, "433889": 0, }; $(".referee-response-container,.js-referee-report").each(function(index, el) { var reportId = $(el).attr("data-reportid"), reportCount = reportIds[reportId] || 0; $(el).find(".comments-count-container,.js-referee-report-views").html(reportCount); }); var uuidInput = $("#article_uuid"), oldUUId = uuidInput.val(), newUUId = "69e022f1-752c-401f-b87b-aec535c2946a"; uuidInput.val(newUUId); $("a[href*='article_uuid=']").each(function(index, el) { var newHref = $(el).attr("href").replace(oldUUId, newUUId); $(el).attr("href", newHref); }); }); An innovative open access publishing platform offering rapid publication and open peer review, whilst supporting data deposition and sharing. Browse Gateways Collections How it Works Contact For Developers Cookie Notice Privacy Notice RSS Submit Your Research Follow us © 2012-2026 F1000 Research Ltd. ISSN 2046-1402 | Legal | Partner of Research4Life • CrossRef • ORCID • FAIRSharing R.templateTests.simpleTemplate = R.template(' $text $text $text $text $text '); R.templateTests.runTests(); var F1000platform = new F1000.Platform({ name: "f1000research", displayName: "F1000Research", hostName: "f1000research.com", id: "1", editorialEmail: "[email protected]", infoEmail: "[email protected]", usePmcStats: true }); $(function(){R.ui.dropdowns('.dropdown-for-authors, .dropdown-for-about, .dropdown-for-myresearch');}); // $(function(){R.ui.dropdowns('.dropdown-for-referees');}); $(document).ready(function () { if ($(".cookie-warning").is(":visible")) { $(".sticky").css("margin-bottom", "35px"); $(".devices").addClass("devices-and-cookie-warning"); } $(".cookie-warning .close-button").click(function (e) { $(".devices").removeClass("devices-and-cookie-warning"); $(".sticky").css("margin-bottom", "0"); }); $("#tweeter-feed .tweet-message").each(function (i, message) { var self = $(message); self.html(linkify(self.html())); }); $(".partner").on("mouseenter mouseleave", function() { $(this).find(".gray-scale, .colour").toggleClass("is-hidden"); }); }); Sign In Remember me Forgotten your password? Sign In Cancel Email or password not correct. Please try again Please wait... $(function(){ // Note: All the setup needs to run against a name attribute and *not* the id due the clonish // nature of facebox... $("a[id=googleSignInButton]").click(function(event){ event.preventDefault(); $("input[id=oAuthSystem]").val("GOOGLE"); $("form[id=oAuthForm]").submit(); }); $("a[id=facebookSignInButton]").click(function(event){ event.preventDefault(); $("input[id=oAuthSystem]").val("FACEBOOK"); $("form[id=oAuthForm]").submit(); }); $("a[id=orcidSignInButton]").click(function(event){ event.preventDefault(); $("input[id=oAuthSystem]").val("ORCID"); $("form[id=oAuthForm]").submit(); }); }); If you've forgotten your password, please enter your email address below and we'll send you instructions on how to reset your password. The email address should be the one you originally registered with F1000. Email address not valid, please try again You registered with F1000 via Google, so we cannot reset your password. To sign in, please click here . If you still need help with your Google account password, please click here . You registered with F1000 via Facebook, so we cannot reset your password. To sign in, please click here . If you still need help with your Facebook account password, please click here . Code not correct, please try again Reset password Cancel Email us for further assistance. Server error, please try again. If your email address is registered with us, we will email you instructions to reset your password. If you think you should have received this email but it has not arrived, please check your spam filters and/or contact for further assistance. Please wait... Register $(document).ready(function () { signIn.createSignInAsRow($("#sign-in-form-gfb-popup")); $(".target-field").each(function () { var uris = $(this).val().split("/"); if (uris.pop() === "login") { $(this).val(uris.toString().replace(",","/")); } }); });