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

Trend · papers per month

154309463617 · Jun 202019922001200920172026
48 results for paraphrase task

Paraphrasing exemplifies the ability to abstract semantic content from surface forms. Recent work on automatic paraphrasing is dominated by methods leveraging Machine Translation (MT) as an intermediate step. This contrasts with humans, who can paraphrase without being bilingual. This work proposes to learn paraphrasin…

2019-05-29abs ↗pdf ↗

TGLS generates text by optimizing search results and learning from them.

problem Unsupervised text generation without explicit training data.
method TGLS uses simulated annealing to estimate sentence quality, then a conditional generative model learns from search results.
result TGLS outperforms unsupervised baselines and matches state-of-the-art supervised methods in paraphrase generation.

Method compares sentences by cosine similarity of vector projections.

problem Measuring semantic similarity of sentences.
method Cosine similarity of vector projections of sentence groups.
result Advantages over existing methods in preserving word order and syntactic connections.

Semantic paraphrases can fool financial sentiment classifiers due to geometric shifts in model representations.

problem Semantic paraphrase attacks on financial sentiment classifiers
method Developing a continuous local model of semantic paraphrase perturbations
result The worst-case local displacement of the target representation is governed by the largest generalised eigenvalue of a matrix pencil constructed from the Jacobians of the two embedding maps.

Word2Vec (W2V) and GloVe are popular, fast and efficient word embedding algorithms. Their embeddings are widely used and perform well on a variety of natural language processing tasks. Moreover, W2V has recently been adopted in the field of graph embedding, where it underpins several leading algorithms. However, despit…

2018-05-30abs ↗pdf ↗

Word2vec (Mikolov et al., 2013) has proven to be successful in natural language processing by capturing the semantic relationships between different words. Built on top of single-word embeddings, paragraph vectors (Le and Mikolov, 2014) find fixed-length representations for pieces of text with arbitrary lengths, such a…

2017-11-10abs ↗pdf ↗

Recurrent neural networks have become ubiquitous in computing representations of sequential data, especially textual data in natural language processing. In particular, Bidirectional LSTMs are at the heart of several neural models achieving state-of-the-art performance in a wide variety of tasks in NLP. However, BiLSTM…

2018-05-18abs ↗pdf ↗

Many tasks in natural language understanding require learning relationships between two sequences for various tasks such as natural language inference, paraphrasing and entailment. These aforementioned tasks are similar in nature, yet they are often modeled individually. Knowledge transfer can be effective for closely …

2018-04-23abs ↗pdf ↗

Convolutional neural networks (CNNs) have recently emerged as a popular building block for natural language processing (NLP). Despite their success, most existing CNN models employed in NLP share the same learned (and static) set of filters for all input sentences. In this paper, we consider an approach of using a smal…

2017-09-25abs ↗pdf ↗

In real-world applications of natural language generation, there are often constraints on the target sentences in addition to fluency and naturalness requirements. Existing language generation techniques are usually based on recurrent neural networks (RNNs). However, it is non-trivial to impose constraints on RNNs whil…

2018-11-14abs ↗pdf ↗

Recently, generative adversarial networks have gained a lot of popularity for image generation tasks. However, such models are associated with complex learning mechanisms and demand very large relevant datasets. This work borrows concepts from image and video captioning models to form an image generative framework. The…

2018-09-27abs ↗pdf ↗

We aim to design strategies for sequential decision making that adjust to the difficulty of the learning problem. We study this question both in the setting of prediction with expert advice, and for more general combinatorial decision tasks. We are not satisfied with just guaranteeing minimax regret rates, but we want …

2015-02-27abs ↗pdf ↗

New approach detects sensitive info in text, outperforming previous methods.

problem Detecting sensitive information in unstructured text documents.
method Developed novel recursive neural network approaches for sensitive info detection, assuming only labeled examples.
result Our approaches significantly outperform previous keyword-based methods on real-world data.

Word embeddings generated by neural network methods such as word2vec (W2V) are well known to exhibit seemingly linear behaviour, e.g. the embeddings of analogy "woman is to queen as man is to king" approximately describe a parallelogram. This property is particularly intriguing since the embeddings are not trained to a…

2019-01-28abs ↗pdf ↗

A new framework explains GNN predictions by simulating graph structure and feature changes.

problem Lack of transparency in GNN predictions hinders understanding.
method TraP2 framework using a three-layer architecture: Translation, Perturbation, and Paraphrase layers.
result TraP2 achieves 10.2% higher explanation accuracy than state-of-the-art methods.

