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

18.8%37.5%56.3%75.0% · Jul 199319922001200920172026
48 results for code embeddings

Natural language processing has improved tremendously after the success of word embedding techniques such as word2vec. Recently, the same idea has been applied on source code with encouraging results. In this survey, we aim to collect and discuss the usage of word embedding techniques on programs and source code. The a…

2019-04-05abs ↗pdf ↗

Investigates neural codes and their embeddings, proving conjectures and introducing new code types.

problem Analyzing neural codes and their embedding dimensions.
method Combinatorial, topological, and algebraic analysis; proving conjectures; introducing new neural code types.
result Proves conjectures about neural codes and their embeddings, introduces new code types.

Paper explores understanding of neural source code embeddings.

problem Lack of understanding of contents and characteristics of code2vec embeddings.
method Small case study using code2vec embeddings to create binary SVM classifiers and compare performance with handcrafted features.
result Code2vec embeddings perform similarly to handcrafted features and have more evenly distributed information gains.

MedGraph learns patient visit embeddings from EMRs, capturing both attributes and temporal sequences.

problem Limited EMR embedding methods fail to capture patient demographics, utilisation, and code descriptions.
method MedGraph constructs an attributed bipartite graph and uses a point process to model temporal sequences.
result MedGraph outperforms state-of-the-art methods in medical risk prediction tasks.

Improves code2vec for Java classes by obfuscating variable names.

problem Code2vec's reliance on variable names makes it vulnerable to typos and attacks.
method Obfuscate variable names during code2vec training and aggregate method embeddings for class-level predictions.
result Obfuscated variable names improve model's robustness and accuracy.

In this paper, we propose a semi-supervised dictionary learning method that uses both the information in labelled and unlabelled data and jointly trains a linear classifier embedded on the sparse codes. The manifold structure of the data in the sparse code space is preserved using the same approach as the Locally Linea…

2018-12-11abs ↗pdf ↗

This work tackles runtime complexity prediction for code, using machine learning and a new dataset.

problem Predicting runtime complexity of code is hard and mathematically impossible.
method Modelled as a machine learning task, using feature engineering and code embeddings, with a new dataset.
result Achieved state-of-the-art results in runtime complexity prediction.

Enhances medical code predictions for multi-morbidity patients using text classification.

problem Improving accuracy in predicting medical codes for patients with multiple illnesses.
method Used machine learning techniques, including multi-label medical text classification, to enhance predictions.
result High dimensional embeddings pre-trained on health data significantly improve multi-label classification performance.

We show how to learn low-dimensional representations (embeddings) of patient visits from the corresponding electronic health record (EHR) where International Classification of Diseases (ICD) diagnosis codes are removed. We expect that these embeddings will be useful for the construction of predictive statistical models…

2018-03-26abs ↗pdf ↗

The study connects projective codes to the distribution of zeros of odd maps.

problem Understanding the distribution of zeros of odd maps from spheres to Euclidean space.
method Using the topology of the space of probability measures on the sphere.
result Generalization of the Borsuk-Ulam theorem and its four consequences.

Study on topological order on fractal geometries, proving no-go theorem and fault-tolerant gates.

problem Investigating topological order on fractal geometries embedded in n dimensions.
method Using quantum error-correcting codes and systolic geometry to diagnose topological order.
result Proves no-go theorem for topological order on 2D fractals, survival on higher dimensions, and construction of fault-tolerant gates.

IdBench benchmarks semantic representations of identifiers, revealing strengths and weaknesses.

problem Evaluating semantic representations of identifiers in source code.
method Created a benchmark using developer ratings, evaluated natural language and source code embeddings, and compared lexical string distance functions.
result No single technique provides a satisfactory representation of semantic similarities, but ensemble models can improve performance.

GMBL uses graph embedding to learn binary codes from multiple views for clustering.

problem Lack of complete structure and complementary information from multiple views in single-view hash clustering methods.
method Graph-based Multi-view Binary Learning (GMBL) using Laplacian matrix to preserve data structure and assign weights to views.
result GMBL outperforms previous methods in clustering performance on multiple datasets.

A new approach predicts next observations without explicit decoding for better control.

problem High-dimensional observations and unknown dynamics in real-world control tasks.
method Proposes a novel information-theoretic LCE approach using predictive coding to develop a decoder-free model.
result The model reliably learns a controllable latent space leading to superior performance.

We propose a novel Wasserstein method with a distillation mechanism, yielding joint learning of word embeddings and topics. The proposed method is based on the fact that the Euclidean distance between word embeddings may be employed as the underlying distance in the Wasserstein topic model. The word distributions of to…

2018-09-12abs ↗pdf ↗

The scientific literature is a rich source of information for data mining with conceptual knowledge graphs; the open science movement has enriched this literature with complementary source code that implements scientific models. To exploit this new resource, we construct a knowledge graph using unsupervised learning me…

2019-08-25abs ↗pdf ↗

Binary embedding of high-dimensional data requires long codes to preserve the discriminative power of the input space. Traditional binary coding methods often suffer from very high computation and storage costs in such a scenario. To address this problem, we propose Circulant Binary Embedding (CBE) which generates bina…

2014-05-13abs ↗pdf ↗

Graph embedding aims to transfer a graph into vectors to facilitate subsequent graph analytics tasks like link prediction and graph clustering. Most approaches on graph embedding focus on preserving the graph structure or minimizing the reconstruction errors for graph data. They have mostly overlooked the embedding dis…

2019-01-04abs ↗pdf ↗

Embedding representation learning via neural networks is at the core foundation of modern similarity based search. While much effort has been put in developing algorithms for learning binary hamming code representations for search efficiency, this still requires a linear scan of the entire dataset per each query and tr…

2018-05-15abs ↗pdf ↗

Framework harmonizes EHR data across institutions for better analysis.

problem Heterogeneity of medical codes and terminologies hinder EHR data analysis.
method MASH (Multi-source Automated Structured Hierarchy) uses neural optimal transport and learned hyperbolic embeddings to align and structure EHR data.
result MASH generates interpretable hierarchical graphs for unstructured local laboratory codes.

Quantum codes on hyperbolic lattices outperform Euclidean ones with higher rates and lower overhead.

problem Improving quantum error correction performance with hyperbolic lattices.
method Unified framework using Hyperbolic Cycle Basis algorithm for CSS codes construction and benchmarking.
result Achieved higher encoding rates and lower qubit overhead in hyperbolic quantum error correction codes.

Chord diagrams on circles and their intersection graphs (also known as circle graphs) have been intensively studied, and have many applications to the study of knots and knot invariants, among others. However, chord diagrams on more general graphs have not been studied, and are potentially equally valuable in the study…

2005-08-15abs ↗pdf ↗

As the performance of computer systems stagnates due to the end of Moore's Law, there is a need for new models that can understand and optimize the execution of general purpose code. While there is a growing body of work on using Graph Neural Networks (GNNs) to learn representations of source code, these representation…

2019-06-17abs ↗pdf ↗

Automation engineering is the task of integrating, via software, various sensors, actuators, and controls for automating a real-world process. Today, automation engineering is supported by a suite of software tools including integrated development environments (IDE), hardware configurators, compilers, and runtimes. The…

2019-09-06abs ↗pdf ↗