← Search

Fares Fourati

7 accepted papers

2026

ECPv2: Fast, Efficient, and Scalable Global Optimization of Lipschitz Functions

AAAI 2026technical

We propose ECPv2, a scalable and theoretically grounded algorithm for global optimization of Lipschitz continuous functions with unknown Lipschitz constants. Building on the Every Call is Precious (ECP) framework, which ensures that each accepted function evaluation is potentially informative, ECPv2

Cited by 0SourcePDFScholar
2025

Every Call is Precious: Global Optimization of Black-Box Functions with Unknown Lipschitz Constants

AISTATS 2025poster

Optimizing expensive, non-convex, black-box Lipschitz continuous functions presents significant challenges, particularly when the Lipschitz constant of the underlying function is unknown. Such problems often demand numerous function evaluations to approximate the global optimum, which can be prohibi…

Cited by 0SourcecodeScholar
2024

Combinatorial Stochastic-Greedy Bandit

AAAI 2024technical

We propose a novel combinatorial stochastic-greedy bandit (SGB) algorithm for combinatorial multi-armed bandit problems when no extra information other than the joint reward of the selected set of n arms at each time step t in [T] is observed. SGB adopts an optimized stochastic-explore-then-commit a…

Cited by 11SourcePDFScholar
2023

Randomized Greedy Learning for Non-monotone Stochastic Submodular Maximization Under Full-bandit Feedback

AISTATS 2023poster

We investigate the problem of unconstrained combinatorial multi-armed bandits with full-bandit feedback and stochastic rewards for submodular maximization. Previous works investigate the same problem assuming a submodular and monotone reward function. In this work, we study a more general problem, i…

Cited by 18SourcePDFScholar