Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Low-dimensional Space”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Generative deep-learning reveals collective variables of Fermionic systems

Complex processes of fermionic systems ranging from protein folding to nuclear fission often follow a low-dimensional reaction path parametrized in terms of a few collective variables. In nuclear theory, variables related to the shape of the nuclear density in a mean-field picture are key to describing the large amplitude collective motion of the neutrons and protons. Exploring the adiabatic energy landscape spanned by these degrees of freedom reveals the possible reaction channels while simulating the dynamics in this reduced space yields their respective probabilities. Unfortunately, this theoretical framework breaks down whenever the systems encounters a quantum phase transition with respect to the collective variables. Here, in this study, we introduce a novel generative deep-learning algorithm designed to build reaction paths that ensure that the many-fermion wave function stays differentiable with respect to the collective variables. This approach is applicable to any fermionic system described by a coherent state. We use the case of potential energy curves in the 16 O nucleus within the Hartree-Fock theory to illustrate its main features.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2026

Ultrafast Nanoimaging of Carrier Funneling in Composition-Graded Semiconductor Nanowires

Recent advances in bandgap engineering of low-dimensional semiconductors have enabled high-efficiency carrier transport in miniaturized electronic and optoelectronic devices. The physical properties and functionalities of these materials are governed by complex carrier dynamics coupled with multiple transport mechanisms in tailored band structures. Here, we report ultrafast nanoimaging of carrier funneling and recombination in composition-grade CdSxSe1-x nanowires using pump-probe near-field nanoscopy. Leveraging the high resolution of this technique in both space and time, we resolve nanoscale local carrier dynamics along composition-graded nanowires, revealing the local variation of composition-dependent carrier mobilities and lifetimes that significantly differ from their uniform composition counterparts. Furthermore, we demonstrate a length-dependent behavior wherein shorter nanowires exhibit enhanced funneling effects, accelerating carrier transport by up to 33%. Our findings provide direct visualization of nanoscale carrier transport while supporting an effective approach for investigating complex carrier interactions in inhomogeneous semiconductor nanostructures, with implications for optimizing next-generation optoelectronic devices.

Yang, Rundi↗
DOE OSTI2026

Algebraic Multigrid with Filtering: An Efficient Preconditioner for Interior Point Methods in Large-Scale Contact Mechanics Optimization

Large-scale contact mechanics simulations are crucial in many engineering fields such as structural design and manufacturing. In the frictionless case, contact can be modeled by minimizing an energy functional; however, these problems are often nonlinear, nonconvex, and increasingly difficult to solve as mesh resolution increases. In this work, we employ a Newton-based interior-point (IP) filter line-search method, an effective approach for large-scale constrained optimization. While this method converges rapidly, each iteration requires solving a large saddle-point linear system that becomes ill-conditioned as the optimization process converges, largely due to IP treatment of the contact constraints. Such ill-conditioning can hinder solver scalability and increase iteration counts with mesh refinement. Here, to address this, we introduce a novel preconditioner, algebraic multigrid with filtering (AMGF), tailored to the Schur complement of the saddle-point system. Building on the classical AMG solver, commonly used for elasticity, we augment it with a specialized subspace correction that filters near null space components introduced by contact interface constraints. Through theoretical analysis and numerical experiments on a range of linear and nonlinear contact problems, we demonstrate that the proposed solver achieves mesh independent convergence and maintains robustness against the ill-conditioning that notoriously plagues IP methods. These results indicate that AMGF makes contact mechanics simulations more tractable and broadens the applicability of Newton-based IP methods in challenging engineering scenarios. More broadly, AMGF is well suited for problems, optimization or otherwise, where solver performance is limited by a low-dimensional subspace, such as those arising from localized constraints, interface conditions, or model heterogeneities. This makes the method widely applicable beyond contact mechanics and constrained optimization.

Mathematics and Computing↗
DOE OSTI2026

Neural Scaling Laws of Deep ReLU and Deep Operator Network: A Theoretical Study

