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

Trend · papers per month

1.2%2.5%3.7%4.9% · Jul 201919922001200920172026
48 results for unsupervised parsing

Unsupervised algorithm parses CSG images into CFG without pretraining.

problem Sparse reward problem in unsupervised program synthesis for images.
method Grammar-encoded tree LSTM, entropy regularization, sampling without replacement.
result Recover meaningful programs in large search spaces (up to 3.8imes10283.8 imes 10^{28}).

This paper explores unsupervised learning of parsing models along two directions. First, which models are identifiable from infinite data? We use a general technique for numerically checking identifiability based on the rank of a Jacobian matrix, and apply it to several standard constituency and dependency parsing mode…

2012-06-14abs ↗pdf ↗

Recurrent neural network grammars (RNNG) are generative models of language which jointly model syntax and surface structure by incrementally generating a syntax tree and sentence in a top-down, left-to-right order. Supervised RNNGs achieve strong language modeling and parsing performance, but require an annotated corpu…

2019-04-07abs ↗pdf ↗

Simple framework decouples word alignment and multilingual embedding mapping.

problem Learning multilingual embeddings without supervision.
method Two-stage approach: 1) unsupervised word alignment, 2) mapping embeddings to shared space.
result Robust performance across various multilingual tasks, including distant languages.

Sequence to sequence learning has recently emerged as a new paradigm in supervised learning. To date, most of its applications focused on only one task and not much work explored this framework for multiple tasks. This paper examines three multi-task learning (MTL) settings for sequence to sequence models: (a) the onet…

2015-11-19abs ↗pdf ↗

Typical spoken language understanding systems provide narrow semantic parses using a domain-specific ontology. The parses contain intents and slots that are directly consumed by downstream domain applications. In this work we discuss expanding such systems to handle compound entities and intents by introducing a domain…

2018-10-26abs ↗pdf ↗

We propose a method for non-projective dependency parsing by incrementally predicting a set of edges. Since the edges do not have a pre-specified order, we propose a set-based learning method. Our method blends graph, transition, and easy-first parsing, including a prior state of the parser as a special case. The propo…

2019-05-27abs ↗pdf ↗

Human communication takes many forms, including speech, text and instructional videos. It typically has an underlying structure, with a starting point, ending, and certain objective steps between them. In this paper, we consider instructional videos where there are tens of millions of them on the Internet. We propose a…

2016-05-11abs ↗pdf ↗

Paper proposes a reinforcement learning framework for distant supervision of question parsing.

problem Lack of gold annotations for parsing in QA datasets.
method Reinforcement learning framework based on formal queries to learn mentions of entities and relations.
result Significant improvement in entity and relation linking compared to state of the art.

Domain-general semantic parsing is a long-standing goal in natural language processing, where the semantic parser is capable of robustly parsing sentences from domains outside of which it was trained. Current approaches largely rely on additional supervision from new domains in order to generalize to those domains. We …

2016-06-20abs ↗pdf ↗

Graph-to-Tree Neural Networks improve structured input-output translation in tasks like semantic parsing and math word problems.

problem Improving performance on tasks like semantic parsing and math word problem solving.
method Graph-to-Tree Neural Networks, consisting of a graph encoder and a hierarchical tree decoder.
result Graph2Tree model outperforms or matches state-of-the-art models on neural semantic parsing and math word problem tasks.

Deep models learn to parse complex language structures from local data patterns.

problem Understanding how deep models parse and represent language structures.
method Introduced tunable probabilistic context-free grammars and a learning algorithm inspired by deep networks.
result Data correlations across scales enable hierarchical language representations.

Part-of-speech (POS) tagging is a fundamental component for performing natural language tasks such as parsing, information extraction, and question answering. When POS taggers are trained in one domain and applied in significantly different domains, their performance can degrade dramatically. We present a methodology f…

2014-10-31abs ↗pdf ↗

Synthetic reference strings are as effective as real ones for training citation parsing models.

problem Lack of training data for citation parsing, especially with deep neural networks.
method Trained Grobid with human-labelled and synthetically created reference strings, and evaluated retraining and out-of-sample data impact.
result Synthetic and real reference strings are equally effective for training Grobid, with retraining improving performance.

Tasks like code generation and semantic parsing require mapping unstructured (or partially structured) inputs to well-formed, executable outputs. We introduce abstract syntax networks, a modeling framework for these problems. The outputs are represented as abstract syntax trees (ASTs) and constructed by a decoder with …

2017-04-25abs ↗pdf ↗

Co-PLNet combines point and line predictions to improve wireframe parsing accuracy and efficiency.

problem Separate line and point predictions lead to inconsistent wireframes.
method Co-PLNet uses a Point-Line Prompt Encoder to convert early point detections into spatial prompts, which guide line refinement.
result Co-PLNet achieves better accuracy and robustness in wireframe parsing compared to existing methods.

In this paper, we propose a probabilistic parsing model, which defines a proper conditional probability distribution over non-projective dependency trees for a given sentence, using neural representations as inputs. The neural network architecture is based on bi-directional LSTM-CNNs which benefits from both word- and …

