← Search

Mohammad Pedramfar

7 accepted papers

2026

Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets

ICML 2026poster

We study online maximization of non-monotone Diminishing-Return(DR)-submodular functions over down-closed convex sets, a regime where existing projection-free online methods suffer from suboptimal regret and limited feedback guarantees. Our main contribution is a new structural result showing that t…

Cited by 0SourceScholar
2025

Diffusion Tree Sampling: Scalable inference‑time alignment of diffusion models

NeurIPS 2025poster

Adapting a pretrained diffusion model to new objectives at inference time remains an open problem in generative modeling. Existing steering methods suffer from inaccurate value estimation, especially at high noise levels, which biases guidance. Moreover, information from past runs is not reused to i…

Cited by 32SourceScholar
2025

Uniform Wrappers: Bridging Concave to Quadratizable Functions in Online Optimization

NeurIPS 2025poster

This paper presents novel contributions to the field of online optimization, particularly focusing on the adaptation of algorithms from concave optimization to more challenging classes of functions. Key contributions include the introduction of uniform wrappers, a class of meta-algorithms that could…

Cited by 0SourceScholar
2024

From Linear to Linearizable Optimization: A Novel Framework with Applications to Stationary and Non-stationary DR-submodular Optimization

NeurIPS 2024poster

This paper introduces the notion of upper-linearizable/quadratizable functions, a class that extends concavity and DR-submodularity in various settings, including monotone and non-monotone cases over different types of convex sets. A general meta-algorithm is devised to convert algorithms for linear…

Cited by 4SourcePDFScholar
2024

Unified Projection-Free Algorithms for Adversarial DR-Submodular Optimization

ICLR 2024poster

This paper introduces unified projection-free Frank-Wolfe type algorithms for adversarial continuous DR-submodular optimization, spanning scenarios such as full information and (semi-)bandit feedback, monotone and non-monotone functions, different constraints, and types of stochastic queries. For ev…

2023

A Unified Approach for Maximizing Continuous DR-submodular Functions

NeurIPS 2023poster

This paper presents a unified approach for maximizing continuous DR-submodular functions that encompasses a range of settings and oracle access types. Our approach includes a Frank-Wolfe type offline algorithm for both monotone and non-monotone functions, with different restrictions on the general c…

Cited by 11SourcePDFScholar
2023

Improved Bayesian Regret Bounds for Thompson Sampling in Reinforcement Learning

NeurIPS 2023poster

In this paper, we prove state-of-the-art Bayesian regret bounds for Thompson Sampling in reinforcement learning in a multitude of settings. We present a refined analysis of the information ratio, and show an upper bound of order $\widetilde{O}(H\sqrt{d_{l_1}T})$ in the time inhomogeneous reinforceme…

Cited by 5SourcePDFScholar