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

60120179239 · Jun 202019922001200920172026
48 results for kernel transfer

This paper improves kernel-based regression using transfer learning.

problem Improving generalization performance in kernel-based regression.
method Two-step kernel-based estimator for known transferable sources and novel aggregation algorithm for unknown sources.
result Established statistical properties and validated effectiveness of proposed methods.

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.

New method tackles concept shifts in nonparametric regression using robust and adaptive transfer learning.

problem Concept shifts and sample scarcity in target domains hinder nonparametric regression.
method Robust and adaptive transfer learning procedure leveraging fixed bandwidth Gaussian kernels.
result Spectral algorithms with fixed bandwidth Gaussian kernels attain minimax convergence rates for nonparametric regression.

The study addresses negative transfer in multi-output Gaussian processes by proposing latent structures.

problem Negative transfer in multi-output Gaussian processes leading to decreased performance.
method Defining negative transfer, deriving conditions for avoiding it, proposing latent structures.
result Latent structures can avoid negative transfer and scale to large datasets.

Paper introduces a new multi-kernel algorithm for better gradient approximation.

problem Improving gradient approximation in high-dimensional problems.
method Develops a multi-kernel passive stochastic gradient algorithm with variance reduction.
result The multi-kernel algorithm performs better in high-dimensional problems.

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.

This work improves knowledge distillation by transferring full kernel matrices efficiently.

problem Efficiently transferring full pairwise similarity matrices for model compression in deep learning.
method The authors propose a method to transfer the full similarity matrix effectively using the Nyström method, decomposing it into partial matrices.
result The difference between the full kernel matrices of teacher and student can be well bounded by partial matrices, improving optimization efficiency.

The ability of a human being to extrapolate previously gained knowledge to other domains inspired a new family of methods in machine learning called transfer learning. Transfer learning is often based on the assumption that objects in both target and source domains share some common feature and/or data space. In this p…

2016-10-20abs ↗pdf ↗

TAP transfers knowledge from unlabeled data to improve cross-modal learning.

problem Improving supervised learning performance using unlabeled data from a different modality.
method Probabilistic approach for missing information estimation, kernel regression, cross-attention module, TAP neural network.
result TAP significantly improves generalization across different domains and neural network architectures.

Knowledge transfer speeds up neural classifier training.

problem Lack of theoretical analysis of knowledge transfer in neural networks.
method Regularization of fit between teacher and student networks using privileged information.
result Wide two-layer networks can interpolate between privileged information and data, improving generalization.

MetaNOR learns common nonlocal kernels for efficient metamaterial modeling.

problem Efficiently modeling wave propagation in new metamaterials.
method Meta-learns a common nonlocal kernel from existing tasks and transfers this knowledge to new tasks with minimal data.
result Substantial improvements in sampling efficiency for new metamaterials.

Paper develops methods for analyzing forms with synchronized singularities.

problem Analyzing forms with synchronized singularities.
method Exact reduction, analytic transfer, and geometric recomposition.
result Transfer of sparse domination principle to synchronized singular forms.

Optimal scheme minimizes deviation in federated transfer learning for kernel regression.

problem Minimizing cumulative deviation in federated transfer learning across multiple datasets.
method Regret-optimal iterative scheme for continual communication between nodes and server.
result Explicit updates for the regret-optimal algorithm in finite-rank kernel regression.

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.

KM method reduces ConvNet parameters to 9% higher accuracy with minimal additional memory.

problem Expensive memory usage for training ConvNets on embedded devices.
method Kernel Modulation (KM) method that adapts all network parameters for each task.
result KM delivers up to 9% higher accuracy than other parameter-efficient methods.

New method for efficient personalized learning in mobile health.

problem Efficient and personalized learning in mobile health.
method Proposes a novel generative process on kernel composition for online Gaussian Process regression.
result Trajectories of kernel evolutions can be transferred between users to improve learning and kernels are meaningful for mHealth prediction.

We consider the Hypothesis Transfer Learning (HTL) problem where one incorporates a hypothesis trained on the source domain into the learning procedure of the target domain. Existing theoretical analysis either only studies specific algorithms or only presents upper bounds on the generalization error but not on the exc…

