Recherche

Afficher tous les résultats pour

Accueil

Catégorie

Astuce du noyau

Applied sciences
Information engineering
Apprentissage automatique
Astuce du noyau

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (12)

High-Dimensional Kernel Methods under Covariate Shift: Data-Dependent Implicit Regularization

Volkan Cevher, Fanghui Liu

This paper studies kernel ridge regression in high dimensions under covariate shifts and analyzes the role of importance re-weighting. We first derive the asymptotic expansion of high dimensional kernels under covariate shifts. By a bias-variance decomposi ...

2024

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

Jie Yang, Fanghui Liu

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

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

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

Sampling and Reconstruction of Shapes with Algebraic Boundaries

Martin Vetterli, Arash Amini, Mitra Fatemi

We present a sampling theory for a class of binary images with finite rate of innovation (FRI). Every image in our model is the restriction of

\mathds{1}_{\{p\leq0\}}

to the image plane, where

\mathds{1}

denotes the indicator function and

p

is some r ...

2016

Some Developments of the Cooray–Rubinstein Formula in the Time Domain

Farhad Rachidi-Haeri

A rigorous formula representing the counterpart of the Cooray-Rubinstein expression in the time domain has recently been derived by the authors. In this paper, the formula is particularized for the cases of a unit step and a linearly rising channel-base cu ...

Institute of Electrical and Electronics Engineers2015

Accurate band gaps of extended systems via efficient vertex corrections in GW

Alfredo Pasquarello, Wei Chen

We propose the use of an approximate bootstrap exchange-correlation kernel to account for vertex corrections in self-consistent GW calculations. We show that the approximate kernel gives accurate band gaps for a variety of extended systems, including simpl ...

2015

The Movement Error Rate for Evaluation of Machine Learning Methods for sEMG-based Hand Movement Classification

Barbara Caputo

There has been increasing interest in applying learning algorithms to improve the dexterity of myoelectric prostheses. In this work, we present a large-scale benchmark evaluation on the second iteration of the publicly released NinaPro database, which cont ...

2014

Automatic Mallampati Classification Using Active Appearance Models

Jean-Philippe Thiran, Matteo Sorci, Gabriel Louis Cuendet, Anil Yuce

Difficult tracheal intubation assessment is an important research topic in anesthesia as failed intubations are important causes of mortality in anesthetic practice. The modified Mallampati score is widely used, alone or in conjunction with other criteria, ...

2012

Learning Image Descriptors with the Boosting-Trick

Pascal Fua, Vincent Lepetit, Tomasz Piotr Trzcinski, Christos Marios Christoudias

In this paper we apply boosting to learn complex non-linear local visual feature representations, drawing inspiration from its successful application to visual object detection. The main goal of local feature descriptors is to distinctively repre- sent a s ...

2012

Fast O(1) Bilateral Filtering Using Trigonometric Range Kernels

Michaël Unser, Daniel Sage, Kunal Narayan Chaudhury

It is well known that spatial averaging can be realized (in space or frequency domain) using algorithms whose complexity does not scale with the size or shape of the filter. These fast algorithms are generally referred to as constant-time or O(1) algorithm ...

IEEE2011

A Kernel Trick For Sequences Applied to Text-Independent Speaker Verification Systems

Samy Bengio

This paper present a principled SVM based speaker verification system. We propose a new framework and a new sequence kernel that can make use of any Mercer kernel at the frame level. An extension of the sequence kernel based on the Max operator is also pro ...

2007

Page 1 sur 1