Neural scaling laws play a pivotal role in the performance of deep neural networks and have been observed in a wide range of tasks. However, a complete theoretical framework for understanding these scaling laws remains underdeveloped. In this paper, we explore the neural scaling laws for deep operator networks, which involve learning mappings between function spaces, with a focus on the Chen and Chen style architecture. These approaches, which include the popular Deep Operator Network (DeepONet), approximate the output functions using a linear combination of learnable basis functions and coefficients that depend on the input functions. We establish a theoretical framework to quantify the neural scaling laws by analyzing its approximation and generalization errors. We articulate the relationship between the approximation and generalization errors of deep operator networks and key factors such as network model size and training data size. Moreover, we address cases where input functions exhibit low-dimensional structures, allowing us to derive tighter error bounds. These results also hold for deep ReLU networks and other similar structures. Our results offer a partial explanation of the neural scaling laws in operator learning and provide a theoretical foundation for their applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Enabling dynamic 3D coherent diffraction imaging via adaptive latent space tuning of generative autoencoders

Abstract Coherent diffraction imaging (CDI) is an advanced non-destructive 3D X-ray imaging technique for measuring a sample’s electron density. The main challenge of CDI is loss of phase information in diffraction intensity measurements, resulting in lengthy iterative reconstruction processes that can return non-unique solutions, which pose challenges for experiments attempting to track dynamic sample evolution through multiple states. As the increased brightness of fourth-generation light sources enables faster sample measurements and drives operando experiments with Bragg CDI, there is a growing need for faster reconstruction techniques that can keep pace. We have developed an adaptive generative autoencoder approach for uniquely tracking a sample’s electron density as it dynamically evolves. Our approach adaptively tunes the low-dimensional latent embedding of a generative autoencoder, enabling a computationally efficient manner to account for time-varying shifting distributions in real-time. Analytic proof of convergence is provided as well as numerical demonstration of sample tracking with noisy measurements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Generative learning for slow manifolds and bifurcation diagrams

