Extracting certainty from uncertainty: regret bounded by variation in costs

ISSN： 0885-6125

Source： Machine Learning, Vol.80, Iss.2-3, 2010-09, pp. : 165-188

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Regret bounded by gradual variation for online convex optimization

By Yang Tianbao Mahdavi Mehrdad Jin Rong Zhu Shenghuo

Machine Learning, Vol. 95, Iss. 2, 2014-05 ,pp. : 183-223

Springer Publishing Company

Access to resources Recommend Favorite

Worst-case regret algorithms for selected optimization problems with interval uncertainty

By Józefczyk Jerzy Siepak Marcin

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 42, Iss. 3, 2013-03 ,pp. : 371-382

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Extracting order from chaos

By Sherif Joseph Singhania Ram

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 38, Iss. 6, 2009-01 ,pp. : 1010-1016

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Extracting Knowledge from Web Data

Journal of Information Technology Research (JITR), Vol. 7, Iss. 4, 2014-10 ,pp. : 27-41

IGI Global_journal

Access to resources Recommend Favorite

Robust Stability of Linear Discrete Stationary Systems with Uncertainty Bounded in the Anisotropic Norm

By Kurdyukov A. P. Maksimov E. A.

Automation and Remote Control, Vol. 65, Iss. 12, 2004-12 ,pp. : 1977-1990

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite