Related papers: The higher sharp I: on $M_1^\#$
Among the most impressive recent applications of neural decoding is the visual representation decoding, where the category of an object that a subject either sees or imagines is inferred by observing his/her brain activity. Even though…
Understanding representation transfer in multilingual neural machine translation (MNMT) can reveal the reason for the zero-shot translation deficiency. In this work, we systematically analyze the representational issue of MNMT models. We…
A cat and mouse play a pursuit and evasion game on a connected graph $G$ with $n$ vertices. The mouse moves to vertices $m_1,m_2,\dots$ of $G$ where $m_i$ is in the closed neighbourhood of $m_{i-1}$ for $i\geq2$. The cat tests vertices…
The paper tries to extend results of the classical Descriptive Set Theory to as many countably based T_0-spaces (cb_0-spaces) as possible. Along with extending some central facts about Borel, Luzin and Hausdorff hierarchies of sets we…
In this paper, on the basis of a specific question raised in [6], we further continue our investigations on the uniqueness of a meromorphic function with its higher derivatives sharing two sets and answer the question affirmatively.…
We define and study a higher-dimensional version of model theoretic internality, and relate it to higher-dimensional definable groupoids in the base theory.
We introduced the concept of a metric value set (MVS) in an earlier paper \cite{GM} and developed the idea further in \cite{AS}. In this paper we study locally $M$-metrizable spaces and the products of $M$-metrizable spaces. Finally we…
Under certain conditions, we give an estimate from above on the number of differential equations of order $r+1$ with prescribed regular singular points, prescribed exponents at singular points, and having a quasi-polynomial flag of…
Let M be a fine structural mouse. Let D be a fully backgrounded L[E]-construction computed inside an iterable coarse premouse S. We describe a process comparing M with D, through forming iteration trees on M and on S. We then prove that…
We introduce a generalization of representations of quivers that contains also representations of posets, vectorspace problems and other matrix problems. Many examples, some of which are given in the paper, show that the language of marked…
Object recognition is a key function in both human and machine vision. While recent studies have achieved fMRI decoding of seen and imagined contents, the prediction is limited to training examples. We present a decoding approach for…
A set $X$ in the Euclidean space $\mathbb{R}^d$ is called an $m$-distance set if the set of Euclidean distances between two distinct points in $X$ has size $m$. An $m$-distance set $X$ in $\mathbb{R}^d$ is said to be maximal if there does…
SHAP is a popular method for measuring variable importance in machine learning models. In this paper, we study the algorithm used to estimate SHAP scores and outline its connection to the functional ANOVA decomposition. We use this…
The goal of this paper is to discover a set of discriminative patches which can serve as a fully unsupervised mid-level visual representation. The desired patches need to satisfy two requirements: 1) to be representative, they need to occur…
We give the distribution of $M_n$, the maximum of a sequence of $n$ observations from a moving average of order 1. Solutions are first given in terms of repeated integrals and then for the case where the underlying independent random…
The present phase of Machine Learning is characterized by supervised learning algorithms relying on large sets of labeled examples ($n \to \infty$). The next phase is likely to focus on algorithms capable of learning from very few labeled…
Recall that the Mouse Set Conjecture says that under AD++V=L(P(R)), a real is ordinal definable if and only if it belongs to an iterable mouse. The Mouse Set Conjecture for sets of reals says that under the same theory, a set of reals is…
We introduce higher level $q$-oscillator representations for the quantum affine (super)algebras of type $C_n^{(1)},C^{(2)}(n+1)$ and $B^{(1)}(0,n)$. These representations are constructed by applying the fusion procedure to the level one…
Let $f$ be a non-zero polynomial with complex coefficients and define $M_n(f)=\int_0^1f(x)^n\,dx$. We use ideas of Duistermaat and van der Kallen to prove $\limsup_{n\rightarrow\infty}|M_n(f)|^{1/n}>0$. In particular, $M_n(f)\ne 0$ for…
We use a method from descriptive set theory to investigate the two precomplete clones above the unary clone on a countable set.