Sciweavers

263 search results - page 34 / 53
» Regret Bounds for Prediction Problems
Sort
View
JMLR
2011
137views more  JMLR 2011»
13 years 4 months ago
Online Learning in Case of Unbounded Losses Using Follow the Perturbed Leader Algorithm
In this paper the sequential prediction problem with expert advice is considered for the case where losses of experts suffered at each step cannot be bounded in advance. We presen...
Vladimir V. V'yugin
CP
2006
Springer
14 years 1 months ago
Constraint Based Resilience Analysis
Abstract. In this paper we give an overview of applications of Constraint Programming for IP (Internet Protocol) data networks, and discuss the problem of Resilience Analysis in mo...
Helmut Simonis
CDC
2009
IEEE
180views Control Systems» more  CDC 2009»
14 years 1 months ago
Robustness analysis for Least Squares kernel based regression: an optimization approach
—In kernel based regression techniques (such as Support Vector Machines or Least Squares Support Vector Machines) it is hard to analyze the influence of perturbed inputs on the ...
Tillmann Falck, Johan A. K. Suykens, Bart De Moor
VCIP
2001
110views Communications» more  VCIP 2001»
13 years 11 months ago
Lossless and near-lossless image compression with successive refinement
We present a technique that provides progressive transmission and near-lossless compression in one single framework. The proposed technique produces a bitstream that results in pr...
Ismail Avcibas, Nasir D. Memon, Bülent Sankur...
DCC
2006
IEEE
14 years 9 months ago
Non-Asymptotic Design of Finite State Universal Predictors for Individual Sequences
In this work we consider the problem of universal prediction of individual sequences where the universal predictor is a deterministic finite state machine, with a fixed, relativel...
Amir Ingber, Meir Feder