Related papers: A consistent formalism for the Thomas-Ehrman Level…
As Large Language Models (LLMs) become increasingly integrated into real-world applications, ensuring their outputs align with human values and safety standards has become critical. The field has developed diverse alignment approaches…
This paper has the goals (1) of unifying top-down parsing with shift-reduce parsing to yield a single simple and consistent framework, and (2) of producing provably correct parsing methods, deterministic as well as tabular ones, for…
We study Lagrangian Perturbation Theory (LPT) and its regularization in the Effective Field Theory (EFT) approach. We evaluate the LPT displacement with the same phases as a corresponding $N$-body simulation, which allows us to compare…
In a recent paper \cite{ft} a new powerful method to calculate Feynman diagrams was proposed. It consists in setting up a Taylor series expansion in the external momenta squared. The Taylor coefficients are obtained from the original…
We introduce a diagrammatic quantum field formalism for the evaluation of normalized expectation values of operators, and suitable for systems with localized electrons. It is used to develop a convergent series expansion for the energy in…
We address problems underlying the algorithmic question of automating the co-design of robot hardware in tandem with its apposite software. Specifically, we consider the impact that degradations of a robot's sensor and actuation suites may…
The Earth Mover's Distance (EMD) is a state-of-the art metric for comparing discrete probability distributions, but its high distinguishability comes at a high cost in computational complexity. Even though linear-complexity approximation…
This paper describes neural-fortran, a parallel Fortran framework for neural networks and deep learning. It features a simple interface to construct feed-forward neural networks of arbitrary structure and size, several activation functions,…
We extend a newly developed formal system for the description of astrophysical maps. In this formalism, we consider the difference between maps to be the distance between elements of a pseudometric space (the space of all such maps). This…
Formalisation is the process of writing system requirements in a formal language. These requirements mostly originate in Natural Language. In the field of Formal Methods, formalisation is often identified as one of the most delicate and…
Strong driving of quantum systems opens opportunities for both controlling and characterizing their states. For theoretical studying of these systems properties we use the rate-equation formalism. The advantage of such approach is its…
Graded Lagrangian formalism in terms of a Grassmann-graded variational bicomplex on graded manifolds is developed in a very general setting. This formalism provides the comprehensive description of reducible degenerate Lagrangian systems,…
This thesis aims to study nonlocal Lagrangians with a finite and an infinite number of degrees of freedom. We obtain an extension of Noether's theorem and Noether's identities for such Lagrangians. We then set up a Hamiltonian formalism for…
This work is devoted to giving a geometric framework for describing higher-order non-autonomous mechanical systems. The starting point is to extend the Lagrangian-Hamiltonian unified formalism of Skinner and Rusk for these kinds of systems,…
The alternative version of Hamiltonian formalism for higher-derivative theories is proposed. As compared with the standard Ostrogradski approach it has the following advantages: (i) the Lagrangian, when expressed in terms of new variables…
Recent years have seen remarkable advances in the field of Simultaneous Machine Translation (SiMT) due to the introduction of innovative policies that dictate whether to READ or WRITE at each step of the translation process. However, a…
This paper presents $\forall$uto$\exists$val, a new approach for scaling LLM assessment in translating formal syntax -- such as first-order logic, regular expressions, etc -- to natural language (interpretation) or vice versa (compilation),…
Tool-assisted refactoring transformations must be trustworthy if programmers are to be confident in applying them on arbitrarily extensive and complex code in order to improve style or efficiency. We propose a simple, high-level but…
We introduce a systematic mathematical language for describing fixed point models and apply it to the study to topological phases of matter. The framework is reminiscent of state-sum models and lattice topological quantum field theories,…
We develop the general formalism for the study of neutrino propagation in presence of stochastic media. This formalism allows the systematic derivation of evolution equations for averaged quantities as survival probabilities and higher…