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,657 papers · 148 categories

Trend · papers per month

25507499 · Oct 201919922001200920172026
48 results for text segmentation

ZegOT uses optimal transport to zero-shot segment images with text prompts.

problem Zero-shot semantic segmentation with limited image-text alignment knowledge.
method ZegOT uses optimal transport to match multiple text prompts with frozen image embeddings.
result ZegOT achieves state-of-the-art performance in zero-shot semantic segmentation.

Adaptive testing segments watermarked text from LLMs.

problem Distinguishing LLM-generated text from human-written content.
method Generalized likelihood-based detection method adapted to inverse transform sampling, removing prompt estimation sensitivity.
result Effective and robust method for segmenting watermarked text.

Embed-KCPD segments text without labels, outperforming baselines.

problem Unsupervised text segmentation is challenging due to lack of boundary labels.
method Embed-KCPD represents sentences as embeddings and estimates boundaries via penalized KCPD.
result Embed-KCPD outperforms strong unsupervised baselines across benchmarks.

Text segmentation plays an important role in various Natural Language Processing (NLP) tasks like summarization, context understanding, document indexing and document noise removal. Previous methods for this task require manual feature engineering, huge memory requirements and large execution times. To the best of our …

2018-08-29abs ↗pdf ↗

BiPE blends intra-segment and inter-segment encodings for better length extrapolation.

problem Improving length extrapolation in language models.
method Bilevel Positional Encoding (BiPE) that separates intra-segment and inter-segment encodings.
result BiPE enhances length extrapolation across various text modalities.

Audio features have been proven useful for increasing the performance of automated topic segmentation systems. This study explores the novel task of using audio embeddings for automated, topically coherent segmentation of radio shows. We created three different audio embedding generators using multi-class classificatio…

2020-02-12abs ↗pdf ↗

OTSeg uses multi-prompt Sinkhorn attention to improve zero-shot semantic segmentation.

problem Leveraging pre-trained CLIP knowledge to align text embeddings with pixel embeddings.
method OTSeg employs Multi-Prompts Sinkhorn (MPS) and Multi-Prompts Sinkhorn Attention (MPSA) to enhance semantic feature matching.
result OTSeg achieves state-of-the-art performance in zero-shot semantic segmentation tasks.

Segmental structure is a common pattern in many types of sequences such as phrases in human languages. In this paper, we present a probabilistic model for sequences via their segmentations. The probability of a segmented sequence is calculated as the product of the probabilities of all its segments, where each segment …

2017-02-24abs ↗pdf ↗

System detects relevant financial news and predictions from unstructured text.

problem Manual extraction of relevant financial information from news is cumbersome and error-prone.
method Topic modeling with LDA, co-reference resolution, multi-paragraph segmentation, and temporal analysis.
result ROUGE-L values for relevant text and predictions/forecasts were 0.662 and 0.982, respectively.

Improves TTS accuracy by correcting context-dependent units.

problem Improves text-to-speech accuracy through speaker adaptation.
method Statistical model predicting context-dependent phonetic unit classes and their mean error values.
result Corrected boundaries of units improve TTS accuracy compared to HMM segmentation.

This paper improves NLP interpretability by using sentence segments instead of words.

problem Limitations of word-based sampling in explaining complex BERT models.
method Using sentence segments as elementary building blocks for NLP interpretability.
result Improved fidelity of the explainer on a benchmark classification task.

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.

Two methods improve 10-K item segmentation using large language models.

problem Challenges in extracting specific items from 10-K reports due to variations in document formats and item presentation.
method Two advanced item segmentation methods: GPT4ItemSeg and BERT4ItemSeg.
result BERT4ItemSeg achieves a macro-F1 of 0.9825, surpassing other methods.

LLmFPCA-detect detects anomalies in sparse longitudinal text data using LLMs and mFPCA.

problem Challenges in detecting patterns and anomalies in sparse longitudinal textual data.
method Pairs LLM-based text embeddings with mFPCA to detect clusters and anomalies.
result LLmFPCA-detect outperforms state-of-the-art baselines on Amazon and Wikipedia datasets.

Recent years have seen remarkable progress of text generation in different contexts, such as the most common setting of generating text from scratch, and the emerging paradigm of retrieval-and-rewriting. Text infilling, which fills missing text portions of a sentence or paragraph, is also of numerous use in real life, …

