arXiv research

The study finds solutions to a curvature minimisation problem in fixed-length curves.

Recurrent auto-encoder model summarises sequential data through an encoder structure into a fixed-length vector and then reconstructs the original sequence through the decoder structure. The summarised vector can be used to represent time series features. In this paper, we propose relaxing the dimensionality of the dec…

RATQ is a new quantizer for optimizing noisy gradients in machine learning.

We prove the analyticity of smooth critical points for O'Hara's knot energies $\mathcal{E}^{α,p}$, with $p=1$ and $2<α< 3$, subject to a fixed length constraint. This implies, together with the main result in \cite{BR13}, that bounded energy critical points of $\mathcal{E}^{α,1}$ subject to a fixed length constraint ar…

Transformers have a potential of learning longer-term dependency, but are limited by a fixed-length context in the setting of language modeling. We propose a novel neural architecture Transformer-XL that enables learning dependency beyond a fixed length without disrupting temporal coherence. It consists of a segment-le…

Click-through rate prediction is an essential task in industrial applications, such as online advertising. Recently deep learning based models have been proposed, which follow a similar Embedding\&MLP paradigm. In these methods large scale sparse input features are first mapped into low dimensional embedding vectors, a…

We consider the expected value for the total curvature of a random closed polygon. Numerical experiments have suggested that as the number of edges becomes large, the difference between the expected total curvature of a random closed polygon and a random open polygon with the same number of turning angles approaches a …

This work lists and describes the main recent strategies for building fixed-length, dense and distributed representations for words, based on the distributional hypothesis. These representations are now commonly called word embeddings and, in addition to encoding surprisingly good syntactic and semantic information, ha…

Rational kernels offer a way to handle sequence data efficiently.

Examines challenges and proposes new approaches in machine learning theory.

Physical knots and links are one-dimensional submanifolds of R^3 with fixed length and thickness. We show that isotopy classes in this category can differ from those of classical knot and link theory. In particular we exhibit a Gordian Split Link, a two component link that is split in the classical theory but cannot be…

Many objects in the real world are difficult to describe by a single numerical vector of a fixed length, whereas describing them by a set of vectors is more natural. Therefore, Multiple instance learning (MIL) techniques have been constantly gaining on importance throughout last years. MIL formalism represents each obj…

Neural machine translation is a recently proposed approach to machine translation. Unlike the traditional statistical machine translation, the neural machine translation aims at building a single neural network that can be jointly tuned to maximize the translation performance. The models proposed recently for neural ma…

Adaptive TFTs improve cryptocurrency price prediction accuracy.

Characterizes curves for minimal surfaces in de Sitter space.

Study on dynamic curves with elastic energy and spontaneous curvature.

Moduli spaces of hyperbolic surfaces with geodesic boundary components of fixed lengths may be endowed with a symplectic structure via the Weil-Petersson form. We show that, as the boundary lengths are sent to infinity, the Weil-Petersson form converges to a piecewise linear form first defined by Kontsevich. The proof …

Motivated by the study of billiards in polygons, we prove fine results for the distribution of gaps of directions of saddle connections on translation surfaces. As an application we prove that for almost every holomorphic differential $ω$ on a Riemann surface of genus $g \geq 2$ the smallest gap between saddle connecti…

Optimizes curves on Riemannian manifolds to minimize curvature.

If $(M,g)$ is a compact Riemannian surface then the integrals of $L^2(M)$-normalized eigenfunctions $e_j$ over geodesic segments of fixed length are uniformly bounded. Also, if $(M,g)$ has negative curvature and $γ(t)$ is a geodesic parameterized by arc length, the measures $e_j(γ(t))\, dt$ on $\R$ tend to zero in the …

GraphKKE learns fixed-length feature vectors from time-evolving graphs of human microbiome data.

This paper classifies all planar p-elasticae and their properties.

Study curves evolving by gradient flow of elastic energy, proving existence, smoothing, and convergence.

End-to-end model extracts nested terms without extra features.

Complex embeddings handle non-metric proximity data better than traditional methods.

Relatively extremal knots are the relative minima of the ropelength functional in C^1 topology. On the set curves of fixed length, they are the relative maxima of thickness (normal injectivity radius) functional, including the ideal knots. We prove that a C^{1,1} relatively extremal knot in R^n has thickness equal to h…

