Abstract Concept drift is a well-known issue that arises when working with data streams. In this paper, we present procedure allows quantile tracking to cope concept drift. We suggest using expected loss, popular loss function in regression, monitor the error, which, turn, used efficiently adapt The suggested procedures drift, and performance close theoretically optimal. were further applied th...

Many convex optimization problems have structured objective functions written as a sum of with different oracle types (e.g., full gradient, coordinate derivative, stochastic gradient) and arithmetic operations complexity these oracles. In the strongly case, also condition numbers that eventually define iteration first-order methods number calls required to achieve given accuracy. Motivated by d...

We define Oracle-Type-2-Machine capable of writing infinite oracle queries. In contrast to finite oracle queries, this extends the realm of oracle-computable function into the discontinuous realm. Our definition is conservative; access to a computable oracle does not increase the computational power. Other models of real hypercomputation such as Ziegler’s (finitely) revising computation ([4], [...

For relativized arguments, we propose to restrict oracle queries to “stringent” ones; for comparing the power of two machine models relative to some oracle set, stringent relativization is to restrict machines of both types to ask queries on the same segment of the oracle. In particular, for investigating polynomial-time (or polynomial-size) computability, we propose polynomial stringency, boun...

We define Oracle-Type-2-Machine capable of writing infinite oracle queries. In contrast to finite oracle queries, this extends the realm of oracle-computable functions into the discontinuous realm. Our definition is conservative; access to a computable oracle does not increase the computational power. Other models of real hypercomputation such as Ziegler’s (finitely) revising computation or Typ...

We discuss a reduction notion relating the random oracles in two cryptographic schemes A and B. Basically, the random oracle of scheme B reduces to the one of scheme A if any hash function instantiation of the random oracle (possibly still oracle based) which makes A secure also makes B secure. In a sense, instantiating the random oracle in scheme B is thus not more demanding than the one for s...