default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristina Lee Yu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c13]Siddhartha Banerjee, Alankrita Bhatt, Christina Lee Yu:
The SMART approach to instance-optimal online learning. COLT 2024: 426- [c12]Haiyun He, Christina Lee Yu, Ziv Goldfeld:
Hierarchical Generalization Bounds for Deep Neural Networks. ISIT 2024: 2688-2693 - [i22]Siddhartha Banerjee, Alankrita Bhatt, Christina Lee Yu:
The SMART approach to instance-optimal online learning. CoRR abs/2402.17720 (2024) - [i21]Xumei Xi, Christina Lee Yu, Yudong Chen:
Entry-Specific Bounds for Low-Rank Matrix Completion under Highly Non-Uniform Sampling. CoRR abs/2403.00184 (2024) - [i20]Haiyun He, Christina Lee Yu, Ziv Goldfeld:
Information-Theoretic Generalization Bounds for Deep Neural Networks. CoRR abs/2404.03176 (2024) - [i19]Mayleen Cortez-Rodriguez, Matthew Eichhorn, Christina Lee Yu:
Combining Rollout Designs and Clustering for Causal Inference under Low-order Interference. CoRR abs/2405.05119 (2024) - [i18]Yudong Chen, Xumei Xi, Christina Lee Yu:
Entry-Specific Matrix Estimation under Arbitrary Sampling Patterns through the Lens of Network Flows. CoRR abs/2409.03980 (2024) - 2023
- [j12]Sean R. Sinclair
, Siddhartha Banerjee, Christina Lee Yu:
Adaptive Discretization in Online Reinforcement Learning. Oper. Res. 71(5): 1636-1652 (2023) - [j11]Sean R. Sinclair, Gauri Jain, Siddhartha Banerjee, Christina Lee Yu:
Sequential Fair Allocation: Achieving the Optimal Envy-Efficiency Trade-off Curve. Oper. Res. 71(5): 1689-1705 (2023) - [j10]Tyler Sam, Yudong Chen, Christina Lee Yu:
Overcoming the Long Horizon Barrier for Sample-Efficient Reinforcement Learning with Latent Low-Rank Structure. Proc. ACM Meas. Anal. Comput. Syst. 7(2): 29:1-29:60 (2023) - [j9]Tyler Sam, Yudong Chen, Christina Lee Yu:
Overcoming the Long Horizon Barrier for Sample-Efficient Reinforcement Learning with Latent Low-Rank Structure. SIGMETRICS Perform. Evaluation Rev. 50(4): 41-43 (2023) - [j8]Devavrat Shah, Christina Lee Yu:
Robust Max Entrywise Error Bounds for Tensor Estimation From Sparse Observations via Similarity-Based Collaborative Filtering. IEEE Trans. Inf. Theory 69(5): 3121-3149 (2023) - [c11]Xumei Xi, Christina Lee Yu, Yudong Chen:
Entry-Specific Bounds for Low-Rank Matrix Completion under Highly Non-Uniform Sampling. ISIT 2023: 2625-2630 - [c10]Tyler Sam, Yudong Chen, Christina Lee Yu:
Overcoming the Long Horizon Barrier for Sample-Efficient Reinforcement Learning with Latent Low-Rank Structure. SIGMETRICS (Abstracts) 2023: 85-86 - [i17]Xumei Xi, Christina Lee Yu, Yudong Chen:
Matrix Estimation for Offline Reinforcement Learning with Low-Rank Structure. CoRR abs/2305.15621 (2023) - [i16]Su Jia, Sohom Bhattacharya, Nathan Kallus, Christina Lee Yu:
Faster Rates for Switchback Experiments. CoRR abs/2312.15574 (2023) - 2022
- [j7]Christian Borgs, Jennifer T. Chayes, Devavrat Shah, Christina Lee Yu:
Iterative Collaborative Filtering for Sparse Matrix Estimation. Oper. Res. 70(6): 3143-3175 (2022) - [j6]Christina Lee Yu, Xumei Xi:
Tensor Completion with Nearly Linear Samples Given Weak Side Information. Proc. ACM Meas. Anal. Comput. Syst. 6(2): 39:1-39:35 (2022) - [j5]Christopher Archer, Siddhartha Banerjee, Mayleen Cortez, Carrie Rucker, Sean R. Sinclair, Max Solberg, Qiaomin Xie, Christina Lee Yu:
ORSuite: Benchmarking Suite for Sequential Operations Models. SIGMETRICS Perform. Evaluation Rev. 49(2): 57-61 (2022) - [c9]Christina Lee Yu:
Nonparametric Matrix Estimation with One-Sided Covariates. ISIT 2022: 892-897 - [c8]Mayleen Cortez, Matthew Eichhorn, Christina Lee Yu:
Staggered Rollout Designs Enable Causal Inference Under Interference Without Network Knowledge. NeurIPS 2022 - [c7]Christina Lee Yu, Xumei Xi:
Tensor Completion with Nearly Linear Samples Given Weak Side Information. SIGMETRICS (Abstracts) 2022: 73-74 - [c6]Sean R. Sinclair, Siddhartha Banerjee, Christina Lee Yu:
Sequential Fair Allocation: Achieving the Optimal Envy-Efficiency Tradeoff Curve. SIGMETRICS (Abstracts) 2022: 95-96 - [i15]Christina Lee Yu, Edoardo M. Airoldi, Christian Borgs, Jennifer T. Chayes:
Graph Agnostic Randomized Experimental Design. CoRR abs/2205.12803 (2022) - [i14]Mayleen Cortez, Matthew Eichhorn, Christina Lee Yu:
Graph Agnostic Estimators with Staggered Rollout Designs under Network Interference. CoRR abs/2205.14552 (2022) - [i13]Tyler Sam, Yudong Chen, Christina Lee Yu:
Overcoming the Long Horizon Barrier for Sample-Efficient Reinforcement Learning with Latent Low-Rank Structure. CoRR abs/2206.03569 (2022) - [i12]Mayleen Cortez, Matthew Eichhorn, Christina Lee Yu:
Exploiting neighborhood interference with low order interactions under unit randomized design. CoRR abs/2208.05553 (2022) - [i11]Siddhartha Banerjee, Sean R. Sinclair, Milind Tambe, Lily Xu, Christina Lee Yu:
Artificial Replay: A Meta-Algorithm for Harnessing Historical Data in Bandits. CoRR abs/2210.00025 (2022) - [i10]Anish Agarwal, Sarah H. Cen, Devavrat Shah, Christina Lee Yu:
Network Synthetic Interventions: A Framework for Panel Data with Network Interference. CoRR abs/2210.11355 (2022) - 2021
- [i9]Sean R. Sinclair, Siddhartha Banerjee, Christina Lee Yu:
Sequential Fair Allocation: Achieving the Optimal Envy-Efficiency Tradeoff Curve. CoRR abs/2105.05308 (2021) - [i8]Christina Lee Yu:
Nonparametric Matrix Estimation with One-Sided Covariates. CoRR abs/2110.13969 (2021) - [i7]Sean R. Sinclair, Siddhartha Banerjee, Christina Lee Yu:
Adaptive Discretization in Online Reinforcement Learning. CoRR abs/2110.15843 (2021) - 2020
- [j4]Devavrat Shah, Guy Bresler, John C. Duchi, Po-Ling Loh, Yihong Wu, Christina Lee Yu:
Editorial. IEEE J. Sel. Areas Inf. Theory 1(3): 612 (2020) - [j3]Yihua Li, Devavrat Shah, Dogyoon Song, Christina Lee Yu:
Nearest Neighbors for Matrix Estimation Interpreted as Blind Regression for Latent Variable Model. IEEE Trans. Inf. Theory 66(3): 1760-1784 (2020) - [j2]Asuman E. Ozdaglar, Devavrat Shah, Christina Lee Yu:
Asynchronous Approximation of a Single Component of the Solution to a Linear System. IEEE Trans. Netw. Sci. Eng. 7(3): 975-986 (2020) - [c5]Sean R. Sinclair, Tianyu Wang, Gauri Jain, Siddhartha Banerjee, Christina Lee Yu:
Adaptive Discretization for Model-Based Reinforcement Learning. NeurIPS 2020 - [c4]Sean R. Sinclair, Siddhartha Banerjee, Christina Lee Yu:
Adaptive Discretization for Episodic Reinforcement Learning in Metric Spaces. SIGMETRICS (Abstracts) 2020: 17-18 - [i6]Sean R. Sinclair, Tianyu Wang, Gauri Jain, Siddhartha Banerjee, Christina Lee Yu:
Adaptive Discretization for Model-Based Reinforcement Learning. CoRR abs/2007.00717 (2020) - [i5]Christina Lee Yu:
Tensor Estimation with Nearly Linear Samples. CoRR abs/2007.00736 (2020) - [i4]Sean R. Sinclair, Gauri Jain, Siddhartha Banerjee, Christina Lee Yu:
Sequential Fair Allocation of Limited Resources under Stochastic Demands. CoRR abs/2011.14382 (2020)
2010 – 2019
- 2019
- [j1]Sean R. Sinclair, Siddhartha Banerjee, Christina Lee Yu:
Adaptive Discretization for Episodic Reinforcement Learning in Metric Spaces. Proc. ACM Meas. Anal. Comput. Syst. 3(3): 55:1-55:44 (2019) - [c3]Devavrat Shah, Christina Lee Yu:
Iterative Collaborative Filtering for Sparse Noisy Tensor Estimation. Allerton 2019: 904-909 - [c2]Devavrat Shah, Christina Lee Yu:
Iterative Collaborative Filtering for Sparse Noisy Tensor Estimation. ISIT 2019: 41-45 - [c1]Nirandika Wanigasekara, Christina Lee Yu:
Nonparametric Contextual Bandits in Metric Spaces with Unknown Metric. NeurIPS 2019: 14657-14667 - [i3]Nirandika Wanigasekara, Christina Lee Yu:
Nonparametric Contextual Bandits in an Unknown Metric Space. CoRR abs/1908.01228 (2019) - [i2]Devavrat Shah, Christina Lee Yu:
Iterative Collaborative Filtering for Sparse Noisy Tensor Estimation. CoRR abs/1908.01241 (2019) - [i1]Sean R. Sinclair, Siddhartha Banerjee, Christina Lee Yu:
Adaptive Discretization for Episodic Reinforcement Learning in Metric Spaces. CoRR abs/1910.08151 (2019)
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-23 20:34 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:
