Related papers: Exploring Repetitiveness Measures for Two-Dimensio…

We present the first application of a "multiple-tracer" redshift-space distortion (RSD) analysis to an observational galaxy sample, using data from the Galaxy and Mass Assembly survey (GAMA). Our dataset is an r < 19.8 magnitude-limited…

Data redundancy is ubiquitous in the inputs and intermediate results of Deep Neural Networks (DNN). It offers many significant opportunities for improving DNN performance and efficiency and has been explored in a large body of work. These…

We study approximation algorithms for the following three string measures that are widely used in practice: edit distance (ED), longest common subsequence (LCS), and longest increasing sequence (LIS). All three problems can be solved…

Detecting multiple structural breaks in high-dimensional data remains a challenge, particularly when changes occur in higher-order moments or within complex manifold structures. In this paper, we propose REAMP (Resonance-Enhanced Analysis…

We demonstrate that the spectrum of any consistent string theory in $D$ dimensions must satisfy a number of supertrace constraints: $ Str~M^{2n}=0 $ for $0 \leq n < D/2-1$, integer $n$. These results hold for a large class of string…

The vast majority of Dimensionality Reduction (DR) techniques rely on second-order statistics to define their optimization objective. Even though this provides adequate results in most cases, it comes with several shortcomings. The methods…

Highly-repetitive collections of strings are increasingly being amassed by genome sequencing and genetic variation experiments, as well as by storing all versions of human-generated files, like webpages and source code. Existing indexes for…

We review some examples of heterotic/type II string duality which shed light on the infrared dynamics of string compactifications with N=2 and N=1 supersymmetry in four dimensions.

High-dimensional statistical inference deals with models in which the the number of parameters p is comparable to or larger than the sample size n. Since it is usually impossible to obtain consistent procedures unless $p/n\rightarrow0$, a…

A $\lambda$-cover of a string $S$ is a set of strings $\{C_i\}_1^\lambda$ such that every index in $S$ is contained in an occurrence of at least one string $C_i$. The existence of a $1$-cover defines a well-known class of quasi-periodic…

Motivated also by recent revival of interest about metastable string states (as cosmic strings or in accelerator physics), we study the decay, in presence of dimensional compactification, of a particular superstring state, which was proven…

In this paper we show how string rewriting methods can be applied to give a new method of computing double cosets. Previous methods for double cosets were enumerative and thus restricted to finite examples. Our rewriting methods do not…

A robust and sparse estimator for multinomial regression is proposed for high dimensional data. Robustness of the estimator is achieved by trimming the observations, and sparsity of the estimator is obtained by the elastic net penalty,…

Data augmentation is an effective way to diversify corpora in machine translation, but previous methods may introduce semantic inconsistency between original and augmented data because of irreversible operations and random subword sampling…

We study duals to field theories in two dimensions with N=(4,4) SUSY. The string backgrounds reproduce certain non-perturbative aspects of the dual field theory with a large number of colors N_c and a tunable number of flavors N_f.…

Difficulties in replication and reproducibility of empirical evidences in machine learning research have become a prominent topic in recent years. Ensuring that machine learning research results are sound and reliable requires…

In this work we extend many classical results concerning the relationship between densities, tangents and rectifiability to the parabolic spaces, namely $\mathbb{R}^{n+1}$ equipped with parabolic dilations. In particular we prove a…

We construct superstring theories that obey the new supersymmetry algebra {Q_a , Q_b}=\gamma_{ab}^{mn} P_{1m} P_{2n}, in a Green-Schwarz formalism, with kappa supersymmetry also of the new type. The superstring is in a system with a…

Nonparametric mean function regression with repeated measurements serves as a cornerstone for many statistical branches, such as longitudinal/panel/functional data analysis. In this work, we investigate this problem using fully connected…

Let $S_{T}(k)$ denote the set of distinct substrings of length $k$ in a string $T$, then the $k$-th substring complexity is defined by its cardinality $|S_{T}(k)|$. Recently, $\delta = \max \{ |S_{T}(k)| / k : k \ge 1 \}$ is shown to be a…