Об алгоритмической разрешимости задачи об $A$-полноте для систем ограниченно-детерминированных функций, содержащих все одноместные $S$-о.-д. функции

  • Буевич В
  • Buevich V
  • Подколзина М
  • et al.
N/ACitations
Citations of this article
23Readers
Mendeley users who have this article in their library.

Abstract

We propose VisualBERT, a simple and flexible framework for modeling a broad range of vision-and-language tasks. VisualBERT consists of a stack of Transformer layers that implicitly align elements of an input text and regions in an associated input image with self-attention. We further propose two visually-grounded language model objectives for pre-training VisualBERT on image caption data. Experiments on four vision-and-language tasks including VQA, VCR, NLVR2, and Flickr30K show that VisualBERT outperforms or rivals with state-of-the-art models while being significantly simpler. Further analysis demonstrates that VisualBERT can ground elements of language to image regions without any explicit supervision and is even sensitive to syntactic relationships, tracking, for example, associations between verbs and image regions corresponding to their arguments.

Cite

CITATION STYLE

APA

Буевич, В. А., Buevich, V. A., Подколзина, М. А., & Podkolzina, M. A. (2012). Об алгоритмической разрешимости задачи об $A$-полноте для систем ограниченно-детерминированных функций, содержащих все одноместные $S$-о.-д. функции. Дискретная Математика, 24(4), 56–69. https://doi.org/10.4213/dm1210

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free