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

54107161214 · May 202619922001200920172026
48 results for transfer principle

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.

ATLAS separates invariant and transferable latent factors across diverse environments.

problem Transfer learning and robust prediction in heterogeneous environments.
method ATLAS leverages invariance principle to disentangle latent factors and uses auxiliary labels for robust prediction.
result Near-oracle performance and robust transferable prediction in new environments.

Framework for transferring discount curve estimates across fixed-income product classes.

problem Challenges in estimating discount curves from sparse or noisy data.
method Proposes a vector-valued kernel ridge regression (KR) framework with economic regularization.
result Transfer learning tightens confidence intervals and improves extrapolation performance.

nGPT learns to transfer learning rates across model dimensions and token horizons.

problem nGPT does not transfer learning rates across model size and token horizon.
method Combining numerical experiments with alignment exponents, a novel nGPT parameterization νGPT is developed.
result νGPT exhibits learning rate transfer across width, depth, and token horizon.

Transfer learning has received a lot of attention in the machine learning community over the last years, and several effective algorithms have been developed. However, relatively little is known about their theoretical properties, especially in the setting of lifelong learning, where the goal is to transfer information…

2013-11-12abs ↗pdf ↗

We explain how the Transference Principles from Diophantine approximation can be interpreted in terms of geometry of the locally symmetric spaces Tn=SO(n)\SL(n,R)/SL(n,Z)T_n=SO(n) \backslash SL(n,R) /SL(n,Z) with n>1n>1, and how, via this dictionary, they become transparent geometric remarks and can be easily proved. Indeed, a finite family …

2008-11-02abs ↗pdf ↗

Parameters in deep neural networks which are trained on large-scale databases can generalize across multiple domains, which is referred as "transferability". Unfortunately, the transferability is usually defined as discrete states and it differs with domains and network architectures. Existing works usually heuristical…

2018-04-23abs ↗pdf ↗

Transfer learning aims at transferring knowledge from a well-labeled domain to a similar but different domain with limited or no labels. Unfortunately, existing learning-based methods often involve intensive model selection and hyperparameter tuning to obtain good results. Moreover, cross-validation is not possible for…

2019-04-02abs ↗pdf ↗

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.

Recently, in order to explore the mechanism behind wealth or income distribution, several models have been proposed by applying principles of statistical mechanics. These models share some characteristics, such as consisting of a group of individual agents, a pile of money and a specific trading rule. Whatever the trad…

2005-07-21abs ↗pdf ↗

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.

We investigate the use of sparse coding and dictionary learning in the context of multitask and transfer learning. The central assumption of our learning method is that the tasks parameters are well approximated by sparse linear combinations of the atoms of a dictionary on a high or infinite dimensional space. This ass…

2012-09-04abs ↗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.

The paper uses thermodynamics to improve machine learning representation quality.

problem Improving the quality of learned representations for transfer learning.
method Formal connection with thermodynamics, iso-classification process, traversing the equilibrium surface.
result Demonstrates how to transfer representations while keeping classification loss constant.

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.

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.

Though the deep learning is pushing the machine learning to a new stage, basic theories of machine learning are still limited. The principle of learning, the role of the a prior knowledge, the role of neuron bias, and the basis for choosing neural transfer function and cost function, etc., are still far from clear. In …

2017-04-23abs ↗pdf ↗

Deep Neural Networks are vulnerable to adversarial attacks even in settings where the attacker has no direct access to the model being attacked. Such attacks usually rely on the principle of transferability, whereby an attack crafted on a surrogate model tends to transfer to the target model. We show that an ensemble o…

2019-01-28abs ↗pdf ↗

New framework using Jensen-Shannon divergence improves domain adaptation theory.

problem Incoherence between empirical domain adversarial training and theoretical H\mathcal{H}-divergence.
method Established new theoretical framework based on Jensen-Shannon divergence, derived bi-directional upper bounds.
result Framework exhibits flexibilities for various transfer learning problems.

