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

Trend · papers per month

82163245326 · Jun 202019922001200920182026
48 results for text input

This paper restores interpretability to adversarial training in text by restricting perturbations to existing words.

problem Lack of interpretability in adversarial training methods for text.
method Restrict perturbations to existing words in the input embedding space.
result Maintains or improves task performance while maintaining interpretability.

Adversaries reprogram text classification models without changing the original network.

problem Reprogramming neural networks trained on discrete input spaces like text classification.
method Context-based vocabulary remapping model for white-box and black-box settings.
result Successfully repurposed various text-classification models for new tasks.

This research discovers model architecture and training dataset characteristics through strategic input probing.

problem Discovering model architecture and training dataset characteristics in black box models.
method Structured input probes and model outputs are used to train a deep classifier for image and text classification.
result The approach successfully distinguishes between different image and text datasets and architectures.

Study shows noisy historical data can still predict future text classification well.

problem Challenges in text classification with noisy, historical data.
method Examined how performance metrics on noisy data reflect future model performance.
result Noisy training data can be used to build effective prediction models for cleaner inputs.

A new method for semi-supervised text classification using layer partitioning.

problem Adapting neural semi-supervised learning to discrete text inputs.
method Decompose neural network into feature extractor FF and update layer UU for training. Use dropout for systematic noise.
result Improves text classification especially on short texts compared to state-of-the-art methods.

Improves text-to-image translation by using GANs and captioning networks.

problem Generating images that accurately reflect the meaning of a sentence.
method Uses cycle consistent adversarial networks and captioning networks to improve image generation.
result Significantly improved image quality compared to existing methods.

Adversarial training provides a means of regularizing supervised learning algorithms while virtual adversarial training is able to extend supervised learning algorithms to the semi-supervised setting. However, both methods require making small perturbations to numerous entries of the input vector, which is inappropriat…

2016-05-25abs ↗pdf ↗

Paper develops a method to generate discrete adversarial attacks on text classification models using submodular optimization.

problem Generating adversarial examples for discrete structures like text is challenging.
method Formulated adversarial attacks as an optimization task on submodular set functions, guided by gradient information.
result Achieved a 1-1/e approximation factor for attacks using the greedy algorithm.

Paper addresses shortcomings in pointer generator networks for summarization.

problem Extractive summaries and factual inaccuracies in generated text.
method Appends traditional linguistic information to teach networks on text structure.
result Feasibility and potential of additional cues for improved generation.

Our work proves robustness of embedding schemes to discrete changes in text.

problem Discrete changes in text, like replacing a word, affect model robustness.
method Formal proofs and quantitative bounds for embedding schemes (concatenation, TF-IDF, Paragraph Vector).
result Embedding schemes are robust to discrete changes in text with Hölder or Lipschitz properties.

This work reduces the dimensionality of text data using SVD, improving performance and computational efficiency.

problem High-dimensional input spaces in text classification lead to excessive parameter count and computational infeasibility.
method Singular Value Decomposition (SVD) is applied to transform the input space into a lower-dimensional latent space.
result Neural networks trained on the lower-dimensional latent space achieve comparable or better performance with reduced computational complexity.

Joint training model for TTS and VC tasks using Tacotron and WaveNet.

problem Training a shared model for text-to-speech and voice conversion.
method Extended Tacotron model with dual attention mechanism for shared tasks, WaveNet for waveform generation.
result Joint training of a shared model achieves both TTS and VC tasks efficiently.

Sparse text alignments learned via optimal transport improve model explainability.

problem Building self-explaining models by selecting relevant text pieces.
method Employing optimal transport to find minimal cost alignments, introducing constrained variants for sparsity.
result Sparse and interpretable alignments achieved, preserving prediction accuracy.

LLMs' explanations are often insufficient and vary with input distribution.

problem Evaluating the sufficiency of LLM explanations without predefined biases.
method Generalizing sufficiency to arbitrary explanations, using LLM's input beliefs, and introducing SCSuff metric.
result Explanation sufficiency can vary with input distribution and is weakly correlated with model size, accuracy, or output entropy.

EBMs improve text discrimination by generating negatives from auto-regressive models.

problem Discriminating machine-generated text from human-generated text.
method Use energy-based models to discriminate text, generating negatives using pre-trained auto-regressive language models.
result EBMs can generalize well to changes in generator architectures but are sensitive to training set.

GENs model generates sparse graphs from text-based inputs, achieving high validity.

problem Efficiently modeling and generating sparse graphs with unique and valid structures.
method RNN-based GENs model trained with an examination mechanism to predict graph characters.
result Moderate to high validity achieved in LGI strings for sparse graph generation.

This paper tackles text infilling, a task of filling missing text portions, and presents a self-attention model that outperforms other methods.

problem The task of filling missing text portions, especially when the number and length of missing portions are unknown.
method A self-attention model with segment-aware position encoding and bidirectional context modeling, trained on extensive supervised data.
result The self-attention model significantly outperforms other approaches, setting a strong baseline for future research.

Proposes a method to train neural networks directly on compressed text data.

problem Training neural networks on compressed text data without decompression.
method Introduces composer modules to encode symbols from grammar compression rules into vector representations.
result Demonstrates that the proposed method can achieve both memory and computational efficiency while maintaining moderate performance.

SAM adds semantic attributes to language models for better interpretation and style variation.

problem Improving text interpretation and style variation in language models.
method SAM includes document attributes, scores them, and embeds them into the model's input space.
result SAM generates interpretable texts and shows superior performance on various datasets.

Ground-A-Video edits videos without training, preserving intended changes.

problem Complex multi-attribute video editing with omitted or wrong changes.
method Grounding-guided video-to-video translation with Cross-Frame Gated Attention.
result Zero-shot multi-attribute video editing with improved accuracy and frame consistency.

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.

DMTE integrates global connectivity for better text embeddings.

problem Lack of capturing complete connectivity between texts in graphs.
method Integrates global structural information through diffusion-convolution on text inputs, preserving high-order proximity.
result DMTE outperforms state-of-the-art methods on vertex-classification and link-prediction tasks.

Recurrent neural networks (RNNs) process input text sequentially and model the conditional transition between word tokens. In contrast, the advantages of recursive networks include that they explicitly model the compositionality and the recursive structure of natural language. However, the current recursive architectur…

2016-07-15abs ↗pdf ↗