Related papers: Briefly on Bottom-up

Diese kurze Einfuehrung in Theorie und Berechnung linearer Rekurrenzen versucht, eine Luecke in der Literatur zu fuellen. Zu diesem Zweck sind viele ausfuehrliche Beispiele angegeben. This short introduction to theory and usage of linear…

The main purpose of this note is to pose a couple of problems which are easily formulated thought some seem to be not yet solved. These problems are of general interest for discrete mathematics including a new twig of a bough of theory of…

These are notes for a graduate-level introductory course on singularity categories.

We study a logic-based approach to versioning of ontologies. Under this view, ontologies provide answers to queries about some vocabulary of interest. The difference between two versions of an ontology is given by the set of queries that…

The aim of this short note is to provide a proof to a statement of Sierpi\'nski concerning the number of possible sums of a series (of type $\lambda<\aleph_1$) of arbitrary ordinal numbers.

Several types of term rewriting systems can be distinguished by the way their rules overlap. In particular, we define the classes of prefix, suffix, bottom-up and top-down systems, which generalize similar classes on words. Our aim is to…

Notes for the upcoming Workshop on Symplectic Field Theory IX, Polyfolds for SFT. These notes are essentially the first few chapters of a forthcoming book entitled "Polyfold Constructions: Tools, Techniques, and Functors"

This technical note provides a first-order formalisation of the logit shift and fact-margin change induced by Low-Rank Adaptation (LoRA). Using a first-order Fr\'echet approximation around the base model trajectory, we show that the…

We consider the problem of learning low-rank tensors from partial observations with structural constraints, and propose a novel factorization of such tensors, which leads to a simpler optimization problem. The resulting problem is an…

This note covers two parts. The first one provides an errata to the paper "Numerical and analytical modeling of busbar systems". We mainly give the correction for three equations affected by a typographical mistake. Despite the corrections…

A remarkable achievement in algorithmic randomness and algorithmic information theory was the discovery of the notions of K-trivial, K-low and Martin-Lof-random-low sets: three different definitions turns out to be equivalent for very…

Tables have gained significant attention in large language models (LLMs) and multimodal large language models (MLLMs) due to their complex and flexible structure. Unlike linear text inputs, tables are two-dimensional, encompassing formats…

Learning to construct text representations in end-to-end systems can be difficult, as natural languages are highly compositional and task-specific annotated datasets are often limited in size. Methods for directly supervising language…

Using linear projections one gets new inequalities for the successive minima of the lattice of sections of an hermitian line bundle on an arithmetic surface.

A way to add an extra dimension is briefly discussed.

This paper describes a probabilistic top-down parser for minimalist grammars. Top-down parsers have the great advantage of having a certain predictive power during the parsing, which takes place in a left-to-right reading of the sentence.…

The purpose of this paper is to give an explicit and elementary construction for the Lie algebras of type $G_2(K)$ of dimension 14, over the field K of characteristic 2. We say an elementary construction on the account that we use not more…

Spatio-temporal forecasting is essential for understanding future dynamics within real-world systems by leveraging historical data from multiple locations. Existing methods often prioritize the development of intricate neural networks to…

These informal notes are concerned with spaces of functions in various situations, including continuous functions on topological spaces, holomorphic functions of one or more complex variables, and so on.

While syntactic dependency annotations concentrate on the surface or functional structure of a sentence, semantic dependency annotations aim to capture between-word relationships that are more closely related to the meaning of a sentence,…