paper-with-me

Papers

Beta Process Multiple Kernel Learning

2014-06-01 · CVPR 2014 6 · Bingbing Ni, Teng Li, Pierre Moulin

In kernel based learning, the kernel trick transforms the original representation of a feature instance into a vector of similarities with the training feature instances, known as kernel representation. However, feature instances are sometimes ambiguous and the kernel representation calculated based on them do not possess any discriminative information, which can eventually harm the trained classifier. To address this issue, we propose to automatically select good feature instances when calculating the kernel representation in multiple kernel learning. Specifically, for the kernel representation calculated for each input feature instance, we multiply it element-wise with a latent binary vector named as instance selection variables, which targets at selecting good instances and attenuate the effect of ambiguous ones in the resulting new kernel representation. Beta process is employed for generating the prior distribution for the latent instance selection variables. We then propose a Bayesian graphical model which integrates both MKL learning and inference for the distribution of the latent instance selection variables. Variational inference is derived for model learning under a max-margin principle. Our method is called Beta process multiple kernel learning. Extensive experiments demonstrate the effectiveness of our method on instance selection and its high discriminative capability for various classification problems in vision.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Variational Inference

Similar Papers 제목 키워드 기반

The Kernel Beta Process

2011-12-01 · NeurIPS 2011 12 · Lu Ren, Yingjian Wang, Lawrence Carin, David B. Dunson

A new Le ́vy process prior is proposed for an uncountable collection of covariate- dependent feature-learning measures; the model is called the kernel beta process (KBP). Available covariates are handled efficiently via …

BKP: An R Package for Beta Kernel Process Modeling

2025-08-14 · Jiangyan Zhao, Kunhai Qing, Jin Xu arxiv

Estimating input-dependent probability surfaces from binary, binomial, categorical, or multinomial response data is a common task in statistics and machine learning. Latent Gaussian process classifiers provide flexible n…

Asymptotic learning curves of kernel methods: empirical data v.s. Teacher-Student paradigm

2019-05-26 · Stefano Spigler, Mario Geiger, Matthieu Wyart

How many training data are needed to learn a supervised task? It is often observed that the generalization error decreases as $n^{-\beta}$ where $n$ is the number of training examples and $\beta$ an exponent that depends…

regression

On the Self-Penalization Phenomenon in Feature Selection

2021-10-12 · Michael I. Jordan, Keli Liu, Feng Ruan

We describe an implicit sparsity-inducing mechanism based on minimization over a family of kernels: \begin{equation*} \min_{\beta, f}~\widehat{\mathbb{E}}[L(Y, f(\beta^{1/q} \odot X)] + \lambda_n \|f\|_{\mathcal{H}_q}^2~…

feature selection

On the number of modes of Gaussian kernel density estimators

2024-12-12 · Borjan Geshkovski, Philippe Rigollet, Yihang Sun

We consider the Gaussian kernel density estimator with bandwidth $\beta^{-\frac12}$ of $n$ iid Gaussian samples. Using the Kac-Rice formula and an Edgeworth expansion, we prove that the expected number of modes on the re…