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

52105157209 · Jun 202019922001200920172026
48 results for non-generic almost positive sentences

The paper studies graph products of groups and recovers graph and vertex groups under certain conditions.

problem Recovering graph and vertex groups from graph products of groups.
method Using non-generic almost positive sentences, the authors show that under specific conditions, the underlying graph and vertex groups can be recovered.
result The core of the defining graph determines an invariant of the elementary theory of a right-angled Artin group.

Study on static manifolds with boundary and rigidity of curvature.

problem Understanding the rigidity of scalar curvature and mean curvature on manifolds with boundary.
method Analyzing maps of scalar curvature in the interior and mean curvature on the boundary, discussing geometric properties of static manifolds.
result Classification and rigidity theorems for simple non-generic domains in space forms and Schwarzschild manifold.

This study improves sentence embeddings from BERT models.

problem Capturing the underlying meaning of sentences using BERT models.
method Comprehensive review and testing of various sentence embedding extraction and refinement methods.
result Representation-shaping techniques significantly improve sentence embeddings from BERT-based and simple baseline models.

The choice of sentence encoder architecture reflects assumptions about how a sentence's meaning is composed from its constituent words. We examine the contribution of these architectures by holding them randomly initialised and fixed, effectively treating them as as hand-crafted language priors, and evaluating the resu…

2019-10-04abs ↗pdf ↗

In this work we describe a method to reconstruct the braid monodromy of the preimage of a curve by a Kummer cover. This method is interesting, since it combines two techniques, namely, the reconstruction of a highly non-generic braid monodromy with a systematic method to go from a non-generic to a generic braid monodro…

2012-05-24abs ↗pdf ↗

While neural sequence generation models achieve initial success for many NLP applications, the canonical decoding procedure with left-to-right generation order (i.e., autoregressive) in one-pass can not reflect the true nature of human revising a sentence to obtain a refined result. In this work, we propose XL-Editor, …

2019-10-19abs ↗pdf ↗

In this paper we explore the "vector semantics" problem from the perspective of "almost orthogonal" property of high-dimensional random vectors. We show that this intriguing property can be used to "memorize" random vectors by simply adding them, and we provide an efficient probabilistic solution to the set membership …

2018-02-23abs ↗pdf ↗

Neural language models are a critical component of state-of-the-art systems for machine translation, summarization, audio transcription, and other tasks. These language models are almost universally autoregressive in nature, generating sentences one token at a time from left to right. This paper studies the influence o…

2018-08-23abs ↗pdf ↗

Given vector representations for individual words, it is necessary to compute vector representations of sentences for many applications in a compositional manner, often using artificial neural networks. Relatively little work has explored the internal structure and properties of such sentence vectors. In this paper, we…

2018-10-16abs ↗pdf ↗

We characterize positive links in terms of strong quasipositivity, homogeneity and the value of Rasmussen, Beliakova and Wehrli's ss-invariant. We also study almost positive links, in particular, determine the ss-invariants of almost positive links. This result suggests that all almost positive links might be strongl…

2014-05-16abs ↗pdf ↗

In this paper, we show that a link which has a positive and almost alternating diagram is alternating, besides that a positive and non-alternating Montesinos link has an almost positive-alternating diagram.

2015-10-12abs ↗pdf ↗

Study of new link types and their invariants, extending previous results.

problem Properties of polynomial invariants and signatures of weakly successively almost positive links.
method Analysis of minimal genus and fibering properties, extending known theorems.
result Extension of Scharlemann-Thompson's theorem to weakly successively almost positive links.

Gradient descent struggles to achieve zero loss in deep learning models due to non-generic data distributions.

problem Achieving zero loss minimizers in deep learning networks.
method Analysis of gradient descent algorithm in deep learning, focusing on underparametrized networks.
result Zero loss minimization cannot be achieved generically in deep learning networks.

We propose a new generative model of sentences that first samples a prototype sentence from the training corpus and then edits it into a new sentence. Compared to traditional models that generate from scratch either left-to-right or by first sampling a latent sentence vector, our prototype-then-edit model improves perp…

2017-09-26abs ↗pdf ↗

