Sciweavers

495 search results - page 15 / 99
» Approximation algorithms for budgeted learning problems
Sort
View

Publication
222views
14 years 5 months ago
Algorithms and Bounds for Rollout Sampling Approximate Policy Iteration
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...
Christos Dimitrakakis, Michail G. Lagoudakis
SIAMDM
2010
117views more  SIAMDM 2010»
13 years 6 months ago
Design is as Easy as Optimization
We consider the class of max-min and min-max optimization problems subject to a global budget (or weight) constraint and we undertake a systematic algorithmic and complexitytheore...
Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vaz...
ICPR
2006
IEEE
14 years 9 months ago
Weakly Supervised Learning on Pre-image Problem in Kernel Methods
This paper presents a novel alternative approach, namely weakly supervised learning (WSL), to learn the pre-image of a feature vector in the feature space induced by a kernel. It ...
Weishi Zheng, Jian-Huang Lai, Pong Chi Yuen
STOC
2012
ACM
209views Algorithms» more  STOC 2012»
11 years 11 months ago
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
Anindya De, Ilias Diakonikolas, Vitaly Feldman, Ro...
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
14 years 8 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman