activity
20232026
most citedRandomized Greedy Methods for Weak Submodular Sensor Selection with Robustness Considerations

4 citations · 10 across the 11 of their papers we have counts for

collaborators

13 papers

cs.LG2026

Robust Langevin Sampling under State-Dependent Heavy-Tailed Noise with Applications to LLM Fine-Tuning

M. Berk Sahin, Ege C. Kaya, Arda Fazla +2

Existing convergence guarantees for non-log-concave sampling with stochastic gradient Langevin Monte Carlo (SG-LMC) typically assume globally Lipschitz gradients and uniformly boun…

cs.LG2026

Why Does Adaptive Batching Help LLM Pretraining? A Perspective from Unbounded Variance

Arda Fazla, Antesh Upadhyay, Ege C. Kaya +2

Increasing the batch size during training is a common practice in large language model (LLM) pretraining, yet the theoretical justification behind its success is not well understoo…

cs.LG2026

EGGROLL, Unrolled: Understanding and Improving Low-Rank Evolution Strategies at Scale

Ege C. Kaya, Abolfazl Hashemi

EGGROLL (Sarkar et al., 2026) makes evolution strategies (ES) practical for LLMs by replacing dense Gaussian weight perturbations with low-rank Gaussian products, often of rank one…

cs.LG2026

Learning to Control Coupled-Dynamics Environments with Joint Markov Decision Processes

Ege C. Kaya, Aliasghar Pourghani, Mahsa Ghasemi +2

Coupled-dynamics environments expose the one-step outcomes that would follow from several possible counterfactual actions under a common realization of exogenous randomness. The or…

cs.LG2026

A Banach-Space Theory of Markovian Halpern Iteration for Non-Expansive Maps

Ege C. Kaya, Arda Fazla, M. Berk Sahin +1

We study stochastic approximation of fixed points of a non-expansive operator when the oracle samples originate from a continuing Markovian trajectory. A direct block-minibatch…

cs.LG2026

Quotient-Categorical Representations for Bellman-Compatible Average-Reward Distributional Reinforcement Learning

Ege C. Kaya, Aliasghar Pourghani, Vijay Gupta +1

Average-reward reinforcement learning requires estimating the gain and the bias, which is defined only up to an additive constant. This makes direct distributional analogues ill-po…

cs.LG2026

A Sharp Finite-Iteration Theory for Asynchronous Categorical Distributional Temporal-Difference Learning

Ege C. Kaya, Abolfazl Hashemi

We study finite-iteration behavior of asynchronous categorical distributional temporal-difference methods, covering scalar categorical TD (CTD) in the Cramér geometry and multivari…

cs.LG2026

Lower Bounds and Proximally Anchored SGD for Non-Convex Minimization Under Unbounded Variance

Arda Fazla, Ege C. Kaya, Antesh Upadhyay +1

Analysis of Stochastic Gradient Descent (SGD) and its variants typically relies on the assumption of uniformly bounded variance, a condition that frequently fails in practical non-…

cs.LG2026

Joint MDPs and Reinforcement Learning in Coupled-Dynamics Environments

Ege C. Kaya, Mahsa Ghasemi, Abolfazl Hashemi

Many distributional quantities in reinforcement learning are intrinsically joint across actions, including distributions of gaps and probabilities of superiority. However, the clas…

cs.LG2024★ 2 cited

Submodular Maximization Approaches for Equitable Client Selection in Federated Learning

Andrés Catalino Castillo Jiménez, Ege C. Kaya, Lintao Ye +1

In a conventional Federated Learning framework, client selection for training typically involves the random sampling of a subset of clients in each iteration. However, this random…

cs.LG2024★ 1 cited

Localized Distributional Robustness in Submodular Multi-Task Subset Selection

Ege C. Kaya, Abolfazl Hashemi

In this work, we treat the problem of multi-task submodular optimization from the perspective of local distributional robustness within the neighborhood of a reference distribution…

math.OC2024★ 4 cited

Randomized Greedy Methods for Weak Submodular Sensor Selection with Robustness Considerations

Ege C. Kaya, Michael Hibbard, Takashi Tanaka +2

We study a pair of budget- and performance-constrained weak-submodular maximization problems. For computational efficiency, we explore the use of stochastic greedy algorithms which…

cs.LG2023★ 3 cited

Communication-Efficient Zeroth-Order Distributed Online Optimization: Algorithm, Theory, and Applications

Ege C. Kaya, M. Berk Sahin, Abolfazl Hashemi

This paper focuses on a multi-agent zeroth-order online optimization problem in a federated learning setting for target tracking. The agents only sense their current distances to t…