In this article we study the regularity of stationary points of the knot energies $E^α$ introduced by O'Hara in the range $α\in (2,3)$. In a first step we prove that $E^α$ is $C^1$ on the set of all regular embedded closed curves belonging to $H^{(α+1)/2,2}$ and calculate its derivative. After that we use the structure…

We investigate the time series of the degree of minimum spanning trees obtained by using a correlation based clustering procedure which is starting from (i) asset return and (ii) volatility time series. The minimum spanning tree is obtained at different times by computing correlation among time series over a time windo…

SummerTime summarizes variable-length time series for machine learning applications.

NBF combines deep learning with classical filtering for better belief tracking.

The intersection of a complex plane curve with a small three-sphere surrounding one of its singularities is a non-trivial link. The refined punctual Hilbert schemes of the singularity parameterize subschemes supported at the singular point of fixed length and whose defining ideals have a fixed number of generators. We …

Word2vec (Mikolov et al., 2013) has proven to be successful in natural language processing by capturing the semantic relationships between different words. Built on top of single-word embeddings, paragraph vectors (Le and Mikolov, 2014) find fixed-length representations for pieces of text with arbitrary lengths, such a…

In this paper, we propose a novel neural network model called RNN Encoder-Decoder that consists of two recurrent neural networks (RNN). One RNN encodes a sequence of symbols into a fixed-length vector representation, and the other decodes the representation into another sequence of symbols. The encoder and decoder of t…

Constrained sequence codes have been widely used in modern communication and data storage systems. Sequences encoded with constrained sequence codes satisfy constraints imposed by the physical channel, hence enabling efficient and reliable transmission of coded symbols. Traditional encoding and decoding of constrained …

Predicting diagnoses from Electronic Health Records (EHRs) is an important medical application of multi-label learning. We propose a convolutional residual model for multi-label classification from doctor notes in EHR data. A given patient may have multiple diagnoses, and therefore multi-label learning is required. We …

We show that a smooth unknotted curve in R^3 satisfies an isoperimetric inequality that bounds the area of an embedded disk spanning the curve in terms of two parameters: the length L of the curve and the thickness r (maximal radius of an embedded tubular neighborhood) of the curve. For fixed length, the expression giv…

Neural machine translation is a relatively new approach to statistical machine translation based purely on neural networks. The neural machine translation models often consist of an encoder and a decoder. The encoder extracts a fixed-length representation from a variable-length input sentence, and the decoder generates…

Bicycle paths form geodesics in 3D subspaces, related to Kirchhoff rods.

We study the use of a time series encoder to learn representations that are useful on data set types with which it has not been trained on. The encoder is formed of a convolutional neural network whose temporal output is summarized by a convolutional attention mechanism. This way, we obtain a compact, fixed-length repr…

Introduces BWMD, a new distance measure for DNA and malware clustering.

Fixed angles of convex polygons lead to combinatorially rich polytopes.

The stochastic block model (SBM) is a flexible probabilistic tool that can be used to model interactions between clusters of nodes in a network. However, it does not account for interactions of time varying intensity between clusters. The extension of the SBM developed in this paper addresses this shortcoming through a…

Improved meta-learning for dynamics using additional structured knowledge.

Cardiovascular Disease (CVD) is considered as one of the principal causes of death in the world. Over recent years, this field of study has attracted researchers' attention to investigate heart sounds' patterns for disease diagnostics. In this study, an approach is proposed for normal/abnormal heart sound classificatio…

The Teichmüller space $\mathcal{T}_S(\mathbf{b})$ of hyperbolic metrics on a surface $S$ with fixed lengths at the boundary components is symplectic. We prove that any sum of infinitesimal earthquakes on $S$ that is tangent to $\mathcal{T}_S(\mathbf{b})$ is Hamiltonian, by providing a Hamiltonian $\mathbb{L}$. Such fun…

We determine the equilibria of a rigid loop in the plane, subject to the constraints of fixed length and fixed enclosed area. Rigidity is characterized by an energy functional quadratic in the curvature of the loop. We find that the area constraint gives rise to equilibria with remarkable geometrical properties: not on…

Paper uses topological data analysis for time series classification.

In this work, we formulate the fixed-length distribution matching as a Bayesian inference problem. Our proposed solution is inspired from the compressed sensing paradigm and the sparse superposition (SS) codes. First, we introduce sparsity in the binary source via position modulation (PM). We then present a simple and …