2019-01-01abs ↗pdf ↗

A tailored HTR system improves CER to 0.015 for medieval Latin.

problem Digitizing handwritten medieval Latin records for a low-resource language.
method End-to-end pipeline using image segmentation and transformer-based models with extensive data augmentation.
result Best-performing setup achieved CER of 0.015, superior to commercial models.

A new framework for consistent segmentation evaluation reduces operating losses.

problem Inconsistent thresholding-based segmentation methods lead to suboptimal solutions.
method Developed a consistent ranking-based framework (RankDice/RankIoU) using Bayes rules and Dice-/IoU-calibration.
result The proposed framework is Dice-/IoU-calibrated and provides excess risk bounds and convergence rates.

Clinical notes are text documents that are created by clinicians for each patient encounter. They are typically accompanied by medical codes, which describe the diagnosis and treatment. Annotating these codes is labor intensive and error prone; furthermore, the connection between the codes and the text is not annotated…

2018-02-15abs ↗pdf ↗

The paper approaches the task of handwritten text recognition (HTR) with attentional encoder-decoder networks trained on sequences of characters, rather than words. We experiment on lines of text from popular handwriting datasets and compare different activation functions for the attention mechanism used for aligning i…

2017-12-11abs ↗pdf ↗

Detects changes in topic proportions over time in large text datasets.

problem Unsupervised detection of structural changes in topic distributions over time.
method Specialised temporal topic model with changepoint detection, approximate inference using sample splitting and likelihood ratio statistic.
result Automated detection of changepoints in topic proportions, facilitating interpretable results.

In this paper, we address the task of Optical Character Recognition(OCR) for the Telugu script. We present an end-to-end framework that segments the text image, classifies the characters and extracts lines using a language model. The segmentation is based on mathematical morphology. The classification module, which is …

2015-09-20abs ↗pdf ↗

Active learning aims to develop label-efficient algorithms by sampling the most representative queries to be labeled by an oracle. We describe a pool-based semi-supervised active learning algorithm that implicitly learns this sampling mechanism in an adversarial manner. Unlike conventional active learning algorithms, o…

2019-03-31abs ↗pdf ↗

Framework for ensuring fairness in machine learning models across multiple groups.

problem Ensuring fairness in machine learning models across multiple groups.
method Introduces (s,G,α)(\mathbf{s},\mathcal{G}, α)-GMC for multi-dimensional mappings and constraint sets, proposing algorithms to achieve multicalibration.
result Demonstrates the effectiveness of the framework on various scenarios, including image segmentation, hierarchical classification, and text generation.

In this paper, we proposed a deep learning-based end-to-end method on the domain specified automatic term extraction (ATE), it considers possible term spans within a fixed length in the sentence and predicts them whether they can be conceptual terms. In comparison with current ATE methods, the model supports nested ter…

2019-08-15abs ↗pdf ↗

Deep learning is still not a very common tool in speaker verification field. We study deep convolutional neural network performance in the text-prompted speaker verification task. The prompted passphrase is segmented into word states - i.e. digits -to test each digit utterance separately. We train a single high-level f…

2018-03-13abs ↗pdf ↗

Historical documents present many challenges for offline handwriting recognition systems, among them, the segmentation and labeling steps. Carefully annotated textlines are needed to train an HTR system. In some scenarios, transcripts are only available at the paragraph level with no text-line information. In this work…

2018-11-10abs ↗pdf ↗

A new method explains RNNs by decision lists over skipgrams, improving explanation fidelity and interpretability.

problem Lack of understanding how input segments combine to form patterns in neural network outputs.
method Proposes a pipeline to explain RNNs using decision lists over skipgrams, creating synthetic and real-world datasets for evaluation.
result Persistently achieves high explanation fidelity and interpretable rules.

We derive local C2C^{2} estimates for complete non-compact translating solitons of the Gauss curvature flow in R3\mathbb{R}^3 which are graphs over a convex domain ΩΩ. This is closely is related to deriving local C1,1C^{1,1} estimates for the degenerate Monge-Ampére equation. As a result, given a weakly convex bounded d…

2016-10-23abs ↗pdf ↗