New kernel method for shape classification on Kendall shape space.
problem Classification of shapes on non-Euclidean Kendall shape space.
method Extrinsic Veronese Whitney Gaussian kernel for KRRC on Σ2k. result KRRC classifier performs well on real Kendall shape data.
Kernel-based tests for shape constraints in finance.
problem Enforcing shape relations on latent functions in financial econometrics.
method Kernel-based nonparametric framework for mean-variance optimization.
result Established statistical properties and a joint Wald-type statistic for testing shape constraints.
The paper explores a new type of kernel using Wasserstein distance for better classification of shapes.
problem Improving kernel methods for shape classification.
method Defined and studied exponential kernels based on regularized Wasserstein distance.
result Wasserstein squared exponential kernels perform better on small shape datasets.
Adaptive RBF-KAN improves KANs by dynamically adjusting kernel parameters.
problem Efficiently approximating multivariate functions using learnable univariate edge functions.
method Integrates LOOCV-based kernel scale estimation with adaptive kernel learning.
result Adaptive RBF-KAN outperforms fixed kernel KANs on various benchmark functions.
Paper tackles hard shape constraints in kernel machines.
problem Enforcing shape requirements in a hard fashion is challenging.
method Tightened second-order cone constrained reformulation for kernel machines.
result Performance guarantees and efficiency demonstrated in various applications.
This paper proposes the adaptation of Support Vector Data Description (SVDD) to the multiple kernel case (MK-SVDD), based on SimpleMKL. It also introduces a variant called Slim-MK-SVDD that is able to produce a tighter frontier around the data. For the sake of comparison, the equivalent methods are also developed for O…
2L-FUSE enhances feature sparsity through kernel learning.
problem Sparsity and feature selection in regression tasks.
method 2-Layered kernel machines for learning a shape matrix and feature direction identification.
result Minimal yet informative feature sets are identified without losing predictive performance.
We define a numerical method that provides a non-parametric estimation of the kernel shape in symmetric multivariate Hawkes processes. This method relies on second order statistical properties of Hawkes processes that relate the covariance matrix of the process to the kernel matrix. The square root of the correlation f…
We introduce a guide to help deep learning practitioners understand and manipulate convolutional neural network architectures. The guide clarifies the relationship between various properties (input shape, kernel shape, zero padding, strides and output shape) of convolutional, pooling and transposed convolutional layers…
New quantization methods improve accuracy of Random Fourier Features.
problem Improving accuracy of Random Fourier Features for machine learning.
method Sigma-Delta and distributed noise-shaping quantization methods for 1-bit and low bit-depth quantization.
result Quantized RFFs allow high accuracy approximation of underlying kernels with polynomial error decay.
We develop a new route through which to explore kerΨX, the kernel of the π1-shape group homomorphism determined by a general space X, and establish, for each locally path connected, paracompact Hausdorff space X, kerΨX is precisely the Spanier group of X.
Unified understanding of neural representation similarity measures.
problem Fragmented research landscape of neural network similarity measures.
method Observation and exploration of connections between shape distances and normalized Bures similarity.
result Cosine of the Riemannian shape distance equals normalized Bures similarity.
Researchers prove long-time existence for two landmark Brownian motion.
problem Proving long-time existence of Brownian motion on configurations of two landmarks.
method Classification and analysis of long-time existence for configurations of exactly two landmarks, using a radial kernel.
result For configurations of exactly two landmarks, long-time existence is possible for certain kernels, but not for others.
A new Mean Shift variant converges after a finite number of iterations for specific kernel shapes.
problem Improving Mean Shift algorithm convergence for specific kernel shapes.
method Developed a novel Mean Shift variant with a triangular kernel profile.
result The new Mean Shift variant converges after a finite number of iterations.
Unified framework for hard affine SDP constraints in vRKHSs.
problem Incorporating shape constraints into predictive models for rich function classes.
method Unified convex optimization framework using second-order cone tightening.
result Unified and modular approach for handling multiple shape constraints.
DNAMite creates interpretable, calibrated survival analysis models.
problem Limited interpretability in survival analysis models, especially for healthcare applications.
method Feature discretization and kernel smoothing in embedding module for flexible shape functions.
result DNAMite produces calibrated shape functions interpretable as contributions to cumulative incidence function.
Informative and discriminative feature descriptors play a fundamental role in deformable shape analysis. For example, they have been successfully employed in correspondence, registration, and retrieval tasks. In the recent years, significant attention has been devoted to descriptors obtained from the spectral decomposi…
The paper improves GP regression for sparse sensor data in structural mode shape reconstruction.
problem Reconstructing full-field structural mode shapes from sparse sensor data.
method Physics-Constrained Single-Output Gaussian Process (CONS-SOGP) framework.
result The proposed method provides more accurate and reliable mode shapes.
Paper introduces a new kernel model for PSD-valued functions with theoretical guarantees and applications.
problem Enforcing positive semi-definiteness (PSD) in function models with good performance and theoretical guarantees.
method Kernel sum-of-squares model for PSD-valued functions, extending previous models for non-negative scalar functions.
result The model constitutes a universal approximator of PSD functions and can represent any smooth and strongly convex function.
We design a new nonparametric method that allows one to estimate the matrix of integrated kernels of a multivariate Hawkes process. This matrix not only encodes the mutual influences of each nodes of the process, but also disentangles the causality relationships between them. Our approach is the first that leads to an …
Reward shaping speeds up human learning through IRL.
problem Slow learning in humans, especially for challenging tasks.
method Extended IRL algorithm with kernel methods, conducted experiments with online game players.
result Players learn desired policies more quickly with reward shaping.
Inception v3 model classifies face shapes with high accuracy.
problem Face shape classification using deep learning.
method Retraining Inception v3 model on face shape dataset.
result Inception v3 outperforms other classifiers.
A new distributed clustering framework using distributional kernel.
problem Clustering in distributed networks with arbitrary shapes, sizes, and densities.
method Distributed Clustering based on Distributional Kernel (KDC) using similarity of distributions.
result KDC guarantees equivalent clustering outcomes to centralized methods, reduces runtime, and discovers arbitrary clusters.
Topological data analysis offers a rich source of valuable information to study vision problems. Yet, so far we lack a theoretically sound connection to popular kernel-based learning techniques, such as kernel SVMs or kernel PCA. In this work, we establish such a connection by designing a multi-scale kernel for persist…
Proposes DILATE and STRIPE++ for precise time series forecasting.
problem Non-stationary signals with sudden changes.
method Incorporates shape and temporal criteria in deep learning models.
result Improves precision in deterministic and probabilistic forecasting.
LLMs learn probability density functions in-context, showing distinct learning trajectories.
problem Density estimation of time series data in LLMs.
method Intensive Principal Component Analysis (InPCA) to visualize and analyze LLMs' learning dynamics.
result LLMs follow similar learning trajectories in a low-dimensional InPCA space, distinct from traditional methods.
The paper proposes a new method for modeling and quantifying uncertainty in multiple closed curves.
problem Modeling and uncertainty quantification of multiple closed curves.
method A multiple-output, multi-dimensional Gaussian process modeling framework.
result The proposed method provides meaningful uncertainty quantification for curve and shape-related tasks.
Topological Data Analysis (TDA) is a recent and growing branch of statistics devoted to the study of the shape of the data. In this work we investigate the predictive power of TDA in the context of supervised learning. Since topological summaries, most noticeably the Persistence Diagram, are typically defined in comple…
In this paper, we introduce a new image representation based on a multilayer kernel machine. Unlike traditional kernel methods where data representation is decoupled from the prediction task, we learn how to shape the kernel with supervision. We proceed by first proposing improvements of the recently-introduced convolu…
Estimation of facial expressions, as spatio-temporal processes, can take advantage of kernel methods if one considers facial landmark positions and their motion in 3D space. We applied support vector classification with kernels derived from dynamic time-warping similarity measures. We achieved over 99% accuracy - measu…
Deep vanilla transformers trained without shortcuts achieve similar performance to standard models.
problem Training deep vanilla transformers without shortcuts and normalizations.
method Parameter initializations, bias matrices, and location-dependent rescaling.
result Deep vanilla transformers can train at similar speeds and performance to standard models.
Topological data analysis is an emerging mathematical concept for characterizing shapes in multi-scale data. In this field, persistence diagrams are widely used as a descriptor of the input data, and can distinguish robust and noisy topological properties. Nowadays, it is highly desired to develop a statistical framewo…
Proposes a new hyperprior and predictive criterion for weakly informative hyperprior in relevance vector machine.
problem Capturing non-homogeneous data structure with limited kernel functions.
method Uses inverse gamma hyperprior with a shape parameter close to zero and a scale parameter not close to zero. Applies multiple kernel method with different widths. Proposes extended predictive information criterion for scale parameter selection.
result Obtains a multiple kernel relevance vector regression model with good predictive accuracy.
New kernel models multi-output Gaussian processes accurately.
problem Challenges in modelling cross-covariances for multiple-output Gaussian processes.
method Replaced Gaussian components with block components of finite bandwidth in spectral mixture kernel.
result First multi-output generalization of spectral mixture kernel that can approximate any stationary multi-output kernel to arbitrary precision.
Deep neural nets optimize kernel parameters for non-parametric two-sample tests.
problem Determining if two samples come from the same distribution.
method Deep kernels trained to maximize test power, adapting to distribution smoothness and shape.
result Deep kernels outperform simpler kernels in high dimensions and complex data.
In-BO optimizes complex constrained domains using SIn-GP surrogate models.
problem Optimizing in complex constrained domains with irregular shapes.
method Sparse Intrinsic Gaussian Processes (SIn-GP) on manifolds with heat kernel estimation.
result In-BO outperforms traditional BO in complex constrained domains.
The kernel exponential family is a rich class of distributions, which can be fit efficiently and with statistical guarantees by score matching. Being required to choose a priori a simple kernel such as the Gaussian, however, limits its practical applicability. We provide a scheme for learning a kernel parameterized by …
ROCKET speeds up time series classification without sacrificing accuracy.
problem High computational complexity and intractability of existing time series classification methods.
method Simple linear classifiers using random convolutional kernels.
result Achieves state-of-the-art accuracy with significantly reduced computational expense.
In this paper, we address the problem of orientation that naturally arises when representing shapes like curves or surfaces as currents. In the field of computational anatomy, the framework of currents has indeed proved very efficient to model a wide variety of shapes. However, in such approaches, orientation of shapes…
Since their emergence in the 1990's, the support vector machine and the AdaBoost algorithm have spawned a wave of research in statistical machine learning. Much of this new research falls into one of two broad categories: kernel methods and ensemble methods. In this expository article, I discuss the main ideas behind t…
Proposes neural similarity for CNNs to enhance flexibility and performance.
problem Limited flexibility of inner product-based convolution in CNNs.
method Introduces neural similarity as a learnable parametric similarity measure, and proposes NSL for adaptive learning from data.
result Dynamic neural similarity improves flexibility and performance in visual recognition and few-shot learning.
We propose a generic spatiotemporal event forecasting method, which we developed for the National Institute of Justice's (NIJ) Real-Time Crime Forecasting Challenge. Our method is a spatiotemporal forecasting model combining scalable randomized Reproducing Kernel Hilbert Space (RKHS) methods for approximating Gaussian …
Over-parameterized CNNs show U-shaped test risk with depth increase.
problem Understanding the impact of depth on test risk in over-parameterized CNNs.
method Empirical image classification experiments and linear regression framework.
result Test risk is U-shaped with increasing depth in over-parameterized CNNs.
The paper analyzes high-dimensional kernel regression, showing different risk curves based on data and regularization.
problem Characterizing generalization properties of high-dimensional kernel ridge regression.
method Bias-variance decomposition of the expected excess risk, considering different regularization schemes and data eigen-profiles.
result The risk curve of kernel regression can be double-descent-like, bell-shaped, or monotonic, depending on n, d, and regularization level.
Presents STRIPE model for probabilistic forecasting of non-stationary time series.
problem Probabilistic forecasting of non-stationary time series.
method STRIPE model representing structured diversity based on shape and time features, with diversification mechanism using determinantal point processes (DPP).
result STRIPE significantly outperforms baseline methods for representing diversity while maintaining forecasting accuracy.
ResNets and their GP generalization align ideas via function space warping, revealing robust properties and connections to image registration.
problem Aligning abstract shapes (ideas) using neural networks.
method Introducing a generalization of ResNets as a GP, showing convergence to image registration variational algorithms, and revealing properties via a Hamiltonian interpretation.
result ResNets and their GP generalization align ideas via function space warping, revealing robust properties and connections to image registration.
We study the risk of minimum-norm interpolants of data in Reproducing Kernel Hilbert Spaces. Our upper bounds on the risk are of a multiple-descent shape for the various scalings of d=nα, α∈(0,1), for the input dimension d and sample size n. Empirical evidence supports our finding that minimum-norm interpo…
Persistence diagrams (PDs) play a key role in topological data analysis (TDA), in which they are routinely used to describe topological properties of complicated shapes. PDs enjoy strong stability properties and have proven their utility in various learning contexts. They do not, however, live in a space naturally endo…