Zobrazeno 1 - 10
of 35 761
pro vyhledávání: '"Epstein P"'
Advanced Artificial Intelligence (AI) systems, specifically large language models (LLMs), have the capability to generate not just misinformation, but also deceptive explanations that can justify and propagate false information and erode trust in the
Externí odkaz:
http://arxiv.org/abs/2408.00024
Autor:
Epstein, Samuel
This paper looks at the intersection of algorithmic information theory and physics, namely quantum mechanics, thermodynamics, and black holes. We discuss theorems which characterize the barrier between the quantum world and the classical realm. The n
Externí odkaz:
http://arxiv.org/abs/2407.18201
The *reciprocal complement* $R(D)$ of an integral domain $D$ is the subring of its fraction field generated by the reciprocals of its nonzero elements. Many properties of $R(D)$ are determined when $D$ is a polynomial ring in $n\geq 2$ variables over
Externí odkaz:
http://arxiv.org/abs/2407.15637
Autor:
Elad, Sharon, Epstein, Ariel
We present a semianalytical synthesis scheme for designing realistic printed-circuit-board- (PCB) based metagratings (MGs), capable of simultaneous beam steering and polarization conversion. These low-profile structures, comprised of sparse periodic
Externí odkaz:
http://arxiv.org/abs/2407.05648
Motion and deformation analysis of cardiac magnetic resonance (CMR) imaging videos is crucial for assessing myocardial strain of patients with abnormal heart functions. Recent advances in deep learning-based image registration algorithms have shown p
Externí odkaz:
http://arxiv.org/abs/2407.02229
Autor:
Epstein, Samuel
All strings with low mutual information with the halting sequence will have flat Kolmogorov Structure Functions, in the context of Algorithmic Statistics. Assuming the Independence Postulate, strings with non-negligible information with the halting s
Externí odkaz:
http://arxiv.org/abs/2406.05903
Autor:
Epstein, Samuel
Using Kolmogorov Game Derandomization, upper bounds of the Kolmogorov complexity of deterministic winning players against deterministic environments can be proved. This paper gives improved upper bounds of the Kolmogorov complexity of such players. T
Externí odkaz:
http://arxiv.org/abs/2405.16353
Autor:
Epstein, Larry G, Patel, Kaushil
Given only aggregate choice data and limited information about how menus are distributed across the population, we describe what can be inferred robustly about the distribution of preferences (or more general decision rules). We strengthen and genera
Externí odkaz:
http://arxiv.org/abs/2405.09500
The brightest steady sources of radiation in the universe, active galactic nuclei (AGN), are powered by gas accretion onto a central supermassive black hole (SMBH). The large sizes and accretion rates implicated in AGN accretion disks are expected to
Externí odkaz:
http://arxiv.org/abs/2405.09380
We discuss general one and two-loops banana diagrams with arbitrary masses on the de Sitter spacetime by using direct methods of dS quantum field theory in the dimensional regularization approach. In the one-loop case we also compute the effective po
Externí odkaz:
http://arxiv.org/abs/2403.13145