Sciweavers

576 search results - page 9 / 116
» Structured metric learning for high dimensional problems
Sort
View
SIAMIS
2010
171views more  SIAMIS 2010»
13 years 2 months ago
Global Optimization for One-Dimensional Structure and Motion Problems
We study geometric reconstruction problems in one-dimensional retina vision. In such problems, the scene is modeled as a 2D plane, and the camera sensor produces 1D images of the s...
Olof Enqvist, Fredrik Kahl, Carl Olsson, Kalle &Ar...
ICML
2006
IEEE
14 years 8 months ago
Bayesian regression with input noise for high dimensional data
This paper examines high dimensional regression with noise-contaminated input and output data. Goals of such learning problems include optimal prediction with noiseless query poin...
Jo-Anne Ting, Aaron D'Souza, Stefan Schaal
PREMI
2005
Springer
14 years 1 months ago
Geometric Decision Rules for Instance-Based Learning Problems
In the typical nonparametric approach to classification in instance-based learning and data mining, random data (the training set of patterns) are collected and used to design a d...
Binay K. Bhattacharya, Kaustav Mukherjee, Godfried...
CORR
2012
Springer
232views Education» more  CORR 2012»
12 years 3 months ago
Smoothing Proximal Gradient Method for General Structured Sparse Learning
We study the problem of learning high dimensional regression models regularized by a structured-sparsity-inducing penalty that encodes prior structural information on either input...
Xi Chen, Qihang Lin, Seyoung Kim, Jaime G. Carbone...
COLT
2010
Springer
13 years 5 months ago
Principal Component Analysis with Contaminated Data: The High Dimensional Case
We consider the dimensionality-reduction problem (finding a subspace approximation of observed data) for contaminated data in the high dimensional regime, where the number of obse...
Huan Xu, Constantine Caramanis, Shie Mannor