Sciweavers

220 search results - page 39 / 44
» SMOS L1 algorithms
Sort
View
CSDA
2007
106views more  CSDA 2007»
13 years 7 months ago
Parsimonious additive models
A new method for function estimation and variable selection, specifically designed for additive models fitted by cubic splines is proposed.This new method involves regularizing ...
Marta Avalos, Yves Grandvalet, Christophe Ambroise
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 6 months ago
Optimism in Reinforcement Learning Based on Kullback-Leibler Divergence
We consider model-based reinforcement learning in finite Markov Decision Processes (MDPs), focussing on so-called optimistic strategies. Optimism is usually implemented by carryin...
Sarah Filippi, Olivier Cappé, Aurelien Gari...
CPM
2008
Springer
143views Combinatorics» more  CPM 2008»
13 years 9 months ago
A Black Box for Online Approximate Pattern Matching
Abstract. We present a deterministic black box solution for online approximate matching. Given a pattern of length m and a streaming text of length n that arrives one character at ...
Raphaël Clifford, Klim Efremenko, Benny Porat...
CCCG
2010
13 years 9 months ago
New variations of the reverse facility location problem
In this paper we consider a natural extension of the socalled reverse facility location problem which was introduced by Cabello et al. [3]. Given a set of n users and a set of m f...
Bhaswar B. Bhattacharya, Subhas C. Nandy
ICML
2010
IEEE
13 years 8 months ago
Learning Fast Approximations of Sparse Coding
In Sparse Coding (SC), input vectors are reconstructed using a sparse linear combination of basis vectors. SC has become a popular method for extracting features from data. For a ...
Karol Gregor, Yann LeCun