We present a syntax-infused variational autoencoder (SIVAE), that integrates sentences with their syntactic trees to improve the grammar of generated sentences. Distinct from existing VAE-based text generative models, SIVAE contains two separate latent spaces, for sentences and syntactic trees. The evidence lower bound…

2019-06-05abs ↗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.

Study on estimating Gumbel--Max watermark proportions in edited documents.

problem Estimating the proportion of a document generated from a watermarked LLM.
method Comparison of full observation and pivotal reduction observation regimes; development of estimators and information-theoretic lower bounds.
result Full observation yields a substantially smaller sample complexity compared to pivotal reduction.

Ultra-fast search algorithm for trillion-scale corpora with semantic flexibility.

problem Efficiently searching over large natural language corpora with semantic variations.
method String matching based on suffix arrays, vector representation of words, dynamic corpus-aware pruning, fast exact lookup.
result Substantially lower search latency compared to existing methods on FineWeb-Edu corpus.

Online monitoring system for safety classifiers with shift detection and conformal adaptation

problem Detecting and adapting to distributional shifts in deployed safety classifiers
method Calibrated sequential statistics for online monitoring, conformal abstention for adaptation
result 86.6% valid detection with mean latency of 39.5 steps

The semantic map calibrates uncertainty from language model probabilities.

problem Uncertainty in language model probabilities for professional decisions.
method Prespecified semantic map linking probabilities of verbal responses to probabilities of declared states.
result Language-derived probabilities outperform printed numerical probabilities and recover valid uncertainty coverage.

Paper introduces SDM for detecting LLM hallucinations, improving on entropy tests.

problem Challenges of Large Language Models (LLMs) with non-factual, nonsensical responses.
method Joint clustering on sentence embeddings to measure semantic divergence between prompts and responses.
result SDM framework detects deeper form of arbitrariness in LLM responses.

APT-Gen generates tasks to help RL learn in hard problems.

problem Learning in hard exploration problems.
method APT-Gen uses a task generator to create tasks from a parameterized space, balancing performance and similarity to target tasks.
result APT-Gen outperforms baselines in grid world and robotic manipulation tasks.

OCEAN infers online task identities from context variables.

problem Online task inference for compositional tasks with context adaptation.
method Variational inference framework OCEAN models global and local context variables in a joint latent space.
result OCEAN provides more effective task inference with sequential context adaptation.

Deep RL multi-task learning outperforms single-task learning on new tasks.

problem Improving performance on new tasks in multi-task reinforcement learning.
method Investigation of multi-task reinforcement learning algorithms with and without Elastic Weight Consolidation (EWC).
result Multi-task reinforcement learning algorithms outperform single-task learning on new tasks.

Sharing information between multiple tasks enables algorithms to achieve good generalization performance even from small amounts of training data. However, in a realistic scenario of multi-task learning not all tasks are equally related to each other, hence it could be advantageous to transfer information only between …

2014-12-03abs ↗pdf ↗

HydaLearn dynamically adjusts task weights for better MTL performance.

problem Constant loss weights in MTL lead to poor results due to drifting relevance and varying mini-batch composition.
method HydaLearn uses mini-batch gradients to dynamically adjust task weights.
result HydaLearn improves performance on synthetic and real-world data.

We investigate task clustering for deep-learning based multi-task and few-shot learning in a many-task setting. We propose a new method to measure task similarities with cross-task transfer performance matrix for the deep learning scenario. Although this matrix provides us critical information regarding similarity betw…

2017-08-26abs ↗pdf ↗

ST-MAML tackles task ambiguity in meta-learning by encoding tasks with stochastic representations.

problem Handling tasks from multiple distributions is challenging for meta-learning due to task ambiguity.
method ST-MAML uses a stochastic neural network module to encode tasks and propagate task representations to revise input variable encoding.
result ST-MAML matches or outperforms state-of-the-art methods on various tasks.

New algorithm combines curriculum learning with HER for complex object manipulation tasks.

problem Learning complex sequential object manipulation tasks from scratch is challenging.
method Curriculum learning with Hindsight Experience Replay (HER) for recurrent object manipulation tasks.
result Significant improvement in learning sequential object manipulation tasks compared to vanilla-HER.

Transformers infer tasks from context via two modes, geometrically shaped task vectors explain their behavior.

problem Understanding how transformers infer tasks from context and the geometric properties of task vectors.
method Synthetic setting to train small transformers, mathematical characterization of task-vector geometry and inference modes.
result Task-vector geometry shapes in-distribution and out-of-distribution behavior of transformers.