Publications related to Hybrid kernel

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

ACTOR: Action-Guided Kernel Fuzzing

Mathias Josef Payer

Fuzzing reliably and efficiently finds bugs in software, including operating system kernels. In general, higher code coverage leads to the discovery of more bugs. This is why most existing kernel fuzzers adopt strategies to generate a series of inputs that ...

Usenix Assoc2023

Bayes-optimal Learning of Deep Random Networks of Extensive-width

Florent Gérard Krzakala, Lenka Zdeborová, Hugo Chao Cui

We consider the problem of learning a target function corresponding to a deep, extensive-width, non-linear neural network with random Gaussian weights. We consider the asymptotic limit where the number of samples, the input dimension and the network width ...

2023

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

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

Deep Compositional Denoising for High-quality Monte Carlo Rendering

Thijs Vogels, Marios Papas, Xianyao Zhang

We propose a deep-learning method for automatically decomposing noisy Monte Carlo renderings into components that kernelpredicting denoisers can denoise more effectively. In our model, a neural decomposition module learns to predict noisy components and co ...

WILEY2021

What can linearized neural networks actually say about generalization?

Pascal Frossard, Seyed Mohsen Moosavi Dezfooli, Guillermo Ortiz Jimenez

For certain infinitely-wide neural networks, the neural tangent kernel (NTK) theory fully characterizes generalization, but for the networks used in practice, the empirical NTK only provides a rough first-order approximation. Still, a growing body of work ...

2021

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

USBFuzz: A Framework for Fuzzing USB Drivers by Device Emulation

Mathias Josef Payer, Hui Peng

The Universal Serial Bus (USB) connects external devices to a host. This interface exposes the OS kernels and device drivers to attacks by malicious devices. Unfortunately, kernels and drivers were developed under a security model that implicitly trusts co ...

USENIX ASSOC2020

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

Snap-On User-Space Manager for Dynamically Reconfigurable System-on-Chips

Paolo Ienne, Andrea Guerrieri, Sahand Kashani

Due to increased embedded processing requirements, modern SoCs are becoming heterogeneous computing platforms by combining traditional processing units with custom reconfigurable hardware accelerators (HAs) on an FPGA fabric. However, efficiently managing ...

2019

Global Flux-Driven Simulations of Ion Temperature-Gradient and Trapped-Electron Modes Driven Turbulence with an Improved Multithreaded Gyrokinetic PIC Code

Emmanuel Lanti

Performance of tokamak fusion plasmas is heavily linked to the radial heat and particle transport, which is known to be mainly produced by turbulence driven by micro-instabilities. Understanding such processes is thus of key importance for the design and o ...

EPFL2019

Neural Tanget Kernel: Convergence and Generalization in Neural Networks

Clément Hongler, Franck Raymond Gabriel, Arthur Ulysse Jacot-Guillarmod

At initialization, artificial neural networks (ANNs) are equivalent to Gaussian processes in the infinite-width limit [12, 9], thus connecting them to kernel methods. We prove that the evolution of an ANN during training can also be described by a kernel: ...

NEURAL INFORMATION PROCESSING SYSTEMS (NIPS)2018

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

A Sampling Theory for Non-Decaying Signals

Michaël Unser, Quy Ha Nguyen

The classical assumption in sampling and spline theories is that the input signal is square-integrable, which prevents us from applying such techniques to signals that do not decay or even grow at infinity. In this paper, we develop a sampling theory for m ...

2017

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