Sciweavers

65 search results - page 4 / 13
» Convergence of a Generalized Gradient Selection Approach for...
Sort
View
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
14 years 15 days ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
TSP
2008
89views more  TSP 2008»
13 years 8 months ago
A Geometrical Study of Matching Pursuit Parametrization
This paper studies the effect of discretizing the parametrization of a dictionary in the particular context of Matching Pursuit decompositions of signals. Our approach relies on th...
Laurent Jacques, Christophe De Vleeschouwer
SIAMJO
2010
127views more  SIAMJO 2010»
13 years 3 months ago
Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning
We consider a recently proposed optimization formulation of multi-task learning based on trace norm regularized least squares. While this problem may be formulated as a semidefini...
Ting Kei Pong, Paul Tseng, Shuiwang Ji, Jieping Ye
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
14 years 1 months ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
Severino F. Galán, Ole J. Mengshoel
SIAMMAX
2010
146views more  SIAMMAX 2010»
13 years 3 months ago
A Comparison of Two-Level Preconditioners Based on Multigrid and Deflation
It is well-known that two-level and multi-level preconditioned conjugate gradient (PCG) methods provide efficient techniques for solving large and sparse linear systems whose coeff...
J. M. Tang, S. P. MacLachlan, Reinhard Nabben, C. ...