Sciweavers

1393 search results - page 123 / 279
» Machine Learning by Function Decomposition
Sort
View
ICML
2008
IEEE
16 years 2 months ago
Adaptive p-posterior mixture-model kernels for multiple instance learning
In multiple instance learning (MIL), how the instances determine the bag-labels is an essential issue, both algorithmically and intrinsically. In this paper, we show that the mech...
Hua-Yan Wang, Qiang Yang, Hongbin Zha
SIAMJO
2010
127views more  SIAMJO 2010»
14 years 8 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
COLT
2007
Springer
15 years 8 months ago
A Lower Bound for Agnostically Learning Disjunctions
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
Adam R. Klivans, Alexander A. Sherstov
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 1 months ago
Efficient Minimization of Decomposable Submodular Functions
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of co...
Peter Stobbe, Andreas Krause
CVPR
1997
IEEE
16 years 3 months ago
Global Training of Document Processing Systems Using Graph Transformer Networks
We propose a new machine learning paradigm called Graph Transformer Networks that extends the applicability of gradient-based learning algorithms to systems composed of modules th...
Léon Bottou, Yoshua Bengio, Yann LeCun