![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Daniel Vial
Person information
Refine list
![note](https://dblp.uni-trier.de./img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c10]Ronshee Chawla, Daniel Vial, Sanjay Shakkottai, R. Srikant:
Collaborative Multi-Agent Heterogeneous Multi-Armed Bandits. ICML 2023: 4189-4217 - [c9]Daniel Vial
, Sanjay Shakkottai
, R. Srikant
:
Robust Multi-Agent Bandits Over Undirected Graphs. SIGMETRICS (Abstracts) 2023: 67-68 - [i12]Ronshee Chawla, Daniel Vial, Sanjay Shakkottai, R. Srikant:
Collaborative Multi-Agent Heterogeneous Multi-Armed Bandits. CoRR abs/2305.18784 (2023) - 2022
- [j5]Daniel Vial
, Vijay G. Subramanian
:
Local Non-Bayesian Social Learning With Stubborn Agents. IEEE Trans. Control. Netw. Syst. 9(3): 1178-1188 (2022) - [c8]Daniel Vial, Advait Parulekar, Sanjay Shakkottai, R. Srikant:
Improved Algorithms for Misspecified Linear Markov Decision Processes. AISTATS 2022: 4723-4746 - [c7]Daniel Vial, Advait Parulekar, Sanjay Shakkottai, R. Srikant:
Regret Bounds for Stochastic Shortest Path Problems with Linear Function Approximation. ICML 2022: 22203-22233 - [c6]Daniel Vial, Sujay Sanghavi, Sanjay Shakkottai, R. Srikant:
Minimax Regret for Cascading Bandits. NeurIPS 2022 - [i11]Daniel Vial, Sanjay Shakkottai, R. Srikant:
Robust Multi-Agent Bandits Over Undirected Graphs. CoRR abs/2203.00076 (2022) - [i10]Daniel Vial, Sujay Sanghavi, Sanjay Shakkottai, R. Srikant:
Minimax Regret for Cascading Bandits. CoRR abs/2203.12577 (2022) - 2021
- [j4]Daniel Vial
, Vijay G. Subramanian
:
Empirical Policy Evaluation With Supergraphs. IEEE J. Sel. Areas Inf. Theory 2(2): 641-651 (2021) - [j3]Daniel Vial
, Sanjay Shakkottai
, R. Srikant
:
Robust Multi-Agent Bandits Over Undirected Graphs. Proc. ACM Meas. Anal. Comput. Syst. 6(3): 53:1-53:57 (2021) - [c5]Daniel Vial, Sanjay Shakkottai, R. Srikant:
Robust Multi-Agent Multi-Armed Bandits. MobiHoc 2021: 161-170 - [i9]Daniel Vial, Advait Parulekar, Sanjay Shakkottai, R. Srikant:
Regret Bounds for Stochastic Shortest Path Problems with Linear Function Approximation. CoRR abs/2105.01593 (2021) - [i8]Daniel Vial, Advait Parulekar, Sanjay Shakkottai, R. Srikant:
Improved Algorithms for Misspecified Linear Markov Decision Processes. CoRR abs/2109.05546 (2021) - 2020
- [i7]Daniel Vial, Vijay G. Subramanian:
Empirical Policy Evaluation with Supergraphs. CoRR abs/2002.07905 (2020) - [i6]Daniel Vial, Sanjay Shakkottai, R. Srikant:
Robust Multi-Agent Multi-Armed Bandits. CoRR abs/2007.03812 (2020) - [i5]Daniel Vial, Sanjay Shakkottai, R. Srikant:
One-bit feedback is sufficient for upper confidence bound policies. CoRR abs/2012.02876 (2020)
2010 – 2019
- 2019
- [j2]Daniel Vial, Vijay G. Subramanian:
A Structural Result for Personalized PageRank and its Algorithmic Consequences. Proc. ACM Meas. Anal. Comput. Syst. 3(2): 25:1-25:88 (2019) - [j1]Daniel Vial, Vijay G. Subramanian
:
On the Role of Clustering in Personalized PageRank Estimation. ACM Trans. Model. Perform. Evaluation Comput. Syst. 4(4): 21:1-21:33 (2019) - [c4]Daniel Vial, Vijay G. Subramanian
:
Local Non-Bayesian Social Learning with Stubborn Agents*. Allerton 2019: 902-903 - [c3]Daniel Vial, Vijay G. Subramanian
:
Local Non-Bayesian Social Learning with Stubborn Agents. EC 2019: 551-552 - [c2]Daniel Vial, Vijay G. Subramanian
:
A Structural Result for Personalized PageRank and its Algorithmic Consequences. SIGMETRICS (Abstracts) 2019: 39-40 - [i4]Daniel Vial, Vijay G. Subramanian:
Local non-Bayesian social learning with stubborn agents. CoRR abs/1904.12767 (2019) - [i3]Daniel Vial, Vijay G. Subramanian:
Restart perturbations for lazy, reversible Markov chains: trichotomy and pre-cutoff equivalence. CoRR abs/1907.02926 (2019) - 2018
- [i2]Daniel Vial, Vijay G. Subramanian:
Personalized PageRank dimensionality and algorithmic implications. CoRR abs/1804.02949 (2018) - 2017
- [i1]Daniel Vial, Vijay G. Subramanian:
Efficient Personalized PageRank Estimation for Many Sources and Many Targets. CoRR abs/1706.01091 (2017) - 2016
- [c1]Daniel Vial, Vijay G. Subramanian
:
Towards fast algorithms for estimating Personalized PageRank using commonly generated random walks. Allerton 2016: 852-855
Coauthor Index
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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-21 00:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint