Lower Bounds on Regret for Noisy Gaussian Process Bandit Optimization

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.

The shear stiffness of headed stud connector is a critical parameter for the calculation of deflection and inter-facial shear force for steel-concrete composite structure. Thus, this study presented a promising data-driven model auto-tuning Deep Forest (AT ...

We study the problem of estimating an unknown function from noisy data using shallow ReLU neural networks. The estimators we study minimize the sum of squared data-fitting errors plus a regularization term proportional to the squared Euclidean norm of the ...

This thesis concerns the theory of positive-definite completions and its mutually beneficial connections to the statistics of function-valued or continuously-indexed random processes, better known as functional data analysis. In particular, it dwells upon ...

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

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

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

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

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

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

We characterize the solution of a broad class of convex optimization problems that address the reconstruction of a function from a finite number of linear measurements. The underlying hypothesis is that the solution is decomposable as a finite sum of compo ...

Principal Component Analysis (PCA) is a powerful tool in statistics and machine learning. While existing study of PCA focuses on the recovery of principal components and their associated eigenvalues, there are few precise characterizations of individual pr ...

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

The invention relates to a material removing tool, such as an ice cream scoop, and method for designing the same. The material removing tool has a shape optimized to minimize the amount of work the user has to provide in order to form and remove a piece of ...

We analyze the adaptive first order algorithm AMSGrad, for solving a constrained stochastic optimization problem with a weakly convex objective. We prove the

\tilde O(t^{-1/2})

rate of convergence for the squared norm of the gradient of Moreau envelope, ...

We propose nonparametric estimators for the second-order central moments of possibly anisotropic spherical random fields, within a functional data analysis context. We consider a measurement framework where each random field among an identically distribute ...

Lower Bounds on Regret for Noisy Gaussian Process Bandit Optimization

Chattez avec Graph Search

Auto-tuning deep forest for shear stiffness prediction of headed stud connectors

Near-Minimax Optimal Estimation With Shallow ReLU Neural Networks

Positive Definite Completions and Continuous Graphical Models

Kernel Methods and Similarity Learning Applied in Computational Chemistry

Multikernel Regression with Sparsity Constraint

NrOS: Effective Replication and Sharing in an Operating System

Midas: Systematic Kernel TOCTTOU Protection

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

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

Convex optimization in sums of Banach spaces

AN l(p) THEORY OF PCA AND SPECTRAL CLUSTERING

What can linearized neural networks actually say about generalization?

Material removing tool and method for designing the same

Convergence of adaptive algorithms for constrained weakly convex optimization

Functional estimation of anisotropic covariance and autocovariance operators on the sphere