default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMehrdad Ghadiri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c16]Emile Anand, Jan van den Brand, Mehrdad Ghadiri, Daniel J. Zhang:
The Bit Complexity of Dynamic Algebraic Formulas and Their Determinants. ICALP 2024: 10:1-10:20- [c15]Mehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd:
A Parameterized Family of Meta-Submodular Functions. SODA 2024: 1278-1306 - [c14]Mehrdad Ghadiri
, Yin Tat Lee, Swati Padmanabhan, William Swartworth, David P. Woodruff, Guanghao Ye:
Improving the Bit Complexity of Communication for Distributed Convex Optimization. STOC 2024: 1130-1140 - [i19]Emile Anand, Jan van den Brand, Mehrdad Ghadiri, Daniel J. Zhang:
The Bit Complexity of Dynamic Algebraic Formulas and their Determinants. CoRR abs/2401.11127 (2024) - [i18]Mehrdad Ghadiri, Yin Tat Lee, Swati Padmanabhan, William Swartworth, David P. Woodruff, Guanghao Ye:
Improving the Bit Complexity of Communication for Distributed Convex Optimization. CoRR abs/2403.19146 (2024) - [i17]Jingbang Chen, Mehrdad Ghadiri, Hoai-An Nguyen, Richard Peng, Junzhao Yang:
Entrywise Approximate Laplacian Solving. CoRR abs/2409.10022 (2024) - 2023
- [c13]Mehrdad Ghadiri, Richard Peng, Santosh S. Vempala:
The Bit Complexity of Efficient Continuous Optimization. FOCS 2023: 2059-2070 - [c12]Mehrdad Ghadiri:
On Symmetric Factorizations of Hankel Matrices. FOCS 2023: 2081-2092 - [c11]Mehrdad Ghadiri, Matthew Fahrbach, Gang Fu, Vahab Mirrokni:
Approximately Optimal Core Shapes for Tensor Decompositions. ICML 2023: 11237-11254 - [c10]Mehrdad Ghadiri, David Arbour, Tung Mai, Cameron Musco, Anup B. Rao:
Finite Population Regression Adjustment and Non-asymptotic Guarantees for Treatment Effect Estimation. NeurIPS 2023 - [i16]Mehrdad Ghadiri, Matthew Fahrbach, Gang Fu, Vahab Mirrokni:
Approximately Optimal Core Shapes for Tensor Decompositions. CoRR abs/2302.03886 (2023) - [i15]Mehrdad Ghadiri, Richard Peng, Santosh S. Vempala:
The Bit Complexity of Efficient Continuous Optimization. CoRR abs/2304.02124 (2023) - [i14]Mehrdad Ghadiri:
On Symmetric Factorizations of Hankel Matrices. CoRR abs/2307.00805 (2023) - 2022
- [c9]Saeid Naderiparizi, Adam Scibior, Andreas Munk, Mehrdad Ghadiri, Atilim Gunes Baydin, Bradley J. Gram-Hansen, Christian A. Schröder de Witt, Robert Zinkov, Philip H. S. Torr, Tom Rainforth, Yee Whye Teh, Frank Wood:
Amortized Rejection Sampling in Universal Probabilistic Programming. AISTATS 2022: 8392-8412 - [c8]Matthew Fahrbach, Gang Fu, Mehrdad Ghadiri:
Subquadratic Kronecker Regression with Applications to Tensor Decomposition. NeurIPS 2022 - [i13]Mehrdad Ghadiri, Mohit Singh, Santosh S. Vempala:
Constant-Factor Approximation Algorithms for Socially Fair k-Clustering. CoRR abs/2206.11210 (2022) - [i12]Matthew Fahrbach, Thomas Fu, Mehrdad Ghadiri:
Subquadratic Kronecker Regression with Applications to Tensor Decomposition. CoRR abs/2209.04876 (2022) - 2021
- [c7]Mehrdad Ghadiri, Samira Samadi, Santosh S. Vempala:
Socially Fair k-Means Clustering. FAccT 2021: 438-448 - [c6]Mehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd:
Beyond Submodular Maximization via One-Sided Smoothness. SODA 2021: 1006-1025 - [i11]Matthew Fahrbach, Mehrdad Ghadiri, Thomas Fu:
Fast Low-Rank Tensor Decomposition by Ridge Leverage Score Sampling. CoRR abs/2107.10654 (2021) - [i10]Mehrdad Ghadiri, Richard Peng, Santosh S. Vempala:
Sparse Regression Faster than dω. CoRR abs/2109.11537 (2021) - 2020
- [i9]Mehrdad Ghadiri, Samira Samadi, Santosh S. Vempala:
Fair k-Means Clustering. CoRR abs/2006.10085 (2020) - [i8]Mehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd:
A Parameterized Family of Meta-Submodular Functions. CoRR abs/2006.13754 (2020)
2010 – 2019
- 2019
- [c5]Mehrdad Ghadiri, Mark Schmidt:
Distributed Maximization of "Submodular plus Diversity" Functions for Multi-label Feature Selection on Huge Datasets. AISTATS 2019: 2077-2086 - [i7]Mehrdad Ghadiri, Mark Schmidt:
Distributed Maximization of "Submodular plus Diversity" Functions for Multi-label Feature Selection on Huge Datasets. CoRR abs/1903.08351 (2019) - [i6]Mehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd:
Beyond Submodular Maximization. CoRR abs/1904.09216 (2019) - [i5]Saeid Naderiparizi, Adam Scibior, Andreas Munk, Mehrdad Ghadiri, Atilim Günes Baydin, Bradley Gram-Hansen, Christian Schröder de Witt, Robert Zinkov, Philip H. S. Torr, Tom Rainforth, Yee Whye Teh, Frank Wood:
Amortized Rejection Sampling in Universal Probabilistic Programming. CoRR abs/1910.09056 (2019) - 2017
- [c4]Sepehr Abbasi Zadeh, Mehrdad Ghadiri, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Scalable Feature Selection via Distributed Diversity Maximization. AAAI 2017: 2876-2883 - 2016
- [c3]Mehrdad Ghadiri, Sina Yazdanbod:
Minimizing the Total Movement for Movement to Independence Problem on a Line. CCCG 2016: 15-20 - [c2]Aditya Bhaskara, Mehrdad Ghadiri, Vahab S. Mirrokni, Ola Svensson:
Linear Relaxations for Finding Diverse Elements in Metric Spaces. NIPS 2016: 4098-4106 - [c1]Amin Aghaee, Mehrdad Ghadiri, Mahdieh Soleymani Baghshah:
Active Distance-Based Clustering Using K-Medoids. PAKDD (1) 2016: 253-264 - [i4]Mehrdad Ghadiri, Sina Yazdanbod:
Minimizing the Total Movement for Movement to Independence Problem on a Line. CoRR abs/1606.09596 (2016) - 2015
- [i3]Sepehr Abbasi Zadeh, Mehrdad Ghadiri:
Max-Sum Diversification, Monotone Submodular Functions and Semi-metric Spaces. CoRR abs/1511.02402 (2015) - [i2]Saieed Akbari, Khashayar Etemadi, Peyman Ezzati, Mehrdad Ghadiri:
Even and Odd Cycles Passing a Given Edge or a Vertex. CoRR abs/1512.02443 (2015) - [i1]Mehrdad Ghadiri, Amin Aghaee, Mahdieh Soleymani Baghshah:
Active Distance-Based Clustering using K-medoids. CoRR abs/1512.03953 (2015)
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-14 23:29 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:
