default search action
Adrian Vladu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c22]Alexandra Peste, Adrian Vladu, Eldar Kurtic, Christoph H. Lampert, Dan Alistarh:
CrAM: A Compression-Aware Minimizer. ICLR 2023 - [c21]Ilia Markov, Adrian Vladu, Qi Guo, Dan Alistarh:
Quantized Distributed Training of Large Models with Convergence Guarantees. ICML 2023: 24020-24044 - [c20]Lucas Pesenti, Adrian Vladu:
Discrepancy Minimization via Regularization. SODA 2023: 1734-1758 - [c19]Adrian Vladu:
Interior Point Methods with a Gradient Oracle. STOC 2023: 1876-1889 - [i21]Ilia Markov, Adrian Vladu, Qi Guo, Dan Alistarh:
Quantized Distributed Training of Large Models with Convergence Guarantees. CoRR abs/2302.02390 (2023) - [i20]Adrian Vladu:
Interior Point Methods with a Gradient Oracle. CoRR abs/2304.04550 (2023) - 2022
- [i19]Alexandra Peste, Adrian Vladu, Dan Alistarh, Christoph H. Lampert:
CrAM: A Compression-Aware Minimizer. CoRR abs/2207.14200 (2022) - [i18]Lucas Pesenti, Adrian Vladu:
Discrepancy Minimization via Regularization. CoRR abs/2211.05509 (2022) - 2021
- [c18]Alina Ene, Huy L. Nguyen, Adrian Vladu:
Adaptive Gradient Methods for Constrained Convex Optimization and Variational Inequalities. AAAI 2021: 7314-7321 - [c17]Alina Ene, Huy L. Nguyen, Adrian Vladu:
Projection-Free Bandit Optimization with Privacy Guarantees. AAAI 2021: 7322-7330 - [c16]Kyriakos Axiotis, Aleksander Madry, Adrian Vladu:
Faster Sparse Minimum Cost Flow by Electrical Flow Localization. FOCS 2021: 528-539 - [c15]Kyriakos Axiotis, Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Adrian Vladu:
Decomposable Submodular Function Minimization via Maximum Flow. ICML 2021: 446-456 - [c14]Alexandra Peste, Eugenia Iofinova, Adrian Vladu, Dan Alistarh:
AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networks. NeurIPS 2021: 8557-8570 - [i17]Kyriakos Axiotis, Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Adrian Vladu:
Decomposable Submodular Function Minimization via Maximum Flow. CoRR abs/2103.03868 (2021) - [i16]Alexandra Peste, Eugenia Iofinova, Adrian Vladu, Dan Alistarh:
AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networks. CoRR abs/2106.12379 (2021) - [i15]Kyriakos Axiotis, Aleksander Madry, Adrian Vladu:
Faster Sparse Minimum Cost Flow by Electrical Flow Localization. CoRR abs/2111.10368 (2021) - 2020
- [c13]Kyriakos Axiotis, Aleksander Madry, Adrian Vladu:
Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs. FOCS 2020: 93-104 - [i14]Kyriakos Axiotis, Aleksander Madry, Adrian Vladu:
Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs. CoRR abs/2003.04863 (2020) - [i13]Alina Ene, Huy L. Nguyen, Adrian Vladu:
Adaptive Gradient Methods for Constrained Convex Optimization. CoRR abs/2007.08840 (2020) - [i12]Alina Ene, Huy L. Nguyen, Adrian Vladu:
Projection-Free Bandit Optimization with Privacy Guarantees. CoRR abs/2012.12138 (2020)
2010 – 2019
- 2019
- [c12]Alina Ene, Adrian Vladu:
Improved Convergence for $\ell_1$ and $\ell_∞$ Regression via Iteratively Reweighted Least Squares. ICML 2019: 1794-1801 - [c11]Alina Ene, Huy L. Nguyen, Adrian Vladu:
Submodular maximization with matroid and packing constraints in parallel. STOC 2019: 90-101 - [i11]Alina Ene, Adrian Vladu:
Improved Convergence for $\ell_\infty$ and $\ell_1$ Regression via Iteratively Reweighted Least Squares. CoRR abs/1902.06391 (2019) - 2018
- [j1]Ilan Lobel, Renato Paes Leme, Adrian Vladu:
Multidimensional Binary Search for Contextual Decision-Making. Oper. Res. 66(5): 1346-1361 (2018) - [c10]Aleksander Madry, Aleksandar Makelov, Ludwig Schmidt, Dimitris Tsipras, Adrian Vladu:
Towards Deep Learning Models Resistant to Adversarial Attacks. ICLR (Poster) 2018 - [i10]Alina Ene, Huy L. Nguyen, Adrian Vladu:
Submodular Maximization with Packing Constraints in Parallel. CoRR abs/1808.09987 (2018) - [i9]Alina Ene, Huy L. Nguyen, Adrian Vladu:
A Parallel Double Greedy Algorithm for Submodular Maximization. CoRR abs/1812.01591 (2018) - 2017
- [c9]Michael B. Cohen, Aleksander Madry, Dimitris Tsipras, Adrian Vladu:
Matrix Scaling and Balancing via Box Constrained Newton's Method and Interior Point Methods. FOCS 2017: 902-913 - [c8]Vahab S. Mirrokni, Renato Paes Leme, Adrian Vladu, Sam Chiu-wai Wong:
Tight Bounds for Approximate Carathéodory and Beyond. ICML 2017: 2440-2448 - [c7]Ilan Lobel, Renato Paes Leme, Adrian Vladu:
Multidimensional Binary Search for Contextual Decision-Making. EC 2017: 585 - [c6]Michael B. Cohen, Aleksander Madry, Piotr Sankowski, Adrian Vladu:
Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (m10/7 log W) Time (Extended Abstract). SODA 2017: 752-771 - [c5]Michael B. Cohen, Jonathan A. Kelner, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford, Adrian Vladu:
Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs. STOC 2017: 410-419 - [i8]Michael B. Cohen, Aleksander Madry, Dimitris Tsipras, Adrian Vladu:
Matrix Scaling and Balancing via Box Constrained Newton's Method and Interior Point Methods. CoRR abs/1704.02310 (2017) - [i7]Aleksander Madry, Aleksandar Makelov, Ludwig Schmidt, Dimitris Tsipras, Adrian Vladu:
Towards Deep Learning Models Resistant to Adversarial Attacks. CoRR abs/1706.06083 (2017) - 2016
- [c4]Michael B. Cohen, Jonathan A. Kelner, John Peebles, Richard Peng, Aaron Sidford, Adrian Vladu:
Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More. FOCS 2016: 583-592 - [i6]Michael B. Cohen, Aleksander Madry, Piotr Sankowski, Adrian Vladu:
Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ(m10/7 log W) Time. CoRR abs/1605.01717 (2016) - [i5]Michael B. Cohen, Jonathan A. Kelner, John Peebles, Richard Peng, Aaron Sidford, Adrian Vladu:
Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More. CoRR abs/1608.03270 (2016) - [i4]Michael B. Cohen, Jonathan A. Kelner, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford, Adrian Vladu:
Almost-Linear-Time Algorithms for Markov Chains and New Spectral Primitives for Directed Graphs. CoRR abs/1611.00755 (2016) - [i3]Ilan Lobel, Renato Paes Leme, Adrian Vladu:
Multidimensional Binary Search for Contextual Decision-Making. CoRR abs/1611.00829 (2016) - 2015
- [c3]Dan Alistarh, Rati Gelashvili, Adrian Vladu:
How To Elect a Leader Faster than a Tournament. PODC 2015: 365-374 - [c2]Gary L. Miller, Richard Peng, Adrian Vladu, Shen Chen Xu:
Improved Parallel Algorithms for Spanners and Hopsets. SPAA 2015: 192-201 - [i2]Vahab S. Mirrokni, Renato Paes Leme, Adrian Vladu, Sam Chiu-wai Wong:
Tight Bounds for Approximate Carathéodory and Beyond. CoRR abs/1512.08602 (2015) - 2014
- [i1]Dan Alistarh, Rati Gelashvili, Adrian Vladu:
How to Elect a Leader Faster than a Tournament. CoRR abs/1411.1001 (2014) - 2010
- [c1]Claire Mathieu, Adrian Vladu:
Online Ranking for Tournament Graphs. WAOA 2010: 201-212
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-07 22:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint