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

120241361481 · Jun 202019922001200920172026
48 results for source code adaptation

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.

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 MDDA for multi-source domain adaptation.

problem Performance decay in deep neural networks due to domain shift between labeled and unlabeled data.
method Multi-source distilling domain adaptation (MDDA) network considering multiple source distributions and target similarities.
result Significantly outperforms state-of-the-art approaches on public DA benchmarks.

Unsupervised domain adaptation techniques have been successful for a wide range of problems where supervised labels are limited. The task is to classify an unlabeled `target' dataset by leveraging a labeled `source' dataset that comes from a slightly similar distribution. We propose metric-based adversarial discriminat…

2018-07-06abs ↗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 ↗

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 ↗

AI agents improve forecast combination in empirical economics.

problem Hidden researcher degrees of freedom in AI-generated code.
method Adapted agent-loop architecture to empirical economics, added holdout evaluation.
result Independent agent searches find better forecast methods than benchmarks.

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.

Paper tackles MSDA with GMMs and OT, improving over prior art.

problem Adapting multiple heterogeneous source measures to a target measure.
method Optimal Transport between Gaussian Mixture Models, with novel barycenter calculation.
result Improves image classification and fault diagnosis benchmarks.

Many software analysis methods have come to rely on machine learning approaches. Code segmentation - the process of decomposing source code into meaningful blocks - can augment these methods by featurizing code, reducing noise, and limiting the problem space. Traditionally, code segmentation has been done using syntact…

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

Gradual domain adaptation improves model transfer between domains with intermediate training.

problem Challenges in unsupervised domain adaptation when distribution shifts are large.
method Gradual self-training using intermediate domains along the Wasserstein geodesic.
result GOAT framework generates intermediate domains for improved adaptation.

Optimal transport aligns source and target distributions for domain adaptation.

problem Unsupervised domain adaptation with joint class-conditional and label shifts.
method Minimizes importance weighted loss and Wasserstein distance for aligned marginals and class-conditional distributions.
result Our method outperforms competitors on various domain adaptation tasks.

FinGPT democratizes financial data for LLMs, enabling innovation.

problem Limited financial text datasets and disparities between general and financial text data.
method Automates collection and curation of real-time financial data from diverse Internet sources, fine-tuning with RLSP and LoRA.
result Democratizes access to financial data for LLMs, enabling innovation.

LiteMORT reduces memory usage for GBDT models by 30% with improved accuracy.

problem Memory inefficiency in GBDT models, especially with adaptive compact distributions.
method Share memory, implicit merging, adaptive histogram resizing.
result Significant reduction in memory usage with improved accuracy.

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.

PETAL adapts models to changing target domains over time.

problem Lifelong test-time adaptation in changing target domains.
method Probabilistic framework with student-teacher model and data-driven parameter restoration.
result PETAL achieves better results than state-of-the-art for online lifelong test-time adaptation.

Paper proposes an online adaptation algorithm for improving model performance.

problem Improving model fidelity in real-time for domain shift and time variance.
method Extended Kalman Filter with Exponential Moving Average and Dynamic Multi-Epoch strategy.
result Proposed algorithm outperforms existing methods in experiments.

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 ↗

Dagma-DCE improves causal discovery with interpretable measures and open-source code.

problem Arbitrary proxy measures of causal strength in non-parametric causal discovery.
method Uses weighted adjacency matrices based on an interpretable measure of causal strength.
result Achieves state-of-the-art performance in simulated datasets.

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 ↗

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 ↗

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.

Mix-up domain adaptation improves dynamic RUL predictions across various conditions.

problem Dynamic RUL predictions under non-i.i.d conditions.
method Three-staged mechanism with mix-up strategy for source and target domains alignment, self-supervised learning.
result MDAN outperforms existing methods in 12 out of 12 cases for dynamic RUL predictions.

An adaptive clustering algorithm learns from evolving data without manual tuning.

problem Clustering in dynamic data environments where distributions change over time.
method ART-based topological clustering with self-adjusting vigilance parameter.
result The algorithm outperforms state-of-the-art methods in clustering performance and continual learning.

Paper models and compresses wideband CSI feedback in FDD MIMO systems.

problem Fundamental limits of channel state information (CSI) feedback in FDD massive MIMO systems.
method Modeling CSI as a Gaussian-mixture source with latent geometry states, proposing Gaussian-mixture transform coding (GMTC).
result Near-optimal CSI compression achieved through state-adaptive transform coding without large neural encoders.

New approach improves domain adaptation with label shift assumptions.

problem Improving domain adaptation when label distributions differ between source and target domains.
method Proposes generalized label shift (GLSGLS) and modifies three DA algorithms (JAN, DANN, CDAN) to handle label distribution mismatches.
result Modified DA algorithms outperform base versions, especially with large label distribution mismatches.

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 ↗

Sparse coding in learned dictionaries has been established as a successful approach for signal denoising, source separation and solving inverse problems in general. A dictionary learning method adapts an initial dictionary to a particular signal class by iteratively computing an approximate factorization of a training …

2012-05-28abs ↗pdf ↗