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

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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 ...

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 ...

Over the last two decades, data-powered machine learning (ML) tools have profoundly transformed numerous scientific fields. In computational chemistry, machine learning applications have permitted faster predictions of chemical properties and provided powe ...

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 ...

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 ...

This thesis focuses on developing efficient algorithmic tools for processing large datasets. In many modern data analysis tasks, the sheer volume of available datasets far outstrips our abilities to process them. This scenario commonly arises in tasks incl ...

Random binning features, introduced in the seminal paper of Rahimi and Recht '07, are an efficient method for approximating a kernel matrix using locality sensitive hashing. Random binning features provide a very simple and efficient way to approximate the ...

A method for performing synchrophasor estimation of an input signal, whereby the input signal is a sinusoidal power system voltage or current signal, comprising: a. Periodic sampling of a continuous time-domain waveform, consisting of a power system voltag ...

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 ...

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 ...

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, ...

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 ...

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 ...

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

Chat with Graph Search

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

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

Kernel Methods and Similarity Learning Applied in Computational Chemistry

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

Oblivious Sketching of High-Degree Polynomial Kernels

Fourier Sampling in Signal Processing and Numerical Linear Algebra

Scaling up Kernel Ridge Regression via Locality Sensitive Hashing

Method for estimating synchrophasors during static and dynamic conditions

A Sampling Theory for Non-Decaying Signals

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

Automatic Mallampati Classification Using Active Appearance Models

Learning Image Descriptors with the Boosting-Trick

Fast O(1) Bilateral Filtering Using Trigonometric Range Kernels

Some Developments of the Cooray&#x2013;Rubinstein Formula in the Time Domain

Chat with Graph Search

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