Publications related to Kernel (algebra)

End-to-end kernel learning via generative random Fourier features

Random Fourier features (RFFs) provide a promising way for kernel learning in a spectral case. Current RFFs-based kernel learning methods usually work in a two-stage way. In the first-stage process, learn-ing an optimal feature map is often formulated as a ...

ELSEVIER SCI LTD2023

Midas: Systematic Kernel TOCTTOU Protection

Mathias Josef Payer, Atri Bhattacharyya, Uros Tesic

Double-fetch bugs are a plague across all major operating system kernels. They occur when data is fetched twice across the user/kernel trust boundary while allowing concurrent modification. Such bugs enable an attacker to illegally access memory, cause den ...

2022

Failure and success of the spectral bias prediction for Laplace Kernel Ridge Regression: the case of low-dimensional data

Matthieu Wyart, Umberto Maria Tomasini, Antonio Sclocchi

Recently, several theories including the replica method made predictions for the generalization error of Kernel Ridge Regression. In some regimes, they predict that the method has a 'spectral bias': decomposing the true function f* on the eigenbasis of the ...

JMLR-JOURNAL MACHINE LEARNING RESEARCH2022

Deterministic error bounds for kernel-based learning techniques under bounded noise

Colin Neil Jones, Paul Scharnhorst, Emilio Maddalena

We consider the problem of reconstructing a function from a finite set of noise-corrupted samples. Two kernel algorithms are analyzed, namely kernel ridge regression and epsilon-support vector regression. By assuming the ground-truth function belongs to th ...

2021

NrOS: Effective Replication and Sharing in an Operating System

Sanidhya Kashyap, Ankit Bhardwaj

Writing a correct operating system kernel is notoriously hard. Kernel code requires manual memory management and type-unsafe code and must efficiently handle complex, asynchronous events. In addition, increasing CPU core counts further complicate kernel de ...

USENIX ASSOC2021

Multikernel Regression with Sparsity Constraint

Michaël Unser, Shayan Aziznejad

In this paper, we provide a Banach-space formulation of supervised learning with generalized total-variation (gTV) regularization. We identify the class of kernel functions that are admissible in this framework. Then, we propose a variation of supervised l ...

2021

Oblivious Sketching of High-Degree Polynomial Kernels

Mikhail Kapralov, Amir Zandieh

Kernel methods are fundamental tools in machine learning that allow detection of non-linear dependencies between data without explicitly constructing feature vectors in high dimensional spaces. A major disadvantage of kernel methods is their poor scalabili ...

ASSOC COMPUTING MACHINERY2020

Computing Cyclic Isogenies between Principally Polarized Abelian Varieties over Finite Fields

Marius Lorenz Vuille

Abelian varieties are fascinating objects, combining the fields of geometry and arithmetic. While the interest in abelian varieties has long time been of purely theoretic nature, they saw their first real-world application in cryptography in the mid 1980's ...

EPFL2020

A conformal dispersion relation: correlations from absorption

Din Carmi

We introduce the analog of Kramers-Kronig dispersion relations for correlators of four scalar operators in an arbitrary conformal field theory. The correlator is expressed as an integral over its "absorptive part", defined as a double discontinuity, times ...

Springer Nature2020

Machine-Learning of Atomic-Scale Properties Based on Physical Principles

Michele Ceriotti, Michael John Willatt

We briefly summarize the kernel regression approach, as used recently in materials modelling, to fitting functions, particularly potential energy surfaces, and highlight how the linear algebra framework can be used to both predict and train from linear fun ...

Springer International Publishing2020

Kernel Density Estimation through Density Constrained Near Neighbor Search

Mikhail Kapralov, Navid Nouri

In this paper we revisit the kernel density estimation problem: given a kernel K(x, y) and a dataset of n points in high dimensional Euclidean space, prepare a data structure that can quickly output, given a query q, a (1 + epsilon)-approximation to mu := ...

IEEE2020

On the lifting of the Dade group

Jacques Thévenaz, Caroline Lassueur

For the group of endo-permutation modules of a finite p-group, there is a surjective reduction homomorphism from a complete discrete valuation ring of characteristic 0 to its residue field of characteristic p. We prove that this reduction map always has a ...

2019

A kernel compression scheme for fractional differential equations

Jan Sickmann Hesthaven, Daniel Henri Baffet

The nonlocal nature of the fractional integral makes the numerical treatment of fractional dierential equations expensive in terms of computational eort and memory requirements. In this paper we propose a method to reduce these costs while controlling the ...

Society for Industrial and Applied Mathematics2017

Lower Bounds on Regret for Noisy Gaussian Process Bandit Optimization

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic

In this paper, we consider the problem of sequentially optimizing a black-box function

f

based on noisy samples and bandit feedback. We assume that

f

is smooth in the sense of having a bounded norm in some reproducing kernel Hilbert space (RKHS), yield ...

2017

Every simple compact semiring is finite

A Hausdorff topological semiring is called simple if every non-zero continuous homomorphism into another Hausdorff topological semiring is injective. Classical work by Anzai and Kaplansky implies that any simple compact ring is finite. We generalize this r ...

Elsevier Science Bv2016

Learning Structured Models for Segmentation of 2D and 3D Imagery

Pascal Fua, Graham Knott, Kevin Smith, Aurélien Lucchi, Yunpeng Li, Carlos Joaquin Becker, Pablo Marquez Neila

Efficient and accurate segmentation of cellular structures in microscopic data is an essential task in medical imaging. Many state-of-the-art approaches to image segmentation use structured models whose parameters must be carefully chosen for optimal perfo ...

Institute of Electrical and Electronics Engineers2015

A New Formulation of the Cooray-Rubinstein Expression in Time Domain

Farhad Rachidi-Haeri

In this paper, a new formulation in the time domain of the Cooray-Rubinstein expression is presented. This new formulation overcomes the problems related to the previous formulation: The Dirac pulse contained in the kernel of the previous formulation is ex ...

Ieee-Inst Electrical Electronics Engineers Inc2015

Trigonometric Interpolation Kernel to Construct Deformable Shapes for User-Interactive Applications

Michaël Unser, Daniel Andreas Schmitter, Ricard Delgado Gonzalo

We present a new trigonometric basis function that is capable of perfectly reproducing circles, spheres and ellipsoids while at the same time being interpolatory. Such basis functions have the advantage that they allow to construct shapes through a sequenc ...

IEEE Institute of Electrical and Electronics Engineers2015

Structured Image Segmentation using Kernelized Features

Pascal Fua, Kevin Smith, Aurélien Lucchi, Yunpeng Li

Most state-of-the-art approaches to image segmentation formulate the problem using Conditional Random Fields. These models typically include a unary term and a pairwise term, whose parameters must be carefully chosen for optimal performance. Recently, stru ...

2012

Short Undeniable Signatures Based on Group Homomorphisms

Serge Vaudenay, Jean Monnerat

This paper is devoted to the design and analysis of short undeniable signatures based on a random oracle. Exploiting their online property, we can achieve signatures with a fully scalable size depending on the security level. To this end, we develop a gene ...

Springer Verlag2011