Publication

Oblivious Sketching of High-Degree Polynomial Kernels

Publications associées (68)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

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

Fourier Sampling in Signal Processing and Numerical Linear Algebra

Amir Zandieh

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

EPFL2020

Structure-property maps with Kernel principal covariates regression

Michele Ceriotti, Guillaume André Jean Fraux, Benjamin Aaron Helfrecht

Data analyses based on linear methods constitute the simplest, most robust, and transparent approaches to the automatic processing of large amounts of data for building supervised or unsupervised machine learning models. Principal covariates regression (PC ...

2020

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

Scaling up Kernel Ridge Regression via Locality Sensitive Hashing

Mikhail Kapralov, Amir Zandieh, Navid Nouri

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

ADDISON-WESLEY PUBL CO2020

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

MOSES: A Streaming Algorithm for Linear Dimensionality Reduction

Armin Eftekhari

This paper introduces Memory-limited Online Subspace Estimation Scheme (MOSES) for both estimating the principal components of streaming data and reducing its dimension. More specifically, in various applications such as sensor networks, the data vectors a ...

IEEE COMPUTER SOC2020

A priori error for unilateral contact problems with Lagrange multipliers and isogeometric analysis

Annalisa Buffa, Pablo Antolin Sanchez, Mathieu Jonathan Fabre

In this paper, we consider unilateral contact problem without friction between a rigid body and deformable one in the framework of isogeometric analysis. We present the theoretical analysis of the mixed problem. For the displacement, we use the pushforward ...

2019

, , ,

In materials with nearly commensurate band filling the electron liquid may spontaneously separate into components with distinct properties, yielding complex intra- and interunit cell ordering patterns and a reduced dimensionality. Polarization-dependent an ...

AMER PHYSICAL SOC2019

Backpropagation-Friendly Eigendecomposition

Pascal Fua, Mathieu Salzmann, Zheng Dang, Wei Wang, Yinlin Hu

Eigendecomposition (ED) is widely used in deep networks. However, the backpropagation of its results tends to be numerically unstable, whether using ED directly or approximating it with the Power Iteration method, particularly when dealing with large matri ...

NEURAL INFORMATION PROCESSING SYSTEMS (NIPS)2019