Sciweavers

701 search results - page 122 / 141
» Self Bounding Learning Algorithms
Sort
View
NETWORKS
2010
13 years 6 months ago
A mean-variance model for the minimum cost flow problem with stochastic arc costs
This paper considers a minimum cost flow problem where arc costs are uncertain, and the decision maker wishes to minimize both the expected flow cost and the variance of this co...
Stephen D. Boyles, S. Travis Waller
KDD
2000
ACM
121views Data Mining» more  KDD 2000»
13 years 11 months ago
Mining high-speed data streams
Many organizations today have more than very large databases; they have databases that grow without limit at a rate of several million records per day. Mining these continuous dat...
Pedro Domingos, Geoff Hulten
COLT
2010
Springer
13 years 5 months ago
Nonparametric Bandits with Covariates
We consider a bandit problem which involves sequential sampling from two populations (arms). Each arm produces a noisy reward realization which depends on an observable random cov...
Philippe Rigollet, Assaf Zeevi
ICML
2007
IEEE
14 years 8 months ago
Relational clustering by symmetric convex coding
Relational data appear frequently in many machine learning applications. Relational data consist of the pairwise relations (similarities or dissimilarities) between each pair of i...
Bo Long, Zhongfei (Mark) Zhang, Xiaoyun Wu, Philip...
CDC
2010
IEEE
196views Control Systems» more  CDC 2010»
13 years 2 months ago
Convergence and convergence rate of stochastic gradient search in the case of multiple and non-isolated extrema
The asymptotic behavior of stochastic gradient algorithms is studied. Relying on some results of differential geometry (Lojasiewicz gradient inequality), the almost sure pointconve...
Vladislav B. Tadic