In dynamical systems characterized by separation of time scales, the approximation of so called “slow manifolds”, on which the long term dynamics lie, is a useful step for model reduction. Initializing on such slow manifolds is a useful step in modeling, since it circumvents fast transients, and is crucial in multiscale algorithms (like the equation-free approach) alternating between fine scale (fast) and coarser scale (slow) simulations. In a similar spirit, when one studies the infinite time dynamics of systems depending on parameters, the system attractors (e.g., its steady states) lie on bifurcation diagrams (curves for one-parameter continuation, and more generally, on manifolds in state parameter space. Sampling these manifolds gives us representative attractors (here, steady states of ODEs or PDEs) at different parameter values. Algorithms for the systematic construction of these manifolds (slow manifolds, bifurcation diagrams) are required parts of the “traditional” numerical nonlinear dynamics toolkit. In more recent years, as the field of Machine Learning develops, conditional score-based generative models (cSGMs) have been demonstrated to exhibit remarkable capabilities in generating plausible data from target distributions that are conditioned on some given label. It is tempting to exploit such generative models to produce samples of data distributions (points on a slow manifold, steady states on a bifurcation surface) conditioned on (consistent with) some quantity of interest (QoI, observable). In this work, we present a framework for using cSGMs to quickly (a) initialize on a low-dimensional (reduced-order) slow manifold of a multi-time-scale system consistent with desired value(s) of a QoI (a “label”) on the manifold, and (b) approximate steady states in a bifurcation diagram consistent with a (new, out-of-sample) parameter value. This conditional sampling can help uncover the geometry of the reduced slow-manifold and/or approximately “fill in” missing segments of steady states in a bifurcation diagram. Finally, the quantity of interest, which determines how the sampling is conditioned, is either known a priori or identified using manifold learning-based dimensionality reduction techniques applied to the training data.

Dynamical systems↗
DOE OSTI2026

Pressure‐Induced Structural and Magnetic Evolution in Layered Antiferromagnet YbMn 2 Sb 2

Electronic states under pressure exhibit unconventional spin and charge dynamics that provide a powerful route to uncover exotic phases in quantum materials. Here, we present the structural, magnetic, and electronic evolution of YbMn 2 Sb 2 under pressure. Single-crystal X-ray diffraction reveals a pressure-induced structural transition from the space group trigonal P$\overline{3}$m1 to the monoclinic P2 1 /m phase near 3.5 GPa, which remains stable up to 10 GPa. Magnetization measurements display an anomalously weak net magnetic moment and the absence of Curie–Weiss behavior up to 400 K, suggesting the formation of short-range Mn moment pairs that cancel macroscopically and subsequently evolve into long-range order upon cooling. Temperature-dependent resistivity shows semiconducting behavior with a transition at ∼119 K at ambient pressure, while pressure induces a dramatic suppression of resistance and the emergence of metallic-like temperature dependence, stabilized beyond 5 GPa. This pressure-driven semiconductor-metal transition is consistent with our density functional theory calculations, confirming the closing of the band gap under compression. Neutron diffraction under pressure identifies an incommensurate magnetic structure with antiparallel correlations between paired spins. Together, these results demonstrate how pressure-driven structural tuning and competing exchange interactions stabilize unconventional magnetic states in this low-dimensional magnetic semiconductor.

antiferromagnetic semiconductor↗
DOE OSTI2026

Fault-tolerant resource comparison of qudit and qubit encodings for diagonal quadratic operators

Finite local Hilbert-space truncations arise naturally in quantum simulations of lattice field theories and motivate qudit encodings, but their fault-tolerant advantage over qubit encodings remains unclear. We compare the non-Clifford cost of implementing quadratic diagonal evolutions, exemplified by 𝑈 = 𝑒$^{−𝑖⁢𝑡⁢𝜙^2_𝑥}$ in a uniform field-amplitude discretization of a real scalar field, using either one logical 𝑑-level qudit or 𝑛 𝑏 = ⌈log 2⁡ 𝑑⌉ logical qubits. We analyze two standard settings: product-formula simulation and linear combination of unitaries (LCU) per block encoding, taking the resource metric to be the number of non-Clifford gates after synthesis into a discrete logical gate set. Because tight synthesis bounds for general single-qudit rotations are not known, we express the qudit constructions in terms of embedded two-level SU⁡(2) rotations and derive explicit finite-𝑑 break-even conditions for their synthesis cost; these serve as compiler targets for when qudit encodings can outperform the qubit baseline. Within the constructive models studied here, product-formula implementations would require an exponentially stronger per-primitive synthesis advantage for qudits to win asymptotically, while in the LCU setting the qubit encoding is asymptotically cheaper in 𝑑. Nevertheless, the finite-𝑑 threshold analysis identifies low-dimensional regions in which qudits can yield meaningful constant-factor savings, particularly for LCU-based implementations. As a secondary analysis of the LCU construction, we use an idealized negligible-overhead qubit-qudit code-switching model to give an absolute 𝑇-count comparison and reinterpret the savings as an allowable per-switch overhead budget.

Godwood, Samuel [Univ. of Liverpool (United Kingdo↗
DOE OSTI2025

Anisotropic light-tailored RKKY interaction in two-dimensional 𝑑-wave altermagnets

Altermagnets are known in spintronics for their intrinsic spin-splitting and unconventional magnetic responses, particularly to magnetic impurities. However, effectively controlling the magnetic exchange interactions in altermagnets is challenging for practical applications. Here, in this work, we propose using circularly polarized light to tune the Ruderman-Kittel-Kasuya-Yosida (RKKY) interaction in two-dimensional 𝑑-wave altermagnets. Using the real-space retarded Green's functions approach, our results show that while the Heisenberg and Ising exchanges dominate, a notable Dzyaloshinskii–Moriya (DM) interaction also plays a key role. Furthermore, the inherent strength of altermagnetism imprints chirp-like signatures into the magnetic responses, which can be dynamically tuned via light. We mainly demonstrate that gate-induced Rashba spin-orbit coupling is essential in response to light—light selectively and anisotropically adjusts the DM interaction without affecting the other exchanges. Our findings further indicate that rotating the altermagnet by 45° relative to the light's polarization direction generates a Dirac-like dispersion and different DM interactions. We finally extract critical thresholds where light reverses DM interactions along one axis or balances both in-plane components. The anisotropic light-driven control of RKKY interactions in altermagnets not only highlights their unique properties but also opens new avenues for engineering tailored magnetic characteristics in spintronic applications.

altermagnetism↗
DOE OSTI2024

Generalization error guaranteed auto-encoder-based nonlinear model reduction for operator learning

Many physical processes in science and engineering are naturally represented by operators between infinite-dimensional function spaces. The problem of operator learning, in this context, seeks to extract these physical processes from empirical data, which is challenging due to the infinite or high dimensionality of data. An integral component in addressing this challenge is model reduction, which reduces both the data dimensionality and problem size. In this paper, we utilize low-dimensional nonlinear structures in model reduction by investigating Auto-Encoder-based Neural Network (AENet). AENet first learns the latent variables of the input data and then learns the transformation from these latent variables to corresponding output data. Our numerical experiments validate the ability of AENet to accurately learn the solution operator of nonlinear partial differential equations. Furthermore, we establish a mathematical and statistical estimation theory that analyzes the generalization error of AENet. Finally, our theoretical framework shows that the sample complexity of training AENet is intricately tied to the intrinsic dimension of the modeled process, while also demonstrating the robustness of AENet to noise.

Auto-encoder↗
DOE OSTI2024

Polynomial chaos expansions on principal geodesic Grassmannian submanifolds for surrogate modeling and uncertainty quantification

In this work we introduce a manifold learning-based surrogate modeling framework for uncertainty quantification in high-dimensional stochastic systems. Our first goal is to perform data mining on the available simulation data to identify a set of low-dimensional (latent) descriptors that efficiently parameterize the response of the high-dimensional computational model. To this end, we employ Principal Geodesic Analysis on the Grassmann manifold of the response to identify a set of disjoint principal geodesic submanifolds, of possibly different dimension, that captures the variation in the data. Since operations on the Grassmann require the data to be concentrated, we propose an adaptive algorithm based on Riemannian K-means and the minimization of the sample Fréchet variance on the Grassmann manifold to identify “local” principal geodesic submanifolds that represent different system behavior across the parameter space. Polynomial chaos expansion is then used to construct a mapping between the random input parameters and the projection of the response on these local principal geodesic submanifolds. Here, the method is demonstrated on four test cases, a toy-example that involves points on a hypersphere, a Lotka-Volterra dynamical system, a continuous-flow stirred-tank chemical reactor system, and a two-dimensional Rayleigh-Bénard convection problem.

42 ENGINEERING↗
DOE OSTI2025

Orbital-Selective Instabilities and Spin Fluctuations at the Verge of Superconductivity in Interlayer-Expanded Iron Selenide

Understanding electron correlation-driven instabilities and their coupling to structural phases is essential for deciphering multiorbital pairing in unconventional superconductors. We investigate Li x (C 5 H 5 N) y Fe 2 Se 2 (x ∼ 0.6; y ∼ 0.7−0.9), a tetragonal β-FeSe intercalate with a superconducting transition temperature (T c = 39 K) closely tied to an expanded Fe-layer spacing (∼11.4 Å). High-resolution synchrotron Xray diffraction and core-level absorption spectroscopy reveal subtle lattice distortions on cooling without a symmetry-breaking transition. Instead, the material exhibits negative thermal expansion (NTE) in the two-dimensional Fe network below T S ∼ 70 K, and stiffening of local Se−Fe−Se bond dynamics near T c . The spatially incoherent rearrangement of FeSe 4 tetrahedra and the site-local fluctuations, signal reduced electron correlations compared to those of parent β-FeSe (T c = 8 K). Complementary X-ray emission spectroscopy, a fast local probe of Fe 3d valence states, detects persistent local Fe spin moments below T S , unlike quenching in related systems. These findings indicate that decoupling of Fe planes leads to an electronically driven lattice instability. The latter emerges as NTE induced from weak, orbital-selective localization of in-plane Fe 3d states rather than conventional transverse vibrations. Governed by Hund’s coupling, this selectivity permits coexistence of local spin fluctuations with itinerant d-electrons critical for enhancing T c . These results suggest that intercalation-driven d-orbital differentiation moderates electron correlations, providing a pathway to optimize the superconductivity in low-dimensional quantum materials.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Dark Energy Survey Year 3 results: Simulation-based 𝑤CDM inference from weak lensing and galaxy clustering maps with deep learning: Analysis design

Data-driven approaches using deep learning are emerging as powerful techniques to extract non-Gaussian information from cosmological large-scale structure. Here, this work presents the first simulation-based inference (SBI) pipeline that combines weak lensing and galaxy clustering maps in a realistic Dark Energy Survey Year 3 (DES Y3) configuration and serves as preparation for a forthcoming analysis of the survey data. We develop a scalable forward model based on the CosmoGridV1 suite of N-body simulations to generate over one million self-consistent mock realizations of DES Y3 at the map level. Leveraging this large dataset, we train deep graph convolutional neural networks on the full survey footprint in spherical geometry to learn low-dimensional features that approximately maximize mutual information with target parameters. These learned compressions enable neural density estimation of the implicit likelihood via normalizing flows in a ten-dimensional parameter space spanning cosmological 𝑤CDM, intrinsic alignment, and linear galaxy bias parameters, while marginalizing over baryonic, photometric redshift, and shear bias nuisances. To ensure robustness, we extensively validate our inference pipeline using synthetic observations derived from both systematic contaminations in our forward model and independent Buzzard galaxy catalogs. Our forecasts yield significant improvements in cosmological parameter constraints, achieving 2−3× higher figures of merit in the 𝛺 𝑚 − 𝑆 8 plane relative to our implementation of baseline two-point statistics and effectively breaking parameter degeneracies through probe combination. These results demonstrate the potential of SBI analyses powered by deep learning for upcoming Stage-IV wide-field imaging surveys.

Thomsen, A. [Zurich, ETH] (ORCID:0000000203099021)↗
DOE OSTI2024

La 4 Co 4 X ( X = Pb , Bi , Sb ) : A demonstration of antagonistic pairs as a route to quasi-low-dimensional ternary compounds

We outline how pairs of strongly immiscible elements, referred to here as antagonistic pairs, can be used to synthesize ternary compounds with low or quasi-reduced-dimensional motifs intrinsically built into their crystal structures. By identifying third elements that are mutually compatible with a given antagonistic pair, ternary compounds can be formed in which the third element segregates the immiscible atoms into spatially separated substructures. Quasi-low-dimensional structural units, such as sheets, chains, or clusters are a natural consequence of the immiscible atoms seeking to avoid close contact in the solid state. Further, as proof of principle, we present the discovery, crystal growth, and basic physical properties of La 4 ⁢Co 4 ⁢$\mathrm{X}$ (X = Pb, Bi, Sb), a family of intermetallic compounds based on the antagonistic pairs Co-Pb and Co-Bi. La 4 ⁢Co 4 ⁢$\mathrm{X}$ adopts an orthorhombic crystal structure (space group Pbam) containing quasi-two-dimensional Co slabs and La-X polyhedra that stack in an alternating manner along the α axis. Consistent with our proposal, the La atoms separate the Co and X substructures, ensuring there are no direct contacts between the members of the immiscible (antagonistic) pair. Within the Co slabs, the atoms occupy the vertices of corner sharing tetrahedra and triangles, and this bonding motif produces narrow electronic bands near the Fermi level that favor magnetism. The Co is moment bearing in each La 4 ⁢Co 4 $\mathrm{X}$ compound studied, and we show that whereas La 4 ⁢Co 4 ⁢Pb behaves as a three-dimensional antiferromagnet with T N =220K, La 4 ⁢Co 4 ⁢Bi and La 4⁢ Co 4 ⁢Sb have behavior consistent with low-dimensional magnetic coupling and ordering, with T N =153K and 143 K, respectively. In addition to the Pb-, Bi-, and Sb-based La 4 ⁢Co 4 ⁢$\mathrm{X}$ compounds, we also were likely able to produce an analogous La 4 ⁢Co 4 ⁢Sn in polycrystalline form, although we were unable to isolate single crystals. We anticipate that identifying and using mutually compatible third elements together with an antagonistic pair represents a generalizable design principle for discovering new materials and new structure types containing low-dimensional substructures.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Data-Driven Compression of Electron-Phonon Interactions

First-principles calculations of electron interactions in materials have seen rapid progress in recent years, with electron-phonon ( e − ph ) interactions being a prime example. However, these techniques use large matrices encoding the interactions on dense momentum grids, which reduces computational efficiency and obscures interpretability. For e − ph interactions, existing interpolation techniques leverage locality in real space, but the high dimensionality of the data remains a bottleneck to balance cost and accuracy. Here we show an efficient way to compress e − ph interactions based on singular value decomposition (SVD), a widely used matrix and image compression technique. Leveraging (un)constrained SVD methods, we accurately predict material properties related to e − ph interactions—including charge mobility, spin relaxation times, band renormalization, and superconducting critical temperature—while using only a small fraction (1%–2%) of the interaction data. These findings unveil the hidden low-dimensional nature of e − ph interactions. Furthermore, they accelerate state-of-the-art first-principles e − ph calculations by about 2 orders of magnitude without sacrificing accuracy. Our Pareto-optimal parametrization of e − ph interactions can be readily generalized to electron-electron and electron-defect interactions, as well as to other couplings, advancing quantitative studies of condensed matter. Published by the American Physical Society 2024

Physics↗
DOE OSTI2026

Characterizing skyrmion flow phases with principal component analysis

Principal component analysis (PCA) is a powerful method that can identify patterns in large, complex data sets by constructing low-dimensional order parameters from higher-dimensional feature vectors. There are increasing efforts to use space-and-time-dependent PCA to detect transitions in nonequilibrium systems that are difficult to characterize with equilibrium methods. Here, we demonstrate that feature vectors incorporating the position and velocity information of driven skyrmions moving through random disorder permit PCA to resolve different types of disordered skyrmion motion as a function of driving force and the ratio of the Magnus force to the dissipation. Since the Magnus force creates gyroscopic motion and a finite Hall angle, skyrmions can exhibit a greater range of flow phases than what is observed in overdamped driven systems with quenched disorder. We show that in addition to identifying previously known skyrmion flow phases, PCA detects several additional phases, including different types of channel flow, moving fluids, and partially ordered states. Guided by the PCA analysis, we further characterize the disordered flow phases to elucidate the different microscopic dynamics and show that the changes in the PCA-derived order parameters can be connected to features in bulk transport measures, including the transverse and longitudinal velocity-force curves, differential conductivity, topological defect density, and changes in the skyrmion Hall angle as a function of drive. We discuss how asymmetric feature vectors can be used to improve the resolution of the PCA analysis, and how this technique can be extended to find disordered phases in other nonequilibrium systems with time-dependent dynamics.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Data-Driven Closures and Assimilation for Stiff Multiscale Random Dynamics

Here, we introduce a data-driven and physics-informed framework for propagating uncertainty in stiff, multiscale random ordinary differential equations (RODEs) driven by correlated (colored) noise. Unlike systems subjected to Gaussian white noise, a deterministic equation for the joint probability density function (PDF) of RODE state variables does not exist in closed form. Moreover, such an equation would require as many phase-space variables as there are states in the RODE system. To alleviate this curse of dimensionality, we instead derive exact, albeit unclosed, reduced-order PDF (RoPDF) equations for low-dimensional observables/quantities of interest. The unclosed terms take the form of state-dependent conditional expectations, which are directly estimated from data at sparse observation times. However, for systems exhibiting stiff, multiscale dynamics, data sparsity introduces regression discrepancies that compound during RoPDF evolution. This is overcome by introducing a kinetic-like defect term to the RoPDF equation, which is learned by assimilating in sparse, low-fidelity RoPDF estimates. Two assimilation methods are considered, namely nudging and deep neural networks, which are successfully tested against Monte Carlo simulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Scalable Bayesian Physics-Informed Kolmogorov-Arnold Networks

Uncertainty quantification (UQ) plays a pivotal role in scientific machine learning, especially when surrogate models are used to approximate complex systems. Although multilayer perceptions (MLPs) are commonly employed as surrogates, they often suffer from overfitting due to their large number of parameters. Kolmogorov-Arnold networks (KANs) offer an alternative solution with fewer parameters. However, gradient-based inference methods, such as Hamiltonian Monte Carlo (HMC), may result in computational inefficiency when applied to KANs, especially for large-scale datasets, due to the high cost of back-propagation. To address these challenges, we propose a novel approach, combining the dropout Tikhonov ensemble Kalman inversion (DTEKI) with Chebyshev KANs. This gradient-free method effectively mitigates overfitting and enhances numerical stability. In addition, we incorporate the active subspace method to reduce the parameter-space dimensionality, allowing us to improve the accuracy of predictions and obtain more reliable uncertainty estimates. Extensive experiments demonstrate the efficacy of our approach in various test cases, including scenarios with large datasets and high noise levels. Our results show that the new method achieves comparable or better accuracy, much higher efficiency as well as stability compared to HMC, in addition to scalability. Moreover, by leveraging the low-dimensional parameter subspace, our method preserves prediction accuracy while substantially reducing further the computational cost.

97 MATHEMATICS AND COMPUTING↗