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

275481108 · Jun 202019922001200920172026
48 results for Abstract Syntax Tree (AST)

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 ↗

SLM models code syntax as trees to generate any programming language code.

problem Generating any piece of code in a given language without restrictions.
method Structural language modeling (SLM) decomposes code into ASTs and estimates probabilities over nodes.
result SLM model generates arbitrary code in any language, outperforming previous methods.

Neural network identifies undeclared variables and infers their types.

problem Undeclared variable errors in programs.
method Trained on structural semantic details of AST, identifies and infers types of undeclared variables.
result Correctly identified and inferred types for 80% of programs with undeclared variable errors.

With the celebrated success of deep learning, some attempts to develop effective methods for detecting malicious PowerShell programs employ neural nets in a traditional natural language processing setup while others employ convolutional neural nets to detect obfuscated malicious commands at a character level. While the…

2018-10-03abs ↗pdf ↗

Neural machine translation models are used to automatically generate a document from given source code since this can be regarded as a machine translation task. Source code summarization is one of the components for automatic document generation, which generates a summary in natural language from given source code. Thi…

2019-06-19abs ↗pdf ↗

Humans prove theorems by relying on substantial high-level reasoning and problem-specific insights. Proof assistants offer a formalism that resembles human mathematical reasoning, representing theorems in higher-order logic and proofs as high-level tactics. However, human experts have to construct proofs manually by en…

2019-05-21abs ↗pdf ↗

The ability to generate natural language sequences from source code snippets has a variety of applications such as code summarization, documentation, and retrieval. Sequence-to-sequence (seq2seq) models, adopted from neural machine translation (NMT), have achieved state-of-the-art performance on these tasks by treating…

2018-08-04abs ↗pdf ↗

Metric learning has the aim to improve classification accuracy by learning a distance measure which brings data points from the same class closer together and pushes data points from different classes further apart. Recent research has demonstrated that metric learning approaches can also be applied to trees, such as m…

2018-06-13abs ↗pdf ↗

This paper describes Convex, a convex optimization modeling framework in Julia. Convex translates problems from a user-friendly functional language into an abstract syntax tree describing the problem. This concise representation of the global structure of the problem allows Convex to infer whether the problem complies …

2014-10-17abs ↗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 ↗

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 ↗

Let GG be a countable group that splits as a free product of groups of the form G=G1GkFNG=G_1\ast\dots\ast G_k\ast F_N, where FNF_N is a finitely generated free group. We identify the closure of the outer space PO(G,{G1,,Gk})P\mathcal{O}(G,\{G_1,\dots,G_k\}) for the axes topology with the space of projective minimal, \emph{very small} …

2014-08-03abs ↗pdf ↗

A new layer learns abstract relations from graph structure using finite-state automata.

problem Learning abstract relations from graph structure for program analysis.
method Relaxing the problem into learning finite-state automata policies on a graph-based POMDP and training these policies using implicit differentiation.
result GFSA layer finds shortcuts in grid-world graphs and reproduces simple static analyses on Python programs.

