Sciweavers

101 search results - page 6 / 21
» Efficient Reductions for Imitation Learning
Sort
View
WWW
2006
ACM
14 years 8 months ago
Browsing on small screens: recasting web-page segmentation into an efficient machine learning framework
Fitting enough information from webpages to make browsing on small screens compelling is a challenging task. One approach is to present the user with a thumbnail image of the full...
Shumeet Baluja
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
13 years 5 months ago
Efficient and Numerically Stable Sparse Learning
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
Sihong Xie, Wei Fan, Olivier Verscheure, Jiangtao ...
STOC
2005
ACM
198views Algorithms» more  STOC 2005»
14 years 7 months ago
On lattices, learning with errors, random linear codes, and cryptography
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
Oded Regev
ICML
2003
IEEE
14 years 8 months ago
Learning Distance Functions using Equivalence Relations
We address the problem of learning distance metrics using side-information in the form of groups of "similar" points. We propose to use the RCA algorithm, which is a sim...
Aharon Bar-Hillel, Tomer Hertz, Noam Shental, Daph...
NPL
2006
130views more  NPL 2006»
13 years 7 months ago
A Fast Feature-based Dimension Reduction Algorithm for Kernel Classifiers
This paper presents a novel dimension reduction algorithm for kernel based classification. In the feature space, the proposed algorithm maximizes the ratio of the squared between-c...
Senjian An, Wanquan Liu, Svetha Venkatesh, Ronny T...