اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدWhen Ignorance is Bliss
93
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
It is commonly-accepted wisdom that more information is better, and that information should never be ignored. Here we argue, using both a Bayesian and a non-Bayesian analysis, that in some situations you are better off ignoring information if your uncertainty is represented by a set of probability measures. These include situations in which the information is relevant for the prediction task at hand. In the non-Bayesian analysis, we show how ignoring information avoids dilation, the phenomenon that additional pieces of information sometimes lead to an increase in uncertainty. In the Bayesian analysis, we show that for small sample sizes and certain prediction tasks, the Bayesian posterior based on a noninformative prior yields worse predictions than simply ignoring the given information.
قيم البحث
اقرأ أيضاً
We show that quantum state tomography with perfect knowledge of the measurement apparatus proves to be, in some instances, inferior to strategies discarding all information about the measurement at hand, as in the case of data pattern tomography. In
those scenarios, the larger uncertainty about the measurement is traded for the smaller uncertainty about the reconstructed signal. This effect is more pronounced for minimal or nearly minimal informationally complete measurement settings, which are of utmost practical importance.
Numerous studies and anecdotes demonstrate the wisdom of the crowd, the surprising accuracy of a groups aggregated judgments. Less is known, however, about the generality of crowd wisdom. For example, are crowds wise even if their members have system
atic judgmental biases, or can influence each other before members render their judgments? If so, are there situations in which we can expect a crowd to be less accurate than skilled individuals? We provide a precise but general definition of crowd wisdom: A crowd is wise if a linear aggregate, for example a mean, of its members judgments is closer to the target value than a randomly, but not necessarily uniformly, sampled member of the crowd. Building on this definition, we develop a theoretical framework for examining, a priori, when and to what degree a crowd will be wise. We systematically investigate the boundary conditions for crowd wisdom within this framework and determine conditions under which the accuracy advantage for crowds is maximized. Our results demonstrate that crowd wisdom is highly robust: Even if judgments are biased and correlated, one would need to nearly deterministically select only a highly skilled judge before an individuals judgment could be expected to be more accurate than a simple averaging of the crowd. Our results also provide an accuracy rationale behind the need for diversity of judgments among group members. Contrary to folk explanations of crowd wisdom which hold that judgments should ideally be independent so that errors cancel out, we find that crowd wisdom is maximized when judgments systematically differ as much as possible. We re-analyze data from two published studies that confirm our theoretical results.
Behind certain marginally trapped surfaces one can construct a geometry containing an extremal surface of equal, but not larger area. This construction underlies the Engelhardt-Wall proposal for explaining Bekenstein-Hawking entropy as a coarse-grain
ed entropy. The construction can be proven to exist classically but fails if the Null Energy Condition is violated. Here we extend the coarse-graining construction to semiclassical gravity. Its validity is conjectural, but we are able to extract an interesting nongravitational limit. Our proposal implies Walls ant conjecture on the minimum energy of a completion of a quantum field theory state on a half-space. It further constrains the properties of the minimum energy state; for example, the minimum completion energy must be localized as a shock at the cut. We verify that the predicted properties hold in a recent explicit construction of Ceyhan and Faulkner, which proves our conjecture in the nongravitational limit.
We study ghosts in multimetric gravity by combining the mini-superspace and the Hamiltonian constraint analysis. We first revisit bimetric gravity and explain why it is ghost-free. Then, we apply our method to trimetric gravity and clarify when the m
odel contains a ghost. More precisely, we prove trimetric gravity generically contains a ghost. However, if we cut the interaction of a pair of metrics, trimetric gravity becomes ghost-free. We further extend the Hamiltonian analysis to general multimetric gravity and calculate the number of ghosts in various models. Thus, we find multimetric gravity with loop type interactions never becomes ghost-free.
In ontology-mediated querying, description logic (DL) ontologies are used to enrich incomplete data with domain knowledge which results in more complete answers to queries. However, the evaluation of ontology-mediated queries (OMQs) over relational d
atabases is computationally hard. This raises the question when OMQ evaluation is efficient, in the sense of being tractable in combined complexity or fixed-parameter tractable. We study this question for a range of ontology-mediated query languages based on several important and widely-used DLs, using unions of conjunctive queries as the actual queries. For the DL ELHI extended with the bottom concept, we provide a characterization of the classes of OMQs that are fixed-parameter tractable. For its fragment EL extended with domain and range restrictions and the bottom concept (which restricts the use of inverse roles), we provide a characterization of the classes of OMQs that are tractable in combined complexity. Both results are in terms of equivalence to OMQs of bounded tree width and rest on a reasonable assumption from parameterized complexity theory. They are similar in spirit to Grohes seminal characterization of the tractable classes of conjunctive queries over relational databases. We further study the complexity of the meta problem of deciding whether a given OMQ is equivalent to an OMQ of bounded tree width, providing several completeness results that range from NP to 2ExpTime, depending on the DL used. We also consider the DL-Lite family of DLs, including members that admit functional roles.
الأسئلة المقترحة
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
