Related papers: Sensitivity of Repetitiveness Measures to String R…
We report on a study of axion string networks using fixed-grid simulations of up to $16384$ points per side. The length of string can be characterised in terms of standard dimensionless parameters $\zeta_\text{w}$ and $\zeta_\text{r}$, the…
We demonstrate that all tree-level string theory amplitudes can be computed using the BCFW recursion relations. Our proof utilizes the pomeron vertex operator introduced by Brower, Polchinski, Strassler, and Tan. Surprisingly, we find that…
Verification of properties expressed as-regular languages such as LTL can benefit hugely from stutter-insensitivity, using a diverse set of reduction strategies. However properties that are not stutter-insensitive, for instance due to the…
Compressed suffix arrays (CSAs) index large repetitive collections and are key in many text applications. The r-index and its derivatives combine the run-length Burrows-Wheeler Transform (BWT) with suffix array sampling to achieve space…
Indexing highly repetitive texts - such as genomic databases, software repositories and versioned text collections - has become an important problem since the turn of the millennium. A relevant compressibility measure for repetitive texts…
Repetitiveness measures reveal profound characteristics of datasets, and give rise to compressed data structures and algorithms working in compressed space. Alas, the computation of some of these measures is NP-hard, and straight-forward…
Repetitiveness measures quantify how much repetitive structure a string contains and serve as parameters for compressed representations and indexing data structures. We study the measure $\chi$, defined as the size of the smallest…
We consider the (2, 0) supersymmetric theory of tensor multiplets and self-dual strings in six space-time dimensions. Space-time diffeomorphisms that leave the string world-sheet invariant appear as gauge transformations on the normal…
We analyze quantum corrections to rigid spinning strings in AdS(5)xS(5). The one-loop worldsheet quantum correction to the string energy is compared to the finite-size correction from the quantum string Bethe ansatz. Expanding the summands…
Recent studies on compression of pretrained language models (e.g., BERT) usually use preserved accuracy as the metric for evaluation. In this paper, we propose two new metrics, label loyalty and probability loyalty that measure how closely…
Regularization of neural machine translation is still a significant problem, especially in low-resource settings. To mollify this problem, we propose regressing word embeddings (ReWE) as a new regularization technique in a system that is…
Methods addressing spurious correlations such as Just Train Twice (JTT, arXiv:2107.09044v2) involve reweighting a subset of the training set to maximize the worst-group accuracy. However, the reweighted set of examples may potentially…
Recently, weak value $\rm A_w$ derived in the pre- and post-selected weak measurement has been shown to be powerful in measuring minute physical effects. In principle, the decrease in the post-selection probability will increase the…
We study the problem of indexing and compressing tries using a BWT-based approach. Specifically, we consider a succinct and compressed representation of the XBWT of Ferragina et al.\ [FOCS '05, JACM '09] corresponding to the analogous of…
For $p \in (0,1)$, sample a binary sequence from the infinite product measure of Bernoulli$(p)$ distributions. It is known that for $p=1/2$, almost every binary sequence is Poisson generic in the sense of Peres and Weiss, a property that…
Relative Lempel-Ziv (RLZ) parsing is a dictionary compression method in which a string $S$ is compressed relative to a second string $R$ (called the reference) by parsing $S$ into a sequence of substrings that occur in $R$. RLZ is…
We study the evolution of the gauge coupling constants in string unification schemes in which the light spectrum below the compactification scale is exactly that of the minimal supersymmetric standard model. In the absence of string…
The pp-wave/BMN limit of the AdS/CFT correspondence has exposed the Maldacena conjecture to a new regimen of direct tests. In one line of pursuit, finite-radius curvature corrections to the Penrose limit (which appear in inverse powers of…
We use Monte Carlo simulations to study pure 2D Euclidean quantum gravity with $R^2$-interaction on spherical topologies, employing Regge's formulation. We attempt to measure the string susceptibility exponent $\gamma_{\rm str}$ by using a…
Neural Machine Translation (NMT) models are sensitive to small perturbations in the input. Robustness to such perturbations is typically measured using translation quality metrics such as BLEU on the noisy input. This paper proposes…