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

Trend · papers per month

6491,2981,9462,595 · Jun 202019922001200920172026
48 results for theory of transfer

We analyze a monetary system of random money transfer on the basis of double entry bookkeeping. Without boundary conditions, we do not reach a price equilibrium and violate text-book formulas of economists quantity theory (MV=PQ). To match the resulting quantity of money with the model assumption of a constant price, w…

2002-11-06abs ↗pdf ↗

Analyzes string topology operations using Chen's integrals and homotopy transfer.

problem Relating string topology to perturbative Chern-Simons theory.
method Develops integrals over configuration spaces and applies homotopy transfer.
result Intertwines involutive Lie bialgebra structures on homology.

Paper constructs a transfer map for codimension 2 submanifolds in higher index theory.

problem Higher index theory of codimension 2 submanifolds.
method Construction of codimension 2 transfer map and adjoint relationship with cyclic cohomology.
result Established adjoint relationship between codimension 2 transfer map and co-transfer map in cyclic cohomology.

Paper analyzes AIRL in high-dimensional spaces using random matrix theory.

problem AIRL's performance challenges in high-dimensional environments.
method Examined the rank of the matrix derived from transition matrix, applied random matrix theory.
result High-dimensional scenarios reveal transfer limitations not inherent to AIRL framework.

New theory explains when pre-trained models can improve downstream tasks.

problem Lack of theoretical understanding of task similarity for transfer learning.
method Feature-centric viewpoint, theoretical results on transferability phase diagram.
result Transfer learning outperforms training from scratch when target task is well represented in feature space.

New research on limits of transfer learning, proving key selection and dependence requirements.

problem Insufficient theoretical foundation for transfer learning.
method Proved novel results on transfer learning, emphasizing selection of information and dependence between domains.
result Upper bound on improvement possible with transfer learning, highlighting the need for careful selection.

We propose a general notion of algebraic gauge theory obtained via extracting the main properties of classical gauge theory. Building on a recent work on transferring curved AA_{\infty}-structures we show that, under certain technical conditions, algebraic gauge theories can be transferred along chain contractions. Sp…

2014-11-25abs ↗pdf ↗

A new framework for robust transfer learning that avoids negative transfer in domains with unequal information.

problem Negative transfer in unsupervised domain adaptation, especially when source and target domains have different levels of informativeness.
method Decision-theoretic framework based on Le Cam's theory of statistical experiments, using constructive approximations to replace strict invariance with directional simulability.
result Le Cam Distortion achieves near-perfect frequency estimation and zero source utility loss in various domains, demonstrating superior performance compared to traditional methods.

We analyze Gibbs-based transfer learning algorithms using information theory.

problem Understanding the generalization error of transfer learning.
method Information-theoretic analysis focusing on αα-weighted-ERM and two-stage-ERM.
result Exact characterization of generalization behavior using conditional symmetrized KL information.

Residual networks with depthwise hyperparameter scaling transfer optimal hyperparameters across width and depth.

problem The challenge of hyperparameter tuning in deep learning, especially for large models.
method Combining μμP parameterization with residual networks having a residual branch scale of 1/extdepth1/\sqrt{ ext{depth}}.
result Optimal hyperparameters transfer across width and depth in residual networks trained with this parameterization.

We extend graph neural networks to transfer performance across different input sizes.

problem Transferability of graph neural networks across varying input dimensions.
method Introduce a general framework for transferability across dimensions, showing it corresponds to continuity in a limit space.
result Transferability of graph neural networks is driven by data and learning task, and can be ensured with design principles.

Transfer learning has been proven effective when within-target labeled data is scarce. A lot of works have developed successful algorithms and empirically observed positive transfer effect that improves target generalization error using source knowledge. However, theoretical analysis of transfer learning is more challe…

2018-10-14abs ↗pdf ↗

Adversarial training enhances model transferability without sacrificing accuracy.

problem The principle of minimal information in classification models is challenged by adversarial training.
method Investigation of the dual relationship between adversarial training and information theory.
result Adversarial training improves linear transferability and introduces a trade-off between transferability and source task accuracy.

This paper introduces localized discrepancy theories for unsupervised domain adaptation.

problem Improving generalization bounds for unsupervised domain adaptation.
method Localized discrepancies defined on the hypothesis space after localization, leading to smaller and asymmetric values.
result Improved generalization bounds and sample complexity reduction.

This paper extends transfer operator theory to McKean-Vlasov equations.

problem Analyzing the behavior of complex dynamical systems using transfer operators.
method Extended dynamic mode decomposition and Galerkin projection.
result Finite-dimensional approximations of transfer operators computed.

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.

CONCERT improves transfer learning by borrowing partial information from auxiliary datasets.

problem Inefficiency of global similarity measures in transfer learning for high-dimensional data.
method Conditional spike-and-slab prior with covariate-specific priors for robust partial information transfer.
result CONCERT achieves variable selection and information transfer simultaneously, improving performance on the target.

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.

Transfer learning is a very important tool in deep learning as it allows propagating information from one "source dataset" to another "target dataset", especially in the case of a small number of training examples in the latter. Yet, discrepancies between the underlying distributions of the source and target data are c…

2019-04-02abs ↗pdf ↗

This work extends GNNs to handle multiple graphs with non-commuting operators, proving transferability.

