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

0.3%0.5%0.8%0.3% · Jul 201819922001200920172026
38 results for in-sourcing

ESS-Flow guides flow models without retraining, using Bayesian inference in source space.

problem Training flow models on paired data for conditional generation or sample production.
method Gradient-free Bayesian inference in source space using Elliptical Slice Sampling.
result Effective in diverse tasks including material design and protein structure prediction.

Transfer learning aims to improve learning in target domain by borrowing knowledge from a related but different source domain. To reduce the distribution shift between source and target domains, recent methods have focused on exploring invariant representations that have similar distributions across domains. However, w…

2017-07-31abs ↗pdf ↗

The Schwarz lemmas are well-known characterizations for holomorphic maps and we exhibit two examples of their applications. For a sequence family of biholomorphisms fjf_j, it is useful to determine the location of fj(q)f_j(q) for a fixed point qq in source manifolds (see Proposition \ref{2.5}). With it, we extend the For…

2014-12-08abs ↗pdf ↗

The paper offers algorithms for managing freelancers and in-house workers in online labor markets.

problem Managing freelancers and in-house workers in online labor markets efficiently.
method Developed algorithms for team formation with outsourcing in an online setting.
result Efficient online algorithms for minimizing costs in hiring and outsourcing.

We consider the problem of developing suitable learning representations (embeddings) for library packages that capture semantic similarity among libraries. Such representations are known to improve the performance of downstream learning tasks (e.g. classification) or applications such as contextual search and analogica…

2019-03-27abs ↗pdf ↗

Multi-source transfer learning has been proven effective when within-target labeled data is scarce. Previous work focuses primarily on exploiting domain similarities and assumes that source domains are richly or at least comparably labeled. While this strong assumption is never true in practice, this paper relaxes it a…

2018-07-06abs ↗pdf ↗

We address the problem of domain generalization where a decision function is learned from the data of several related domains, and the goal is to apply it on an unseen domain successfully. It is assumed that there is plenty of labeled data available in source domains (also called as training domain), but no labeled dat…

2018-07-09abs ↗pdf ↗

Bayesian Experience Reuse improves learning from multiple experts.

problem Learning from multiple experts with conflicting goals.
method Bayesian neural networks with shared features to model uncertainty and derive a probability distribution over expert models.
result BERS method effectively samples demonstrations from the derived distribution to reuse them in new tasks.

Nonnegative matrix factorization (NMF) factorizes a non-negative matrix into product of two non-negative matrices, namely a signal matrix and a mixing matrix. NMF suffers from the scale and ordering ambiguities. Often, the source signals can be monotonous in nature. For example, in source separation problem, the source…

2015-05-01abs ↗pdf ↗

We explore methods of producing adversarial examples on deep generative models such as the variational autoencoder (VAE) and the VAE-GAN. Deep learning architectures are known to be vulnerable to adversarial examples, but previous work has focused on the application of adversarial examples to classification tasks. Deep…

2017-02-22abs ↗pdf ↗

Domain adaptation is an important technique to alleviate performance degradation caused by domain shift, e.g., when training and test data come from different domains. Most existing deep adaptation methods focus on reducing domain shift by matching marginal feature distributions through deep transformations on the inpu…

2019-06-24abs ↗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 ↗

Study on Gaussian interpolation flows for generative modeling.

problem Theoretical properties and regularizing effect of Gaussian denoising in continuous normalizing flows.
method Unified framework of Gaussian interpolation flow, Lipschitz regularity, existence and uniqueness of flow, stability analysis.
result Established theoretical properties of Gaussian interpolation flows, including Lipschitz continuity and existence of flow.

In recent years, deep learning models have shown great potential in source code modeling and analysis. Generally, deep learning-based approaches are problem-specific and data-hungry. A challenging issue of these approaches is that they require training from starch for a different related problem. In this work, we propo…

2019-10-12abs ↗pdf ↗

Graph-based approach repairs programs from diagnostic feedback.

problem Learning to repair programs from limited labeled data and compiler error messages.
method Introduces program-feedback graph and graph neural network for reasoning, and self-supervised learning with unlabeled programs.
result DrRepair significantly outperforms prior work, achieving high repair rates.

Automated sentiment classification (SC) on short text fragments has received increasing attention in recent years. Performing SC on unseen domains with few or no labeled samples can significantly affect the classification performance due to different expression of sentiment in source and target domain. In this study, w…

2018-08-28abs ↗pdf ↗

Proposes a few-shot learning method for feature selection without labeled data.

problem Feature selection in unlabeled data with limited instances.
method Uses Concrete random variables and permutation-invariant neural networks to select features from multiple source tasks.
result Outperforms existing methods in feature selection performance.

Forward translation improves neural machine translation for sentences originally in source language.

problem Improving neural machine translation quality using synthetic data.
method Case study with French-English news translation, separating test sets by original language, analyzing domains, translationese, and noise.
result Forward translation delivers superior gains on sentences originally in source language, complementing back-translation on target language sentences.

We study inference and learning based on a sparse coding model with `spike-and-slab' prior. As in standard sparse coding, the model used assumes independent latent sources that linearly combine to generate data points. However, instead of using a standard sparse prior such as a Laplace distribution, we study the applic…

2012-11-15abs ↗pdf ↗

Interactive machine learning with weak supervision and pre-trained embeddings.

problem Training machine learning models with limited labeled data.
method Use pre-trained embeddings to define a distance function and extend source votes to nearby points.
result Significantly outperforms traditional weakly-supervised and fully-supervised methods.

This study compares transfer learning and self-supervised learning for better model performance.

problem Choosing between transfer learning and self-supervised learning for optimal model performance.
method Comprehensive comparative study of transfer learning and self-supervised learning under various data and task properties.
result Self-supervised learning outperforms transfer learning in certain applications, and vice versa.

CUTS removes corruption from models without clean data, improving utility and security.

problem Removing corruption from models without access to clean training data.
method CUTS uses a proxy set to amplify corruption and subtract it from model weights.
result CUTS recovers a large fraction of lost utility and nearly eliminates attacks with minimal damage.