Sciweavers

1062 search results - page 124 / 213
» Sublinear Optimization for Machine Learning
Sort
View
132
Voted
ML
2002
ACM
127views Machine Learning» more  ML 2002»
15 years 1 months ago
Sparse Regression Ensembles in Infinite and Finite Hypothesis Spaces
We examine methods for constructing regression ensembles based on a linear program (LP). The ensemble regression function consists of linear combinations of base hypotheses generat...
Gunnar Rätsch, Ayhan Demiriz, Kristin P. Benn...
100
Voted
ICML
2007
IEEE
16 years 3 months ago
Scalable training of L1-regularized log-linear models
The l-bfgs limited-memory quasi-Newton method is the algorithm of choice for optimizing the parameters of large-scale log-linear models with L2 regularization, but it cannot be us...
Galen Andrew, Jianfeng Gao
ICML
2006
IEEE
16 years 3 months ago
Algorithms for portfolio management based on the Newton method
We experimentally study on-line investment algorithms first proposed by Agarwal and Hazan and extended by Hazan et al. which achieve almost the same wealth as the best constant-re...
Amit Agarwal, Elad Hazan, Satyen Kale, Robert E. S...
105
Voted
ICDM
2007
IEEE
132views Data Mining» more  ICDM 2007»
15 years 8 months ago
Learning What Makes a Society Tick
We present a machine learning methodology (models, algorithms, and experimental data) to discovering the agent dynamics that drive the evolution of the social groups in a communit...
Hung-Ching Chen, Mark K. Goldberg, Malik Magdon-Is...
ICDM
2006
IEEE
119views Data Mining» more  ICDM 2006»
15 years 8 months ago
Fast On-line Kernel Learning for Trees
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...