Mehrdad Ghadiri

According to our database1, Mehrdad Ghadiri authored at least 24 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Improving the Bit Complexity of Communication for Distributed Convex Optimization.
CoRR, 2024

The Bit Complexity of Dynamic Algebraic Formulas and their Determinants.
CoRR, 2024

A Parameterized Family of Meta-Submodular Functions.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Finite Population Regression Adjustment and Non-asymptotic Guarantees for Treatment Effect Estimation.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Approximately Optimal Core Shapes for Tensor Decompositions.
Proceedings of the International Conference on Machine Learning, 2023

The Bit Complexity of Efficient Continuous Optimization.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

On Symmetric Factorizations of Hankel Matrices.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
Subquadratic Kronecker Regression with Applications to Tensor Decomposition.
CoRR, 2022

Constant-Factor Approximation Algorithms for Socially Fair k-Clustering.
CoRR, 2022

Subquadratic Kronecker Regression with Applications to Tensor Decomposition.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Amortized Rejection Sampling in Universal Probabilistic Programming.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Sparse Regression Faster than d<sup>ω</sup>.
CoRR, 2021

Fast Low-Rank Tensor Decomposition by Ridge Leverage Score Sampling.
CoRR, 2021

Beyond Submodular Maximization via One-Sided Smoothness.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Socially Fair k-Means Clustering.
Proceedings of the FAccT '21: 2021 ACM Conference on Fairness, 2021

2020
Fair k-Means Clustering.
CoRR, 2020

2019
Beyond Submodular Maximization.
CoRR, 2019

Distributed Maximization of "Submodular plus Diversity" Functions for Multi-label Feature Selection on Huge Datasets.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2017
Scalable Feature Selection via Distributed Diversity Maximization.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Active Distance-Based Clustering Using K-Medoids.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2016

Linear Relaxations for Finding Diverse Elements in Metric Spaces.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Minimizing the Total Movement for Movement to Independence Problem on a Line.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015
Max-Sum Diversification, Monotone Submodular Functions and Semi-metric Spaces.
CoRR, 2015

Even and Odd Cycles Passing a Given Edge or a Vertex.
CoRR, 2015


  Loading...