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

74148222296 · Jun 202019922001200920172026
48 results for source code summarization

Contrastive Code Representation Learning improves code summarization and type inference.

problem Code representations are sensitive to edits, hindering downstream semantic understanding tasks.
method ContraCode: a contrastive pre-training task that learns code functionality.
result Contrastive pre-training improves code summarization and type inference accuracy.

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 ↗

As a powerful tool of asynchronous event sequence analysis, point processes have been studied for a long time and achieved numerous successes in different fields. Among various point process models, Hawkes process and its variants attract many researchers in statistics and computer science these years because they capt…

2017-08-28abs ↗pdf ↗

Code search and comprehension have become more difficult in recent years due to the rapid expansion of available source code. Current tools lack a way to label arbitrary code at scale while maintaining up-to-date representations of new programming languages, libraries, and functionalities. Comprehensive labeling of sou…

2019-06-03abs ↗pdf ↗

We present apricot, an open source Python package for selecting representative subsets from large data sets using submodular optimization. The package implements an efficient greedy selection algorithm that offers strong theoretical guarantees on the quality of the selected set. Two submodular set functions are impleme…

2019-06-08abs ↗pdf ↗

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 ↗

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.

Automatic summarization of natural language is a current topic in computer science research and industry, studied for decades because of its usefulness across multiple domains. For example, summarization is necessary to create reviews such as this one. Research and applications have achieved some success in extractive …

2018-12-18abs ↗pdf ↗

Backdoors can be implanted in neural models of source code, and we detect and remove them.

problem Vulnerability of neural models to backdoors in source code.
method Defined and implemented various backdoor classes, adapted robust statistics algorithms, and detected poisoned data through spectral signatures.
result Demonstrated the ease of injecting and removing backdoors in neural models of source code.

Proposes RDASS for better Korean text summarization evaluation.

problem ROUGE scores fail to capture semantic meaning in Korean text summarization.
method Introduces RDASS metrics and a method to improve their correlation with human judgment.
result RDASS metrics correlate better with human judgment than ROUGE scores.

Unsupervised learning summarizes EHR data into a patient status vector.

problem Challenges in modeling electronic health records due to irregularities and varying procedures/diagnoses.
method Two-step unsupervised representation learning scheme using auto-encoders and forecasting tasks.
result Improved generalization performance on mortality and readmission tasks.

Unsupervised summarization generates novel reviews reflecting consensus opinions.

problem Creating summaries that reflect subjective information in multiple documents.
method Generative model with hierarchical variational autoencoder, pointer-generator mechanism.
result Model produces fluent and coherent summaries reflecting common opinions.

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.

Programming languages are emerging as a challenging and interesting domain for machine learning. A core task, which has received significant attention in recent years, is building generative models of source code. However, to our knowledge, previous generative models have always been framed in terms of generating stati…

2019-04-04abs ↗pdf ↗

Determining the programming language of a source code file has been considered in the research community; it has been shown that Machine Learning (ML) and Natural Language Processing (NLP) algorithms can be effective in identifying the programming language of source code files. However, determining the programming lang…

2018-09-21abs ↗pdf ↗

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 ↗

We study the problem of building generative models of natural source code (NSC); that is, source code written and understood by humans. Our primary contribution is to describe a family of generative models for NSC that have three key properties: First, they incorporate both sequential and hierarchical structure. Second…

2014-01-02abs ↗pdf ↗

TreeCaps improves code comprehension for software developers.

problem Processing code efficiently for software developers.
method Tree-based capsule networks for capturing code syntactical structures and dependencies.
result TreeCaps outperforms other approaches in classifying program functionalities.

We develop a privacy-preserving method to summarize distributed datasets under covariate shift.

problem Constructing a training dataset from multiple private sources that matches a target task without privacy leakage.
method Introduced a novel protocol using hash functions and differential privacy mechanisms to minimize private information access.
result Achieved strong differential privacy guarantees while closely matching the performance of non-private greedy algorithms.

We develop a method to summarize causal models with cycles in cubic time.

problem Cycles in high-dimensional causal models limit applicability of existing methods.
method We relax the acyclicity assumption in LiNG models and develop a low-dimensional DAG summary.
result Our method allows recovery of a low-dimensional DAG from high-dimensional data with cycles.

Top 8 robotic vision systems tackled lifelong object recognition challenges.

problem Lifelong learning in robotic vision for varied, dynamic environments.
method Design of a dataset with diverse conditions and rules for evaluation.
result Robotic vision systems improved over time with dynamic object appearances.

In the past few years, neural abstractive text summarization with sequence-to-sequence (seq2seq) models have gained a lot of popularity. Many interesting techniques have been proposed to improve seq2seq models, making them capable of handling different challenges, such as saliency, fluency and human readability, and ge…

2018-12-05abs ↗pdf ↗

This work proposes a meta-learning approach for better adaptation of source code models.

problem Adapting source code models to unseen local contexts.
method Formulated as a meta-learning problem, selecting targeted information for adaptation.
result Improved performance in code auto-completion tasks, especially for identifiers and literals.

The paper optimizes querying schemes for crowdsourced classification using XOR queries.

problem Optimizing querying schemes for crowdsourced classification.
method Modeling crowdsourced labeling/classification as source coding problem, leveraging connections to channel coding.
result Provides querying schemes with almost optimal number of queries, each involving a constant number of labels.

A new algorithm ThreeSieves maximizes submodular functions efficiently in streaming data.

problem Maximizing submodular functions in high-dimensional data streams efficiently.
method ThreeSieves algorithm, designed for streaming data, ignoring worst-case guarantees for high probability solutions.
result ThreeSieves outperforms state-of-the-art methods in terms of performance and resource usage.

This paper studies communication efficiency in federated learning by optimizing the sum-rate-distortion function for indirect multiterminal source coding.

problem Indirect multiterminal source coding in federated learning where edge devices send noisy gradients to the server.
method Analyzes the rate region for the quadratic vector Gaussian CEO problem under unbiased estimator and derives an explicit formula for the sum-rate-distortion function.
result Derives an explicit formula for the sum-rate-distortion function in the special case of identical gradients over edge devices.