MAMatin Ansaripour

Matin Ansaripour

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Matin Ansaripour has a total of 6 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Hybrid Decentralized Optimization: Leveraging Both First- and Zeroth-Order Optimizers for Faster Convergence

    by Shayan Talaei, Matin Ansaripour, Giorgi Nadiradze, Dan Alistarh

    Distributed optimization is the standard way of speeding up machine learning training, and most of the research in the area focuses on distributed first-order, gradient-based methods. Yet, there are settings where some computationally-bounded nodes may not be able to implement first-order, gradient-based optimization, while they could still contribute to joint optimization tasks. In this paper, we initiate the study of hybrid decentralized optimization, studying settings where nodes with zeroth-order and first-order optimization capabilities co-exist in a distributed system, and attempt to jointly solve an optimization task over some data distribution. We essentially show that, under reasonable parameter settings, such a system can not only withstand noisier zeroth-order agents but can even benefit from integrating such agents into the optimization process, rather than ignoring their information. At the core of our approach is a new analysis of distributed optimization with noisy and possibly-biased gradient estimators, which may be of independent interest. Our results hold for both convex and non-convex objectives. Experimental results on standard optimization tasks confirm our analysis, showing that hybrid first-zeroth order optimization can be practical, even when training deep neural networks.

  • Open Access

    Approximate EFX and Exact tEFX Allocations for Indivisible Chores: Improved Algorithms

    by Mahyar Afshinmehr, Matin Ansaripour, Alireza Danaei, Kurt Mehlhorn

    We explore the fair distribution of a set of $m$ indivisible chores among $n$ agents, where each agent's costs are evaluated using a monotone cost function. Our focus lies on two fairness criteria: envy-freeness up to any item (EFX) and a relaxed notion, namely envy-freeness up to the transfer of any item (tEFX). We demonstrate that a 2-approximate EFX allocation exists and is computable in polynomial time for three agents with subadditive cost functions, improving upon the previous $(2 + \sqrt{6})$ approximation for additive cost functions. This result requires extensive case analysis. Christoforidis et al. (IJCAI'24) independently claim the same approximation for additive cost functions; however, we provide a counter-example to their algorithm. We expand the number of agents to any number to get the same approximation guarantee with the assumption of partially identical ordering (IDO) for the cost functions. Additionally, we establish that a tEFX allocation is achievable for three agents if one has an additive 2-ratio bounded cost function, while the others may have general monotone cost functions. This is an improvement from the prior requirement of two agents with additive 2-ratio bounded cost functions. This allocation can also be extended to agent groups with identical valuations. Further, we show various analyses of EFX allocations for chores, such as the relaxations for additive $α$-ratio-bounded cost functions.