Sciweavers

3643 search results - page 21 / 729
» Learning Submodular Functions
Sort
View
SODA
2010
ACM
208views Algorithms» more  SODA 2010»
15 years 7 months ago
Correlation Robust Stochastic Optimization
We consider a robust model proposed by Scarf, 1958, for stochastic optimization when only the marginal probabilities of (binary) random variables are given, and the correlation be...
Shipra Agrawal, Yichuan Ding, Amin Saberi, Yinyu Y...
CORR
2011
Springer
177views Education» more  CORR 2011»
14 years 5 months ago
A Truthful Randomized Mechanism for Combinatorial Public Projects via Convex Optimization
In Combinatorial Public Projects, there is a set of projects that may be undertaken, and a set of selfinterested players with a stake in the set of projects chosen. A public plann...
Shaddin Dughmi
COLT
1999
Springer
15 years 2 months ago
On the Intrinsic Complexity of Learning Recursive Functions
Efim B. Kinber, Christophe Papazian, Carl H. Smith...
COLT
1993
Springer
15 years 2 months ago
On the Complexity of Function Learning
Peter Auer, Philip M. Long, Wolfgang Maass, Gerhar...
COLT
2008
Springer
14 years 11 months ago
Improved Guarantees for Learning via Similarity Functions
Maria-Florina Balcan, Avrim Blum, Nathan Srebro