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

12.5%25.0%37.5%50.0% · May 199319922001200920172026
48 results for Transfer Component Analysis

Study improves Bayesian optimisation with ensemble transfer learning.

problem Improving sample efficiency in Bayesian optimisation of expensive functions.
method Empirical analysis of ensemble-based transfer learning methods and pipeline components.
result Two components (warm start initialisation and positive weight constraint) improve transfer learning Bayesian optimisation performance.

The paper improves classification accuracy by leveraging a shared signal across domains in high-dimensional classification.

problem Improving classification accuracy in high-dimensional data with shared signals across domains.
method Transfer learning for linear discriminant analysis, decomposing mean differences into common and domain-specific components.
result Deterministic limits for transfer performance, leading to optimal weights and corrections for bias.

A new GNN architecture called coVariance neural network (VNN) improves stability and transferability of covariance matrix analysis.

problem Stability and transferability issues in covariance matrix analysis.
method Developed coVariance neural network (VNN) that operates on sample covariance matrices.
result VNN is more stable and transferable than PCA-based approaches.

Research has shown that widely used deep neural networks are vulnerable to carefully crafted adversarial perturbations. Moreover, these adversarial perturbations often transfer across models. We hypothesize that adversarial weakness is composed of three sources of bias: architecture, dataset, and random initialization.…

2018-12-04abs ↗pdf ↗

Transfer knowledge from multiple sources to improve matrix completion.

problem Matrix completion with noisy data.
method Aggregating singular subspaces information from multiple sources to solve a two-way PCA problem and transform into a low-dimensional linear regression.
result Guaranteed statistical efficiency in transforming the high-dimensional target matrix completion problem.

Transfer learning improves MNI's performance in high-dimensional linear regression.

problem Improving model performance in high-dimensional linear regression with diverse data.
method Proposes a Transfer MNI approach, analyzing its excess risk and conditions for outperformance.
result Identifies free-lunch covariate shift regimes where knowledge transfer benefits.

The paper proposes reusable network components by making them compatible across tasks.

problem Training networks for different tasks independently leads to incompatible components.
method The paper splits a network into a features extractor and a target task head, and proposes various approaches to make them compatible.
result The proposed methods produce components that are directly compatible without compromising accuracy on original tasks.

Bayesian model transfers knowledge across different engineering fleets.

problem Data sparsity in predictive models for engineering infrastructure.
method Hierarchical Bayesian approach with multitask learning.
result Improves survival analysis and power prediction in truck fleets and wind farms.

Study improves model fit by transferring info from related datasets.

problem Improving model fit on target data using source data.
method Proposes a transfer learning algorithm for GLMs, derives error bounds, and introduces detection of informative sources.
result Theoretical and practical improvements over classical methods in high-dimensional GLM settings.

Vision transformers benefit from non-smooth components in adaptation.

problem Understanding the role of non-smoothness in vision transformer adaptation.
method Theoretical analysis and extensive experiments on large-scale vision transformers.
result High plasticity of attention modules and feedforward layers leads to better finetuning performance.

UCB-TQL learns from multiple tasks with shared dynamics and adapts to task-specific variations.

problem Transfer reinforcement learning with composite MDPs where tasks share core dynamics but have sparse differences.
method UCB-TQL, a novel transfer RL algorithm for composite MDPs.
result Achieved a regret bound of ildeO(eH5N) ilde{O}(\sqrt{eH^5N}) that scales independently of the ambient dimension.

Deep neural networks trained on a wide range of datasets demonstrate impressive transferability. Deep features appear general in that they are applicable to many datasets and tasks. Such property is in prevalent use in real-world applications. A neural network pretrained on large datasets, such as ImageNet, can signifi…

2019-09-26abs ↗pdf ↗

Training on mixed distributions improves test performance even when components are unrelated.

problem Improving test performance with mismatched training and test distributions.
method Analyzing mixture distributions with different training and test proportions.
result Distribution shift can be beneficial, improving test performance even when components are unrelated.

New model improves transfer learning and semi-supervised learning.

problem Improving transfer learning and semi-supervised learning performance.
method Developed a new conditional energy-based model (ICE-BeeM) based on nonlinear ICA.
result Identifiable representations learned by ICE-BeeM improve performance in transfer learning and semi-supervised learning tasks.

Proves Riemannian positive mass theorem with singularities.

problem Proves Riemannian positive mass theorem for specific types of singular manifolds.
method Uses initial data sets with a second fundamental form to transfer convexity between different singularity components.
result Proves the theorem for manifolds with some mean-concave components and others mean-convex.

The paper tackles transfer learning for growing matrix representations, improving estimation accuracy.

problem Structured matrix estimation under growing ambient dimensions and latent representations.
method Proposes a general transfer framework decomposing target parameters into embedded source components, low-rank innovations, and sparse edits. Develops an anchored alternating projection estimator.
result Establishes deterministic error bounds that separate target noise, representation growth, and source estimation error, yielding improved rates.

This paper improves MI-based BCIs by applying transfer learning across all components.

problem Reducing calibration effort for new subjects in MI-based BCIs.
method Proposes TL in spatial filtering, feature engineering, and classification blocks, and adds data alignment.
result Integrating data alignment and sophisticated TL significantly improves classification performance and reduces calibration effort.

New framework explains fast transfer of hyperparameters across model scales.

problem Understanding and optimizing hyperparameters for large-scale models.
method Developed a conceptual framework for HP transfer across scale, showing fast transfer is equivalent to useful transfer for compute-optimal grid search.
result Fast transfer of hyperparameters is equivalent to useful transfer for compute-optimal grid search, offering asymptotic computational advantage.

