Results 91 to 100 of about 132 (130)
ABSTRACT This study introduces the inductive differential constraint method (IDCM), a data‐informed structural regularization framework that enhances neural network predictions under data‐scarce regimes by enforcing invariant differential structures extracted from simulation data.
Rekisei Ozawa, Yoshitaka Wada
wiley +1 more source
When AI outputs become documents: Documentation activity in human–AI dialogue
Abstract Large language models (LLMs) generate texts that increasingly circulate as documents in knowledge infrastructures, yet their documentary status remains theoretically underdetermined. Unlike traditional documents, LLM outputs lack identifiable authorship, stable provenance, or testimonial grounding.
Sascha Donner
wiley +1 more source
A hidden Markov model and reinforcement learning‐based strategy for fault‐tolerant control
Abstract This study introduces a data‐driven control strategy integrating hidden Markov models (HMM) and reinforcement learning (RL) to achieve resilient, fault‐tolerant operation against persistent disturbances in nonlinear chemical processes. Called hidden Markov model and reinforcement learning (HMMRL), this strategy is evaluated in two case studies
Tamera Leitao +2 more
wiley +1 more source
Topological data analysis and topological deep learning beyond persistent homology: a review. [PDF]
Su Z +7 more
europepmc +1 more source
ABSTRACT We present four novel tests of equal predictive accuracy and encompassing á Pitarakis (2023, 2025) for factor‐augmented regressions. Factors are estimated using cross‐section averages (CAs) of grouped series and our theoretical findings are empirically relevant: asymptotic normality, robustness to an overspecification of the number of factors,
Alessandro Morico, Ovidijus Stauskas
wiley +1 more source
Vector‐Driven Projection and Backprojection
Abstract Background Projection and backprojection are fundamental operators in tomographic image reconstruction. Existing approaches—namely pixel‐driven (PD), ray‐driven (RD), and distance‐driven (DD)—are subject to well‐known trade‐offs among interpolation artifacts, geometric flexibility, and computational cost. Purpose This study aims to introduce a
Ismail Melik Turker, Isa Yildirim
wiley +1 more source
Finite‐Block Polynomial and Volterra Structure in Reservoir Computing
ABSTRACT Reservoir computing is analyzed through the algebraic structure generated by finite‐width reservoirs on fixed input blocks. For linear and quadratic logistic activations, the induced input‐to‐state map admits an exact finite Volterra representation, yielding an explicit characterization of the associated hypothesis class.
Alfio Borzì
wiley +1 more source
Bidiagonal Decompositions and High‐Accuracy Computations for Newton Collocation Matrices
ABSTRACT We consider a class of collocation matrices A$$ A $$ associated with the Newton basis of the space of polynomials of degree at most n$$ n $$, evaluated at a set of l+1≥n+1$$ l+1\ge n+1 $$ nodes. In the most general setting, we allow n$$ n $$ of these nodes to either coincide with or differ from those defining the Newton basis.
E. Mainar, A. Marco, B. Rubio, R. Viaña
wiley +1 more source
Randomized Algorithms for Streaming Low‐Rank Approximation in Tree Tensor Network Format
ABSTRACT In this work, we present the tree tensor network Nyström (TTNN), an algorithm that extends recent research on streamable tensor approximation, such as for Tucker and tensor‐train formats, to the more general tree tensor network format, enabling a unified treatment of various existing methods.
Alberto Bucci, Gianfranco Verzella
wiley +1 more source
Abstract Active learning (AL) has emerged as a pedagogical response to diverse educational challenges across multiple disciplines. This scoping review maps the terrain of AL implementation patterns, examining AL practices in Business Education, Information and Communication Technology (ICT) Engineering, Mathematics, and Statistics from 2015 until the ...
Dubravka Novkovic +2 more
wiley +1 more source

