arXiv research

Study bounds on kernel function entropy for finite measures.

Bayesian neural networks with Mercer priors for interpretable uncertainty quantification.

Survey of kernels, RKHS, and their applications in machine learning.

Paper identifies key function spaces for ReLU networks based on Fisher information.

The study assesses low-rank approximations in Gaussian Process regression.

Develops a framework for learning nonlinear operators using Mercer kernels.

The study assesses low-rank approximations in Gaussian Process regression.

Transformers are explained as infinite-dimensional kernel machines.

Interest in multioutput kernel methods is increasing, whether under the guise of multitask learning, multisensor networks or structured output data. From the Gaussian process perspective a multioutput Mercer kernel is a covariance function over correlated output functions. One way of constructing such kernels is based …

Lecture notes on kernel functions and Random Fourier Features.

This paper presents a unified framework to tackle estimation problems in Digital Signal Processing (DSP) using Support Vector Machines (SVMs). The use of SVMs in estimation problems has been traditionally limited to its mere use as a black-box model. Noting such limitations in the literature, we take advantage of sever…

Kernel interpolation improved with continuous volume sampling.

New method approximates MMD using pseudo-differential operators and singular values.

A new PCA method for analyzing point processes.

Uniform bounds for neural networks' generalization error in overparameterized settings.

Overlapping clustering problem is an important learning issue in which clusters are not mutually exclusive and each object may belongs simultaneously to several clusters. This paper presents a kernel based method that produces overlapping clusters on a high feature space using mercer kernel techniques to improve separa…

Devoted to multi-task learning and structured output learning, operator-valued kernels provide a flexible tool to build vector-valued functions in the context of Reproducing Kernel Hilbert Spaces. To scale up these methods, we extend the celebrated Random Fourier Feature methodology to get an approximation of operator-…

We consider the problem of cost sensitive multiclass classification, where we would like to increase the sensitivity of an important class at the expense of a less important one. We adopt an {\em apportioned margin} framework to address this problem, which enables an efficient margin shift between classes that share th…

New learning rates derived for Tikhonov-regularized problems without kernel assumptions.

We investigate a generic problem of learning pairwise exponential family graphical models with pairwise sufficient statistics defined by a global mapping function, e.g., Mercer kernels. This subclass of pairwise graphical models allow us to flexibly capture complex interactions among variables beyond pairwise product. …

As a robust nonlinear similarity measure in kernel space, correntropy has received increasing attention in domains of machine learning and signal processing. In particular, the maximum correntropy criterion (MCC) has recently been successfully applied in robust regression and filtering. The default kernel function in c…

In machine learning or statistics, it is often desirable to reduce the dimensionality of a sample of data points in a high dimensional space $\mathbb{R}^d$. This paper introduces a dimensionality reduction method where the embedding coordinates are the eigenvectors of a positive semi-definite kernel obtained as the sol…

Recently, there has been emerging interest in constructing reproducing kernel Banach spaces (RKBS) for applied and theoretical purposes such as machine learning, sampling reconstruction, sparse approximation and functional analysis. Existing constructions include the reflexive RKBS via a bilinear form, the semi-inner-p…

This work analyzes how different layers in deep neural networks contribute to generalization error.

A simple framework Probabilistic Multi-view Graph Embedding (PMvGE) is proposed for multi-view feature learning with many-to-many associations so that it generalizes various existing multi-view methods. PMvGE is a probabilistic model for predicting new associations via graph embedding of the nodes of data vectors with …

Sequential modelling with self-attention has achieved cutting edge performances in natural language processing. With advantages in model flexibility, computation complexity and interpretability, self-attention is gradually becoming a key component in event sequence models. However, like most other sequence models, self…

In data science, determining proximity between observations is critical to many downstream analyses such as clustering, information retrieval and classification. However, when the underlying structure of the data probability space is unclear, the function used to compute similarity between data points is often arbitrar…

We reformulate unsupervised dimension reduction problem (UDR) in the language of tempered distributions, i.e. as a problem of approximating an empirical probability density function by another tempered distribution, supported in a $k$-dimensional subspace. We show that this task is connected with another classical prob…

New asymmetric kernel methods improve feature learning.

A new deep neural network tackles nonlinear functional regression with improved dimensionality reduction.

Paper develops a new algorithm for distribution regression with optimal learning rates.

Paper learns optimal kernels for Gaussian process regression in aerodynamics.

Study on Neural Tangent Kernel of Matrix Product States and their convergence.

Positive weights improve kernel quadrature's accuracy.

Unified framework for constructing kernels for transport equations and Koopman eigenfunctions.

Previous studies indicate that nonlinear properties of Gaussian time series with long-range correlations, $u_i$, can be detected and quantified by studying the correlations in the magnitude series $|u_i|$, i.e., the ``volatility''. However, the origin for this empirical observation still remains unclear, and the exact …

Lie-Butcher (LB) series are formal power series expressed in terms of trees and forests. On the geometric side LB-series generalizes classical B-series from Euclidean spaces to Lie groups and homogeneous manifolds. On the algebraic side, B-series are based on pre-Lie algebras and the Butcher-Connes-Kreimer Hopf algebra…

Research into time series classification has tended to focus on the case of series of uniform length. However, it is common for real-world time series data to have unequal lengths. Differing time series lengths may arise from a number of fundamentally different mechanisms. In this work, we identify and evaluate two cla…

The explosion of time series data in recent years has brought a flourish of new time series analysis methods, for forecasting, clustering, classification and other tasks. The evaluation of these new methods requires either collecting or simulating a diverse set of time series benchmarking data to enable reliable compar…

Study series invariants of plumbed 3-manifolds using root lattices.

New formula and properties of inverted Habiro series derived from GM series.

Paper introduces novel distances for clustering ordinal time series.

MPPN network improves long-term time series forecasting accuracy.

Overview of high-dimensional time series regression methods.

Archive of 20 time series datasets for forecasting evaluation.

Improved prediction of hierarchical time series using structured regularization.

New kernel handles irregularly-spaced multivariate time series.

Time series motifs play an important role in the time series analysis. The motif-based time series clustering is used for the discovery of higher-order patterns or structures in time series data. Inspired by the convolutional neural network (CNN) classifier based on the image representations of time series, motif diffe…