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

12.5%25.0%37.5%50.0% · Sep 199319922001200920172026
48 results for text domain

Proposes STN for HDA by aligning domain-shared classifier and subspace.

problem Learning in target domain using knowledge from heterogeneous source domain.
method End-to-end learning of domain-shared classifier and domain-invariant subspace; soft-label strategy for unlabeled data; adaptive coefficient for soft-labels.
result Significantly outperforms state-of-the-art approaches in various transfer tasks.

Paper proposes a deep learning method to measure domain similarity in Persian texts.

problem Measuring the similarity between different domains of Persian text descriptions.
method Built a dataset of paired texts, used word embeddings and deep neural networks to score similarity, trained on GPU.
result Best model achieved an F1 score of 0.9865.

Gradient-based framework for optimizing text prompts in diffusion models.

problem Efficiently optimizing prompts in text-to-image diffusion models with large domain space and non-differentiable embeddings.
method Formulated as discrete optimization over language space, designed compact subspaces, and introduced shortcut text gradient.
result Empirically discovered prompts that enhance or destroy image faithfulness.

New method improves text classification without labeled target data.

problem Improving text classification under domain shift without labeled target data.
method Diversity-based generalization using multi-head attention with diversity constraints.
result Method matches state-of-the-art performance without labeled target data.

Many text classification tasks are known to be highly domain-dependent. Unfortunately, the availability of training data can vary drastically across domains. Worse still, for some domains there may not be any annotated data at all. In this work, we propose a multinomial adversarial network (MAN) to tackle the text clas…

2018-02-15abs ↗pdf ↗

Improves text classification on new domains using distance-based measures and dynamic domain selection.

problem Improving text classification performance on new domains with limited labeled data.
method Develops DistanceNet and DistanceNet-Bandit models using distance measures to adapt to new domains.
result DistanceNet and DistanceNet-Bandit models outperform baseline methods in unsupervised domain adaptation.

Study introduces KorFinMTEB for Korean financial texts, revealing model limitations.

problem Limited evaluation benchmarks for low-resource domains, especially Korean.
method Developed KorFinMTEB, a tailored benchmark for Korean financial texts.
result Models perform better on translated benchmarks than on domain-specific ones.

New domains found in hyperbolic space solve a specific elliptic problem.

problem Solving an overdetermined elliptic problem in nontrivial exterior domains of hyperbolic space.
method Constructing nontrivial domains and solving the elliptic equation.
result Positive bounded solutions found in $C^{2,α}\left(Ω ight) \cap H^1\left(Ω ight)$.

Paper introduces a specialized text classification system for French Open Banking transactions.

problem Classifying specialized banking text data with high accuracy and efficiency.
method Data collection, labeling, preprocessing, modeling, and evaluation stages with language-specific techniques.
result Enhanced performance and efficiency compared to generic approaches.

Paper proves super log-concavity of first eigenfunction for certain hyperbolic domains.

problem Proving super log-concavity of first eigenfunction for horo-convex domains in hyperbolic space.
method Analyzes properties of Laplacian eigenfunctions in hyperbolic geometry.
result Optimal proof of super log-concavity for horo-convex domains with constraints.

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.

The study connects contact forms and Ruelle invariant in convex domains.

problem Understanding the relationship between contact forms and Ruelle invariant in convex domains.
method Using the extrinsic curvature and Ruelle invariant, the authors prove bounds and construct counterexamples.
result First examples of dynamically convex contact 3-spheres not strictly contactomorphic to convex boundaries.

Proposes MR-SNE for multimodal data visualization.

problem Visualizing data from multiple domains with relations across them.
method Extends t-SNE to compute augmented relations and jointly embed them in a low-dimensional space.
result Demonstrates promising performance in visualizing Flickr and Animal with Attributes 2 datasets.

Convolutional neural network improves assertion detection in multi-label clinical text.

problem Detecting assertions in multi-label clinical text with rich descriptions.
method Developed a CNN architecture for multi-label scope detection.
result At least 12% improvement over state-of-the-art on multi-label clinical text.

Prototype learns automotive industry ontology from unstructured data.

problem Automatic learning of domain-specific ontologies from unstructured text data.
method Two-stage classification system: first classifier for concepts and irrelevant collocates, second classifier for concept types.
result Prototype validated with automotive industry complaint and repair data.

In this paper we analyze the capacitary potential due to a charged body in order to deduce sharp analytic and geometric inequalities, whose equality cases are saturated by domains with spherical symmetry. In particular, for a regular bounded domain ΩRnΩ\subset \mathbb{R}^n, n3n\geq 3, we prove that if the mean curvature…