VNNs transfer well across datasets for brain age prediction using cortical thickness features.

problem Predicting brain age using anatomical features.
method Transferability of coVariance neural networks (VNNs) in brain age prediction.
result VNNs can assign anatomical interpretability to elevated brain age gap in AD.

We investigate metric learning in the context of dynamic time warping (DTW), the by far most popular dissimilarity measure used for the comparison and analysis of motion capture data. While metric learning enables a problem-adapted representation of data, the majority of methods has been proposed for vectorial data onl…

2016-10-17abs ↗pdf ↗

Mathematical framework for transfer learning feasibility and transfer risk.

problem Theoretical analysis of transfer learning.
method Reformulated transfer learning as an optimization problem, introduced transfer risk concept.
result Demonstrated the potential and benefits of incorporating transfer risk in transfer learning evaluation.

Paper evaluates membership inference attacks on transfer learning models.

problem Evaluating membership inference attacks on transfer learning models.
method Shadow model training strategy to derive data for membership inference classifier.
result Membership inference attacks can achieve effective performance against transfer learning models.

Enhances FDA for robust, efficient federated learning.

problem Domain shift challenges in federated learning models.
method Introduces RF-TCA to accelerate computation and extends it to FDA setting with FedRF-TCA.
result Communication complexity independent of sample size, superior performance and robustness.

The paper analyzes phase transitions in transfer learning for perceptrons.

problem Understanding when transfer learning from a source task to a target task is beneficial.
method Theoretical analysis of a pair of related perceptron learning tasks.
result Reveals a phase transition from negative to positive transfer as task similarity changes.

In terms of transfer entropy, we investigated the strength and the direction of information transfer in the US stock market. Through the directionality of the information transfer, the more influential company between the correlated ones can be found and also the market leading companies are selected. Our entropy analy…

2005-09-02abs ↗pdf ↗

We extend the theoretical analysis of a recently proposed single subspace learning algorithm, called Dual Principal Component Pursuit (DPCP), to the case where the data are drawn from of a union of hyperplanes. To gain insight into the properties of the 1\ell_1 non-convex problem associated with DPCP, we develop a geo…

2017-06-06abs ↗pdf ↗

TX-Ray analyzes and quantifies model knowledge transfer in NLP.

problem Insufficient methods for explaining and quantifying model knowledge transfer in NLP.
method Modified computer vision explainability principle to NLP, visualizing feature preference distributions.
result TX-Ray reveals how self-supervised models learn linguistic abstractions and improves generalization.

Enhancing spectral embedding for low-dimensional embeddings in rare disease cohorts

problem Representing clinical concepts and patients in electronic health records
method Spectral-based unsupervised learning with flexible knowledge transfer
result Outperforms competing approaches in challenging scenarios

G5 universal GRAPH-BERT learns graph representations across different datasets.

problem Learning graph representations across diverse graph datasets with distinct input and output configurations.
method G5 introduces a pluggable model architecture with input and output components for each graph data source, connected via a unified layer and fusion layer.
result G5 removes obstacles for cross-graph representation learning and transfer, even for sparse data.

When labeled data is scarce for a specific target task, transfer learning often offers an effective solution by utilizing data from a related source task. However, when transferring knowledge from a less related source, it may inversely hurt the target performance, a phenomenon known as negative transfer. Despite its p…

2018-11-24abs ↗pdf ↗

Proposes a transfer learning method for high-dimensional quantile regression.

problem Inadequate handling of heterogeneity and heavy tails in transfer learning.
method High-dimensional quantile regression framework with double transfer learning estimator.
result Established error bounds and valid confidence intervals for high-dimensional quantile regression coefficients.

TabSurv adapts tabular neural networks for survival analysis.

problem Survival analysis on tabular data using deep learning methods.
method Adapts modern tabular architectures to survival analysis using Weibull distribution or non-parametric prediction. Optimizes SurvHL histogram loss function.
result TabSurv consistently outperforms classical and deep learning baselines on 10 real-world survival datasets.

Variational auto-encoder frameworks have demonstrated success in reducing complex nonlinear dynamics in molecular simulation to a single non-linear embedding. In this work, we illustrate how this non-linear latent embedding can be used as a collective variable for enhanced sampling, and present a simple modification th…

2018-01-02abs ↗pdf ↗

This paper proposes a TL method for SOH estimation of lithium-ion batteries.

problem Accurately estimating battery SOH to prevent unexpected failures.
method Temporal synchronization and distribution similarity analysis for transfer learning.
result The proposed method achieves a root mean squared error of 0.0034, improving accuracy by 77%.

DRUM transfers cardiac arrest models across registries with missing covariates.

problem Clinical prediction models fail when key training covariates are unavailable at deployment.
method DRUM transfers models to target populations with structurally missing covariates, optimizing worst-case predictive performance over unknown target distributions.
result DRUM yields better-calibrated predictions and improved clinical classification performance across sites.

Paper proposes a method to combine multiple facial analysis models for better performance.

problem Facial analysis models from different sources have low transferability.
method Two-step process: 1) Auto-encoder for common embedding, 2) Distillation for lightweight model.
result Lightweight model outperforms state-of-the-art on 15 facial analysis tasks.

We analyze a simple asset transfer model in which the transfer amount is a fixed fraction ff of the giver's wealth. The model is analyzed in a new way by Laplace transforming the master equation, solving it analytically and numerically for the steady-state distribution, and exploring the solutions for various values o…

2010-04-29abs ↗pdf ↗