Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Near Optimal Linear Algebra in the Online and Sliding Window Models., , , , , , and . FOCS, page 517-528. IEEE, (2020)QPipe: quantiles sketch fully in the data plane., , , and . CoNEXT, page 285-291. ACM, (2019)Near-Optimal Entrywise Sampling of Numerically Sparse Matrices., , , and . CoRR, (2020)Selective experience replay compression using coresets for lifelong deep reinforcement learning in medical imaging., , , , and . MIDL, volume 227 of Proceedings of Machine Learning Research, page 1751-1764. PMLR, (2023)Universal Sketches for the Frequency Negative Moments and Other Decreasing Streaming Sums., and . APPROX-RANDOM, volume 40 of LIPIcs, page 591-605. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Symmetric Norm Estimation and Regression on Sliding Windows., , and . COCOON, volume 13025 of Lecture Notes in Computer Science, page 528-539. Springer, (2021)AutoCoreset: An Automatic Practical Coreset Construction Framework., , , and . ICML, volume 202 of Proceedings of Machine Learning Research, page 23451-23466. PMLR, (2023)Last Iterate Risk Bounds of SGD with Decaying Stepsize for Overparameterized Linear Regression., , , , and . ICML, volume 162 of Proceedings of Machine Learning Research, page 24280-24314. PMLR, (2022)Adversarial Robustness of Streaming Algorithms through Importance Sampling., , , , , and . NeurIPS, page 3544-3557. (2021)Accommodating Picky Customers: Regret Bound and Exploration Complexity for Multi-Objective Reinforcement Learning., , and . NeurIPS, page 13112-13124. (2021)