AIConfPaper
← Search

Peyman Jabbarzade

6 accepted papers

2026

Improved Dynamic Algorithm for Non-monotone Submodular Maximization under Cardinality Constraint

Morteza Monemizadeh, Kiarash Banihashem, Peyman Jabbarzade, MohammadTaghi Hajiaghayi, Samira Goudarzi
ICML 2026poster

Non-monotone submodular maximization is a fundamental problem in machine learning and combinatorial optimization, with a range of applications including text and video summarization, recommendation systems, feature selection, Max Cut problems in graphs, and viral marketing strategies. In this work, …

Cited by 0Source ↗Scholar ↗
2025

Dynamic Diameter in High-Dimensions against Adaptive Adversary and Beyond

Kiarash Banihashem, Jeff Giliberti, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh
NeurIPS 2025poster

In this paper, we study the fundamental problems of maintaining the diameter and a $k$-center clustering of a dynamic point set $P \subset \mathbb{R}^d$, where points may be inserted or deleted over time and the ambient dimension $d$ is not constant and may be high. Our focus is on designing algorit…

Cited by 0Source ↗Scholar ↗
2025

Non-monotone Submodular Optimization: $p$-Matchoid Constraints and Fully Dynamic Setting

Kiarash Banihashem, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh
NeurIPS 2025poster

Submodular maximization subject to a $p$-matchoid constraint has various applications in machine learning, particularly in tasks such as feature selection, video and text summarization, movie recommendation, graph-based learning, and constraint-based optimization. We study this problem in the dynami…

Cited by 0Source ↗Scholar ↗
2024

A Dynamic Algorithm for Weighted Submodular Cover Problem

Kiarash Banihashem, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh
ICML 2024oral

We initiate the study of the submodular cover problem in a dynamic setting where the elements of the ground set are inserted and deleted. In the classical submodular cover problem, we are given a monotone submodular function $f : 2^{V} \to \mathbb{R}^{\ge 0}$ and the goal is to obtain a set $S \subs…

Cited by 0Source ↗PDF ↗Scholar ↗
2023

Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time

Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh
ICML 2023poster

Maximizing a monotone submodular function under cardinality constraint $k$ is a core problem in machine learning and database with many basic applications, including video and data summarization, recommendation systems, feature extraction, exemplar clustering, and coverage problems. We study this cl…

Cited by 9Source ↗PDF ↗Scholar ↗
2023

Dynamic Non-monotone Submodular Maximization

Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh
NeurIPS 2023poster

Maximizing submodular functions has been increasingly used in many applications of machine learning, such as data summarization, recommendation systems, and feature selection. Moreover, there has been a growing interest in both submodular maximization and dynamic algorithms. In 2020, Monemizadeh an…

Cited by 4Source ↗PDF ↗Scholar ↗