default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStephen Pasteris
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2016
[b1]Stephen Pasteris:
Efficient algorithms for online learning over graphs. University College London, UK, 2016
Journal Articles
- 2022
- [j3]Hanlin Lu
, Ting He, Shiqiang Wang, Changchang Liu, Mehrdad Mahdavi, Vijaykrishnan Narayanan, Kevin S. Chan, Stephen Pasteris:
Communication-Efficient $k$k-Means for Edge-Based Machine Learning. IEEE Trans. Parallel Distributed Syst. 33(10): 2509-2523 (2022) - 2020
- [j2]Yilei Lin, Ting He, Shiqiang Wang, Kevin Chan, Stephen Pasteris:
Looking Glass of NFV: Inferring the Structure and State of NFV Network From External Observations. IEEE/ACM Trans. Netw. 28(4): 1477-1490 (2020) - 2015
- [j1]Mark Herbster, Stephen Pasteris, Massimiliano Pontil:
Predicting a switching sequence of graph labelings. J. Mach. Learn. Res. 16: 2003-2022 (2015)
Conference and Workshop Papers
- 2024
- [c21]Stephen U. Pasteris, Alberto Rumi, Fabio Vitale, Nicolò Cesa-Bianchi:
Sum-max Submodular Bandits. AISTATS 2024: 2323-2331 - [c20]Stephen Pasteris, Fabio Vitale, Mark Herbster, Claudio Gentile, André Panisson:
Adversarial Online Collaborative Filtering. ALT 2024: 945-971 - 2023
- [c19]Stephen Pasteris:
Perceptronic Complexity and Online Matrix Completion. ALT 2023: 1261-1291 - [c18]Stephen Pasteris, Chris Hicks, Vasilios Mavroudis:
Nearest Neighbour with Bandit Feedback. NeurIPS 2023 - 2021
- [c17]Stephen Pasteris, Ting He, Fabio Vitale, Shiqiang Wang, Mark Herbster:
Online Learning of Facility Locations. ALT 2021: 1002-1050 - [c16]Mark Herbster, Stephen Pasteris, Fabio Vitale, Massimiliano Pontil:
A Gang of Adversarial Bandits. NeurIPS 2021: 2265-2279 - [c15]Lin Yang, Yu-Zhen Janice Chen, Stephen Pasteris, Mohammad H. Hajiesmaili, John C. S. Lui, Don Towsley:
Cooperative Stochastic Bandits with Asynchronous Agents and Constrained Feedback. NeurIPS 2021: 8885-8897 - 2020
- [c14]Hanlin Lu, Ting He, Shiqiang Wang, Changchang Liu, Mehrdad Mahdavi, Vijaykrishnan Narayanan, Kevin S. Chan, Stephen Pasteris:
Communication-efficient k-Means for Edge-based Machine Learning. ICDCS 2020: 595-605 - [c13]Hanlin Lu, Changchang Liu, Shiqiang Wang, Ting He, Vijaykrishnan Narayanan, Kevin S. Chan, Stephen Pasteris:
Joint Coreset Construction and Quantization for Distributed Machine Learning. Networking 2020: 172-180 - [c12]Mark Herbster, Stephen Pasteris, Lisa Tse:
Online Multitask Learning with Long-Term Memory. NeurIPS 2020 - [c11]Mark Herbster, Stephen Pasteris, Lisa Tse:
Online Matrix Completion with Side Information. NeurIPS 2020 - 2019
- [c10]Stephen Pasteris, Fabio Vitale, Kevin S. Chan, Shiqiang Wang, Mark Herbster:
MaxHedge: Maximizing a Maximum Online. AISTATS 2019: 1851-1859 - [c9]Yilei Lin, Ting He, Shiqiang Wang, Kevin S. Chan, Stephen Pasteris:
Multicast-Based Weight Inference in General Network Topologies. ICC 2019: 1-6 - [c8]Stephen Pasteris, Shiqiang Wang, Mark Herbster, Ting He:
Service Placement with Provable Guarantees in Heterogeneous Edge Computing Systems. INFOCOM 2019: 514-522 - [c7]Yilei Lin, Ting He, Shiqiang Wang, Kevin S. Chan, Stephen Pasteris:
Looking Glass of NFV: Inferring the Structure and State of NFV Network from External Observations. INFOCOM 2019: 1774-1782 - 2018
- [c6]Stephen Pasteris, Fabio Vitale, Claudio Gentile, Mark Herbster:
On Similarity Prediction and Pairwise Clustering. ALT 2018: 654-681 - 2017
- [c5]Stephen Pasteris, Shiqiang Wang, Christian Makaya, Kevin Chan, Mark Herbster:
Data distribution and scheduling for distributed analytics tasks. SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI 2017: 1-6 - 2016
- [c4]Mark Herbster, Stephen Pasteris, Massimiliano Pontil:
Mistake Bounds for Binary Matrix Completion. NIPS 2016: 3954-3962 - 2015
- [c3]Mark Herbster, Stephen Pasteris, Shaona Ghosh:
Online Prediction at the Limit of Zero Temperature. NIPS 2015: 2935-2943 - 2013
- [c2]Claudio Gentile, Mark Herbster, Stephen Pasteris:
Online Similarity Prediction of Networked Data from Known and Unknown Graphs. COLT 2013: 662-695 - 2012
- [c1]Mark Herbster, Stephen Pasteris, Fabio Vitale:
Online Sum-Product Computation Over Trees. NIPS 2012: 2879-2887
Informal and Other Publications
- 2024
- [i18]Stephen Pasteris, Alberto Rumi, Maximilian Thiessen, Shota Saito, Atsushi Miyauchi, Fabio Vitale, Mark Herbster:
Bandits with Abstention under Expert Advice. CoRR abs/2402.14585 (2024) - [i17]Stephen Pasteris, Chris Hicks, Vasilios Mavroudis:
Fusion Encoder Networks. CoRR abs/2402.15883 (2024) - [i16]Stephen Pasteris, Chris Hicks, Vasilios Mavroudis, Mark Herbster:
Online Convex Optimisation: The Optimal Switching Regret for all Segmentations Simultaneously. CoRR abs/2405.20824 (2024) - [i15]Stephen Pasteris, Chris Hicks, Vasilios Mavroudis:
Fair Exploration and Exploitation. CoRR abs/2411.04295 (2024) - 2023
- [i14]Stephen Pasteris, Fabio Vitale, Mark Herbster, Claudio Gentile:
Regret Guarantees for Adversarial Online Collaborative Filtering. CoRR abs/2302.05765 (2023) - [i13]Stephen Pasteris, Chris Hicks, Vasilios Mavroudis:
Nearest Neighbour with Bandit Feedback. CoRR abs/2306.13773 (2023) - [i12]Stephen Pasteris, Alberto Rumi, Fabio Vitale, Nicolò Cesa-Bianchi:
Sum-max Submodular Bandits. CoRR abs/2311.05975 (2023) - [i11]Stephen Pasteris, Chris Hicks, Vasilios Mavroudis:
A Hierarchical Nearest Neighbour Approach to Contextual Bandits. CoRR abs/2312.09332 (2023) - 2022
- [i10]Hanlin Lu, Changchang Liu, Shiqiang Wang, Ting He, Vijay Narayanan, Kevin S. Chan, Stephen Pasteris:
Joint Coreset Construction and Quantization for Distributed Machine Learning. CoRR abs/2204.06652 (2022) - 2021
- [i9]Hanlin Lu, Ting He, Shiqiang Wang, Changchang Liu, Mehrdad Mahdavi, Vijaykrishnan Narayanan, Kevin S. Chan, Stephen Pasteris:
Communication-efficient k-Means for Edge-based Machine Learning. CoRR abs/2102.04282 (2021) - 2020
- [i8]Stephen Pasteris, Ting He, Fabio Vitale, Shiqiang Wang, Mark Herbster:
Online Learning of Facility Locations. CoRR abs/2007.02801 (2020) - [i7]Mark Herbster, Stephen Pasteris, Lisa Tse:
Online Multitask Learning with Long-Term Memory. CoRR abs/2008.07055 (2020) - 2019
- [i6]Stephen Pasteris, Shiqiang Wang, Mark Herbster, Ting He:
Service Placement with Provable Guarantees in Heterogeneous Edge Computing Systems. CoRR abs/1906.07055 (2019) - [i5]Mark Herbster, Stephen Pasteris, Lisa Tse:
Online Matrix Completion with Side Information. CoRR abs/1906.07255 (2019) - 2018
- [i4]Stephen Pasteris, Fabio Vitale, Kevin Chan, Shiqiang Wang:
MaxHedge: Maximising a Maximum Online with Theoretical Performance Guarantees. CoRR abs/1810.11843 (2018) - 2017
- [i3]Stephen Pasteris, Fabio Vitale, Claudio Gentile, Mark Herbster:
On Pairwise Clustering with Side Information. CoRR abs/1706.06474 (2017) - 2013
- [i2]Claudio Gentile, Mark Herbster, Stephen Pasteris:
Online Similarity Prediction of Networked Data from Known and Unknown Graphs. CoRR abs/1302.7263 (2013) - [i1]Stephen Pasteris:
Fast Product Format. CoRR abs/1308.0187 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
