Sciweavers

732 search results - page 23 / 147
» Strongly Non-U-Shaped Learning Results by General Techniques
Sort
View
TCC
2010
Springer
173views Cryptology» more  TCC 2010»
14 years 4 months ago
Bounds on the Sample Complexity for Private Learning and Private Data Release
Learning is a task that generalizes many of the analyses that are applied to collections of data, and in particular, collections of sensitive individual information. Hence, it is n...
Amos Beimel, Shiva Prasad Kasiviswanathan, Kobbi N...
ICML
2010
IEEE
13 years 8 months ago
Deep Supervised t-Distributed Embedding
Deep learning has been successfully applied to perform non-linear embedding. In this paper, we present supervised embedding techniques that use a deep network to collapse classes....
Martin Renqiang Min, Laurens van der Maaten, Zinen...
SIGIR
2012
ACM
11 years 10 months ago
Robust ranking models via risk-sensitive optimization
Many techniques for improving search result quality have been proposed. Typically, these techniques increase average effectiveness by devising advanced ranking features and/or by...
Lidan Wang, Paul N. Bennett, Kevyn Collins-Thompso...
FOCS
2009
IEEE
14 years 2 months ago
Agnostic Learning of Monomials by Halfspaces Is Hard
— We prove the following strong hardness result for learning: Given a distribution on labeled examples from the hypercube such that there exists a monomial (or conjunction) consi...
Vitaly Feldman, Venkatesan Guruswami, Prasad Ragha...
ICML
2004
IEEE
14 years 8 months ago
Bayesian inference for transductive learning of kernel matrix using the Tanner-Wong data augmentation algorithm
In kernel methods, an interesting recent development seeks to learn a good kernel from empirical data automatically. In this paper, by regarding the transductive learning of the k...
Zhihua Zhang, Dit-Yan Yeung, James T. Kwok