2016-12-03abs ↗pdf ↗

Study on neural networks' performance in sequential task learning.

problem Understanding the performance of neural networks in sequential task learning.
method Theoretical analysis of generalization performance in continual learning using statistical mechanical analysis of kernel ridge-less regression.
result Characteristic transitions from positive to negative transfer observed in neural networks.

The paper analyzes covariate shift in nonparametric regression with Markovian data.

problem Covariate shift in regression problems with Markovian data.
method Extension of nonparametric convergence rates to Markovian dependence structures, using Hölder smoothness assumptions and similarity measures.
result Precise convergence rates for Nadaraya-Watson kernel estimators under specific Markovian conditions.

Efficiently fine-tunes patient-independent seizure detection models with tensor kernel machine.

problem Improving seizure detection accuracy for wearable devices.
method Transfer learning with tensor kernel machine using canonical polyadic decomposition.
result Patient fine-tuned model achieves high performance with smaller model size.

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.

Simplifies transfer learning with deep neural networks using ridge regression.

problem High computational cost of finetuning deep models for transfer learning.
method Leverage the low-rank property of deep neural networks' feature vectors in kernel ridge regression.
result Successful on supervised and semi-supervised transfer learning tasks.

TransBoost improves financial inclusion by evaluating individual financial risk.

problem Evaluating individual financial risk for new users and companies with limited data.
method Combines tree-based models and kernel methods, with parallel tree structure and efficient weights updating.
result Outperforms other transfer learning algorithms in prediction accuracy and robustness.

In this paper, we propose a novel supervised learning method that is called Deep Embedding Kernel (DEK). DEK combines the advantages of deep learning and kernel methods in a unified framework. More specifically, DEK is a learnable kernel represented by a newly designed deep architecture. Compared with pre-defined kerne…

2018-04-16abs ↗pdf ↗

Study improves hypothesis transfer learning for functional linear models.

problem Incompatible TL techniques for high-dimensional FLR methods due to infinite-dimensional nature of functional data.
method Proposes two algorithms for hypothesis transfer learning in RKHS framework, leveraging RKHS distance and aggregation techniques.
result Establishes asymptotic lower bounds and matching upper bounds for the proposed algorithms, demonstrating their effectiveness.

Bayesian optimisation is a popular technique for hyperparameter learning but typically requires initial exploration even in cases where similar prior tasks have been solved. We propose to transfer information across tasks using learnt representations of training datasets used in those tasks. This results in a joint Gau…

2018-10-15abs ↗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.

Develops kernels for matchings, overcoming computational challenges.

problem Challenges in applying kernel methods to matchings due to their discrete, non-Euclidean nature.
method Characterizes stationary kernels, introduces heat and Matérn kernel families, and develops a sub-exponential algorithm for efficient evaluation.
result Establishes novel negative results and identifies an open problem in transferring the framework to trees.

The purpose of this paper is to introduce a concept of equivalence between machine learning algorithms. We define two notions of algorithmic equivalence, namely, weak and strong equivalence. These notions are of paramount importance for identifying when learning prop erties from one learning algorithm can be transferre…

2014-06-10abs ↗pdf ↗

Model projection transfers convolutional network properties to feedforward networks.

problem Transferring properties between feedforward and convolutional networks.
method Unified node-level framework with tensor-valued activations, model projection.
result Projected CNN nodes inherit GFFN-style trainable structure.

Study shows how transformers classify symbols without naming them, proving a margin-versus-collision criterion.

problem How transformers classify symbols without naming them.
method Logistic classification analysis of transformer-kernel regime, colored collision graph.
result Decomposes learned predictor into ideal template-level classifier and finite-sample perturbation.

We illustrate relationships between classical kernel-based dimensionality reduction techniques and eigendecompositions of empirical estimates of reproducing kernel Hilbert space (RKHS) operators associated with dynamical systems. In particular, we show that kernel canonical correlation analysis (CCA) can be interpreted…

2019-04-16abs ↗pdf ↗