Quadratic manifold fitting provides a flexible framework for modeling nonlinear low-dimensional structures embedded in high-dimensional spaces. However, existing methods typically employ prescribed noise models or fixed loss functions, limiting their adaptability to varying noise characteristics. To address this limitation, we propose an alternating maximum likelihood estimation method for subspace-constrained quadratic matrix factorization, termed AMLE-SQMF, which jointly estimates the quadratic manifold and the underlying noise distribution. Specifically, we model the residuals using a generalized Gaussian distribution (GGD), whose shape parameter controls the tail behavior and determines the associated fitting loss. By exploiting the closed-form maximum likelihood estimator of the scale parameter, we eliminate the scale variable and derive a profile negative log-likelihood. Based on this formulation, we develop an alternating optimization algorithm that iteratively updates the manifold parameters and estimates the noise shape parameter. This enables adaptive loss selection within a unified likelihood-based framework, without requiring prior specification of the noise characteristics. Experiments on synthetic and real-world datasets demonstrate the effectiveness of AMLE-SQMF in quadratic manifold fitting and its robustness to diverse noise distributions.
Pancheng Niu, Jun Guo, Qiaolin He, Jingcai Guo, Yanchao Shi
原文摘要
Recovering explicit symbolic solutions of partial differential equations (PDEs) from physics-informed neural networks (PINNs) is attractive, yet selecting and fitting expressions against neural predictions can lock the recovered solution into the teacher's approximation error. We propose DeSyR (Decoupled Symbolic Recovery) to break this dependence. DeSyR uses PINNs only to discover candidate structures and initial coefficient estimates; once a structure is fixed, the governing equations and constraints alone determine the refined coefficients. Multiple candidates with different fitting-error--complexity trade-offs are retained, evaluated after physics-only refinement, and reduced to the simplest expression within a physically near-optimal set. Joint refinement extends the same principle to coupled fields. For fixed candidate parameterizations, affine error identities and local nonlinear analysis show how teacher errors enter fitted coefficients and establish conditions under which physical residuals control coefficient and solution errors. Across seven benchmarks covering scalar evolution equations, multidimensional elliptic problems and coupled incompressible flows, DeSyR attains mean relative solution errors on the order of $10^{-14}$ or smaller and lower reported mean physical residuals than PINNs, physics-informed symbolic networks and teacher-fitted symbolic distillation. With the expression structure held fixed, estimating coefficients from physical constraints further yields more accurate frequency estimates and solutions than fitting teacher predictions. DeSyR therefore turns neural approximations into guides for structure discovery, while physical constraints determine the final explicit solution.
Graph Representation Learning (GRL) requires node embeddings to preserve local structural coherence while remaining globally discriminative. Existing graph self-supervised methods generally coordinate these competing objectives through method-specific designs, lacking a unified and adaptive mechanism that responds to the evolving representation state. To address this limitation, we propose SelfGRL, a self-organized graph representation learning framework that reformulates representation learning as Helmholtz free-energy minimization on the unit hypersphere. SelfGRL models local neighborhood attraction as a Structural Binding Energy through neighbor-mean alignment, while introducing a Sampling-Free Repulsive Entropy objective to preserve global dispersion and prevent representation collapse without pairwise negative sampling. To dynamically coordinate these competing effects, we develop an endogenous Bayesian Thermostat that adaptively regulates their relative strengths in response to the evolving representation state, allowing the system to approach a metastable semantic equilibrium without requiring manually tuned loss weights. Extensive experiments on node classification across both homophilic and heterophilic benchmark datasets, together with link prediction evaluations, demonstrate that SelfGRL consistently achieves strong performance across diverse graph structures.