Sciweavers

1376 search results - page 73 / 276
» The Localization Hypothesis and Machines
Sort
View
JMLR
2010
143views more  JMLR 2010»
13 years 8 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...
ICML
1996
IEEE
14 years 10 months ago
Learning Relational Concepts with Decision Trees
In this paper, we describe two di erent learning tasks for relational structures. When learning a classi er for structures, the relational structures in the training sets are clas...
Peter Geibel, Fritz Wysotzki
AI
2009
Springer
14 years 1 months ago
Financial Forecasting Using Character N-Gram Analysis and Readability Scores of Annual Reports
Abstract. Two novel Natural Language Processing (NLP) classification techniques are applied to the analysis of corporate annual reports in the task of financial forecasting. The ...
Matthew Butler, Vlado Keselj
ALT
2009
Springer
14 years 1 months ago
Learning and Domain Adaptation
Domain adaptation is a fundamental learning problem where one wishes to use labeled data from one or several source domains to learn a hypothesis performing well on a different, y...
Yishay Mansour
NIPS
2001
13 years 11 months ago
Online Learning with Kernels
Abstract--Kernel-based algorithms such as support vector machines have achieved considerable success in various problems in batch setting, where all of the training data is availab...
Jyrki Kivinen, Alex J. Smola, Robert C. Williamson