Research
On-device research index

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.

169,051 papers · 148 categories

Trend · papers per month

2.9%5.8%8.6%11.5% · May 201919922001200920182026
48 results for character input

Representation mixing combines character and phoneme inputs for flexible TTS synthesis.

problem Limited control over pronunciation in character or phoneme-based TTS systems.
method Representation mixing combines multiple linguistic inputs in a single encoder.
result Flexibility in choosing between character, phoneme, or mixed representations during inference.

We describe a simple neural language model that relies only on character-level inputs. Predictions are still made at the word-level. Our model employs a convolutional neural network (CNN) and a highway network over characters, whose output is given to a long short-term memory (LSTM) recurrent neural network language mo…

2015-08-26abs ↗pdf ↗

Most modern neural machine translation (NMT) systems rely on presegmented inputs. Segmentation granularity importantly determines the input and output sequence lengths, hence the modeling depth, and source and target vocabularies, which in turn determine model size, computational costs of softmax normalization, and han…

2018-10-02abs ↗pdf ↗

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…

2015-08-05abs ↗pdf ↗

Unsupervised model learns word and context embeddings from character sequences.

problem Learning meaningful word and context embeddings from unlabeled data.
method Character-aware neural architecture that jointly learns word and context embeddings.
result Compact encoders achieve high performance in downstream tasks.

Generative Neuro-Symbolic model learns from raw data with rich conceptual representations.

problem Learning rich, general-purpose conceptual representations from raw perceptual inputs.
method Generative Neuro-Symbolic (GNS) model combining symbolic and neural network approaches.
result Model learns from raw data and generalizes to 4 unique tasks.

End-to-end character-level model for text generation without delexicalization.

problem Generating text without delexicalization and tokenization.
method Character-level sequence-to-sequence model with attention mechanism, copy mechanism, and transfer learning.
result Competitive performance in text generation metrics.

Improves text-to-speech speed by interleaving character reading and audio synthesis.

problem Latency in text-to-speech models limits their use in time-sensitive tasks.
method Reinforcement learning to train an agent to choose the order of character reading and audio synthesis.
result The proposed method successfully balances latency and audio quality.

We introduce multiplicative LSTM (mLSTM), a recurrent neural network architecture for sequence modelling that combines the long short-term memory (LSTM) and multiplicative recurrent neural network architectures. mLSTM is characterised by its ability to have different recurrent transition functions for each possible inp…

2016-09-26abs ↗pdf ↗

Predicting the click-through rate of an advertisement is a critical component of online advertising platforms. In sponsored search, the click-through rate estimates the probability that a displayed advertisement is clicked by a user after she submits a query to the search engine. Commercial search engines typically rel…

2017-07-07abs ↗pdf ↗

Character scheme of small Seifert 3-manifolds is reduced if and only if no exceptional abelian character exists.

problem Character scheme of small Seifert 3-manifolds and its reduction condition.
method Complete description of the SL2(C)-character scheme of small Seifert 3-manifolds.
result Character scheme is reduced if and only if no exceptional abelian character exists, and exceptional abelian character has multiplicity 2.

We present the Latent Sequence Decompositions (LSD) framework. LSD decomposes sequences with variable lengthed output units as a function of both the input sequence and the output sequence. We present a training algorithm which samples valid extensions and an approximate decoding algorithm. We experiment with the Wall …

2016-10-10abs ↗pdf ↗

In this paper, we give a quantum interpretation of the Bismut-Chern character form (the loop space lifting of the Chern character form) as well as the Chern character form associated to a complex vector bundle with connection over a smooth manifold in the framework of supersymmetric quantum field theories developed by …

2007-11-24abs ↗pdf ↗

Study shows how certain knots and tori are detected by ideal points in character varieties.

problem Detecting essential twice-punctured tori in character varieties.
method Extending Tillmann's limiting character method to new families of knots and tori.
result Explicit determination of limiting characters at ideal points for specific knots and tori.

