Sciweavers

NIPS
2003
14 years 28 days ago
Ambiguous Model Learning Made Unambiguous with 1/f Priors
What happens to the optimal interpretation of noisy data when there exists more than one equally plausible interpretation of the data? In a Bayesian model-learning framework the a...
Gurinder S. Atwal, William Bialek
NIPS
2003
14 years 28 days ago
Probabilistic Inference of Speech Signals from Phaseless Spectrograms
Many techniques for complex speech processing such as denoising and deconvolution, time/frequency warping, multiple speaker separation, and multiple microphone analysis operate on...
Kannan Achan, Sam T. Roweis, Brendan J. Frey
NIPS
2003
14 years 28 days ago
Learning to Find Pre-Images
We consider the problem of reconstructing patterns from a feature map. Learning algorithms using kernels to operate in a reproducing kernel Hilbert space (RKHS) express their solu...
Gökhan H. Bakir, Jason Weston, Bernhard Sch&o...
NIPS
2001
14 years 28 days ago
Active Portfolio-Management based on Error Correction Neural Networks
Hans-Georg Zimmermann, Ralph Neuneier, Ralph Groth...
NIPS
2001
14 years 28 days ago
Kernel Logistic Regression and the Import Vector Machine
The support vector machine (SVM) is known for its good performance in binary classification, but its extension to multi-class classification is still an on-going research issue. I...
Ji Zhu, Trevor Hastie
NIPS
2001
14 years 28 days ago
A General Greedy Approximation Algorithm with Applications
Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. In this paper, we present a general greedy algorithm for solving a class...
T. Zhang
NIPS
2001
14 years 28 days ago
Generalization Performance of Some Learning Problems in Hilbert Functional Spaces
We investigate the generalization performance of some learning problems in Hilbert functional Spaces. We introduce a notion of convergence of the estimated functional predictor to...
T. Zhang
NIPS
2001
14 years 28 days ago
Spectral Relaxation for K-means Clustering
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
Hongyuan Zha, Xiaofeng He, Chris H. Q. Ding, Ming ...
NIPS
2001
14 years 28 days ago
Reducing multiclass to binary by coupling probability estimates
This paper presents a method for obtaining class membership probability estimates for multiclass classification problems by coupling the probability estimates produced by binary c...
B. Zadrozny
NIPS
2001
14 years 28 days ago
The Concave-Convex Procedure (CCCP)
We introduce the Concave-Convex procedure (CCCP) which constructs discrete time iterative dynamical systems which are guaranteed to monotonically decrease global optimization/ener...
Alan L. Yuille, Anand Rangarajan