Results 81 to 90 of about 2,835 (222)
Sparse Minimum Redundancy Maximum Relevance for Feature Selection
ABSTRACT We propose a feature screening method that integrates both feature–feature and feature–target relationships. Inactive features are identified via a penalized minimum Redundancy Maximum Relevance (mRMR) procedure, which is the continuous version of the classical mRMR penalized by a non‐convex regularizer, and where the parameters estimated as ...
Peter Naylor +3 more
wiley +1 more source
Some Order Preserving Inequalities for Cross Entropy and Kullback–Leibler Divergence
Cross entropy and Kullback⁻Leibler (K-L) divergence are fundamental quantities of information theory, and they are widely used in many fields. Since cross entropy is the negated logarithm of likelihood, minimizing cross entropy is equivalent to ...
Mateu Sbert +3 more
doaj +1 more source
Testing for Bivariate Stochastic Dominance Using Inequality Restrictions [PDF]
In this paper, we propose of a test of bivariate stochastic dominance using a generalized framework for testing inequality constraints. Unlike existing tests, this test has the advantage of utilizing the covariance structure of the estimates of the joint
Thanasis Stengos, Brennan S. Thompson
core
ABSTRACT In this study, the dimensions of enjoying science lessons and pursuing science careers were examined under gender considerations. Ex post facto research was conducted on high school students (N = 599) from the Canary Islands who completed a Spanish version of the Test of Science Related Attitudes (TORSA).
Luis Miguel Rivera‐Gavidia +1 more
wiley +1 more source
Let $\mathcal{L}$ be the hypoelliptic Ornstein-Uhlenbeck operator associated with the pair of matrices (A,B). In 2004, Priola and Zabczyk proved the following Liouville-type theorem: every bounded entire solution of $\mathcal{L}u=0$ is constant if and ...
Alessia E. Kogoj +2 more
doaj +1 more source
An Algorithmic Complexity Interpretation of Lin's Third Law of Information Theory
Instead of static entropy we assert that the Kolmogorov complexity of a static structure such as a solid is the proper measure of disorder (or chaoticity).
Joel Ratsaby
doaj +1 more source
Invariant Measure and Universality of the 2D Yang–Mills Langevin Dynamic
ABSTRACT We prove that the Yang–Mills (YM) measure for the trivial principal bundle over the two‐dimensional torus, with any connected, compact structure group, is invariant for the associated renormalised Langevin dynamic. Our argument relies on a combination of regularity structures, lattice gauge‐fixing and Bourgain's method for invariant measures ...
Ilya Chevyrev, Hao Shen
wiley +1 more source
Lossless quantum data compression and quantum Kolmogorov complexity
We show that the optimal rate of lossless quantum data compression is closely related to Berthiaume, van Dam and Laplante's quantum Kolmogorov complexity.
Rogers, C. (Caroline) +3 more
core +1 more source
Representative policymakers? A behavioural experiment with French politicians
Abstract This study leverages an online behavioural experiment to analyse whether politicians' decisions align with citizens' preferences and with citizens' decisions within the same decision environment. We recruited 760 local politicians and 655 non‐politicians in France to participate as policymakers in a taxation‐redistribution game.
Roberto Brunetti, Matthieu Pourieux
wiley +1 more source
Fourier Mass Lower Bounds for Batchelor‐Regime Passive Scalars
ABSTRACT Batchelor predicted that a passive scalar ψν$\psi ^\nu$ with diffusivity ν$\nu$, advected by a smooth fluid velocity, should typically have Fourier mass distributed as |ψ̂ν|2(k)≈|k|−d$|\widehat{\psi }^\nu |^2(k) \approx |k|^{-d}$ for |k|≪ν−1/2$|k| \ll \nu ^{-1/2}$.
William Cooperman, Keefer Rowan
wiley +1 more source