Background elimination for noisy character images or character images from real scene is still a challenging problem, due to the bewildering backgrounds, uneven illumination, low resolution and different distortions. We propose a stroke-based character reconstruction(SCR) method that use a weighted quadratic Bezier cur…

2018-06-23abs ↗pdf ↗

SmoothLLM defends LLMs from jailbreaking attacks by randomly perturbing inputs.

problem Adversaries can fool large language models into generating objectionable content.
method SmoothLLM randomly perturbs multiple copies of a prompt and aggregates predictions to detect adversarial inputs.
result SmoothLLM sets the state-of-the-art for robustness against various jailbreak attacks.

FinMem enhances LLM trading agents with layered memory and character design.

problem Developing purpose-driven LLM agents for financial decision-making.
method Integrates layered memory and character design modules into an LLM framework.
result Significantly enhanced trading performance in financial markets.

Computes dimensions of representation and character varieties for 2 and 3-dimensional orbifolds.

problem Computing dimensions of representation and character varieties for orbifolds.
method Analyzes varieties of representations and characters of hyperbolic and non-hyperbolic orbifolds, provides tools for computation.
result Shows that the dimension of a specific component of characters equals half the dimension of the variety of characters of the boundary.

Paper generates personalized fonts from a few characters.

problem Creating personalized fonts from a limited set of characters.
method Designs a network framework to extract and recombine character content and style using various neural networks.
result Generated characters are structurally similar to real characters.

We study some basic properties of the variety of characters in PSL(2,C) of a finitely generated group. In particular we give an interpretation of its points as characters of representations. We construct 3-manifolds whose variety of characters has arbitrarily many components that do not lift to SL(2,C). We also study t…

2003-02-07abs ↗pdf ↗

Study of quantum decorated character stacks and their quantizations.

problem Quantization of decorated character stacks and their compatibility with cutting and gluing.
method Using stratified factorization homology, extend Fock and Goncharov's construction to include stacky points.
result Construction of categorical charts and flips on quantum decorated character stacks.

Study character varieties of hyperbolic 3-manifolds using bundle methods.

problem Character varieties of hyperbolic 3-manifolds in once-punctured torus bundles.
method Restrict characters to the fibre and analyze branched covering maps.
result Infinite family of hyperbolic once-punctured bundles with unbounded genus.

Researchers describe character varieties for Hopf links, proving geometric properties.

problem Character variety geometry of Hopf links with nn twists.
method Geometric descriptions of irreducible and totally reducible representations.
result Complete geometric description of SU(2)\mathrm{SU}(2)-character variety for r=2r=2.

Study of SU(2,1) character varieties on one-holed torus.

problem Characterize representations of mapping class group on SU(2,1) character variety.
method Explicit description of SU(2,1) character variety, use of Farey graph adaptation, and mapping class group action analysis.
result Description of an open domain of discontinuity for mapping class group action.

Study SL2(F)\mathrm{SL}_2(\mathbb{F})-character varieties of knots over fields of odd characteristic.

problem Character varieties of knots over fields of odd characteristic exhibit ramification phenomena.
method Investigate sufficient conditions for ramification using double branched covers and Alexander polynomials.
result Character varieties of knots over fields of odd characteristic can present ramification phenomena.

Detecting essential surfaces in 3-manifolds and orbifolds using character varieties.

problem Detecting essential surfaces in 3-manifolds and orbifolds.
method Extending Culler and Shalen's construction to 3-orbifolds using SL2(C)\mathrm{SL}_2(\mathbb{C}) character variety.
result Any slope detected on a canonical component of the (P)SL2(C)\mathrm{(P)SL}_2(\mathbb{C}) character variety of a one-cusped hyperbolic 3-manifold with symmetries must be the slope of a symmetric surface.

We introduce certain relative differential characters which we call Cheeger-Chern-Simons characters. These combine the well-known Cheeger-Simons characters with Chern-Simons forms. In the same way as the Cheeger-Simons characters generalize Chern-Simons invariants of oriented closed manifolds, the Cheeger-Chern-Simons …

2014-04-02abs ↗pdf ↗