default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTaylan Kargin
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Vikrant Malik, Taylan Kargin, Joudi Hajar, Babak Hassibi:
Optimal Infinite-Horizon Mixed H2/ H∞ Control. Allerton 2024: 1-8- [c9]Joudi Hajar, Taylan Kargin, Vikrant Malik, Babak Hassibi:
The Distributionally Robust Infinite-Horizon LQR. CDC 2024: 6539-6546 - [c8]Taylan Kargin, Joudi Hajar, Vikrant Malik, Babak Hassibi:
Infinite-Horizon Distributionally Robust Regret-Optimal Control. ICML 2024 - [c7]Yingying Li, Jing Yu, Lauren Conger, Taylan Kargin, Adam Wierman:
Learning the Uncertainty Sets of Linear Control Systems via Set Membership: A Non-asymptotic Analysis. ICML 2024 - [c6]Vikrant Malik, Taylan Kargin
, Victoria Kostina, Babak Hassibi:
A Distributionally Robust Approach to Shannon Limits using the Wasserstein Distance. ISIT 2024: 861-866 - [c5]Taylan Kargin, Joudi Hajar, Vikrant Malik, Babak Hassibi:
Wasserstein distributionally robust regret-optimal control over infinite-horizon. L4DC 2024: 1688-1701 - [i8]Vikrant Malik, Taylan Kargin, Victoria Kostina, Babak Hassibi:
A Distributionally Robust Approach to Shannon Limits using the Wasserstein Distance. CoRR abs/2405.06528 (2024) - [i7]Taylan Kargin, Joudi Hajar, Vikrant Malik, Babak Hassibi:
Infinite-Horizon Distributionally Robust Regret-Optimal Control. CoRR abs/2406.07248 (2024) - [i6]Taylan Kargin, Joudi Hajar, Vikrant Malik, Babak Hassibi:
Distributionally Robust Kalman Filtering over Finite and Infinite Horizon. CoRR abs/2407.18837 (2024) - [i5]Joudi Hajar, Taylan Kargin, Vikrant Malik, Babak Hassibi:
The Distributionally Robust Infinite-Horizon LQR. CoRR abs/2408.06230 (2024) - [i4]Vikrant Malik, Taylan Kargin, Joudi Hajar, Babak Hassibi:
Optimal Infinite-Horizon Mixed H2/H∞ Control. CoRR abs/2409.20020 (2024) - 2023
- [c4]Joudi Hajar, Taylan Kargin, Babak Hassibi:
Wasserstein Distributionally Robust Regret-Optimal Control under Partial Observability. Allerton 2023: 1-6 - [c3]Taylan Kargin, Sahin Lale, Kamyar Azizzadenesheli, Anima Anandkumar, Babak Hassibi:
Thompson Sampling for Partially Observable Linear-Quadratic Control. ACC 2023: 4561-4568 - [c2]Taylan Kargin, Fariborz Salehi, Babak Hassibi:
Asymptotic Distribution of Stochastic Mirror Descent Iterates in Average Ensemble Models. ICASSP 2023: 1-5 - [i3]Taylan Kargin, Joudi Hajar, Vikrant Malik, Babak Hassibi:
Wasserstein Distributionally Robust Regret-Optimal Control in the Infinite-Horizon. CoRR abs/2312.17376 (2023) - 2022
- [c1]Taylan Kargin, Sahin Lale, Kamyar Azizzadenesheli, Animashree Anandkumar, Babak Hassibi:
Thompson Sampling Achieves $\tilde{O}(\sqrt{T})$ Regret in Linear Quadratic Control. COLT 2022: 3235-3284 - [i2]Taylan Kargin, Sahin Lale, Kamyar Azizzadenesheli, Anima Anandkumar, Babak Hassibi:
Thompson Sampling Achieves Õ(√T) Regret in Linear Quadratic Control. CoRR abs/2206.08520 (2022) - [i1]Taylan Kargin, Fariborz Salehi, Babak Hassibi:
Stochastic Mirror Descent in Average Ensemble Models. CoRR abs/2210.15323 (2022)
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-03-04 21:24 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:
