5 citations · 17 across the 14 of their papers we have counts for
17 papers
Self-Supervised Combinatorial Optimization with Constraints via Frank-Wolfe
Akbar Rafiey, Yifei Xu, Nikolaos Karalias
Self-supervised learning for combinatorial optimization has emerged as a promising paradigm for solving discrete optimization problems with neural networks, but a central challenge…
StepJack: Benchmarking Computer-Use Agent Safety Against Multi-Step Indirect Prompt Injection
Zhuoxin Zhan, Akbar Rafiey, Avery Ma +2
Computer-use agents (CUAs) face a growing threat from indirect prompt injection, where adversarial instructions are planted in the environment such as web pages. In this paper, we…
The Price of Privacy For Approximating Max-CSP
Prathamesh Dharangutte, Jingcheng Liu, Pasin Manurangsi +3
We study approximation algorithms for Maximum Constraint Satisfaction Problems (Max-CSPs) under differential privacy (DP) where the constraints are considered sensitive data. Infor…
Geometric Algorithms for Neural Combinatorial Optimization with Constraints
Nikolaos Karalias, Akbar Rafiey, Yifei Xu +4
Self-Supervised Learning (SSL) for Combinatorial Optimization (CO) is an emerging paradigm for solving combinatorial problems using neural networks. In this paper, we address a cen…
Explaining GNN Explanations with Edge Gradients
Jesse He, Akbar Rafiey, Gal Mishne +1
In recent years, the remarkable success of graph neural networks (GNNs) on graph-structured data has prompted a surge of methods for explaining GNN predictions. However, the state-…
Differentiable Extensions with Rounding Guarantees for Combinatorial Optimization over Permutations
Robert R. Nerem, Zhishang Luo, Akbar Rafiey +1
Continuously extending combinatorial optimization objectives is a powerful technique commonly applied to the optimization of set functions. However, few such methods exist for exte…
Decomposable Submodular Maximization in Federated Setting
Akbar Rafiey
Submodular functions, as well as the sub-class of decomposable submodular functions, and their optimization appear in a wide range of applications in machine learning, recommendati…
The aperiodic Domino problem in higher dimension
Antonin Callard, Benjamin Hellouin de Menibus
The classical Domino problem asks whether there exists a tiling in which none of the forbidden patterns given as input appear. In this paper, we consider the aperiodic version of t…
Private Boosted Decision Trees via Smooth Re-Weighting
Vahid R. Asadi, Marco L. Carmosino, Mohammadmahdi Jahanara +2
Protecting the privacy of people whose data is used by machine learning algorithms is important. Differential Privacy is the appropriate mathematical framework for formal guarantee…
Sparsification of Decomposable Submodular Functions
Akbar Rafiey, Yuichi Yoshida
Submodular functions are at the core of many machine learning and data mining tasks. The underlying submodular functions for many of these tasks are decomposable, i.e., they are su…
The Ideal Membership Problem and Abelian Groups
Andrei A. Bulatov, Akbar Rafiey
Given polynomials the Ideal Membership Problem, IMP for short, asks if belongs to the ideal generated by . In the search version of this prob…
On the Complexity of CSP-based Ideal Membership Problems
Andrei A. Bulatov, Akbar Rafiey
In this paper we consider the Ideal Membership Problem (IMP for short), in which we are given real polynomials and the question is to decide whether belo…
Fast and Private Submodular and -Submodular Functions Maximization with Matroid Constraints
Akbar Rafiey, Yuichi Yoshida
The problem of maximizing nonnegative monotone submodular functions under a certain constraint has been intensively studied in the last decade, and a wide range of efficient approx…
Toward a Dichotomy for Approximation of -coloring
Akbar Rafiey, Arash Rafiey, Thiago Santos
Given two (di)graphs G, H and a cost function , in the minimum cost homomorphism problem, MinHOM(H), goal is finding a hom…
Counting maximal near perfect matchings in quasirandom and dense graphs
Yifan Jing, Akbar Rafiey
A maximal -near perfect matching is a maximal matching which covers at least vertices. In this paper, we study the number of maximal near perfe…
Approximation Algorithms for Generalized MST and TSP in Grid Clusters
Binay Bhattacharya, Ante Ćustić, Akbar Rafiey +2
We consider a special case of the generalized minimum spanning tree problem (GMST) and the generalized travelling salesman problem (GTSP) where we are given a set of points inside…
Ordering with precedence constraints and budget minimization
Akbar Rafiey, Jeff Kinne, Ján Manuch +1
We introduce a variation of the scheduling with precedence constraints problem that has applications to molecular folding and production management. We are given a bipartite graph…