2017-05-28abs ↗pdf ↗

FINCH dataset enables financial Text-to-SQL tasks, improving model evaluation.

problem Lack of a large-scale financial dataset for Text-to-SQL tasks.
method Curated financial dataset (FINCH), benchmarking reasoning and language models.
result Proposed FINCH Score for more accurate financial model evaluation.

Classifies CAD model descriptions and names from product websites.

problem Distinguishing product descriptions from other text and identifying product names.
method Paragraph vectors, character-level LSTM, word embeddings LSTM tagger.
result Promising results for distinguishing product descriptions and names.

The increasing volume of short texts generated on social media sites, such as Twitter or Facebook, creates a great demand for effective and efficient topic modeling approaches. While latent Dirichlet allocation (LDA) can be applied, it is not optimal due to its weakness in handling short texts with fast-changing topics…

2013-01-24abs ↗pdf ↗

When training a deep neural network for image classification, one can broadly distinguish between two types of latent features of images that will drive the classification. We can divide latent features into (i) "core" or "conditionally invariant" features XcoreX^\text{core} whose distribution XcoreYX^\text{core}\vert Y, cond…

2017-10-31abs ↗pdf ↗

Social media is increasingly used by humans to express their feelings and opinions in the form of short text messages. Detecting sentiments in the text has a wide range of applications including identifying anxiety or depression of individuals and measuring well-being or mood of a community. Sentiments can be expressed…

2018-07-20abs ↗pdf ↗

LangDA improves domain adaptation for semantic segmentation by learning context-aware scene descriptions.

problem Improving domain adaptation for semantic segmentation with dense prediction tasks.
method LangDA learns contextual relationships between objects via VLM-generated scene descriptions and aligns image features with text representation.
result LangDA sets new state-of-the-art across three DASS benchmarks, outperforming existing methods.

Scarcity of labeled data is one of the most frequent problems faced in machine learning. This is particularly true in relation extraction in text mining, where large corpora of texts exists in many application domains, while labeling of text data requires an expert to invest much time to read the documents. Overall, st…

2018-07-12abs ↗pdf ↗

InvestLM is a financial domain LLM tuned on LLaMA-65B for investment advice.

problem Improving financial text understanding and advice generation for investment.
method Curated financial instruction dataset, LLaMA-65B, less-is-more-for-alignment approach.
result InvestLM provides comparable responses to state-of-the-art commercial models.

WideDTA predicts drug-target binding affinity using text-based information.

problem Predicting drug-target binding affinity is a major challenge in drug discovery.
method WideDTA uses chemical and biological textual sequence information, including protein sequence, ligand SMILES, protein domains and motifs, and maximum common substructure words.
result WideDTA outperformed DeepDTA on the KIBA dataset, indicating the word-based sequence representation is a promising alternative.

The study shows algebraic Bergman kernels imply finite type boundaries in complex domains.

problem Understanding the relationship between algebraic Bergman kernels and the finite type of boundaries in complex domains.
method Analyzing algebraic Bergman kernels and their implications on the finite type of boundaries in smoothly bounded pseudoconvex domains in C2\mathbb{C}^2.
result The boundary of a smoothly bounded pseudoconvex domain with an algebraic Bergman kernel of degree dd is of finite type with type r2dr \leq 2d.

Deep neural networks are data hungry models and thus face difficulties when attempting to train on small text datasets. Transfer learning is a potential solution but their effectiveness in the text domain is not as explored as in areas such as image analysis. In this paper, we study the problem of transfer learning for…

2018-10-15abs ↗pdf ↗

MuLan links music audio to natural language tags.

problem Traditional music tagging systems use rigid attributes; MuLan aims to link audio directly to natural language.
method Joint audio-text embedding model trained on 44 million music recordings and text annotations.
result MuLan's embeddings enable zero-shot functionalities and transfer learning.

Paper presents a method to train NER models without labelled data using weak supervision.

problem Dealing with NER performance drop in new domains without labelled data.
method Weak supervision through automatic annotation and hidden Markov model integration.
result Improvement of about 7 percentage points in entity-level F1F_1 scores.

Study shows adversarial attacks can fool speech-to-text models, and PCA is ineffective as a defense.

problem Adversarial attacks can mislead speech-to-text neural networks.
method Crafted adversarial waveforms, used PCA for defense, tested under black-box setting.
result PCA is ineffective as a defense mechanism against adversarial attacks in audio domain.