Kernel transfer operators, which can be regarded as approximations of transfer operators such as the Perron-Frobenius or Koopman operator in reproducing kernel Hilbert spaces, are defined in terms of covariance and cross-covariance operators and have been shown to be closely related to the conditional mean embedding fr…
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,657 papers · 148 categories
Trend · papers per month
48 results for “kernel transfer operators”
Transfer operators such as the Perron--Frobenius or Koopman operator play an important role in the global analysis of complex dynamical systems. The eigenfunctions of these operators can be used to detect metastable sets, to project the dynamics onto the dominant slow processes, or to separate superimposed signals. We …
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.
MetaNOR: A Meta-Learnt Nonlocal Operator Regression Approach for Metamaterial Modelingcond-mat.mtrl-sci
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.
Reproducing kernel Hilbert spaces (RKHSs) play an important role in many statistics and machine learning applications ranging from support vector machines to Gaussian processes and kernel embeddings of distributions. Operators acting on such spaces are, for instance, required to embed conditional probability distributi…
Coarea Reduction, Sparse Transfer, and Geometric Recomposition for Synchronized Singular Formsmath.FA
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.
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…
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.
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.
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.
This paper discusses the existence of gradient estimates for second order hypoelliptic heat kernels on manifolds. It is now standard that such inequalities, in the elliptic case, are equivalent to a lower bound on the Ricci tensor of the Riemannian metric. For hypoelliptic operators, the associated "Ricci curvature" ta…
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.
SATL adapts to varying smoothness in hypothesis transfer learning.
problem Fixed kernel regularization fails in varying smoothness settings.
method Proposes SATL, a two-phase KRR algorithm with adaptive Gaussian kernels.
result SATL achieves minimax optimality with matching upper and lower bounds.
Operator-theoretic analysis of nonlinear dynamical systems has attracted much attention in a variety of engineering and scientific fields, endowed with practical estimation methods using data such as dynamic mode decomposition. In this paper, we address a lifted representation of nonlinear dynamical systems with random…
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.
New method transfers emotions in facial images.
problem Transforming facial images to different emotions.
method Infinite task learning and vector-valued reproducing kernel Hilbert spaces.
result Achieves low reconstruction cost and high emotion classification accuracy.
A kernel-based approach to molecular conformation analysisphysics.comp-ph
We present a novel machine learning approach to understanding conformation dynamics of biomolecules. The approach combines kernel-based techniques that are popular in the machine learning community with transfer operator theory for analyzing dynamical systems in order to identify conformation dynamics based on molecula…
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.
The paper proposes a method to estimate joint probability from unpaired data using entropic transport kernels.
problem Estimating joint probability from unpaired data with unknown internal ordering.
method Maximum-likelihood inference, entropic optimal transport kernels, EMML algorithm.
result The method can recover true density from empirical approximations as the number of blocks increases.
GraphKKE learns fixed-length feature vectors from time-evolving graphs of human microbiome data.
problem Understanding dynamic changes in human microbiome graphs over time.
method Spectral analysis of transfer operators and graph kernels.
result GraphKKE captures temporal changes in human microbiome graphs.
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.
The paper explains how continuous language models can produce discrete, interpretable meanings.
problem Semantic collapse in continuous systems of large language models.
method Formalizing large language models as Continuous State Machines (CSMs) and analyzing the associated transfer operator.
result The leading eigenfunctions of the transfer operator induce a finite number of invariant meaning basins, explaining how continuous computation can produce discrete, interpretable semantics.
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.
Framework transfers complementary operating conditions to train anomaly detectors.
problem Training anomaly detectors on changing operating conditions requires comprehensive data, which is hard to obtain.
method Proposes unsupervised transfer learning to align and combine data from different units.
result Demonstrates improved anomaly detection in changing operating conditions.
Data-driven approximation of transfer operators for mean-field stochastic differential equationsmath.DS
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.
New methods for clustering graphs using spectral analysis.
problem Graph clustering for complex systems.
method Transfer operators and spectral properties.
result Spectral clustering can be interpreted using Koopman operators.
Neural networks can learn useful representations that kernels can't.
problem Learning functions that depend on only a few relevant directions.
method Gradient descent on a two-layer neural network.
result Improved sample complexity for learning polynomials.
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…
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.
We consider the kernel completion problem with the presence of multiple views in the data. In this context the data samples can be fully missing in some views, creating missing columns and rows to the kernel matrices that are calculated individually for each view. We propose to solve the problem of completing the kerne…
The kernel embedding algorithm is an important component for adapting kernel methods to large datasets. Since the algorithm consumes a major computation cost in the testing phase, we propose a novel teacher-learner framework of learning computation-efficient kernel embeddings from specific data. In the framework, the h…
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.
Paper proposes operator deep Q-learning for quick reward adaptation.
problem Standard RL can only handle one reward function and struggles with unseen rewards.
method Develops operator neural networks to map reward functions to value functions.
result Operator deep Q-learning can quickly adapt to new reward functions.
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.
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.
Method leverages data transfer for estimating CATE with KRR.
problem Leveraging findings from one study to estimate CATE in a different population.
method Overlap-adaptive transfer learning of CATE using kernel ridge regression.
result The method achieves superior efficiency and adaptability in estimating CATE.
New kernels allow learning from non-separable data.
problem Learning from non-separable data.
method Introducing entangled kernels and a two-step algorithm.
result Efficient algorithm for learning entangled kernels.
Develops a framework for learning nonlinear operators using Mercer kernels.
problem Learning nonlinear operators between infinite-dimensional spaces.
method Stochastic approximation framework with Mercer operator-valued kernels.
result Establishes dimension-free polynomial convergence rates for nonlinear operator learning.
RaNNDy uses randomized neural networks to learn transfer operators efficiently.
problem Efficiently learning transfer operators from data.
method Randomized neural network approach with randomly initialized hidden layers and trained output layer.
result Significant reduction in training time and resources with improved stability.
Kernel Dynamic Mode Decomposition reconstructs dynamical systems using Laplacian kernel.
problem Reconstructing spatial-temporal dynamics of complex systems.
method Kernel Dynamic Mode Decomposition with Laplacian kernel.
result Laplacian kernel allows for the closability of Koopman operators in RKHS, enabling reconstruction.
We prove exponential decay of correlations for Hölder continuous observables with respect to any Gibbs measure for contact Anosov flows admitting Pesin sets with exponentially small tails. This is achieved by establishing strong spectral estimates for certain Ruelle transfer operators for such flows.
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.
Random features improve neural operators' generalization properties.
problem Improving generalization of neural operators.
method Unified framework for spectral regularization techniques and operator-valued kernels.
result Established optimal learning rates and required number of neurons.
Formula for Toeplitz operator kernel on CR manifolds.
problem Analyzing Toeplitz operators on CR manifolds.
method Formula for the symbol of the kernel, asymptotic expansions.
result Formula for the values at the diagonal of the second coefficient in the expansion of the symbol of the kernel.
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.
Positive definite operator-valued kernels generalize the well-known notion of reproducing kernels, and are naturally adapted to multi-output learning situations. This paper addresses the problem of learning a finite linear combination of infinite-dimensional operator-valued kernels which are suitable for extending func…
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…