Results 101 to 110 of about 2,032,124 (281)
On the Kolmogorov Complexity of Binary Classifiers
We provide tight upper and lower bounds on the expected minimum Kolmogorov complexity of binary classifiers that are consistent with labeled samples. The expected size is not more than complexity of the target concept plus the conditional entropy of the labels given the sample.
openaire +2 more sources
Explaining the Origin of Negative Poisson's Ratio in Amorphous Networks With Machine Learning
This review summarizes how machine learning (ML) breaks the “vicious cycle” in designing auxetic amorphous networks. By transitioning from traditional “black‐box” optimization to an interpretable “AI‐Physics” closed‐loop paradigm, ML is shown to not only discover highly optimized structures—such as all‐convex polygon networks—but also unveil hidden ...
Shengyu Lu, Xiangying Shen
wiley +1 more source
The complexity or randomness was examined with the aid of Kolmogorov complexity for the flow about a turbulence wedge developed from a single roughness element on a flat plate.
Masashi ICHIMIYA +2 more
doaj +1 more source
The Kolmogorov Expression Complexity of Logics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Physics‐Informed Neural Networks (PINNs) provide a framework for integrating physical laws with data. However, their application to Prognostics and Health Management (PHM) remains constrained by the limited uncertainty quantification (UQ) capabilities.
Ibai Ramirez +4 more
wiley +1 more source
The Intransitive Logic of Directed Cycles and Flipons Enhances the Evolution of Molecular Computers by Augmenting the Kolmogorov Complexity of Genomes. [PDF]
Herbert A.
europepmc +1 more source
Single‐cell Spatial Transcriptomics Analysis and Denoising Engine is introduced as a unified deep learning framework that jointly performs denoising, clustering, and gene prioritization in spatial transcriptomics. By integrating linear and nonlinear representations within a dual‐channel architecture, it improves robustness and accuracy, uncovers ...
Yaxuan Cui +11 more
wiley +1 more source
Normalized Unconditional ϵ-Security of Private-Key Encryption
In this paper we introduce two normalized versions of non-perfect security for private-key encryption: one version in the framework of Shannon entropy, another version in the framework of Kolmogorov complexity.
Lvqing Bi, Songsong Dai, Bo Hu
doaj +1 more source
Exploiting Ferroelectric and Spintronic Dynamics for Neural Network Computation
Ferroelectric and spintronic devices, relying on the control of polarization and magnetization, offer intrinsically fast, durable, energy‐efficient, and low‐latency building blocks for analog in‐memory computing. The hysteretic dynamics of an order parameter are leveraged to provide nonvolatile, multistate memory and nonlinear switching. Brain‐inspired
Dashiell Harrison +4 more
wiley +1 more source
The Kolmogorov complexity of random reals
Crudely speaking, a real number is random iff it does not belong to any constructive set of measure 0. Randomness can be reformulated in terms of a (prefix-free) Kolmogorov complexity \(K(\alpha_{| n})\) of the initial segments of the real number \(\alpha\) (described as an infinite sequence of 0s and 1s): \(\alpha\) is random iff there exists a ...
Liang Yu 0004 +2 more
openaire +2 more sources

