default search action
Tianyu Wang 0008
Person information
- affiliation: Fudan University, Shanghai, China
- affiliation (PhD 2021): Duke University, Department of Computer Science, Durham, NC, USA
Other persons with the same name
- Tianyu Wang — disambiguation page
- Tianyu Wang 0001 — Nanjing University, School of Electronic Science and Engineering, China (and 1 more)
- Tianyu Wang 0002 — Dalian University of Technology, School of Control Sciences and Engineering, China
- Tianyu Wang 0003 — Chinese University of Hong Kong, Hong Kong (and 1 more)
- Tianyu Wang 0004 — North China Electric Power University, Beijing, China
- Tianyu Wang 0005 — Institut Mines-Télécom Atlantique, LS2N, UMR CNRS, Nantes, France
- Tianyu Wang 0006 — University of Illinois at Urbana-Champaign, Department of Electrical and Computering Engineering, Urbana, IL, USA
- Tianyu Wang 0007 — Shanghai Jiao Tong University, China
- Tianyu Wang 0009 — Shenzhen University, College of Computer Science and Software Engineering, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j2]Yasong Feng, Zengfeng Huang, Tianyu Wang:
Lipschitz Bandits With Batched Feedback. IEEE Trans. Inf. Theory 70(3): 2154-2176 (2024) - 2023
- [i8]Yasong Feng, Weijian Luo, Yimin Huang, Tianyu Wang:
A Lipschitz Bandits Approach for Continuous Hyperparameter Optimization. CoRR abs/2302.01539 (2023) - [i7]Chuying Han, Yasong Feng, Tianyu Wang:
From Random Search to Bandit Learning in Metric Measure Spaces. CoRR abs/2305.11509 (2023) - 2022
- [c3]Yasong Feng, Zengfeng Huang, Tianyu Wang:
Lipschitz Bandits with Batched Feedback. NeurIPS 2022 - [i6]Yasong Feng, Tianyu Wang:
Stochastic Zeroth Order Gradient and Hessian Estimators: Variance Reduction and Refined Bias Bounds. CoRR abs/2205.14737 (2022) - 2021
- [b1]Tianyu Wang:
New Directions in Bandit Learning: Singularities and Random Walk Feedback. Duke University, Durham, NC, USA, 2021 - [j1]Tianyu Wang, Marco Morucci, M. Usaid Awan, Yameng Liu, Sudeepa Roy, Cynthia Rudin, Alexander Volfovsky:
FLAME: A Fast Large-scale Almost Matching Exactly Approach to Causal Inference. J. Mach. Learn. Res. 22: 31:1-31:41 (2021) - [i5]Neha R. Gupta, Vittorio Orlandi, Chia-Rui Chang, Tianyu Wang, Marco Morucci, Pritam Dey, Thomas J. Howell, Xian Sun, Angikar Ghosal, Sudeepa Roy, Cynthia Rudin, Alexander Volfovsky:
dame-flame: A Python Library Providing Fast Interpretable Matching for Causal Inference. CoRR abs/2101.01867 (2021) - [i4]Yasong Feng, Zengfeng Huang, Tianyu Wang:
Batched Lipschitz Bandits. CoRR abs/2110.09722 (2021) - 2020
- [c2]Tianyu Wang, Weicheng Ye, Dawei Geng, Cynthia Rudin:
Towards Practical Lipschitz Bandits. FODS 2020: 129-138 - [c1]Tianyu Wang, Cynthia Rudin:
Bandits for BMO Functions. ICML 2020: 9996-10006 - [i3]Tianyu Wang, Cynthia Rudin:
Bandits for BMO Functions. CoRR abs/2007.08703 (2020)
2010 – 2019
- 2019
- [i2]Tianyu Wang, Dawei Geng, Cynthia Rudin:
A Practical Bandit Method with Advantages in Neural Network Tuning. CoRR abs/1901.09277 (2019) - 2017
- [i1]Sudeepa Roy, Cynthia Rudin, Alexander Volfovsky, Tianyu Wang:
FLAME: A Fast Large-scale Almost Matching Exactly Approach to Causal Inference. CoRR abs/1707.06315 (2017)
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-11-27 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint