We formulate the manifold learning problem as the problem of finding an
...
Valued constraint satisfaction problems with ordered variables (VCSPO) a...
The classical Mercer's theorem claims that a continuous positive definit...
We develop new upper and lower bounds on the ε-entropy of a unit
ball in...
We present a new way of study of Mercer kernels, by corresponding to a
s...
The tractability of certain CSPs for dense or sparse instances is known ...
We show that the skip-gram embedding of any word can be decomposed into ...
Classical dimension reduction problem can be loosely formulated as a pro...
This paper takes a step towards theoretical analysis of the relationship...
We review neural network architectures which were motivated by Fourier s...
A theory of sufficient dimension reduction (SDR) is developed from an
op...
We propose several ways of reusing subword embeddings and other weights ...
Words in some natural languages can have a composite structure. Elements...
The Constraint Satisfaction Problem (CSP) is a problem of computing a
ho...
Syllabification does not seem to improve word-level RNN language modelin...