The concept of unknowability is commonly discussed relative to the cognitive limits of human observers. This paper asks whether a boundary established for one Observer Intelligence can be generalized to heterogeneous observers without an additional assumption of perceptual or epistemic equivalence. It first proposes observer-relative knowability, K = K(O), and then extends the model by introducing the epistemic capability level L, yielding K = K(O, L). Unknowability is subsequently derived as the complement of observer-relative knowability, U(O, L) = S ∖ K(O, L). The resulting hypothesis is that inaccessibility to one observer at one capability level does not by itself establish universal unknowability. The paper illustrates the model with a minimal cross- sectional example, defines its scope relative to interpretation, and considers an implication for artificial intelligence: a human-readable AI interface does not establish epistemic equivalence between Human and AI Observer Intelligences. The model does not claim that AI has access to structures unknowable to humans, nor that multiple observers collectively exhaust Structure. It proposes only that epistemic boundaries should remain indexed to the observer and its capability level unless observer equivalence is independently established. Let S denote an individual Structure, S_all the domain of candidate Structures, O an Observer Intelligence, K its epistemically accessible domain, and L its epistemic capability level. Unknowability U is not introduced as a primary variable; it is derived later from K.
This paper investigates developing real-world perception for active agents, proposes Gibson Environment for this purpose, and showcases a set of perceptual tasks learned therein.
F. Xia, Amir Zamir, Zhi-Yang He et al.· 2018 IEEE/CVF Conference on...· 1,069 citations· ⚡112
GAOKAO-Bench is introduced, an intuitive benchmark that employs questions from the Chinese GAOKAO examination as test samples, including both subjective and objective questions that contribute a robust evaluation benchmark for future large language models and offers valuable insights into the advantages and limitations...
Xiaotian Zhang, Chun-yan Li, Yi Zong et al.· arXiv.org· 216 citations· ⚡17
An algorithm is proposed which leverages disentangled semantic factors to generate adversarial perturbation by altering controlled semantic attributes to fool the learner towards various "adversarial" targets.
Haonan Qiu, Chaowei Xiao, Lei Yang et al.· arXiv.org· 208 citations· ⚡17
This work proposes a HALO that directly maximizes the utility of generations instead of maximizing the log-likelihood of preferences, and suggests that the best loss depends on the inductive biases most appropriate for a given setting, an oft-overlooked consideration.
This work investigates the possibilities of using LLMs in a resume screening setting via a document retrieval framework that simulates job candidate selection and finds that the MTEs are biased, significantly favoring White-associated names in 85% of cases and female-associated names in only 11.1% of cases.
This work shows that orders of magnitude enhancement in performance could be obtained by a combination of hardware improvements and tight quantum-HPC integration and introduces high-performance architectures for quantum-probabilistic computing with custom-designed accelerators to tackle today's industry-scale classical...
Masoud Mohseni, Artur Scherer, K. Johnson et al.· arXiv.org· 121 citations· ⚡9