Sciweavers

227 search results - page 4 / 46
» Linearly Parameterized Bandits
Sort
View
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 7 months ago
Gaussian Process Bandits for Tree Search
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
Louis Dorard, John Shawe-Taylor
CORR
2004
Springer
103views Education» more  CORR 2004»
13 years 7 months ago
Online convex optimization in the bandit setting: gradient descent without a gradient
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
Abraham Flaxman, Adam Tauman Kalai, H. Brendan McM...
ICCAD
2005
IEEE
87views Hardware» more  ICCAD 2005»
14 years 4 months ago
Parameterized model order reduction of nonlinear dynamical systems
— In this paper we present a parameterized reduction technique for non-linear systems. Our approach combines an existing non-parameterized trajectory piecewise linear method for ...
Bradley N. Bond, Luca Daniel
GMP
2010
IEEE
175views Solid Modeling» more  GMP 2010»
13 years 11 months ago
Optimal Analysis-Aware Parameterization of Computational Domain in Isogeometric Analysis
Abstract. In isogeometric analysis (IGA for short) framework, computational domain is exactly described using the same representation as that employed in the CAD process. For a CAD...
Gang Xu, Bernard Mourrain, Régis Duvigneau,...
MOC
2010
13 years 2 months ago
On a family of Thue equations of degree 16
We consider a parameterized family of Thue equations of degree 16. By reducing this family to a system of Pell equations and linear relations, we are able to solve this family.
Volker Ziegler