English
Related papers

Related papers: Normalization for multimodal type theory

200 papers

Compositional generalization, the ability of intelligent models to extrapolate understanding of components to novel compositions, is a fundamental yet challenging facet in AI research, especially within multimodal environments. In this…

Computation and Language · Computer Science 2023-11-09 Danial Kamali , Parisa Kordjamshidi

While progress has been made on the visual question answering leaderboards, models often utilize spurious correlations and priors in datasets under the i.i.d. setting. As such, evaluation on out-of-distribution (OOD) test samples has…

Computer Vision and Pattern Recognition · Computer Science 2020-10-19 Tejas Gokhale , Pratyay Banerjee , Chitta Baral , Yezhou Yang

The field of directed type theory seeks to design type theories capable of reasoning synthetically about (higher) categories, by generalizing the symmetric identity types of Martin-L\"of Type Theory to asymmetric hom-types. We articulate…

Category Theory · Mathematics 2025-10-21 Thorsten Altenkirch , Jacob Neumann

We review here the construction of a translation-invariant scalar model which was proved to be perturbatively renormalizable on Moyal space. Some general considerations on nonlocal renormalizability are given. Finally, we present…

High Energy Physics - Theory · Physics 2010-06-09 Adrian Tanasa

Although Neural Machine Translation (NMT) has achieved remarkable progress in the past several years, most NMT systems still suffer from a fundamental shortcoming as in other sequence generation tasks: errors made early in generation…

Computation and Language · Computer Science 2018-11-14 Zhirui Zhang , Shuangzhi Wu , Shujie Liu , Mu Li , Ming Zhou , Tong Xu

We introduce layers to modal type theories, which subsequently enables type theories for pattern matching on code in meta-programming and clean and straightforward semantics.

Logic in Computer Science · Computer Science 2024-03-01 Jason Z. S. Hu , Brigitte Pientka

We introduce the Generalized Turing Test (GTT), a formal framework for comparing the capabilities of arbitrary agents via indistinguishability. For agents A and B, we define the Turing comparator A $\geq$ B to hold if B, acting as a…

Artificial Intelligence · Computer Science 2026-05-12 Daniel Mitropolsky , Susan S. Hong , Riccardo Neumarker , Emanuele Rimoldi , Tomaso Poggio

We introduce a new type of generalized Turing machines (GTMs), which are intended as a tool for the mathematician who studies computability in Analysis. In a single tape cell a GTM can store a symbol, a real number, a continuous real…

Logic · Mathematics 2015-07-01 Nazanin Tavana , Klaus Weihrauch

Continual Test-Time Adaptation (CTTA) generalizes conventional Test-Time Adaptation (TTA) by assuming that the target domain is dynamic over time rather than stationary. In this paper, we explore Multi-Modal Continual Test-Time Adaptation…

Computer Vision and Pattern Recognition · Computer Science 2023-03-21 Haozhi Cao , Yuecong Xu , Jianfei Yang , Pengyu Yin , Shenghai Yuan , Lihua Xie

In this work, we propose to model the interaction between visual and textual features for multi-modal neural machine translation (MMT) through a latent variable model. This latent variable can be seen as a multi-modal stochastic embedding…

Computation and Language · Computer Science 2019-05-17 Iacer Calixto , Miguel Rios , Wilker Aziz

Many qualitative observations on the glass transition in classical fluids are well described by the mode coupling theory (MCT) but the extent of the non-ergodicity domain is often over-estimated by this theory. Making it more quantitative…

Statistical Mechanics · Physics 2012-10-04 S. Amokrane , F. Tchangnwa Nya , J. M. Ndjaka

Many organizations rely on data from government and third-party sources, and those sources rarely follow the same data formatting. This introduces challenges in integrating data from multiple sources or aligning external sources with…

Databases · Computer Science 2023-12-27 Arash Dargahi Nobari , Davood Rafiei

Today's propositional satisfiability (SAT) solvers are extremely powerful and can be used as an efficient back-end for solving NP-complete problems. However, many fundamental problems in knowledge representation and reasoning are located at…

Computational Complexity · Computer Science 2016-07-04 Ronald de Haan , Stefan Szeider

Multiparty session types (MSTs) provide an efficient methodology for specifying and verifying message passing software systems. In the theory of MSTs, a global type specifies the interaction among the roles at the global level. A local…

Formal Languages and Automata Theory · Computer Science 2022-08-12 Rupak Majumdar , Madhavan Mukund , Felix Stutz , Damien Zufferey

We investigate the domain of satisfiable formulas in satisfiability modulo theories (SMT), in particular, automatic generation of a multitude of satisfying assignments to such formulas. Despite the long and successful history of SMT in…

Logic in Computer Science · Computer Science 2022-12-14 Matan Peled , Bat-Chen Rothenberg , Shachar Itzhaky

Continual Test-Time Adaptation (CTTA) is an emerging and challenging task where a model trained in a source domain must adapt to continuously changing conditions during testing, without access to the original source data. CTTA is prone to…

Machine Learning · Computer Science 2024-05-29 Ziqi Shi , Fan Lyu , Ye Liu , Fanhua Shang , Fuyuan Hu , Wei Feng , Zhang Zhang , Liang Wang

Machine Translation (MT) has been widely used for cross-lingual classification, either by translating the test set into English and running inference with a monolingual model (translate-test), or translating the training set into the target…

Computation and Language · Computer Science 2023-05-24 Mikel Artetxe , Vedanuj Goswami , Shruti Bhosale , Angela Fan , Luke Zettlemoyer

It is well known that attributed tree transducers can be equipped with "regular look-around" in order to obtain a more robust class of translations. We present two characterizations of this class in terms of macro tree transducers (MTTs):…

Formal Languages and Automata Theory · Computer Science 2022-09-16 Kenji Hashimoto , Sebastian Maneth

Neural Machine Translation (NMT) is a new approach to machine translation that has made great progress in recent years. However, recent studies show that NMT generally produces fluent but inadequate translations (Tu et al. 2016b; Tu et al.…

Computation and Language · Computer Science 2017-01-02 Xing Wang , Zhengdong Lu , Zhaopeng Tu , Hang Li , Deyi Xiong , Min Zhang

This study explores the quantisation-aware training (QAT) on time series Transformer models. We propose a novel adaptive quantisation scheme that dynamically selects between symmetric and asymmetric schemes during the QAT phase. Our…

Machine Learning · Computer Science 2023-10-05 Tianheng Ling , Chao Qian , Lukas Einhaus , Gregor Schiele