Remark on "Recursive aggregation of estimators by the mirror descent algorithm with averaging" published in Probl. Peredachi Inf., 2005, no. 4

A. B. Juditsky; A. V. Nazin; A. B. Tsybakov; N. Vayatis

doi:10.1134/S0032946006030094

Remark on "Recursive aggregation of estimators by the mirror descent algorithm with averaging" published in Probl. Peredachi Inf., 2005, no. 4

A. B. Juditsky
, A. V. Nazin
, A. B. Tsybakov
, N. Vayatis

Research output: Contribution to journal › Letter › peer-review

Original language	English
Pages (from-to)	262
Number of pages	1
Journal	Problems of Information Transmission
Volume	42
Issue number	3
DOIs	https://doi.org/10.1134/S0032946006030094
Publication status	Published - 1 Sept 2006

Access to Document

10.1134/S0032946006030094

Cite this

@article{c3074bd46623485389eeba1448a9c54d,

title = "Remark on {"}Recursive aggregation of estimators by the mirror descent algorithm with averaging{"} published in Probl. Peredachi Inf., 2005, no. 4",

author = "Juditsky, \{A. B.\} and Nazin, \{A. V.\} and Tsybakov, \{A. B.\} and N. Vayatis",

year = "2006",

month = sep,

day = "1",

doi = "10.1134/S0032946006030094",

language = "English",

volume = "42",

pages = "262",

journal = "Problems of Information Transmission",

issn = "0032-9460",

number = "3",

}

TY - JOUR

T1 - Remark on "Recursive aggregation of estimators by the mirror descent algorithm with averaging" published in Probl. Peredachi Inf., 2005, no. 4

AU - Juditsky, A. B.

AU - Nazin, A. V.

AU - Tsybakov, A. B.

AU - Vayatis, N.

PY - 2006/9/1

Y1 - 2006/9/1

UR - https://www.scopus.com/pages/publications/33750211223

U2 - 10.1134/S0032946006030094

DO - 10.1134/S0032946006030094

M3 - Letter

AN - SCOPUS:33750211223

SN - 0032-9460

VL - 42

SP - 262

JO - Problems of Information Transmission

JF - Problems of Information Transmission

IS - 3

ER -

Remark on "Recursive aggregation of estimators by the mirror descent algorithm with averaging" published in Probl. Peredachi Inf., 2005, no. 4

Access to Document

Other files and links

Cite this