Sciweavers

593 search results - page 4 / 119
» Optimizing Complex Loss Functions in Structured Prediction
Sort
View
NIPS
1996
13 years 9 months ago
Radial Basis Function Networks and Complexity Regularization in Function Learning
In this paper we apply the method of complexity regularization to derive estimation bounds for nonlinear function estimation using a single hidden layer radial basis function netwo...
Adam Krzyzak, Tamás Linder
EMNLP
2011
12 years 7 months ago
Structured Sparsity in Structured Prediction
Linear models have enjoyed great success in structured prediction in NLP. While a lot of progress has been made on efficient training with several loss functions, the problem of ...
André F. T. Martins, Noah A. Smith, M&aacut...
KDD
2008
ACM
147views Data Mining» more  KDD 2008»
14 years 8 months ago
Structured learning for non-smooth ranking losses
Learning to rank from relevance judgment is an active research area. Itemwise score regression, pairwise preference satisfaction, and listwise structured learning are the major te...
Soumen Chakrabarti, Rajiv Khanna, Uma Sawant, Chir...
TIT
2002
95views more  TIT 2002»
13 years 7 months ago
On sequential strategies for loss functions with memory
The problem of optimal sequential decision for individual sequences, relative to a class of competing o -line reference strategies, is studied for general loss functions with memo...
Neri Merhav, Erik Ordentlich, Gadiel Seroussi, Mar...
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 7 months ago
Adaptive Bound Optimization for Online Convex Optimization
We introduce a new online convex optimization algorithm that adaptively chooses its regularization function based on the loss functions observed so far. This is in contrast to pre...
H. Brendan McMahan, Matthew J. Streeter