Related papers: A Note on the Polynomial Ergodicity of the One-Dim…

Mastery learning improves learning proficiency and efficiency. However, the overpractice of skills--students spending time on skills they have already mastered--remains a fundamental challenge for tutoring systems. Previous research has…

We provide an exposition of the proofs of Bourgain's polynomial ergodic theorems. The focus is on the motivation and intuition behind his arguments.

We study a broad class of polynomial optimization problems whose constraints and objective functions exhibit sparsity patterns. We give two characterizations of the number of critical points to these problems, one as a mixed volume and one…

We study the roots of a random polynomial over the field of $p$-adic numbers. For a random monic polynomial with i.i.d. coefficients in $\mathbb{Z}_p$, we obtain an estimate for the expected number of roots of this polynomial. In…

In this paper, we study the pointwise convergence of centain continuous-time polynomial ergodic averages. Our approach is based on the topological models of measurable flows. One of the main results of this paper is as follows: Let $a\in…

A neural network based technique is presented, which is able to successfully extract polynomial classification rules from labeled electroencephalogram (EEG) signals. To represent the classification rules in an analytical form, we use the…

Given a convergence theorem in analysis, under very general conditions a model-theoretic compactness argument implies that there is a uniform bound on the rate of metastability. We illustrate with three examples from ergodic theory.

We study a scalable alternative to robust gradient descent (RGD) techniques that can be used when the gradients can be heavy-tailed, though this will be unknown to the learner. The core technique is simple: instead of trying to robustly…

We propose a polynomial force-motion model for planar sliding. The set of generalized friction loads is the 1-sublevel set of a polynomial whose gradient directions correspond to generalized velocities. Additionally, the polynomial is…

The double-direction orthogonalization algorithm is applied to construct sequences of polynomials, which are orthogonal over the interval [0,1]with the weighting function 1. Functional and recurrent relations are derived for the sequences…

We investigate the Bilinear Hilbert Transform in the plane and the pointwise convergence of bilinear averages in Ergodic theory, arising from $\Z^2$ actions. Our techniques combine novel one and a half dimensional phase-space analysis with…

Let $w$ be a weight on the unit disk $\mathbb{D}$ having the form \[w(z)=|v(z)|^2\prod_{k=1}^s\left|\frac{z-a_k}{1-z\overline{a}_k}\right|^{m_k}\,,\quad m_k>-2,\ |a_k|<1,\] where $v$ is analytic and free of zeros in $\overline{\mathbb{D}}$,…

In pattern classification, polynomial classifiers are well-studied methods as they are capable of generating complex decision surfaces. Unfortunately, the use of multivariate polynomials is limited to kernels as in support vector machines,…

Rate of convergence is studied for a diffusion process on the half line with a non-sticky reflection to a heavy-tailed 1D invariant distribution which density on the half line has a polynomial decay at infinity. Starting from a standard…

The main objects of the paper are $z$-oriented triangulations of connected closed $2$-dimensional surfaces. A $z$-orientation of a map is a minimal collection of zigzags which double covers the set of edges. We have two possibilities for an…

Rank one transformations serve as a source of examples in ergodic theory, showing variety of algebraic, asymptotic and spectral properties of dynamical systems. The properties of a rank one transformation are closely related to the weak…

This work develops asymptotic properties of a class of switching jump diffusion processes. The processes under consideration may be viewed as a number of jump diffusion processes modulated by a random switching mechanism. The underlying…

In this paper we study ergodic $\mathbb{Z}^r$-actions and investigate expansion properties along cyclic subgroups. We show that under some spectral conditions there are always directions which expand significantly a given measurable set…

I propose an orthogonalization procedure preserving the grading of the initial graded set of linearly independent vectors. In particular, this procedure is applicable for orthonormalization of any countable set of polynomials in several…

The optimisation of neural networks can be sped up by orthogonalising the gradients before the optimisation step, ensuring the diversification of the learned representations. We orthogonalise the gradients of the layer's components/filters…