default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBahar Taskesen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j2]Bahar Taskesen
, Soroosh Shafieezadeh-Abadeh, Daniel Kuhn:
Semi-discrete optimal transport: hardness, regularization and numerical solution. Math. Program. 199(1): 1033-1106 (2023)- [j1]Bahar Taskesen, Soroosh Shafieezadeh-Abadeh, Daniel Kuhn, Karthik Natarajan:
Discrete Optimal Transport with Independent Marginals is #P-Hard. SIAM J. Optim. 33(2): 589-614 (2023)
Conference and Workshop Papers
- 2023
- [c5]Bahar Taskesen, Dan A. Iancu, Çagil Koçyigit, Daniel Kuhn:
Distributionally Robust Linear Quadratic Control. NeurIPS 2023 - 2021
- [c4]Bahar Taskesen, Jose H. Blanchet, Daniel Kuhn, Viet Anh Nguyen:
A Statistical Test for Probabilistic Fairness. FAccT 2021: 648-665 - [c3]Bahar Taskesen, Man-Chung Yue, Jose H. Blanchet, Daniel Kuhn, Viet Anh Nguyen:
Sequential Domain Adaptation by Synthesizing Distributionally Robust Experts. ICML 2021: 10162-10172 - 2018
- [c2]Bahar Taskesen, Alper Koz, A. Aydin Alatan, Oliver Weatherbee:
Change Detection for Hyperspectral Images Using Extended Mutual Information and Oversegmentation. WHISPERS 2018: 1-5 - 2017
- [c1]Bahar Taskesen, Beril Besbinar, Alper Koz, A. Aydin Alatan:
Unsupervised change detection in satellite images using oversegmentation and mutual information. SIU 2017: 1-4
Informal and Other Publications
- 2024
- [i8]Mengmeng Li, Daniel Kuhn, Bahar Taskesen:
Optimism in the Face of Ambiguity Principle for Multi-Armed Bandits. CoRR abs/2409.20440 (2024) - 2023
- [i7]Bahar Taskesen, Dan A. Iancu, Çagil Koçyigit, Daniel Kuhn:
Distributionally Robust Linear Quadratic Control. CoRR abs/2305.17037 (2023) - 2022
- [i6]Bahar Taskesen, Soroosh Shafieezadeh-Abadeh, Daniel Kuhn, Karthik Natarajan:
Discrete Optimal Transport with Independent Marginals is #P-Hard. CoRR abs/2203.01161 (2022) - [i5]Yves Rychener, Bahar Taskesen, Daniel Kuhn:
Metrizing Fairness. CoRR abs/2205.15049 (2022) - 2021
- [i4]Bahar Taskesen, Soroosh Shafieezadeh-Abadeh, Daniel Kuhn:
Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solution. CoRR abs/2103.06263 (2021) - [i3]Bahar Taskesen, Man-Chung Yue, Jose H. Blanchet, Daniel Kuhn, Viet Anh Nguyen:
Sequential Domain Adaptation by Synthesizing Distributionally Robust Experts. CoRR abs/2106.00322 (2021) - 2020
- [i2]Bahar Taskesen, Viet Anh Nguyen, Daniel Kuhn, Jose H. Blanchet:
A Distributionally Robust Approach to Fair Classification. CoRR abs/2007.09530 (2020) - [i1]Bahar Taskesen, Jose H. Blanchet, Daniel Kuhn, Viet Anh Nguyen:
A Statistical Test for Probabilistic Fairness. CoRR abs/2012.04800 (2020)
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 2024-10-22 21:17 CEST 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:
