← Search

Mehrdad Ghadiri

7 accepted papers

2025

Fast Tensor Completion via Approximate Richardson Iteration

ICML 2025poster

We study tensor completion (TC) through the lens of low-rank tensor decomposition (TD). Many TD algorithms use fast alternating minimization methods to solve _highly structured_ linear regression problems at each step (e.g., for CP, Tucker, and tensor-train decompositions). However, such algebraic s…

Cited by 0SourcePDFScholar
2023

Approximately Optimal Core Shapes for Tensor Decompositions

ICML 2023poster

This work studies the combinatorial optimization problem of finding an optimal core tensor shape, also called multilinear rank, for a size-constrained Tucker decomposition. We give an algorithm with provable approximation guarantees for its reconstruction error via connections to higher-order singul…

Cited by 8SourcePDFScholar
2023

Finite Population Regression Adjustment and Non-asymptotic Guarantees for Treatment Effect Estimation

NeurIPS 2023poster

The design and analysis of randomized experiments is fundamental to many areas, from the physical and social sciences to industrial settings. Regression adjustment is a popular technique to reduce the variance of estimates obtained from experiments, by utilizing information contained in auxiliary c…

Cited by 3SourcePDFScholar
2022

Amortized Rejection Sampling in Universal Probabilistic Programming

AISTATS 2022poster

Naive approaches to amortized inference in probabilistic programs with unbounded loops can produce estimators with infinite variance. This is particularly true of importance sampling inference in programs that explicitly include rejection sampling as part of the user-programmed generative procedure.…

2022

Subquadratic Kronecker Regression with Applications to Tensor Decomposition

NeurIPS 2022accept

Kronecker regression is a highly-structured least squares problem $\min_{\mathbf{x}} \lVert \mathbf{K}\mathbf{x} - \mathbf{b} \rVert_{2}^2$, where the design matrix $\mathbf{K} = \mathbf{A}^{(1)} \otimes \cdots \otimes \mathbf{A}^{(N)}$ is a Kronecker product of factor matrices. This regression prob…

2019

Distributed Maximization of "Submodular plus Diversity" Functions for Multi-label Feature Selection on Huge Datasets

AISTATS 2019poster

There are many problems in machine learning and data mining which are equivalent to selecting a non-redundant, high "quality" set of objects. Recommender systems, feature selection, and data summarization are among many applications of this. In this paper, we consider this problem as an optimization…

Cited by 0SourcePDFScholar
2016

Linear Relaxations for Finding Diverse Elements in Metric Spaces

NeurIPS 2016poster

Choosing a diverse subset of a large collection of points in a metric space is a fundamental problem, with applications in feature selection, recommender systems, web search, data summarization, etc. Various notions of diversity have been proposed, tailored to different applications. The general alg…

Cited by 27SourcePDFScholar