146 search results - page 12 / 30 » Online Gradient Descent Learning Algorithms |
ACL
2012
11 years 9 months ago
2012
We present a joint model for Chinese word segmentation and new word detection. We present high dimensional new features, including word-based features and enriched edge (label-tra...
PREMI
2005
Springer
14 years 25 days ago
2005
Springer
A hierarchical framework for document segmentation is proposed as an optimization problem. The model incorporates the dependencies between various levels of the hierarchy unlike tr...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
We describe and analyze a simple and effective iterative algorithm for solving the optimization problem cast by Support Vector Machines (SVM). Our method alternates between stocha...
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
CVPR
2012
IEEE
11 years 9 months ago
2012
IEEE
It has recently been shown that only a small number of samples from a low-rank matrix are necessary to reconstruct the entire matrix. We bring this to bear on computer vision prob...