Unsupervised domain transfer is the task of transferring or translating samples from a source distribution to a different target distribution. Current solutions unsupervised domain transfer often operate on data on which the modes of the distribution are well-matched, for instance have the same frequencies of classes b…

2019-05-29abs ↗pdf ↗

This paper explores how imperfect reward models can improve online RLHF.

problem Sample efficiency in online RLHF from imperfect reward models.
method Identifies policy coverability and proposes TPO algorithm for transfer learning.
result TPO algorithm improves sample efficiency compared to standard online learning.

Proposes a method to improve treatment policies in data-scarce clinical settings.

problem Improving treatment policies in data-scarce clinical settings with unobserved confounding.
method Uses a causal mechanism to model the underlying generative process and augments counterfactual trajectories with source domain priors.
result Significantly improves treatment policy performance in a simulated sepsis treatment task.

New model predicts radiative properties of nanoparticle layers with high accuracy and uncertainty.

problem Predicting radiative properties of nanoparticle embedded layers accurately and with uncertainty.
method Conditional normalizing flows learn conditional distributions of optical outputs given input parameters.
result The model achieves high predictive accuracy and reliable uncertainty estimates.

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 ↗

Study controlled contagion with state-dependent killing, proving a comparison principle.

problem Analyzing controlled McKean--Vlasov contagion with state-dependent killing.
method Proof of a comparison principle using Wasserstein smooth-gauge comparison and killing-jump absorption estimates.
result Established a comparison principle for the two-population killed-particle HJB.

Unified approach to domain generalization by aligning gradients and Hessians.

problem Developing models that generalize well across unseen domains.
method Moment Alignment, extending transfer measure to DG, aligning derivatives across domains.
result Moment Alignment unifies gradient and Hessian matching approaches, improving generalizability.

In multi-task learning, a learner is given a collection of prediction tasks and needs to solve all of them. In contrast to previous work, which required that annotated training data is available for all tasks, we consider a new setting, in which for some tasks, potentially most of them, only unlabeled training data is …

2016-02-21abs ↗pdf ↗

ShotgunCSP predicts crystal structures using machine learning, achieving high accuracy with minimal computation.

problem Predicting stable or metastable crystal structures of large systems.
method Noniterative screening using transfer learning and generative models.
result ShotgunCSP achieves 93.3% accuracy in benchmark tests with 90 different crystal structures.

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.

This work investigates how neural collapse improves transfer learning for large-scale models.

problem Improving transfer learning for large-scale models with limited labeled data.
method Investigates neural collapse and develops a fine-tuning method using skip-connections.
result Feature collapse on downstream data correlates with higher transfer accuracy.

Smooth structures on diffeological spaces and sheaves, resolving conjectures.

problem Model structures on diffeological spaces and sheaves of sets.
method Embedding diffeological spaces into sheaves of sets, studying combinatorial model structures, and proving equivalence to simplicial sets.
result Established a model structure on sheaves of sets that is Quillen equivalent to simplicial sets and has properties like cartesian and cofibrant smooth manifolds.

Compared with shallow domain adaptation, recent progress in deep domain adaptation has shown that it can achieve higher predictive performance and stronger capacity to tackle structural data (e.g., image and sequential data). The underlying idea of deep domain adaptation is to bridge the gap between source and target d…

2018-11-15abs ↗pdf ↗

One-step Bellman alignment improves online RL by reducing task mismatch.

problem Online RL struggles with task similarity defined by rewards or transitions.
method One-step Bellman alignment and re-weighted targeting (RWT) to correct task mismatch.
result Regret bounds show task shift complexity, not target MDP, affects performance.

Paper tackles efficient IRL in offline settings with polynomial samples and runtime.

problem Efficiently learning reward functions from expert demonstrations in offline settings.
method Adapting the pessimism principle for offline RL, achieving strong guarantees.
result Achieved efficient IRL in offline and online settings with polynomial samples and runtime.