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,657 papers · 148 categories

Trend · papers per month

174348522696 · Jun 202019922001200920172026
48 results for source tasks

New algorithm combines curriculum learning with HER for complex object manipulation tasks.

problem Learning complex sequential object manipulation tasks from scratch is challenging.
method Curriculum learning with Hindsight Experience Replay (HER) for recurrent object manipulation tasks.
result Significant improvement in learning sequential object manipulation tasks compared to vanilla-HER.

Paper proposes a method to identify negative transfers in multitask learning using surrogate models.

problem Identifying subsets of source tasks that improve target task performance in multitask learning.
method Surrogate modeling to precompute multitask learning performances and approximate them with a linear regression model.
result The approach predicts negative transfers from multiple source tasks to target tasks more accurately than existing methods.

Training a source model optimally for its own task is suboptimal for downstream transfer.

problem The optimality of a source model for its own task hinders downstream transfer performance.
method Analyzes L2-SP ridge regression, characterizes transfer-optimal source penalty, and identifies alignment-dependent effects.
result Transfer benefits from stronger source regularization when aligned imperfectly, and from weaker regularization when aligned perfectly.

Method transfers knowledge without label overlap, source data, or target architecture consistency.

problem Difficulties in transfer learning due to label mismatch, restricted source data, and specialized target architectures.
method Uses deep generative models in two stages: pseudo pre-training and pseudo semi-supervised learning.
result Outperforms scratch training and knowledge distillation methods.

Recent advancements in language representation models such as BERT have led to a rapid improvement in numerous natural language processing tasks. However, language models usually consist of a few hundred million trainable parameters with embedding space distributed across multiple layers, thus making them challenging t…

2019-12-10abs ↗pdf ↗

A new meta-learning framework that assigns weights to source tasks based on target samples.

problem Learning initialization for target tasks with limited labeled examples.
method A general framework that assigns weights to the loss of different source tasks, which can depend on the target samples. Provides upper bounds and develops a learning algorithm based on minimizing the error bound with respect to an empirical IPM.
result Empirically, the weighted meta-learning algorithm finds better initializations than uniformly-weighted meta-learning algorithms.

