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

Trend · papers per month

57115172229 · Jun 202019922001200920172026
48 results for synthetic texts

The paper proposes a new framework to generate synthetic data with human-like imperfections to prevent model collapse.

problem Model collapse due to statistical optimization of synthetic data.
method Introduces Prompt-driven Cognitive Computing Framework (PMCSF) with Cognitive State Decoder (CSD) and Cognitive Text Encoder (CTE).
result The framework generates text with cognitive imperfections, reducing maximum drawdown and delivering defensive alpha.

Estimates watermarked content proportions in mixed-source texts.

problem Optimally estimating the proportion of watermarked content in texts with mixed sources.
method Casting the problem as estimating a proportion parameter in a mixture model based on pivotal statistics.
result Proposes efficient estimators for watermark proportion and shows their accuracy through evaluations.

Bayesian Topic Regression models causal inference with text and numerical data.

problem Causal inference using observational text data with both text and numerical confounders.
method Combines supervised Bayesian topic model with Bayesian regression framework, respecting the Frisch-Waugh-Lovell theorem.
result Joint approach recovers ground truth with lower bias than benchmarks, superior prediction results compared to separate approaches.

The Generative Adversarial Network (GAN) has achieved great success in generating realistic (real-valued) synthetic data. However, convergence issues and difficulties dealing with discrete data hinder the applicability of GAN to text. We propose a framework for generating realistic text via adversarial training. We emp…

2017-06-12abs ↗pdf ↗

A variety of methods existing for generating synthetic electronic health records (EHRs), but they are not capable of generating unstructured text, like emergency department (ED) chief complaints, history of present illness or progress notes. Here, we use the encoder-decoder model, a deep learning algorithm that feature…

2018-06-01abs ↗pdf ↗

FRAPPE estimates tensor canonical rank without CPD computation.

problem Estimating the canonical rank of tensors efficiently.
method Generates synthetic data matching input tensor's size and sparsity, trains a regression model to estimate rank.
result 24 times faster than best baseline, 10% improvement in MAPE on synthetic dataset.

EASTER improves OCR efficiency and scalability.

problem Efficient and scalable Optical Character Recognition (OCR) for machine printed and handwritten text.
method 1-D convolutional layers without recurrence, parallel training, synthetic dataset generation.
result EASTER achieves comparable performance to complex RNN models with less data and outperforms them on benchmark datasets.

Dataset distillation is a method for reducing dataset sizes by learning a small number of synthetic samples containing all the information of a large dataset. This has several benefits like speeding up model training, reducing energy consumption, and reducing required storage space. Currently, each synthetic sample is …

2019-10-06abs ↗pdf ↗

Synthetic continued pretraining enhances model performance with synthetic data.

problem Data inefficiency in pretrained models when adapting to domain-specific documents.
method Synthetic data augmentation using EntiGraph to create a large synthetic corpus.
result Language models can answer questions and follow instructions without access to domain-specific documents.

SHMM models human mobility from GPS and text data, overcoming text sparsity.

problem Modeling human mobility from semantic trace data, especially addressing text sparsity.
method SHMM is a multi-modal spherical hidden Markov model that jointly models location, time, and text embeddings on a unit sphere using vMF distribution.
result SHMM outperforms state-of-the-art models in next location prediction and has lower training cost.

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.

Modeling lead-lag relationship between two text corpora for improved topic modeling.

problem Recognizing the relationship between multiple text corpora for better topic modeling.
method Proposed a jointly dynamic topic model and embedding extension for large-scale text corpus.
result The proposed model can well recognize the lead-lag relationship between two text corpora and improve topic learning.

Paper tackles treatment leakage in text-based causal inference, proposing methods to mitigate bias.

problem Treatment leakage in text-as-confounder applications introduces bias in causal estimates.
method Formal definitions, four text distillation methods (passage removal, classification, salient feature removal, nullspace projection).
result Moderate distillation optimally balances bias reduction against confounder retention.

Does adding a theorem to a paper affect its chance of acceptance? Does labeling a post with the author's gender affect the post popularity? This paper develops a method to estimate such causal effects from observational text data, adjusting for confounding features of the text such as the subject or writing quality. We…

2019-05-29abs ↗pdf ↗

Proposes a new method to adapt to covariate shifts in supervised learning.

