Biomedical subjects

Yoshua Bengio

Publications and source records attributed to Yoshua Bengio.

4 recordsLinked to original sources

PubMed2005

Selective small molecule peptidomimetic ligands of TrkC and TrkA receptors afford discrete or complete neurotrophic activities.

We designed a minilibrary of 55 small molecule peptidomimetics based on beta-turns of the neurotrophin growth factor polypeptides neurotrophin-3 (NT-3) and nerve growth factor (NGF). Direct binding, binding competition, and biological screens identified agonistic ligands of the ectodomain of the neurotrophin receptors TrkC and TrkA. Agonism is intrinsic to the peptidomimetic ligand (in the absence of neurotrophins), and/or can also be detected as potentiation of neurotrophin action. Remarkably, some peptidomimetics afford both neurotrophic activities of cell survival and neuronal differentiation, while others afford discrete signals leading to either survival or differentiation. The high rate of hits identified suggests that focused minilibraries may be desirable for developing bioactive ligands of cell surface receptors. Small, selective, proteolytically stable ligands with defined biological activity may have therapeutic potential.

Animals↗

PubMed2004

Learning eigenfunctions links spectral embedding and kernel PCA.

In this letter, we show a direct relation between spectral embedding methods and kernel principal components analysis and how both are special cases of a more general learning problem: learning the principal eigenfunctions of an operator defined from a kernel and the unknown data-generating density. Whereas spectral embedding methods provided only coordinates for the training points, the analysis justifies a simple extension to out-of-sample examples (the Nyström formula) for multidimensional scaling (MDS), spectral clustering, Laplacian eigenmaps, locally linear embedding (LLE), and Isomap. The analysis provides, for all such spectral embedding methods, the definition of a loss function, whose empirical average is minimized by the traditional algorithms. The asymptotic expected value of that loss defines a generalization performance and clarifies what these algorithms are trying to learn. Experiments with LLE, Isomap, spectral clustering, and MDS show that this out-of-sample embedding formula generalizes well, with a level of error comparable to the effect of small perturbations of the training set on the embedding.

Algorithms↗

PubMed2002

Robust regression with asymmetric heavy-tail noise distributions.

In the presence of a heavy-tail noise distribution, regression becomes much more difficult. Traditional robust regression methods assume that the noise distribution is symmetric, and they downweight the influence of so-called outliers. When the noise distribution is asymmetric, these methods yield biased regression estimators. Motivated by data-mining problems for the insurance industry, we propose a new approach to robust regression tailored to deal with asymmetric noise distribution. The main idea is to learn most of the parameters of the model using conditional quantile estimators (which are biased but robust estimators of the regression) and to learn a few remaining parameters to combine and correct these estimators, to minimize the average squared error in an unbiased way. Theoretical analysis and experiments show the clear advantages of the approach. Results are on artificial data as well as insurance data, using both linear and neural network predictors.

Algorithms↗

PubMed2002

A parallel mixture of SVMs for very large scale problems.

Support vector machines (SVMs) are the state-of-the-art models for many classification problems, but they suffer from the complexity of their training algorithm, which is at least quadratic with respect to the number of examples. Hence, it is hopeless to try to solve real-life problems having more than a few hundred thousand examples with SVMs. This article proposes a new mixture of SVMs that can be easily implemented in parallel and where each SVM is trained on a small subset of the whole data set. Experiments on a large benchmark data set (Forest) yielded significant time improvement (time complexity appears empirically to locally grow linearly with the number of examples). In addition, and surprisingly, a significant improvement in generalization was observed.

Algorithms↗