Sciweavers

74 search results - page 11 / 15
» Regret Bounds for Gaussian Process Bandit Problems
Sort
View
MANSCI
2007
100views more  MANSCI 2007»
13 years 7 months ago
Dynamic Assortment with Demand Learning for Seasonal Consumer Goods
Companies such as Zara and World Co. have recently implemented novel product development processes and supply chain architectures enabling them to make more product design and ass...
Felipe Caro, Jérémie Gallien
NECO
2010
97views more  NECO 2010»
13 years 6 months ago
Rademacher Chaos Complexities for Learning the Kernel Problem
In this paper we develop a novel generalization bound for learning the kernel problem. First, we show that the generalization analysis of the kernel learning problem reduces to in...
Yiming Ying, Colin Campbell
TIP
1998
128views more  TIP 1998»
13 years 7 months ago
Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage
This paper examines the relationship between wavelet-based image processing algorithms and variational problems. Algorithms are derived as exact or approximate minimizers of varia...
Antonin Chambolle, Ronald A. DeVore, Nam-Yong Lee,...
ICASSP
2010
IEEE
13 years 6 months ago
A signal-specific bound for joint tdoa and FDOA estimation and its Use in combining multiple segments
We consider passive joint estimation of the time-difference of arrival (TDOA) and frequency-difference of arrival (FDOA) of an unknown signal at two sensors. The classical approac...
Arie Yeredor
ICASSP
2010
IEEE
13 years 5 months ago
Robust rate-maximization game under bounded channel uncertainty
The problem of decentralized power allocation for competitive rate maximization in a frequency-selective Gaussian interference channel is considered. In the absence of perfect kno...
Amod J. G. Anandkumar, Animashree Anandkumar, Sang...