Editing Open Problems:73

Jump to: navigation, search

Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.

The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision Your text
Line 3: Line 3:
 
|who=Edo Liberty
 
|who=Edo Liberty
 
}}
 
}}
A tad more open-ended than the usual open problems from this website, this one arises from the following observation. While streaming algorithms are often motivated by the constraints due to “big data,” in practice this data is not ''static'': however, most streaming algorithms use the structure and regularities encountered in the stream to compute solutions or results only available at the end of the streaming, in hindsight.
+
A tad more open-ended than the usual open problems from this website, this one arises from the following observation. While streaming algorithms are often motivated by the constraints due to "big data," in practice this data is not ''static'': however, most streaming algorithms use the structure and regularities encountered in the stream to compute solutions or results only available at the end of the streaming, in hindsight.
  
In practice, however, one often needs to be ''online'' as well: that is, to maintain a “good as of now” solution as the stream goes, and to combine the usual memory constraints of the streaming setting with the objectives of the standard online analysis setting. (Note that, in contrast to the majority of the machine learning literature, one cannot in general make the assumption of stochasticity; the performance thus has to be compared in the adversarial setting, or an intermediate, better suited model has to be developed.)
+
In practice, however, one often needs to be ''online'' as well: that is, to maintain a "good as of now" solution as the stream goes, and to combine the usual memory constraints of the streaming setting with the objectives of the standard online analysis setting. (Note that, in contrast to the majority of the machine learning literature, one cannot in general make the assumption of stochasticity; the performance thus has to be compared in the adversarial setting, or an intermediate, better suited model has to be developed.)
  
'''Question:''' Which model can capture this real-world need for a combination of streaming and online competitivity constraints, and what algorithms can then one obtain in this model?
+
'''Question:''' which model can capture this real-world need for a combination of streaming and online competitivity constraints, and what algorithms can then one obtain in this model?
  
'''Note:''' For some work in this direction, one can consult {{cite|LibertySS-16}}.
+
'''Note:''' for some work in this direction, one can consult {{cite|LibertySS-16}}.

Please note that all contributions to Open Problems in Sublinear Algorithms may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see Open Problems in Sublinear Algorithms:Copyrights for details). Do not submit copyrighted work without permission!

To edit this page, please answer the question that appears below (more info):

Cancel Editing help (opens in new window)