selection problems | Sciweavers

44

AAAI
2012

225views Intelligent Agents» more AAAI 2012»

Convex Matching Pursuit for Large-Scale Sparse Coding and Subset Selection

12 years 3 months ago

In this paper, a new convex matching pursuit scheme is proposed for tackling large-scale sparse coding and subset selection problems. In contrast with current matching pursuit alg...

Mingkui Tan, Ivor W. Tsang, Li Wang, Xinming Zhang

claim paper

Read More »

36

click to vote

JCAM
2011

69views more JCAM 2011»

Comonotonic approximations for a generalized provisioning problem with application to optimal portfolio selection

13 years 3 months ago

Download www.econ.kuleuven.be

In this paper we discuss multiperiod portfolio selection problems related to a speci…c provisioning problem. Our results are an extension of Dhaene et al. (2005), where optimal ...

Koen Van Weert, Jan Dhaene, Marc J. Goovaerts

claim paper

Read More »

39

click to vote

DA
2010

123views more DA 2010»

Paradoxes in Learning and the Marginal Value of Information

13 years 9 months ago

Download www.castlelab.princeton.edu

We consider the Bayesian ranking and selection problem, in which one wishes to allocate an information collection budget as efficiently as possible to choose the best among severa...

Peter Frazier, Warren B. Powell

claim paper

Read More »

32

click to vote

CORR
2010
Springer

100views Education» more CORR 2010»

Convex Relaxations for Subset Selection

14 years 25 days ago

Download www.princeton.edu

We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the...

Francis Bach, Selin Damla Ahipasaoglu, Alexandre d...

claim paper

Read More »

34

click to vote

GECCO
2006
Springer

133views Optimization» more GECCO 2006»

Search--based approaches to the component selection and prioritization problem

14 years 4 months ago