Related papers: Briefly on Bottom-up
We propose a simple model of recognition, short-term memory, long-term memory and learning.
In this note, we precisely elaborate the connection between recognisable series (in the sense of Berstel and Reutenauer) and $q$-regular sequences (in the sense of Allouche and Shallit) via their linear representations. In particular, we…
The purpose of this note is make Theorem 13 in the article "On Biautomaticity of Non-Homogenous Small-Cancellation Groups" more accessible. Restatements of the theorem already appeared in few of the authors' succeeding works but with no…
Here we give a reformulation of a key lemma in the paper [2], "Spaces of Topological Complexity One", which is necessary due to an oversight.
The note complements topological aspects of the theory of chiral algebras.
This short note present a "proof" of $P\neq NP$. The "proof" with double quotation marks is to indicate that we do not know whether the proof is correct or not (We're confused because we do know in which we make the mistakes).
We describe calculations of b b-bar production to next-to-next-to-leading order (NNLO) and next-to-next-to-leading logarithm (NNLL) near threshold in pp interactions. Our calculations are in good agreement with the b b-bar total cross…
Lecture notes written for a one-semester course in mathematical relativity aimed at mathematics and physics students. Not meant as an introduction to general relativity, but rather as a complementary, more advanced text.
Annotating datasets is one of the main costs in nowadays supervised learning. The goal of weak supervision is to enable models to learn using only forms of labelling which are cheaper to collect, as partial labelling. This is a type of…
Low rank approximation of a matrix (hereafter LRA) is a highly important area of Numerical Linear and Multilinear Algebra and Data Mining and Analysis. One can operate with an LRA at sublinear cost -- by using much fewer memory cells and…
Latent tree learning models represent sentences by composing their words according to an induced parse tree, all based on a downstream task. These models often outperform baselines which use (externally provided) syntax trees to drive the…
The paper is devoted to the study of the lattice of subgroups of the Lamplighter type groups and to the relative gradient rank.
State-of-the-art approaches of NER have used sequence-labeling BiLSTM as a core module. This paper formally shows the limitation of BiLSTM in modeling cross-context patterns. Two types of simple cross-structures -- self-attention and…
The purpose of this short note, is to rewrite Morozov's formula for correlation functions over the unitary group, in a much simpler form, involving the computation of a single determinant.
This note is about variations on a theorem of Bers about short pants decompositions of surfaces. It contains a version for surfaces with boundary but also a slight improvement on the best known bound for closed surfaces.
We review our progress on the lattice calculation of low moments of both the unpolarised and polarised nucleon structure functions.
These lectures are a brief introduction to supersymmetry.
Long Short-Term Memory (LSTM) networks, a type of recurrent neural network with a more complex computational unit, have been successfully applied to a variety of sequence modeling tasks. In this paper we develop Tree Long Short-Term Memory…
These informal notes deal with some topics related to analysis on metric spaces.
Some top-down problem specifications, if executed directly, may compute sub-problems repeatedly. Instead, we may want a bottom-up algorithm that stores solutions of sub-problems in a table to be reused. It can be tricky, however, to figure…