This paper considers the online scenario using Barzilai-Borwein Quasi-Newton Method. In an optimization problem, agent uses a certain algorithm to decide on objective at each time step after which possible loss is encountered. Even though player will ideally try make best decisions step, there notion of regret associated with player’s decisions. study examines methods like methods, due their fa...

We initiate the study of sublinear-time algorithms in the external memory model [Vit01]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged a unit cost for each block access. This model is well-studied, since it reflects the computational issues occurring when the (massive) input is stored on a disk. Since each block access operates on B data elements ...

We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged a unit cost for each block access. This model is well-studied, since it reflects the computational issues occurring when the (massive) input is stored on a disk. Since each block access operates on B data elements in ...

We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged a unit cost for each block access. This model is well-studied, since it reflects the computational issues occurring when the (massive) input is stored on a disk. Since each block access operates on B data elements in ...

Œe degree distribution is one of the most fundamental properties used in the analysis of massive graphs. Œere is a large literature on graph sampling, where the goal is to estimate properties (especially the degree distribution) of a large graph through a small, random sample. Œe degree distribution estimation poses a signi€cant challenge, due to its heavy-tailed nature and the large variance i...

We consider the problem of estimating the number of triangles in a graph. This problem has been extensively studied in two models: exact counting algorithms, which require reading the entire graph, and streaming algorithms, where the edges are given in a stream and the memory is limited. In this work we design a sublinear-time algorithm for approximating the number of triangles in a graph, wher...