( en | de | ru )

 

Disambiguation of "Braverman, Vladimir"

Author of the publication

copydeleteadd this publication to your clipboard
The Physical Systems Behind Optimization Algorithms.

, , , and . NeurIPS, page 4377-4386. (2018)

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.

Sigrun H Braverman

Vladimir Spasitsch

Vladimir Legradi

Vladimir Oreskovic

Vladimir Popov

 

Other publications of authors with the same name

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)Lower Bounds for Pseudo-Deterministic Counting in a Stream., , , and . ICALP, volume 261 of LIPIcs, page 30:1-30:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Near Optimal Linear Algebra in the Online and Sliding Window Models., , , , , , and . FOCS, page 517-528. IEEE, (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)Understanding the Micro-Behaviors of Hardware Offloaded Network Stacks with Lumina., , , , , and . SIGCOMM, page 1074-1087. ACM, (2023)Risk Bounds of Multi-Pass SGD for Least Squares in the Interpolation Regime., , , , and . NeurIPS, (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)Sketch and Scale Geo-distributed tSNE and UMAP., , , and . IEEE BigData, page 996-1003. IEEE, (2020)