Sciweavers

818 search results - page 28 / 164
» Regularized multi--task learning
Sort
View
ICASSP
2009
IEEE
14 years 4 months ago
Map approach to learning sparse Gaussian Markov networks
Recently proposed l1-regularized maximum-likelihood optimization methods for learning sparse Markov networks result into convex problems that can be solved optimally and efficien...
Narges Bani Asadi, Irina Rish, Katya Scheinberg, D...
ICCBR
1999
Springer
14 years 2 months ago
When Experience Is Wrong: Examining CBR for Changing Tasks and Environments
Case-based problem-solving systems reason and learn from experiences, building up case libraries of problems and solutions to guide future reasoning. The expected bene ts of this l...
David B. Leake, David C. Wilson
UAI
2003
13 years 11 months ago
On Information Regularization
We formulate a principle for classification with the knowledge of the marginal distribution over the data points (unlabeled data). The principle is cast in terms of Tikhonov styl...
Adrian Corduneanu, Tommi Jaakkola
KDD
2007
ACM
132views Data Mining» more  KDD 2007»
14 years 10 months ago
A scalable modular convex solver for regularized risk minimization
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...
Choon Hui Teo, Alex J. Smola, S. V. N. Vishwanatha...
COLT
2006
Springer
13 years 11 months ago
Can Entropic Regularization Be Replaced by Squared Euclidean Distance Plus Additional Linear Constraints
There are two main families of on-line algorithms depending on whether a relative entropy or a squared Euclidean distance is used as a regularizer. The difference between the two f...
Manfred K. Warmuth