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.

168,695 papers · 148 categories

Trend · papers per month

97194290387 · Jun 202019922001200920172026
48 results for Text Representation

A new text representation model combines CNN and VAE for better semantic extraction.

problem Difficult to effectively extract semantic features and distinguish polysemy in text data.
method Integrates CNN for feature extraction and VAE for consistent Gaussian distribution.
result The model outperforms traditional classification algorithms in text classification tasks.

A method for disentangling text representations without supervision.

problem Challenges in learning disentangled representations of natural language.
method Information-theoretic guidance to induce independent style and content embeddings.
result High quality disentangled representations in terms of content and style preservation.

New text-to-image diffusion models improve scene understanding for AI agents.

problem Fine-grained scene understanding for AI agents from text and images.
method Pre-trained text-to-image diffusion models optimized for generating images from text prompts.
result Policies learned with Stable Control Representations outperform state-of-the-art approaches on various control tasks.

Most of the information is stored as text, so text mining is regarded as having high commercial potential. Aiming at the semantic constraint problem of classification methods based on sparse representation, we propose a weighted recurrent neural network (W-RNN), which can fully extract text serialization semantic infor…

2019-09-28abs ↗pdf ↗

Let MφM_φ be a surface bundle over a circle with monodromy φ:SSφ:S \rightarrow S. We study deformations of certain reducible representations of π1(Mφ)π_1(M_φ) into SL(n,C)\text{SL}(n,\mathbb{C}), obtained by composing a reducible representation into SL(2,C)\text{SL}(2,\mathbb{C}) with the irreducible representation $\text{SL}(2,\mathb…

2015-09-24abs ↗pdf ↗

Strict plurisubharmonicity proven for Teichmüller energy on Hitchin representations.

problem Proving strict plurisubharmonicity of Teichmüller energy for Hitchin representations.
method Analyzing energy functional EE on Teichmüller space associated to Hitchin representations.
result Strict plurisubharmonicity of energy functional EE proven.

New text as data techniques offer a great promise: the ability to inductively discover measures that are useful for testing social science theories of interest from large collections of text. We introduce a conceptual framework for making causal inferences with discovered measures as a treatment or outcome. Our framewo…

2018-02-06abs ↗pdf ↗

LFD method improves text classification by making features clearer and less label-leaking.

problem Creating interpretable text representations that are both predictive and understandable.
method LFD method: proposes lexical and semantic features from contrastive text pairs, screens candidates using κκ, and selects features by residual gain.
result LFD features achieve higher human-human and human-LLM agreement than baseline concepts and are less label-leaking.

The paper studies mapping class group actions on character varieties of surfaces.

problem Understanding the dynamics of mapping class group actions on relative extPSL(2,R) ext{PSL}(2,\mathbb{R})-character varieties.
method Definition and proof of simple-stability and primitive-stability of representations.
result Holonomies of hyperbolic cone surfaces are simple-stable and primitive-stable.

Paper develops heavy-tailed embeddings for better text classification and augmentation.

problem Improving text classification, especially for extreme values.
method Develops heavy-tailed embeddings using multivariate extreme value theory and introduces a scale-invariant classifier.
result The classifier outperforms baselines and generates meaningful augmented text.

Recent progress in AutoML has lead to state-of-the-art methods (e.g., AutoSKLearn) that can be readily used by non-experts to approach any supervised learning problem. Whereas these methods are quite effective, they are still limited in the sense that they work for tabular (matrix formatted) data only. This paper descr…

2019-06-21abs ↗pdf ↗

Autoencoders have been successful in learning meaningful representations from image datasets. However, their performance on text datasets has not been widely studied. Traditional autoencoders tend to learn possibly trivial representations of text documents due to their confounding properties such as high-dimensionality…

2017-05-04abs ↗pdf ↗

CLIP learns joint image-text representations for zero-shot learning.

problem Understanding and improving zero-shot transfer performance in CLIP.
method Formal study of transferrable representation learning and analysis of zero-shot transfer performance.
result Proposes a new CLIP-type approach that outperforms existing methods.

In this continuation of \cite{BM}, we prove the following: Let ΓSL(2,C)Γ\subset \text{SL}(2,{\mathbb C}) be a cocompact lattice, and let ρ:ΓGL(r,C)ρ: Γ\rightarrow \text{GL}(r,{\mathbb C}) be an irreducible representation. Then the holomorphic vector bundle EρSL(2,C)/ΓE_ρ\longrightarrow \text{SL}(2,{\mathbb C})/Γ associated to ρρ is polystab…

2013-03-13abs ↗pdf ↗

The paper defines and calculates Reidemeister torsion for a specific class of representations.

problem Defining and calculating Reidemeister torsion for G-Anosov representations.
method Symplectic chain complex method to establish a novel formula for R-torsion.
result Reidemeister torsion is well-defined and calculated for G-Anosov representations.

Bi-directional LSTMs are a powerful tool for text representation. On the other hand, they have been shown to suffer various limitations due to their sequential nature. We investigate an alternative LSTM structure for encoding text, which consists of a parallel state for each word. Recurrent steps are used to perform lo…

2018-05-07abs ↗pdf ↗

Characterizes flag geometries for Hitchin representations in SL3(R).

problem Understanding flag geometries associated with Hitchin representations in SL3(R).
method Geometric characterization based on invariant foliations and refraction flows.
result Constructs refraction flows for positive roots in general sl_n(R), with highest root flows being C^1+α.

POTA improves short text clustering by generating reliable pseudo-labels.

problem Limited discriminative representations in short texts.
method POTA uses instance-level attention and optimal transport for semantic consistency and cluster structure.
result POTA outperforms state-of-the-art methods in short text clustering.

DPNR preserves privacy of text representations using differential privacy.

problem Privacy leakage in deep learning text representations.
method DPNR uses Differential Privacy to provide formal privacy guarantees and dropout masking for enhanced privacy.
result DPNR reduces privacy leakage without significantly sacrificing main task performance.

The paper formalizes how concepts are encoded in text-guided generative models and provides a method to manipulate them.

problem Encoding and manipulating concepts in text-guided generative models.
method Formalizing concepts as subspaces of a representation space, developing algebraic manipulation methods.
result The ability to manipulate concepts in generative models through algebraic operations on the representation.

The paper addresses causal estimation for text data with apparent overlap violations.

problem Estimating causal effects from text data with unknown confounders and apparent overlap.
method Uses supervised representation learning to create a representation that preserves confounding information while eliminating predictive information, satisfying overlap assumptions.
result Shows how to obtain robust causal estimation in the presence of apparent overlap violations.

It has been known since the time of Nielsen that the mapping class group Modg,1\text{Mod}_{g,1} of a surface of genus gg and one puncture acts faithfully by homeomorphisms on the circle. In this note, we show that this standard representation of the mapping class group is not rigid, precisely, if G<Modg,1G<\text{Mod}_{g,1} is a…

2016-03-07abs ↗pdf ↗

A novel method extracts topological features from word embeddings for text classification.

problem High dimensional and noisy text representations in natural language processing.
method Persistent homology for topological data analysis on word embeddings.
result Topological features outperform conventional text mining features on long textual documents.

This paper fine-tunes LLMs for stock return prediction using financial news.

problem Improving stock return forecasting accuracy using LLMs.
method Fine-tuning LLMs with text and forecasting modules, comparing encoder-only and decoder-only models, and integrating token-level representations.
result LLMs' aggregated token-level embeddings enhance return predictions for long-only and long-short portfolios.

Learning latent representations from long text sequences is an important first step in many natural language processing applications. Recurrent Neural Networks (RNNs) have become a cornerstone for this challenging task. However, the quality of sentences during RNN-based decoding (reconstruction) decreases with the leng…

2017-08-16abs ↗pdf ↗

Recent work in learning ontologies (hierarchical and partially-ordered structures) has leveraged the intrinsic geometry of spaces of learned representations to make predictions that automatically obey complex structural constraints. We explore two extensions of one such model, the order-embedding model for hierarchical…

2017-08-01abs ↗pdf ↗

A commonly used evaluation metric for text-to-image synthesis is the Inception score (IS) \cite{inceptionscore}, which has been shown to be a quality metric that correlates well with human judgment. However, IS does not reveal properties of the generated images indicating the ability of a text-to-image synthesis method…

2019-10-31abs ↗pdf ↗