• Aucun résultat trouvé

Model identification and local linear convergence of coordinate descent

N/A
N/A
Protected

Academic year: 2021

Partager "Model identification and local linear convergence of coordinate descent"

Copied!
27
0
0

Texte intégral

Loading

Figure

Figure 1: Lasso, linear convergence. Distance to optimum, k x (k) − x ? k , as a function of the number of iterations k, on 4 different datasets: leukemia, gisette, rcv1, and real-sim.
Figure 2: Sparse logistic regression, linear convergence. Distance to optimum, k x (k) − x ? k , as a function of the number of iterations k, on 4 different datasets: leukemia, gisette, rcv1, and real-sim.
Table 1: Characteristics of the datasets.
Table 2: C values for SVM.

Références

Documents relatifs

To study this complex structure, we use a classical finite element code with a simplified model (called macromodel) to avoid a large number of degrees of freedom implied by a

Besides, the problem is addressed in the context of robustness requirement: an unknown deviation from the linear regression model (called model error or misspecification) is supposed

The Hamiltonian Monte Carlo algorithm and a method based on a system of dynamical stochastic differential equations were considered and applied to a simplified pyrolysis model to

In this paper, we proposed a block successive convex ap- proximation algorithm for nonsmooth nonconvex optimization problems. The proposed algorithm partitions the whole set

This information is calculated in a fashion similar to (4), except that here only the directly predicted genes are taken into account. Directly predicted genes

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

Kif5b ne semble donc pas nécessaire pour les mouvements des clusters de triadine à DIF3. Il serait tout de même intéressant de voir si c’est également bien le cas à 16h

This would either require to use massive Monte-Carlo simulations at each step of the algorithm or to apply, again at each step of the algorithm, a quantization procedure of