We consider the transfer of experience samples (i.e., tuples < s, a, s', r >) in reinforcement learning (RL), collected from a set of source tasks to improve the learning process in a given target task. Most of the related approaches focus on selecting the most relevant source samples for solving the target task, but t…

2018-05-28abs ↗pdf ↗

Integrates multiple datasets to solve open set crowdsourcing problems.

problem Crowdsourcing with unknown label space and unfamiliar tasks.
method Integrates multiple crowdsourced datasets, weights them based on category correlation, and uses open set transfer learning.
result Proves OSCrowd solves open set crowdsourcing problems and outperforms related solutions.

This study tackles offline RL with perturbed data sources, deriving a lower bound and proposing an optimal algorithm.

problem Understanding offline RL with multiple perturbed data sources.
method Derives an information-theoretic lower bound, proposes HetPEVI algorithm considering sample and source uncertainties.
result HetPEVI is optimal up to a polynomial factor of the horizon length and can solve offline RL tasks.

The study analyzes transfer learning in infinite-width neural networks, improving generalization on target tasks.

problem Improving generalization in neural networks when using pretraining on a source task.
method Developed a theory under gradient flow for infinitely wide networks, analyzing fine-tuning and joint pretraining.
result Summary statistics of randomly initialized networks after pretraining are adaptive kernels that depend on both source and target data.

SMART transfers knowledge across related studies for multi-task learning.

problem Deterioration of multi-task learning performance with small target sample size.
method SMART assumes spectral similarity between source and target models, estimating target coefficients through structured regularization.
result SMART achieves near-minimax error rates, improving estimation accuracy and robustness to negative transfer.

Novel hyperparameter optimization for target tasks under covariate shift.

problem Hyperparameter optimization under multi-source covariate shift.
method Construct variance reduced estimator to unbiasedly approximate target objective; propose no-regret hyperparameter optimization procedure.
result Proposed framework broadens applications of automated hyperparameter optimization.

This paper introduces a novel deep learning based method, named bridge neural network (BNN) to dig the potential relationship between two given data sources task by task. The proposed approach employs two convolutional neural networks that project the two data sources into a feature space to learn the desired common re…

2019-06-26abs ↗pdf ↗

FinRobot opens-source AI for financial tasks, breaking down complex problems.

problem Barriers to AI adoption in finance due to proprietary data and specialized knowledge.
method Develops open-source AI agent platform with four layers: Financial AI Agents, LLM Algorithms, LLMOps/DataOps, and Foundation Models.
result FinRobot democratizes AI access for financial analysis.

The paper provides guarantees for learning nonlinear representations from multiple non-identically distributed data sources.

problem Learning from non-identically distributed and dependent data.
method Established statistical guarantees for learning general nonlinear representations from multiple data sources.
result The excess risk of the estimated function decays as a function of the sample complexity and task diversity.

Magnetoencephalography and electroencephalography (M/EEG) are non-invasive modalities that measure the weak electromagnetic fields generated by neural activity. Estimating the location and magnitude of the current sources that generated these electromagnetic fields is a challenging ill-posed regression problem known as…

2019-10-03abs ↗pdf ↗

XMixup improves transfer learning accuracy by 1.9% with less training time.

problem Efficiently transfer knowledge from large source datasets to target tasks with small samples.
method Cross-domain Mixup technique that selects auxiliary samples from source datasets and augments training samples via mixup strategy.
result Improves accuracy by 1.9% on average over six real-world transfer learning datasets.

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.

Source separation for music is the task of isolating contributions, or stems, from different instruments recorded individually and arranged together to form a song. Such components include voice, bass, drums and any other accompaniments.Contrarily to many audio synthesis tasks where the best performances are achieved b…

2019-11-27abs ↗pdf ↗

Spatial blind source separation simplifies multivariate spatial prediction.

problem Predicting multivariate measurements at unobserved locations with spatial dependencies.
method Spatial blind source separation as a pre-processing tool compared to Cokriging and neural networks.
result Spatial blind source separation simplifies spatial prediction by avoiding cross-dependencies.

DeltaBO accelerates Bayesian optimization with theoretical guarantees.

problem Improving Bayesian optimization performance through knowledge transfer.
method DeltaBO algorithm that transfers knowledge from related source tasks to target tasks using the difference function.
result DeltaBO achieves a regret bound of O~(T(T/N+γδ))\widetilde{O}(\sqrt{T (T/N + γ_δ)}), significantly better than existing methods.

A number of modern learning tasks involve estimation from heterogeneous information sources. This includes classification with labeled and unlabeled data as well as other problems with analogous structure such as competitive (game theoretic) problems. The associated estimation problems can be typically reduced to solvi…

2012-12-12abs ↗pdf ↗

Combines foundation models with weak supervision to improve NLP and video tasks.

problem Leveraging weak supervision with foundation models without labeled data.
method Liger, a combination of foundation model embeddings and weak supervision techniques.
result Liger outperforms existing weak supervision methods by 14.1 points on benchmark NLP and video tasks.

Fine-tuned open-source LLMs match or exceed closed-source models in social science research.

problem Limited scalability and high costs of large LLMs in social science research.
method Fine-tuning open-source models for specific tasks, exploring training set size effects, proposing hybrid workflow.
result Small, fine-tuned open-source LLMs achieve equal or superior performance to commercial alternatives.

Considering a mixed signal composed of various audio sources and recorded with a single microphone, we consider on this paper the blind audio source separation problem which consists in isolating and extracting each of the sources. To perform this task, nonnegative matrix factorization (NMF) based on the Kullback-Leibl…

2019-07-04abs ↗pdf ↗

This paper benchmarks FinGPT for financial datasets using open-source large language models.

problem Challenges in integrating GPT-based models with financial datasets.
method Instruction Tuning paradigm for open-source large language models adapted for financial contexts.
result Demonstrates the effectiveness and adaptability of FinGPT in financial tasks.

This paper addresses unsupervised domain adaptation, the setting where labeled training data is available on a source domain, but the goal is to have good performance on a target domain with only unlabeled data. Like much of previous work, we seek to align the learned representations of the source and target domains wh…

2019-09-26abs ↗pdf ↗

PLRM synthesizes labels from mismatched sources for better training sets.

problem Creating labeled training sets is a major challenge in machine learning.
method PLRM uses probabilistic modeling to synthesize labels from indirect supervision sources with different output spaces.
result PLRM outperforms baselines by 2%-9% on various tasks.

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 ↗