Recurrent neural network (RNN) language models (LMs) and Long Short Term Memory (LSTM) LMs, a variant of RNN LMs, have been shown to outperform traditional N-gram LMs on speech recognition tasks. However, these models are computationally more expensive than N-gram LMs for decoding, and thus, challenging to integrate in…
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Trend · papers per month
Paper presents an efficient approach for integrating LSTM language models in LVCSR systems.
FMP improves personalized ASR models on private devices.
Boosts causal discovery by dynamically reweighting samples to learn better DAGs.
Out-of-vocabulary word translation is a major problem for the translation of low-resource languages that suffer from a lack of parallel training data. This paper evaluates the contributions of target-language context models towards the translation of OOV words, specifically in those cases where OOV translations are der…
Global constraints and reranking have not been used in cognates detection research to date. We propose methods for using global constraints by performing rescoring of the score matrices produced by state of the art cognates detection systems. Using global constraints to perform rescoring is complementary to state of th…
Recent work on end-to-end automatic speech recognition (ASR) has shown that the connectionist temporal classification (CTC) loss can be used to convert acoustics to phone or character sequences. Such systems are used with a dictionary and separately-trained Language Model (LM) to produce word sequences. However, they a…
MLMs score better than autoregressive models without finetuning.
We present Listen, Attend and Spell (LAS), a neural network that learns to transcribe speech utterances to characters. Unlike traditional DNN-HMM models, this model learns all the components of a speech recognizer jointly. Our system has two components: a listener and a speller. The listener is a pyramidal recurrent ne…
New property identifies arithmetic lattices from nonuniform lattices.
Research finds bounds for knots in hexagonal lattice and classifies 11-stick knots.
This work compares lattice-free and lattice-based training criteria for LVCSR.
We outline the theory of sets with distributive operations: multishelves and multispindles, with examples provided by semi-lattices, lattices and skew lattices. For every such a structure we define multi-term distributive homology and show some of its properties. The main result is a complete formula for the homology o…
Course on arithmetic lattices at EPFL.
We give a simple example showing that a knot or link diagram that lies in the lattice is not necessarily the projection of a lattice stick knot or link in the lattice, and we give a necessary and sufficient condition for when a knot or link diagram that lies in the lat…
New rigidity theorem for product of lattices.
We explore hybrid subgroups of certain non-arithmetic lattices in . We show that all of Mostow's lattices are virtually hybrids; moreover, we show that some of these non-arithmetic lattices are hybrids of two non-commensurable arithmetic lattices in .
This paper studies the covolumes of nonuniform arithmetic lattices in PU(n, 1). We determine the smallest covolume nonuniform arithmetic lattices for each n, the number of minimal covolume lattices for each n, and study the growth of the minimal covolume as n varies. In particular, there is a unique lattice (up to conj…
The paper finds incommensurable lattices in complex models of Baumslag-Solitar groups.
Proves a lattice version of the Atiyah-Singer index theorem.
Vertex distortion measures how far lattice knots deviate from straight lines.
Regular integer lattices are characterized by k unit vectors that build up their generator matrices. These have rank k for D-lattices, and are rank-deficient for A-lattices, for E_6 and E_7. We count lattice points inside hypercubes centered at the origin for all three types, as if classified by maximum infinity norm i…
In this paper we use techniques from convex projective geometry to produce many new examples of thin subgroups of lattices in special linear groups that are isomorphic to the fundamental groups of finite volume hyperbolic manifolds. More specifically, we show that for a large class of arithmetic lattices in SO(n,1) it …
We show that the set of even positive definite lattices that arise from smooth, simply-connected 4-manifolds bounded by a fixed homology 3-sphere can depend on more than the ranks of the lattices. We provide two homology 3-spheres with distinct sets of such lattices, each containing a distinct nonempty subset of the ra…
The paper proves residual finiteness of certain lattices and constructs surfaces with specific fundamental groups.
A celebrated theorem of Hadwiger states that the Euler-Poincaré characteristic is the the unique invariant and continuous valuation on the distributive lattice of compact polyhedra in R^n that assigns value one to each convex non-empty such polyhedron. This paper provides an analogue of Hadwiger's result for finitely p…
The cubic lattice stick index of a knot type is the least number of sticks necessary to construct the knot type in the 3-dimensional cubic lattice. We present the cubic lattice stick index of various knots and links, including all (p,p+1)-torus knots, and show how composing and taking satellites can be used to obtain t…
New method finds lattice polygons that can be dissected into triangles with integer areas.
L-CNNs approximate gauge actions, revealing fixed points with no lattice artifacts.
The paper refines transformations of lattice diagrams and introduces dotted diagrams.
Classifies knots by lattice size, finding unknot ratios and crossing numbers.
Let be a simply connected, solvable Lie group and a lattice in . The deformation space is the orbit space associated to the action of $\Aut(G)$ on the space of all lattice embeddings of into . Our main result generalises the classical rigidity theorems of Mal'tsev…
Proves effective slope gaps for lattice surfaces.
We study the arithmeticity of the Couwenberg-Heckman-Looijenga lattices in PU(n,1), and show that they contain a non-arithmetic lattice in PU(3,1) which is not commensurable to the non-arithmetic Deligne-Mostow lattice in PU(3,1).
Study answers arithmeticity question for normal subgroup of lattices.
Improved lattice field theory simulations with local-Autoregressive Conditional Normalizing Flow.
One type of switch simplifies operations on lattice knots.
New lattices in higher dimensions have dense surface subgroups.
Study investigates lattices fibring over the circle, focusing on BNSR invariants.
Defines and analyzes the holonomy Lie algebra of geometric lattices.
A new surgery formula for knot lattice homology.
The lattice stick number of knots is defined to be the minimal number of straight sticks in the cubic lattice required to construct a lattice stick presentation of the knot. We similarly define the lattice stick number of spatial graphs with vertices of degree at most six (necessary for embedding into th…
We construct an infinite commutative lattice of groups whose dual spaces give Kauffman finite-type invariants of long virtual knots. The lattice is based "horizontally" upon the Polyak algebra and extended "vertically" using Manturov's functorial map . For each , the -th vertical line in the lattice contains a…
The (isothermic) compressibility of lattice knots can be examined as a model of the effects of topology and geometry on the compressibility of ring polymers. In this paper, the compressibility of minimal length lattice knots in the simple cubic, face centered cubic and body centered cubic lattices are determined. Our r…
Researchers reinterpret complex hyperbolic orbifolds using line arrangements.
The study examines knot probabilities in confined lattice polygons.
New research shows certain arithmetic lattices can't be LERF.
New lattice path method for statistical inference of persistent diagrams.