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

Trend · papers per month

68136204272 · Jun 202019922001200920172026
48 results for transfer map

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.

We consider a transfer-learning problem by using the parameter transfer approach, where a suitable parameter of feature mapping is learned through one task and applied to another objective task. Then, we introduce the notion of the local stability and parameter transfer learnability of parametric feature mapping,and th…

2016-10-27abs ↗pdf ↗

We record various properties of twisted Becker-Gottlieb transfer maps and study their multiplicative properties analogous to Becker-Gottlieb transfer. We show these twisted transfer maps factorise through Becker-Schultz-Mann-Miller-Miller transfer; some of these might be well known. We apply this to show that $BSO(2n+1…

2014-07-27abs ↗pdf ↗

To reduce the large computation and storage cost of a deep convolutional neural network, the knowledge distillation based methods have pioneered to transfer the generalization ability of a large (teacher) deep network to a light-weight (student) network. However, these methods mostly focus on transferring the probabili…

2018-10-18abs ↗pdf ↗

Weight Squeezing transfers knowledge from large models to smaller ones, improving performance and speed.

problem Transfer learning and model compression for faster and more efficient training.
method Reparameterization of weights from a large model to a smaller one.
result Weight Squeezing outperforms other methods on GLUE benchmark with faster training.

A new method estimates generative model mappings using kernel transfer operators, reducing costs and improving performance.

problem Efficiently estimating mappings between known and unknown distributions in generative models.
method Adapting kernel transfer operators to estimate mappings, reducing computational costs.
result Significant runtime savings and good empirical performance compared to existing methods.

Researchers in functional neuroimaging mostly use activation coordinates to formulate their hypotheses. Instead, we propose to use the full statistical images to define regions of interest (ROIs). This paper presents two machine learning approaches, transfer learning and selection transfer, that are compared upon their…

2012-09-07abs ↗pdf ↗

Method learns feature map between source and target domains for high-dimensional regression with missing features.

problem High-dimensional regression with differing feature sets in target and source domains.
method First learns a feature map between missing and observed features using source data, then imputes missing features in target domain, and performs two-step transfer learning for penalized regression.
result Developed upper bounds on estimation and prediction errors for HTL, showing dependence on model complexity, sample size, feature map quality, and domain differences.

JSCN improves cross-domain recommendation by learning domain-invariant user representations.

problem Cross-domain recommendation data sparsity and domain-incompatibility issues.
method JSCN uses multi-layer spectral convolutions on different graphs to learn domain-invariant user representations and domain adaptive user mappings.
result Significant improvement in cross-domain recommendation performance (9.2% recall, 36.4% MAP improvements).

We propose Gaussian optimal transport for Image style transfer in an Encoder/Decoder framework. Optimal transport for Gaussian measures has closed forms Monge mappings from source to target distributions. Moreover interpolates between a content and a style image can be seen as geodesics in the Wasserstein Geometry. Usi…

2019-05-30abs ↗pdf ↗

Paper explores using bi-fidelity data to train neural networks for uncertainty quantification.

problem Training neural networks requires large amounts of data, which may not be available for computationally expensive systems.
method Transfer learning techniques using high- and low-fidelity models, including standard transfer and bi-fidelity weighted learning.
result Bi-fidelity transfer learning improves accuracy over standard training approaches.

This research evaluates learning models for bionic robots, focusing on transfer function identification.

problem Developers need guidance on selecting and constructing transfer functions for bionic robots.
method Comprehensive evaluation strategy including data collection, learning model selection, comparative analysis, and transfer function identification.
result A framework for effectively dealing with multi-input multi-output robotic data.

ActiLabel learns activity patterns across diverse sensor devices.

problem Limited adoption of activity recognition models across different domains due to diverse sensor devices.
method Combination of graph model and optimal tiered mapping for learning activity labels.
result Superior performance compared to state-of-the-art methods on public datasets.

MPHD transfers knowledge across different domains for Bayesian optimization.

problem Optimizing functions with unknown or diverse domains.
method MPHD uses neural nets to map domain-specific contexts to GP specifications, enabling transfer learning across heterogeneous search spaces.
result MPHD improves black-box function optimization performance on diverse domains.

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.

This paper proposes an online knowledge distillation method that transfers feature map information in addition to class probabilities.

problem Previous online knowledge distillation methods only utilized class probabilities, missing feature map information.
method Adversarial training framework to transfer feature map information; multiple networks trained simultaneously with discriminators.
result Our method performs better than direct alignment methods and is more suitable for online distillation.

In this paper, we study the problem of transfer learning with the attribute data. In the transfer learning problem, we want to leverage the data of the auxiliary and the target domains to build an effective model for the classification problem in the target domain. Meanwhile, the attributes are naturally stable cross d…

2018-03-26abs ↗pdf ↗

This paper provides a rational model for fiberwise THH transfer using A-infinity algebras.

problem Rational models for fiberwise THH transfer of fibrations over a base space.
method Explicit description of Hochschild homology transfer in terms of A-infinity algebras.
result Rational models for Becker-Gottlieb transfer and fiberwise THH-simple structures.

The cross-domain recommendation technique is an effective way of alleviating the data sparse issue in recommender systems by leveraging the knowledge from relevant domains. Transfer learning is a class of algorithms underlying these techniques. In this paper, we propose a novel transfer learning approach for cross-doma…

2018-04-18abs ↗pdf ↗

TMDA aligns subdomain data distribution discrepancies across domains using manifold representations.

problem Transfer learning challenges due to domain divergence.
method TMDA uses low-dimensional manifolds to represent subdomains and aligns local data distribution discrepancies across domains using M3D.
result TMDA is a promising method for various transfer learning tasks.

BAR reprograms black-box ML models for transfer learning with scarce data.

problem Transfer learning with limited data and resources.
method Zeroth-order optimization and multi-label mapping techniques to reprogram black-box models.
result BAR outperforms state-of-the-art methods and baseline transfer learning approaches.

OpFlow predicts robust OD flows by learning choice potentials conditioned on spatial exposures.

problem Deep models trained on raw counts are vulnerable to distribution shift.
method OpFlow learns row-centered choice potentials and reconstructs flows by combining them with a calibrated origin scale.
result OpFlow improves robustness under environment shifts, as shown by controlled synthetic shifts and a real-world experiment.

A new method for hyperparameter tuning across multiple datasets and objectives.

problem Hyperparameter tuning for black-box functions, especially across different datasets and objectives.
method Quantile-based regression with Gaussian Copula distribution for semi-parametric modeling, combined with Thompson sampling and Gaussian Copula process.
result Significant improvements in hyperparameter optimization and neural architecture search over state-of-the-art methods.

SF-DQN improves RL transfer by learning successor features.

problem Transfer RL with shared dynamics but different reward functions.
method Decomposes Q-function into SF and reward mapping; uses GPI for policy improvement.
result SF-DQN with GPI converges faster and generalizes better than traditional RL methods.

Deep Neural Networks have been found vulnerable re-cently. A kind of well-designed inputs, which called adver-sarial examples, can lead the networks to make incorrectpredictions. Depending on the different scenarios, goalsand capabilities, the difficulties of the attacks are different.For example, a targeted attack is …

2019-08-29abs ↗pdf ↗

Deep learning speeds up protein mapping entropy calculation.

problem Efficiently calculating the mapping entropy of protein structures.
method Deep graph networks for accelerating mapping entropy computation.
result Deep graph networks achieve a speedup factor of up to 10^5.

Method maps imperfect simulations to observed stellar spectra using unsupervised domain adaptation.

problem Mapping from large sets of imperfect simulations and observational data.
method Adversarial autoencoders, cycle-consistency constraint, and generative surrogate physics emulator network.
result Reconstructed spectra quality and discovery of new spectral features.

The circle transfer QΣ(LXhS1)+QLX+QΣ(LX_{hS^1})_+ \to QLX_+ has appeared in several contexts in topology. In this note we observe that this map admits a geometric re-interpretation as a morphism of cobordism categories of 0-manifolds and 1-cobordisms. Let C1(X)C_1(X) denote the 1-dimensional cobordism category and let $Circ(X) \subse…

2017-11-26abs ↗pdf ↗

Domain adaptation leverages the knowledge in one domain - the source domain - to improve learning efficiency in another domain - the target domain. Existing heterogeneous domain adaptation research is relatively well-progressed, but only in situations where the target domain contains at least a few labeled instances. I…

2017-01-10abs ↗pdf ↗

Unified framework maps financial market dynamics using TE and KM, revealing directional information flow.

problem Challenges in traditional correlation analysis of financial markets, especially during crises.
method Combines Transfer Entropy (TE) and Kramers-Moyal (KM) expansion to analyze dynamic interactions among major indices.
result Increased directional information flow during crises, highlighting gold-dollar and oil-equity linkages.

A new model SEQ clusters and classifies encoded features for better interpretability.

problem Lack of interpretability in classical supervised classification tasks.
method Proposes a novel supervised learning model named Supervised-Encoding Quantizer (SEQ) that applies a quantizer to cluster and classify encoded features.
result The quantizer provides an interpretable graph where each cluster represents a class with a particular style.

Notes on quasiregular maps between Riemannian manifolds, preserving Sobolev forms.

problem Extending quasiregular map theory from Euclidean to Riemannian manifolds.
method Recalling different approaches to first-order Sobolev spaces, showing equivalence, and transferring key theorems.
result Pull-backs with quasiregular maps preserve Sobolev differential forms of the conformal exponent.