Paper proposes a novel model to improve n-ary cross-sentence relation extraction by addressing noisy data and non-consecutive sentences.

problem Noisy labeled data and non-consecutive sentences in n-ary cross-sentence relation extraction.
method Two-level agent reinforcement learning model and hybrid attention mechanism/PCNN approach.
result The model reduces the impact of noisy data and achieves better performance.

The extrinsic Bonnet-Myers theorem is proven for positive Ricci curvature manifolds.

problem Understanding the structure of compact Riemannian manifolds with positive Ricci curvature.
method Establishing the extrinsic Bonnet-Myers theorem and showing almost rigidity for hypersurfaces.
result Proven the extrinsic Bonnet-Myers theorem for positive Ricci curvature manifolds and demonstrated almost rigidity for hypersurfaces.

A Riemannian manifold is called almost positively curved if the set of points for which all 22-planes have positive sectional curvature is open and dense. We find three new examples of almost positively curved manifolds: Sp(3)/Sp(1)2Sp(3)/Sp(1)^2, and two circle quotients of Sp(3)/Sp(1)2Sp(3)/Sp(1)^2. We also show the quasi-positively cu…

2015-04-01abs ↗pdf ↗

Using the Fiedler-Polyak-Viro Gauss diagram formulas we study the Vassiliev invariants of degree 2 and 3 on almost positive knots. As a consequence we show that the number of almost positive knots of given genus or unknotting number grows polynomially in the crossing number, and also recover and extend, inter alia to t…

1998-03-17abs ↗pdf ↗

Distributed representations of sentences have become ubiquitous in natural language processing tasks. In this paper, we consider a continual learning scenario for sentence representations: Given a sequence of corpora, we aim to optimize the sentence encoder with respect to the new corpus while maintaining its accuracy …

2019-04-18abs ↗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 ↗

Positivity of intersections in 4-manifolds leads to taming symplectic structures.

problem Taming symplectic structures in almost complex 4-manifolds.
method Proof of positivity of intersections of pseudoholomorphic curves.
result Positivity of intersections is stable and leads to taming symplectic structures.

Unsupervised scheme ranks sentences in text documents based on semantic importance.

problem Ranking sentences in text documents without labeled data.
method Extracts essential words and phrases, constructs semantic phrase and sentence graphs, applies PageRank, combines scores, and optimizes for topic diversity.
result SSR outperforms individual judges and compares favorably with combined rankings on benchmarks.

Bayesian EnKF improves sentence comprehension uncertainty modeling.

problem Uncertainty in human language comprehension, especially with ambiguous inputs.
method Bayesian framework using ensemble Kalman filter (EnKF) for uncertainty quantification.
result Enhanced model's ability to approximate human cognitive processing with linguistic ambiguities.

We formulate coherence modeling as a regression task and propose two novel methods to combine techniques from our setup with pairwise approaches. The first of our methods is a model that we call "first-next," which operates similarly to selection sorting but conditions decision-making on information about already-sorte…

2018-12-06abs ↗pdf ↗

New findings show that not all area-minimizing surfaces are calibrated, even on complex manifolds.

problem Understanding when area-minimizing surfaces cannot be calibrated.
method Analyzing homology classes and metrics on manifolds to determine if area-minimizers are calibrated.
result Calibrated area-minimizers are non-generic, challenging the common assumption that they are typical.

Existing relation classification methods that rely on distant supervision assume that a bag of sentences mentioning an entity pair are all describing a relation for the entity pair. Such methods, performing classification at the bag level, cannot identify the mapping between a relation and a sentence, and largely suffe…

2018-08-24abs ↗pdf ↗

We study twistor forms on products of compact Riemannian manifolds and show that they are defined by Killing forms on the factors. The main result of this note is a necessary step in the classification of compact Riemannian manifolds with non-generic holonomy carrying twistor forms.

2004-07-05abs ↗pdf ↗

We introduce the Attentive Unsupervised Text (W)riter (AUTR), which is a word level generative model for natural language. It uses a recurrent neural network with a dynamic attention and canvas memory mechanism to iteratively construct sentences. By viewing the state of the memory at intermediate stages and where the m…

2018-06-13abs ↗pdf ↗