problem Covariate shift in training and testing samples with different marginal distributions.
method Minimax risk classification (MRC) approach that weights both training and testing samples.
result Significantly enhanced classification performance in synthetic and empirical experiments.

AMI framework improves text generation by optimizing mutual information between source and target.

problem Previous MI approaches ignored the backward network, leading to loose variational bounds.
method AMI is a saddle point optimization framework that iteratively promotes and demotes generated instances.
result AMI significantly outperforms baselines on various text generation tasks.

Proposes CLRS-Text, a new benchmark for evaluating LM reasoning capabilities.

problem Lack of transferable benchmarks for evaluating reasoning capabilities of language models.
method Developed a textual version of the CLRS benchmark, generating diverse algorithmic tasks.
result Demonstrates a novel challenge for the LM reasoning community and validates prior work.

A new method improves text generation quality and diversity.

problem Exposure bias in Maximum Likelihood Estimation for text generation.
method ψ-MLE, a new training scheme based on density ratio estimation.
result ψ-MLE outperforms Maximum Likelihood Estimation and other models in text generation quality and diversity.

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.

Improved text classification performance through conformal transformations of kernels.

problem Text document categorization in high-dimensional spaces.
method Introduced new Gaussian Cosine kernel and two conformal transformations.
result Conformal transformations significantly improve kernel performance, especially for sub-optimal kernels.

As electronically stored data grow in daily life, obtaining novel and relevant information becomes challenging in text mining. Thus people have sought statistical methods based on term frequency, matrix algebra, or topic modeling for text mining. Popular topic models have centered on one single text collection, which i…

2019-06-17abs ↗pdf ↗

This paper presents an algorithm for the unsupervised learning of latent variable models from unlabeled sets of data. We base our technique on spectral decomposition, providing a technique that proves to be robust both in theory and in practice. We also describe how to use this algorithm to learn the parameters of two …

2016-12-11abs ↗pdf ↗

Synthetic Combinations learns unit-specific causal outcomes for combinatorial interventions.

problem Estimating unit-specific causal outcomes for all combinations of pp interventions in a heterogeneous setting.
method Latent factor model with Fourier expansion sparsity, imposing structure across units and interventions.
result Synthetic Combinations provides consistent estimation with poly(r) * (N + s^2p) observations, outperforming previous methods.

The paper assesses text classification robustness through maximal safe radius computation.

problem Vulnerability of neural network models to small input modifications.
method Maximal safe radius computation, Monte Carlo Tree Search, syntactic filtering, linear bounding techniques.
result Approximation methods for computing upper and lower bounds of maximal safe radius.

Adapts causal inference for high-dimensional treatments like text strings.

problem Predicting effects of interventions with many possible variations.
method Adapts classical causal estimators to high-dimensional treatment spaces, balancing moment errors.
result Shows high-dimensional treatment spaces can be addressed with a single model.

Efficiently distills pretrained text-to-image models without real data, improving FID and CLIP scores.

problem Slow iterative refinement process of diffusion-based text-to-image models.
method Guided Score identity Distillation with Long and Short Classifier-Free Guidance.
result Achieves state-of-the-art FID performance with competitive CLIP score.

Privacy preserving networks can be modelled as decentralized networks (e.g., sensors, connected objects, smartphones), where communication between nodes of the network is not controlled by an all-knowing, central node. For this type of networks, the main issue is to gather/learn global information on the network (e.g.,…

2016-10-05abs ↗pdf ↗

LLMs encode latent topic distributions, suggesting Bayesian inference.

problem Capturing topic structure from large language models.
method Connecting LLM optimization to implicit Bayesian inference and de Finetti's theorem.
result LLMs recover latent topic distributions, matching LDA-generated topics.

Estimates sparse topic models with improved efficiency and adaptability.

problem Estimating sparse topic models with unknown sparsity and number of topics.
method Proposes a new algorithm for efficient estimation of sparse topic models with non-negative matrices.
result Upper bound matches minimax lower bound, demonstrating optimal performance.

This paper presents a method to generate synthetic data with differential privacy to protect user privacy while maintaining data trends.

problem Protecting user privacy while using real data for AI applications.
method Develops a practical guide to generating synthetic data using differential privacy.
result Synthetic data can be generated to preserve trends of real data while ensuring strong privacy protections.