activity
20172024
most citedStochastic Submodular Maximization: The Case of Coverage Functions

12 citations · 22 across the 9 of their papers we have counts for

collaborators

9 papers

stat.ML2024

Constrained Sampling with Primal-Dual Langevin Monte Carlo

Luiz F. O. Chamon, Mohammad Reza Karimi, Anna Korba

This work considers the problem of sampling from a probability distribution known up to a normalization constant while satisfying a set of statistical constraints specified by the…

cs.CL2024★ 1 cited

Enhancing Language Learning through Technology: Introducing a New English-Azerbaijani (Arabic Script) Parallel Corpus

Jalil Nourmohammadi Khiarak, Ammar Ahmadi, Taher Ak-bari Saeed +7

This paper introduces a pioneering English-Azerbaijani (Arabic Script) parallel corpus, designed to bridge the technological gap in language learning and machine translation (MT) f…

cs.LG2023

Sinkhorn Flow: A Continuous-Time Framework for Understanding and Generalizing the Sinkhorn Algorithm

Mohammad Reza Karimi, Ya-Ping Hsieh, Andreas Krause

Many problems in machine learning can be formulated as solving entropy-regularized optimal transport on the space of probability measures. The canonical approach involves the Sinkh…

math.OC2023★ 2 cited

Riemannian stochastic optimization methods avoid strict saddle points

Ya-Ping Hsieh, Mohammad Reza Karimi, Andreas Krause +1

Many modern machine learning applications - from online principal component analysis to covariance matrix identification and dictionary learning - can be formulated as minimization…

stat.ML2022

Isotropic Gaussian Processes on Finite Spaces of Graphs

Viacheslav Borovitskiy, Mohammad Reza Karimi, Vignesh Ram Somnath +1

We propose a principled way to define Gaussian process priors on various sets of unweighted graphs: directed or undirected, with or without loops. We endow each of these sets with…

cs.LG2022★ 1 cited

A Dynamical System View of Langevin-Based Non-Convex Sampling

Mohammad Reza Karimi, Ya-Ping Hsieh, Andreas Krause

Non-convex sampling is a key challenge in machine learning, central to non-convex optimization in deep learning as well as to approximate probabilistic inference. Despite its signi…

math.OC2022

Riemannian stochastic approximation algorithms

Mohammad Reza Karimi, Ya-Ping Hsieh, Panayotis Mertikopoulos +1

We examine a wide class of stochastic approximation algorithms for solving (stochastic) nonlinear problems on Riemannian manifolds. Such algorithms arise naturally in the study of…

cs.LG2020★ 6 cited

Online Active Model Selection for Pre-trained Classifiers

Mohammad Reza Karimi, Nezihe Merve Gürel, Bojan Karlaš +3

Given pre-trained classifiers and a stream of unlabeled data examples, how can we actively decide when to query a label so that we can distinguish the best model from the rest…

cs.LG2017★ 12 cited

Stochastic Submodular Maximization: The Case of Coverage Functions

Mohammad Reza Karimi, Mario Lucic, Hamed Hassani +1

Stochastic optimization of continuous objectives is at the heart of modern machine learning. However, many important problems are of discrete nature and often involve submodular ob…