SearcharxivSearch

arXiv subjects

Christoph Meyer

Publications and source records attributed to Christoph Meyer.

5 recordsLinked to original sources

General Cross-Architecture Distillation of Pretrained Language Models into Matrix Embeddings

Large pretrained language models (PreLMs) are revolutionizing natural language processing across all benchmarks. However, their sheer size is prohibitive for small laboratories or for deployment on mobile devices. Approaches like pruning and distillation reduce the model size but typically retain the same model architecture. In contrast, we explore distilling PreLMs into a different, more efficient architecture, Continual Multiplication of Words (CMOW), which embeds each word as a matrix and uses matrix multiplication to encode sequences. We extend the CMOW architecture and its CMOW/CBOW-Hybrid variant with a bidirectional component for more expressive power, per-token representations for a general (task-agnostic) distillation during pretraining, and a two-sequence encoding scheme that facilitates downstream tasks on sentence pairs, such as sentence similarity and natural language inference. Our matrix-based bidirectional CMOW/CBOW-Hybrid model is competitive to DistilBERT on question similarity and recognizing textual entailment, but uses only half of the number of parameters and is three times faster in terms of inference speed. We match or exceed the scores of ELMo for all tasks of the GLUE benchmark except for the sentiment analysis task SST-2 and the linguistic acceptability task CoLA. However, compared to previous cross-architecture distillation approaches, we demonstrate a doubling of the scores on detecting linguistic acceptability. This shows that matrix-based embeddings can be used to distill large PreLM into competitive models and motivates further research in this direction.

cs.CL

Traversing Steep and Granular Martian Analog Slopes With a Dynamic Quadrupedal Robot

Celestial bodies such as the Moon and Mars are mainly covered by loose, granular soil, a notoriously challenging terrain to traverse with (wheeled) robotic systems. Here, we present experimental work on traversing steep, granular slopes with the dynamically walking quadrupedal robot SpaceBok. To adapt to the challenging environment, we developed passive-adaptive planar feet and optimized grouser pads to reduce sinkage and increase traction on planar and inclined granular soil. Single-foot experiments revealed that a large surface area of 110cm2 per foot reduces sinkage to an acceptable level even on highly collapsible soil (ES-1). Implementing several 12mm grouser blades increases traction by 22% to 66% on granular media compared to grouser-less designs. Together with a terrain-adapting walking controller, we validate - for the first time - static and dynamic locomotion on Mars analog slopes of up to 25°(the maximum of the testbed). We evaluated the performance between point- and planar feet and static and dynamic gaits regarding stability (safety), velocity, and energy consumption. We show that dynamic gaits are energetically more efficient than static gaits but are riskier on steep slopes. Our tests also revealed that planar feet's energy consumption drastically increases when the slope inclination approaches the soil's angle of internal friction due to shearing. Point feet are less affected by slippage due to their excessive sinkage, but in turn, are prone to instabilities and tripping. We present and discuss safe and energy-efficient global path-planning strategies for accessing steep topography on Mars based on our findings.

cs.RO

Algorithmic transformation of multi-loop Feynman integrals to a canonical basis

The evaluation of multi-loop Feynman integrals is one of the main challenges in the computation of precise theoretical predictions for the cross sections measured at the LHC. In recent years, the method of differential equations has proven to be a powerful tool for the computation of Feynman integrals. It has been observed that the differential equation of Feynman integrals can in many instances be transformed into a so-called canonical form, which significantly simplifies its integration in terms of iterated integrals. The main result of this thesis is an algorithm to compute rational transformations of differential equations of Feynman integrals into a canonical form. Apart from requiring the existence of such a rational transformation, the algorithm needs no further assumptions about the differential equation. In particular, it is applicable to problems depending on multiple kinematic variables and also allows for a rational dependence on the dimensional regulator. First, the transformation law is expanded in the dimensional regulator to derive differential equations for the coefficients of the transformation. Using an ansatz in terms of rational functions, these differential equations are then solved to determine the transformation. This thesis also presents an implementation of the algorithm in the Mathematica package CANONICA, which is the first publicly available program to compute transformations to a canonical form for differential equations depending on multiple variables. The main functionality and its usage are illustrated with some simple examples. Furthermore, the package is applied to state-of-the-art integral topologies appearing in recent multi-loop calculations. These topologies depend on up to three variables and include previously unknown topologies contributing to higher-order corrections to the cross section of single top-quark production at the LHC.

hep-ph

Algorithmic transformation of multi-loop master integrals to a canonical basis with CANONICA

The integration of differential equations of Feynman integrals can be greatly facilitated by using a canonical basis. This paper presents the Mathematica package CANONICA, which implements a recently developed algorithm to automatize the transformation to a canonical basis. This represents the first publicly available implementation suitable for differential equations depending on multiple scales. In addition to the presentation of the package, this paper extends the description of some aspects of the algorithm, including a proof of the uniqueness of canonical forms up to constant transformations.

hep-ph

Transforming differential equations of multi-loop Feynman integrals into canonical form

The method of differential equations has been proven to be a powerful tool for the computation of multi-loop Feynman integrals appearing in quantum field theory. It has been observed that in many instances a canonical basis can be chosen, which drastically simplifies the solution of the differential equation. In this paper, an algorithm is presented that computes the transformation to a canonical basis, starting from some basis that is, for instance, obtained by the usual integration-by-parts reduction techniques. The algorithm requires the existence of a rational transformation to a canonical basis, but is otherwise completely agnostic about the differential equation. In particular, it is applicable to problems involving multiple scales and allows for a rational dependence on the dimensional regulator. It is demonstrated that the algorithm is suitable for current multi-loop calculations by presenting its successful application to a number of non-trivial examples.

hep-ph