In additive models the problem of variable selection is strongly linked to the choice of the amount of smoothing used for components that represent metrical variables. Many software packages use separate toolsto solve the different tasks of variable selection and smoothing parameter choice. The...

The adaptive lasso is a model selection method shown to be both consistent in variable selection and asymptotically normal in coefficient estimation. The actual variable selection performance of the adaptive lasso depends on the weight used. It turns out that the weight assignment using the OLS...

The problem of variable selection for linear regression in a high dimension model is considered. A new method, called Extended-VISA (Ext-VISA), is proposed to simultaneously select variables and encourage a grouping effect where strongly correlated predictors tend to be in or out of the model...

A Monte Carlo algorithm is said to be adaptive if it can adjust automatically its current proposal distribution, using past simulations. The choice of the parametric family that defines the set of proposal distributions is critical for a good performance. We treat the problem of constructing...

A Monte Carlo algorithm is said to be adaptive if it automatically calibrates its current proposal distribution using past simulations. The choice of the parametric family that defines the set of proposal distributions is critical for a good performance. In this paper, we present such a...

We study technology adoption in a dynamic model of price competition. Adoption involves disruption costs and learning by doing. Because of disruption costs, the adopting firm begins in a market disadvantage, which may persist if its rival captures the buyers it needs to learn the technology. The...