activity
20072026
most citedOn sparse representations of linear operators and the approximation of matrix products

20 citations · 38 across the 30 of their papers we have counts for

collaborators
Showing 2024Show all

6 papers · 1 filter

math.OC2024

Time-delay Induced Stochastic Optimization and Extremum Seeking

Naum Dimitrieski, Michael Reyer, Mohamed-Ali Belabbas +1

In this paper a novel stochastic optimization and extremum seeking algorithm is presented, one which is based on time-delayed random perturbations and step size adaptation. For the…

cs.IT2024

Age of Coded Updates In Gossip Networks Under Memory and Memoryless Schemes

Erkan Bayram, Melih Bastopcu, Mohamed-Ali Belabbas +1

We consider an information update system on a gossip network, where a source node encodes information into total keys such that any subset of at least keys can fully reco…

cs.LG2024

Control Theoretic Approach to Fine-Tuning and Transfer Learning

Erkan Bayram, Shenyu Liu, Mohamed-Ali Belabbas +1

Given a training set in the form of a paired , we say that the control system has learned the paired set via the control if the s…

math.OC2024

Dynamic Global Feedback Stabilization: why do the twist?

Mohamed-Ali Belabbas, Jehyung Ko

We investigate global dynamic feedback stabilization from a topological viewpoint. In particular, we consider the general case of dynamic feedback systems, whereby the total space…

math.OC2024

Graphons and the -property

Mohamed-Ali Belabbas, Xudong Chen

A graphon satisfies the -property if graphs sampled from it contain a Hamiltonian decomposition almost surely, which in turn implies that the corresponding network topologies ar…

cs.IT2024

Age of -out-of- Systems on a Gossip Network

Erkan Bayram, Melih Bastopcu, Mohamed-Ali Belabbas +1

We consider information update systems on a gossip network, which consists of a single source and receiver nodes. The source encrypts the information into distinct keys wit…