Sciweavers

24 search results - page 3 / 5
» Online convex optimization in the bandit setting: gradient d...
Sort
View
EMMCVPR
2011
Springer
12 years 4 months ago
Discrete Optimization of the Multiphase Piecewise Constant Mumford-Shah Functional
Abstract. The Mumford-Shah model has been one of the most powerful models in image segmentation and denoising. The optimization of the multiphase Mumford-Shah energy functional has...
Noha Youssry El-Zehiry, Leo Grady
ICML
2006
IEEE
14 years 5 months ago
Learning algorithms for online principal-agent problems (and selling goods online)
In a principal-agent problem, a principal seeks to motivate an agent to take a certain action beneficial to the principal, while spending as little as possible on the reward. This...
Vincent Conitzer, Nikesh Garera
KDD
2012
ACM
194views Data Mining» more  KDD 2012»
11 years 7 months ago
A sparsity-inducing formulation for evolutionary co-clustering
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
Shuiwang Ji, Wenlu Zhang, Jun Liu
CORR
2011
Springer
127views Education» more  CORR 2011»
12 years 8 months ago
Generalized Boosting Algorithms for Convex Optimization
Boosting is a popular way to derive powerful learners from simpler hypothesis classes. Following previous work (Mason et al., 1999; Friedman, 2000) on general boosting frameworks,...
Alexander Grubb, J. Andrew Bagnell
ICDM
2007
IEEE
157views Data Mining» more  ICDM 2007»
13 years 6 months ago
Training Conditional Random Fields by Periodic Step Size Adaptation for Large-Scale Text Mining
For applications with consecutive incoming training examples, on-line learning has the potential to achieve a likelihood as high as off-line learning without scanning all availabl...
Han-Shen Huang, Yu-Ming Chang, Chun-Nan Hsu