2017-01-04abs ↗pdf ↗

PATOIS synthesizes code from natural language using learned code idioms.

problem Synthesizing general-purpose source code from natural language specifications is challenging.
method PATOIS uses a neural synthesizer that interleaves high-level and low-level reasoning, incorporating learned code idioms from a corpus.
result Using learned code idioms improves the synthesizer's accuracy on semantic parsing datasets.

Survey on automating geometry problem solving with large models.

problem Automating geometric problem solving with spatial understanding and logical reasoning.
method Synthesizes GPS advancements through benchmark construction, parsing, and reasoning paradigms.
result Unified analytical paradigm and emerging opportunities identified.

Program synthesis struggles with complex spatial relationships in image classification.

problem Challenges in solving Synthetic Visual Reasoning Test problems.
method Quantitative reanalysis of human and machine performance, improved program synthesis classifier, categorization of SVRT problems.
result Program synthesis is constrained by spatial relationships in images, not just shape specification.

Automatically mined rules from dependency parsing help neural models learn from less labeled data.

problem Lack of labeled data for aspect and opinion term extraction.
method Automatically mined rules from dependency parsing, applied to auxiliary data, combined with human-annotated data.
result Neural models achieve better performance than state-of-the-art with mined rules and auxiliary data.

While neural networks have shown impressive performance on large datasets, applying these models to tasks where little data is available remains a challenging problem. In this paper we propose to use feature transfer in a zero-shot experimental setting on the task of semantic parsing. We first introduce a new method fo…

2018-08-27abs ↗pdf ↗

Novel ramp loss method improves weakly supervised machine translation and parsing.

problem Training neural models without gold labels in weak supervision scenarios.
method Adapted ramp loss objectives to promote positive outputs and discourage negative ones.
result Bipolar ramp loss objectives outperform other methods on weakly supervised tasks.

Scene parsing is an important and challenging prob- lem in computer vision. It requires labeling each pixel in an image with the category it belongs to. Tradition- ally, it has been approached with hand-engineered features from color information in images. Recently convolutional neural networks (CNNs), which automatica…

2014-11-15abs ↗pdf ↗

Framework for universal graph function approximators outperforms existing methods.

problem Graph classification and separation of graph classes.
method Inspired by persistent homology, dependency parsing, and multivalued functions, the framework constructs universal approximators on graph isomorphism classes.
result Achieves state-of-the-art performance on four graph datasets.

Syntactic constituency parsing is a fundamental problem in natural language processing and has been the subject of intensive research and engineering for decades. As a result, the most accurate parsers are domain specific, complex, and inefficient. In this paper we show that the domain agnostic attention-enhanced seque…

2014-12-23abs ↗pdf ↗

Deep generative models have been wildly successful at learning coherent latent representations for continuous data such as video and audio. However, generative modeling of discrete data such as arithmetic expressions and molecular structures still poses significant challenges. Crucially, state-of-the-art methods often …

2017-03-06abs ↗pdf ↗

Neurally-Guided Structure Inference combines search and data-driven methods for efficient, robust structure inference.

problem Combining the advantages of exhaustive search and data-driven methods for structure inference.
method Neurally-Guided Structure Inference (NG-SI) uses a neural network to guide hierarchical search over structures.
result NG-SI outperforms search-based and data-driven methods on probabilistic matrix decomposition and symbolic program parsing.

We speed up marginal inference by ignoring factors that do not significantly contribute to overall accuracy. In order to pick a suitable subset of factors to ignore, we propose three schemes: minimizing the number of model factors under a bound on the KL divergence between pruned and full models; minimizing the KL dive…

2012-03-15abs ↗pdf ↗

Despite enormous progress in object detection and classification, the problem of incorporating expected contextual relationships among object instances into modern recognition systems remains a key challenge. In this work we propose Information Pursuit, a Bayesian framework for scene parsing that combines prior models …

2017-01-09abs ↗pdf ↗

West Frisian lemmatizer, POS tagger, and parser created.

problem Creating accurate lemmatization, POS tagging, and dependency parsing for West Frisian.
method Using a corpus of 44,714 words annotated according to Universal Dependency version 2. Applying Dutch POS tags and morphological/syntactic annotations to create Frisian translations.
result Significant improvement in lemma accuracy compared to default parameters.

We provide complete source code for building a fundamental industry classification based on publically available and freely downloadable data. We compare various fundamental industry classifications by running a horserace of short-horizon trading signals (alphas) utilizing open source heterotic risk models (https://ssr…

2017-06-13abs ↗pdf ↗

HapNet predicts marketing campaign effects using a hierarchical structure.

problem Complex and challenging effect prediction for marketing campaigns.
method Hierarchical Capsule Prediction Network (HapNet).
result HapNet outperforms state-of-the-art methods in both synthetic and real data.

A new method for spotting symbols in CAD images reduces annotation costs and improves accuracy.

problem Challenging task of labeling symbols from CAD drawings.
method Pixel-wise point location via Progressive Gaussian Kernels (PGK) and local offset.
result The proposed method achieves good generalization on real-world CAD images.