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.
Character-level model performs well on various languages.
problem Language modeling with minimal parameters.
method CNN and highway network over characters, followed by LSTM RNN-LM.
result Character-level model outperforms word-level/morpheme-level models with fewer parameters.
Dynamic segmentation algorithm improves NMT performance by favoring character-level processing.
problem Suboptimal static segmentation choices in NMT systems.
method Adaptive Computation Time algorithm for dynamic segmentation, trainable end-to-end.
result The model prefers character-level processing when given the freedom to navigate different segmentation levels.
Scene text magnifier enhances readability for visually impaired.
problem Helps visually impaired read natural scene text.
method Four CNN-based networks: character erasing, extraction, magnify, synthesis.
result Effective text magnification without background alteration.
A minimal RNN model learns to generate new characters from a single example.
problem Learning efficiency and compositional ability in AI.
method Minimal RNN model with one-shot inference mechanism.
result The model can recombine previously learned substructures to generate new characters.
LAS neural network transcribes speech to characters without independence assumptions.
problem Transcribe speech to characters without making independence assumptions.
method Jointly learns listener and speller components; listener is a pyramidal recurrent network encoder; speller is an attention-based recurrent network decoder.
result Achieves 10.3% WER on Google voice search task subset, outperforming state-of-the-art CLDNN-HMM model.
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.
Paper proposes BCNMCC for system identification with noisy input.
problem System identification with noisy input and impulsive output noise.
method Introduces BCV to NMCC algorithm to compensate for input noise bias.
result BCNMCC outperforms other algorithms in noisy input conditions.
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.
Sum-product networks enhance sequence modeling with higher-order factors.
problem Modeling complex relations in sequence data with first-order models.
method Combining sum-product networks with higher-order linear-chain conditional random fields.
result Improved performance in sequence labeling tasks compared to state-of-the-art methods.
The theory of differential characters is developed completely from a de Rham - Federer viewpoint. Characters are defined as equivalence classes of special currents, called sparks, which appear naturally in the theory of singular connections. There are many different spaces of currents which yield the character groups. …
A stroke-based method reconstructs characters from noisy images.
problem Challenges in reconstructing characters from noisy images.
method Uses a weighted quadratic Bezier curve (WQBC) to represent strokes.
result Achieves excellent reconstruction in real scenes.
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.
New twisted versions of wild character varieties created.
problem Constructing twisted wild character varieties.
method Creating new versions of wild character varieties.
result Twisted versions of wild character varieties constructed.
ABC learns context-aware representations for clustering.
problem Learning latent representations that adapt to context in machine learning.
method Attention-based neural architecture that learns a similarity kernel.
result Competitive results for clustering Omniglot characters.
Quantum character varieties unify four construction methods.
problem No specific problem stated; unification of approaches.
method Four different approaches to construction.
result Unified understanding of quantum character varieties.
We show that for any knot there exist only finitely many irreducible metabelian characters in the SL(2,C)-character variety of the knot group, and the number is given explicitly by using the determinant of the knot. Then it turns out that for any 2-bridge knot a section of the SL(2,C)-character va…
Study of orbifold Chern character using superconnections.
problem Chern character for orbifold settings.
method Use of flat antiholomorphic superconnections and Riemann-Roch-Grothendieck theorem.
result Uniqueness of orbifold Chern character proven.
Character varieties get a natural Poisson structure.
problem Character varieties of surfaces.
method Natural Poisson structure.
result Character varieties have a Poisson structure.
Study on deformations of trivial character in SL_2(C) for groups.
problem Deforming the trivial character in SL_2(C) for groups.
method Analyzing maps satisfying the parallelogram identity on groups and relating them to deformations of the trivial character.
result The trivial character is a smooth point if and only if H_1(G,C) has dimension less than 2.
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 …
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.
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.
Study SL(2,C) character schemes for finitely generated groups.
problem Characterize SL(2,C) representations of finitely generated groups.
method Define coordinate rings and equations for SL(2,C) character schemes.
result Explicit equations for character schemes of finitely presented groups.
Character variety of Borromean link solved, Alexander polynomial formula found.
problem Character variety of Borromean link
method Determined irreducible SL(2,C) character variety, found Alexander polynomial formula
result Formula for twisted Alexander polynomial on character variety
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.
Deep neural nets predict click-through rates for sponsored search ads.
problem Predicting click-through rates for sponsored search ads.
method Two novel deep convolutional neural network approaches at character and word levels.
result Deep models significantly outperform baseline models and improve click-through rate prediction accuracy.
Detects essential surfaces in knots using character variety intersections.
problem Identifying essential surfaces in knot theory.
method Analyzing intersections in the character variety of hyperbolic knots.
result Intersection points in the character variety detect Seifert surfaces.
RTN generates realistic character transitions from context.
problem Manual transition animation creation is tedious and time-consuming.
method Recurrent Neural Network (RNN) with LSTM architecture trained on past context.
result RTN produces realistic transitions that rival motion capture.
Character varieties of 2-bridge knots and links explained using Farey recursion.
problem Understanding character varieties of 2-bridge knots and links.
method Using Farey recursion to define polynomials for character varieties.
result Character varieties described in terms of polynomials defined by Farey recursion.
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.
Study character varieties for real forms of SL_n(C).
problem Characterize representations of groups in real forms of SL_n(C).
method Define and analyze G-character varieties, study involutions, and examples.
result Irreducible representations fixed by involutions are conjugate to real forms.
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.
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…
Let K be a knot in an integral homology 3-sphere and let B denote the 2-fold branched cover of the integral homology sphere branched along K. We construct a map from the slice of characters with trace free along meridians in the SL(2, C)-character variety of the knot exterior to the SL(2, C)-character variety of 2-fold…
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.
Study the relationship between knot complements and their branched covers using abelian cord rings and SL(2,C) characters.
problem Understanding the relationship between knot complements and their branched covers.
method Utilizing Ng's abelian cord ring and SL(2,C) characters of the two-fold branched cover, focusing on augmentations and their ranks.
result Established a correspondence between trace-free SL(2,C) characters of a knot complement and augmentations, providing effective tools for finding representations.
mLSTM improves sequence modeling with better autoregressive density estimation.
problem Improving autoregressive density estimation in sequence modeling.
method Introduces mLSTM, a recurrent neural network combining LSTM and multiplicative recurrent networks.
result mLSTM outperforms standard LSTM and its variants in character-level language modeling tasks.
Finite automorphisms of SL(2,C) character varieties identified.
problem Character varieties of surfaces with negative Euler characteristic.
method Algebraic automorphisms and mapping class groups studied.
result Finite extension of mapping class group identified.
Researchers describe character varieties for Hopf links, proving geometric properties.
problem Character variety geometry of Hopf links with n twists. method Geometric descriptions of irreducible and totally reducible representations.
result Complete geometric description of SU(2)-character variety for r=2. New geometry connects super loops to Chern character.
problem Understanding super parallel transport on quotient stacks.
method Super holonomy on loop stacks to construct Chern character.
result Global equivariant Chern character from super holonomy.
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.
RNN model predicts handwritten characters from accelerometer and gyroscope data.
problem Online handwritten character recognition using sensor data.
method RNN-based neural network trained on gyroscope and accelerometer data.
result High accuracy on test data, achieving character prediction.
We calculate the universal character ring of a class of two-generator, one-relator groups. As an application we give a less technical proof of a result in [LT] on the universal character ring of the (-2,3,2n+1)-pretzel knot. We also give an elementary proof of a result in [Ma] on the character variety of the (-2,3,2n+1…
Character variety of Whitehead link described in detail.
problem Character variety of Whitehead link.
method Nice description of a Zariski open subset.
result Zariski open subset of the character variety described.