Results 191 to 200 of about 156,057 (270)

Critical evaluation of the theory and practice of feed-forward neural networks for genomic prediction. [PDF]

G3 (Bethesda)
Kusmec A, Negus KL, Yu J.
europepmc   +1 more source

Robust Tests of Forecast Accuracy for Factor‐Augmented Regressions With an Application to the Novel EA‐MD‐QD Dataset

Journal of Applied Econometrics, EarlyView.
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

Evaluating Synthetic Cyber Deception Strategies Under Uncertainty via Game Theory Approach: Linking Information Leakage and Game Outcomes in Cyber Deception. [PDF]

Sensors (Basel)
Shahin M, Maghanaki M, Chen FF.
europepmc   +1 more source

Group Agency and Egalitarian Corporate Structure: The Epistemic, Incentive, and Control Dimensions

Journal of Applied Philosophy, EarlyView.
ABSTRACT What constitutes a good corporate agent? The article answers this question by critically applying List and Pettit's theory of group agency, which emphasizes three crucial dimensions of organizational design: epistemic quality, incentive compatibility, and control.
Chi Kwok, Chris Man‐Kong Li
wiley   +1 more source

Semi-Quenched Invariance Principle for the Random Lorentz Gas: Beyond the Boltzmann-Grad Limit. [PDF]

Entropy (Basel)
Tóth B.
europepmc   +1 more source

Treewidth Versus Clique Number. V. Further Connections With Tree‐Independence Number

Journal of Graph Theory, EarlyView.
ABSTRACT We continue the study of ( tw , ω ) $({\mathsf{tw}},\omega )$‐bounded graph classes, that is, hereditary graph classes in which large treewidth is witnessed by the presence of a large clique, and the relation of this property to boundedness of the tree‐independence number, a graph parameter introduced independently by Yolov in 2018 and by ...
Claire Hilaire, Martin Milanič, Ðorđe Vasić   +2 more
wiley   +1 more source

BoxesZero: An Efficient and Computationally Frugal Dots-and-Boxes Agent. [PDF]

Entropy (Basel)
Niu X, Liu Q, Chen W, Zheng Y, Jin Z.
europepmc   +1 more source

On Oriented Colourings of Graphs on Surfaces

Journal of Graph Theory, EarlyView.
ABSTRACT For an oriented graph G $G$, the least number of colours required to oriented colour G $G$ is called the oriented chromatic number of G $G$ and denoted χ o ( G ) ${\chi }_{o}(G)$. For a non‐negative integer g $g$ let χ o ( g ) ${\chi }_{o}(g)$ be the least integer such that χ o ( G ) ≤ χ o ( g ) ${\chi }_{o}(G)\le \unicode{x0200A}{\chi }_{o}(g)
Alexander Clow
wiley   +1 more source

Sparse identification of nonlinear dynamics and Koopman operators with Shallow Recurrent Decoder Networks. [PDF]

Proc Natl Acad Sci U S A
Gao ML, Williams JP, Kutz JN.
europepmc   +1 more source

Edge‐Length Preserving Embeddings of Graphs Between Normed Spaces

Journal of Graph Theory, EarlyView.
ABSTRACT The concept of graph embeddability, initially formalized by Belk and Connelly and later expanded by Sitharam and Willoughby, extends the question of embedding finite metric spaces into a given normed space. A finite simple graph G = ( V , E ) $G=(V,E)$ is said to be ( X , Y ) $(X,Y)$‐embeddable if any set of induced edge lengths from an ...
Sean Dewar, Eleftherios Kastis, Derek Kitson, William Sims   +3 more
wiley   +1 more source