Resolving abstract anaphora is an important, but difficult task for text understanding. Yet, with recent advances in representation learning this task becomes a more tangible aim. A central property of abstract anaphora is that it establishes a relation between the anaphor embedded in the anaphoric sentence and its (ty…

2017-06-07abs ↗pdf ↗

There is a widespread need for techniques that can discover structure from time series data. Recently introduced techniques such as Automatic Bayesian Covariance Discovery (ABCD) provide a way to find structure within a single time series by searching through a space of covariance kernels that is generated using a simp…

2016-11-21abs ↗pdf ↗

Given a countable group GG splitting as a free product G=G1GkFNG=G_1\ast\dots\ast G_k\ast F_N, we establish classification results for subgroups of the group Out(G,F)Out(G,\mathcal{F}) of all outer automorphisms of GG that preserve the conjugacy classes of each GiG_i. We show that every finitely generated subgroup $H\subseteq Ou…

2019-01-15abs ↗pdf ↗

Develops a framework for decision-making abstractions under computational limitations.

problem Decision-making by agents with limited computational resources.
method Information-theoretic signal compression and optimization problem formulation.
result Generates a hierarchy of abstractions for a non-trivial environment.

Model learns code representations from comments for data analysis tasks.

problem Lack of descriptive labels for analyzing large code corpora.
method Weakly supervised transformer architecture for joint code and comment representation.
result Model achieves 38% accuracy increase over expert-supplied heuristics.

We present a neural model for representing snippets of code as continuous distributed vectors ("code embeddings"). The main idea is to represent a code snippet as a single fixed-length code vector\textit{code vector}, which can be used to predict semantic properties of the snippet. This is performed by decomposing code to a col…

2018-03-26abs ↗pdf ↗

AlphaCFG discovers alpha factors using grammar-guided search.

problem Discovering formulaic alpha factors in finance.
method AlphaCFG uses a grammar-based framework to define and discover alpha factors with syntactic and semantic constraints.
result AlphaCFG outperforms state-of-the-art methods in trading profitability and efficiency.

Let LJ1(M)L\subset J^1(M) be a Legendrian submanifold of the 1-jet space of a Riemannian nn-manifold MM. A correspondence is established between rigid flow trees in MM determined by LL and boundary punctured rigid pseudo-holomorphic disks in TMT^\ast M, with boundary on the projection of LL and asymptotic to the doubl…

2005-09-16abs ↗pdf ↗

The paper certifies decision trees against evasion attacks using program analysis.

problem Vulnerability of decision tree models to evasion attacks by maliciously crafted perturbations.
method Transform decision trees into imperative programs for program analysis, leveraging abstract interpretation.
result Soundly verifies security guarantees of decision tree models, yielding minimal false positives.

The study proves properties of specific groups acting on cube complexes.

problem Proving properties of specific groups acting on cube complexes.
method Elementary construction of a contractible cube complex.
result Proves T,TT^\sharp,T^\ast are of type FF_\infty and brHn\mathrm{br}H_n is of type Fn1F_{n-1} but not of type FnF_n.

We present SEALion: an extensible framework for privacy-preserving machine learning with homomorphic encryption. It allows one to learn deep neural networks that can be seamlessly utilized for prediction on encrypted data. The framework consists of two layers: the first is built upon TensorFlow and SEAL and exposes sta…

2019-04-29abs ↗pdf ↗

The paper characterizes \ast-Ricci-Bourguignon solitons on Kenmotsu manifolds.

problem Characterizing \ast-Ricci-Bourguignon solitons on Kenmotsu manifolds.
method Analyzing conditions for compressing, balancing, or enlarging \ast-Ricci-Bourguignon on Kenmotsu manifolds; estimating curvature properties; featuring with torse-forming vector fields; providing an example.
result Found conditions and curvature properties for \ast-Ricci-Bourguignon solitons on Kenmotsu manifolds.

Estimates parameters in a deviated Gaussian mixture model.

problem Testing goodness-of-fit between a known function and a mixture of experts.
method Constructs novel Voronoi-based loss functions to estimate parameters.
result Characterizes local convergence rates of parameter estimation more accurately.

To identify and classify toxic online commentary, the modern tools of data science transform raw text into key features from which either thresholding or learning algorithms can make predictions for monitoring offensive conversations. We systematically evaluate 62 classifiers representing 19 major algorithmic families …

2018-10-03abs ↗pdf ↗

Neural program embedding can be helpful in analyzing large software, a task that is challenging for traditional logic-based program analyses due to their limited scalability. A key focus of recent machine-learning advances in this area is on modeling program semantics instead of just syntax. Unfortunately evaluating su…

2019-05-27abs ↗pdf ↗

The paper characterizes contact metric manifolds with specific solitons.

problem Characterizing contact metric manifolds with \ast-conformal Ricci solitons.
method Analyzing properties of (2n+1)(2n+1)-dimensional N(k)N(k)-contact metric manifolds.
result The manifold is locally isometric to a flat (n+1)(n+1)-dimensional manifold and an nn-dimensional manifold of constant curvature 4.

Study on Schouten solitons on Kenmotsu manifolds, focusing on torse-forming vector fields.

problem Characterizing \ast-ηη-Schouten solitons on Kenmotsu manifolds.
method Investigation of \ast-ηη-Schouten solitons on Kenmotsu manifolds with torse-forming potential vector fields.
result Characterization of the soliton and derivation of scalar curvature for Kenmotsu manifolds.

The paper develops a local index formula for complex manifolds with C\mathbb{C}^{\ast }-action.

problem Analyzing the mm-index on complex manifolds with C\mathbb{C}^{\ast }-action.
method Applying the method of transversal heat kernel asymptotics.
result Obtained a local index formula for the mm-index.

The paper studies special solitons on specific contact metric manifolds.

problem Characterizing solitons on N(k)-contact metric manifolds.
method Analyzing \ast-conformal Einstein solitons and gradient solitons on N(k)-contact metric manifolds.
result Conditions for solitons to be expanding, steady, or shrinking are determined.

Every infinitely edge-connected graph has a minor of Farey graph or T0tT_{\aleph_0}\ast t.

problem Characterizing edge-connected graphs with specific minor properties.
method Analyzing the minor structure of infinitely edge-connected graphs.
result Infinitely edge-connected graphs contain Farey graph or T0tT_{\aleph_0}\ast t as a minor.

XIMP improves molecular property prediction by integrating multiple graph representations.

problem Graph neural networks struggle in data-scarce regimes and fail to surpass traditional methods.
method Cross-graph inter-message passing with multiple graph abstractions.
result XIMP outperforms state-of-the-art baselines across diverse molecular property tasks.

In this paper, we explore dynamics of the nonholonomic system called vakonomic mechanics in the context of Lagrange-Dirac dynamical systems using a Dirac structure and its associated Hamilton-Pontryagin variational principle. We first show the link between vakonomic mechanics and nonholonomic mechanics from the viewpoi…

2014-05-21abs ↗pdf ↗