Related papers: A New Method to Compute the 2-adic Complexity of B…
This paper classifies the complexity of various teaching models by their position in the arithmetical hierarchy. In particular, we determine the arithmetical complexity of the index sets of the following classes: (1) the class of uniformly…
The $S$-adic conjecture claims that there exists a condition $C$ such that a sequence has a sub-linear complexity if and only if it is an $S$-adic sequence satisfying Condition $C$ for some finite set $S$ of morphisms. We present an…
In this article, the optimal sample complexity of learning the underlying interactions or dependencies of a Linear Dynamical System (LDS) over a Directed Acyclic Graph (DAG) is studied. We call such a DAG underlying an LDS as dynamical DAG…
$p$-adic linear regression is the problem of finding coefficients $\beta$ that minimise $\sum_i |y_i - x_i^\top\beta|_p$. We prove that computing an optimal solution is NP-hard via a polynomial-time reduction from Max Cut using a…
Parallelization is a popular strategy for improving the performance of iterative algorithms. Optimization methods are no exception: design of efficient parallel optimization methods and tight analysis of their theoretical properties are…
A few years ago new quantitative measures of pseudorandomness of binary sequences have been introduced. Since that these measures have been studied in many papers and many constructions have been given along these lines. In this paper the…
A system of nested dichotomies is a method of decomposing a multi-class problem into a collection of binary problems. Such a system recursively applies binary splits to divide the set of classes into two subsets, and trains a binary…
We present a dynamic prediction framework for binary sequences that is based on a Bernoulli generalization of the auto-regressive process. Our approach lends itself easily to variants of the standard link prediction problem for a sequence…
We present adaptive sequential SAA (sample average approximation) algorithms to solve large-scale two-stage stochastic linear programs. The iterative algorithm framework we propose is organized into \emph{outer} and \emph{inner} iterations…
Lie symmetries of systems of second-order linear ordinary differential equations with constant coefficients are exhaustively described over both the complex and real fields. The exact lower and upper bounds for the dimensions of the maximal…
This paper introduces two new algorithms for Lie algebras over finite fields and applies them to the investigate the known simple Lie algebras of dimension at most $20$ over the field $\mathbb{F}_2$ with two elements. The first algorithm is…
In this paper we extend previous results on convergent perturbative solutions of the Schroedinger equation of a class of periodically time-dependent two-level systems. The situation treated here is particularly suited for the investigation…
The duality and other symmetry properties of the effective conductivity sigma_e of the classical two-dimensional isotropic randomly inhomogeneous heterophase systems at arbitrary number of phases N are discussed. A new approach for a…
In hypergraph theory, determining a characterization of the degree sequence $d=(d_1,d_2,\ldots,d_n)$ where $d_1\ge d_2\ge\ldots,d_n$ are positive integers, of an $h$-uniform simple hypergraph $\cal H$, and deciding the complexity status of…
We revisit parallel-innermost term rewriting as a model of parallel computation on inductive data structures and provide a corresponding notion of runtime complexity parametric in the size of the start term. We propose automatic techniques…
Empirical observation of high dimensional phenomena, such as the double descent behaviour, has attracted a lot of interest in understanding classical techniques such as kernel methods, and their implications to explain generalization…
We investigate the joint distribution of the vertex degrees in three models of random bipartite graphs. Namely, we can choose each edge with a specified probability, choose a specified number of edges, or specify the vertex degrees in one…
In the deep-learning community new algorithms are published at an incredible pace. Therefore, solving an image classification problem for new datasets becomes a challenging task, as it requires to re-evaluate published algorithms and their…
In this work we present a system for the automatic classification of the light curves of eclipsing binaries. This system is based on a classification scheme that aims to separate eclipsing binary sistems according to their geometrical…
Let $s$ be a finite sequence over a field of length $n$. It is well-known that if $s$ satisfies a linear recurrence of order $d$ with non-zero constant term, then the reverse of $s$ also satisfies a recurrence of order $d$ (with…