Sciweavers

35 search results - page 3 / 7
» Online Multiple Instance Learning with No Regret
Sort
View
COLT
2007
Springer
14 years 1 months ago
On-Line Estimation with the Multivariate Gaussian Distribution
We consider on-line density estimation with the multivariate Gaussian distribution. In each of a sequence of trials, the learner must posit a mean µ and covariance Σ; the learner...
Sanjoy Dasgupta, Daniel Hsu
COLT
2004
Springer
13 years 11 months ago
Regret Bounds for Hierarchical Classification with Linear-Threshold Functions
We study the problem of classifying data in a given taxonomy when classifications associated with multiple and/or partial paths are allowed. We introduce an incremental algorithm u...
Nicolò Cesa-Bianchi, Alex Conconi, Claudio ...
CORR
2010
Springer
171views Education» more  CORR 2010»
13 years 2 months ago
Online Learning in Opportunistic Spectrum Access: A Restless Bandit Approach
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...
Cem Tekin, Mingyan Liu
CORR
2011
Springer
198views Education» more  CORR 2011»
12 years 11 months ago
Decentralized Online Learning Algorithms for Opportunistic Spectrum Access
—The fundamental problem of multiple secondary users contending for opportunistic spectrum access over multiple channels in cognitive radio networks has been formulated recently ...
Yi Gai, Bhaskar Krishnamachari
ICASSP
2011
IEEE
12 years 11 months ago
Multiple instance tracking based on hierarchical maximizing bag's margin boosting
In online tracking, the tracker evolves to reflect variations in object appearance and surroundings. This updating process is formulated as a supervised learning problem, thus a ...
Chunxiao Liu, Guijin Wang, Xinggang Lin, Bobo Zeng