problem Handling multiple graphs with non-commuting operators in graph neural networks.
method Developed a mathematical theory for graph-tuple neural networks (GtNNs) with non-commuting non-expansive operators.
result Proved universal transferability of GtNNs, ensuring no non-transferable energy under convergence.

Novel AMP framework for multi-environment transfer learning.

problem Characterizing risk of Lasso-based transfer learning estimators.
method Multi-Environment Generalized Long AMP (multi-environment GLAMP) framework.
result Precise characterization of the risk of three Lasso-based transfer learning estimators.

The paper examines Adaptive Lasso and Transfer Lasso, highlighting their differences and proposing a new method.

problem Comparing and contrasting Adaptive Lasso and Transfer Lasso.
method Theoretical analysis of asymptotic properties and introduction of a new method.
result The Transfer Lasso method reduces non-asymptotic estimation errors compared to Adaptive Lasso.

A Systemic Optimal Risk Transfer Equilibrium (SORTE) was introduced in: "Systemic optimal risk transfer equilibrium", Mathematics and Financial Economics (2021), for the analysis of the equilibrium among financial institutions or in insurance-reinsurance markets. A SORTE conjugates the classical Bühlmann's notion of a …

2019-12-27abs ↗pdf ↗

Transfer learning is a popular practice in deep neural networks, but fine-tuning of large number of parameters is a hard task due to the complex wiring of neurons between splitting layers and imbalance distributions of data in pretrained and transferred domains. The reconstruction of the original wiring for the target …

2017-10-20abs ↗pdf ↗

A transfer learning method builds high-dimensional models using disparate datasets.

problem Building comprehensive prediction models with small sample sizes and limited features.
method Transfer learning approach using external data to build a reduced model and apply calibration equations.
result Proposes a penalized generalized method of moment framework for inference and one-step estimation.

New methods avoid spectral pollution in transfer operators for accurate analysis.

problem Spectral pollution in finite-dimensional approximations of transfer operators.
method Algorithms for computing spectral properties of transfer operators without spectral pollution.
result Accurate spectral estimation across various applications, including protein folding models.

Proposes improved classification via transfer learning with regularized linear discriminant analysis.

problem High dimensionality and small sample sizes lead to poor classification performance.
method Regularized random-effects linear discriminant analysis, combining ridge estimates from target and source models.
result Explicit derivation of asymptotic weights and classification error rates in high-dimensional settings.

A simple strategy prevents negative transfer in transfer learning.

problem Negative transfer in transfer learning where source representations harm target performance.
method Residual feature integration with a trainable target-side encoder.
result The method provably prevents negative transfer with theoretical guarantees.

This paper examines allocation mechanisms in markets with transfer costs, showing how these costs affect economic efficiency.

problem Transfer costs in decentralized exchange markets reduce economic efficiency.
method An axiomatic study of allocation mechanisms in the presence of transfer costs, providing robust and conditional mean allocation mechanisms.
result Robust and conditional mean allocation mechanisms are identified, relating to risk sharing in agent pools.

We construct Hodge filtered cohomology groups for complex manifolds that combine the topological information of generalized cohomology theories with geometric data of Hodge filtered holomorphic forms. This theory provides a natural generalization of Deligne cohomology. For smooth complex algebraic varieties, we show th…

2012-12-10abs ↗pdf ↗

The paper analyzes how combining samples from two tasks can improve performance, especially in high dimensions.

problem Understanding when combining samples from two related tasks outperforms learning with one task alone.
method Applying random matrix theory to high-dimensional linear regression, focusing on proportional sample size increases.
result Precise high-dimensional asymptotics for bias and variance of HPS estimator, showing phase transitions in transfer performance.

New method uses correlation-ratio for transfer learning, improving target model inference.

problem Difficulty in meeting similarity condition for transfer learning.
method Introduces linear correlation-ratio for building accurate relationships between models.
result Improves inference on target model by transferring information from source models.

This paper analyzes HTL using stability theory for binary classification.

problem Analyzing HTL's theoretical behavior in binary classification tasks.
method Stability analysis of regularized empirical risk minimizers.
result Derives generalization bounds for training error, excess risk, and cross-validation.

A method for disentangling text representations without supervision.

problem Challenges in learning disentangled representations of natural language.
method Information-theoretic guidance to induce independent style and content embeddings.
result High quality disentangled representations in terms of content and style preservation.

Paper improves AIRL by enhancing policy imitation and addressing reward recovery issues.

problem Inadequate policy imitation and limited transferable reward recovery in AIRL.
method Substituted built-in algorithm with SAC for policy updating and proposed PPO-AIRL + SAC hybrid framework.
result SAC improves policy imitation but hinders reward recovery; PPO-AIRL + SAC achieves satisfactory transfer effect.

This paper quantifies hyperparameter transfer and finds embedding layer learning rate is key.

problem Quantifying optimal hyperparameters for large language models across scales.
method Developed three metrics to quantify hyperparameter transfer and investigated the importance of embedding layer learning rate.
result Maximal Update (μP) parameterization offers high-quality learning rate transfer compared to standard parameterization (SP).

The paper proves a generalized inverse function theorem for curved LL_\infty spaces.

problem Proving a generalized inverse function theorem for curved LL_\infty spaces.
method Obstruction theory for LL_\infty homomorphisms and homotopy transfer theorem for curved LL_\infty algebras.
result A morphism of curved LL_\infty spaces which is a quasi-isomorphism at a point has a local homotopy inverse.