ABDULLAH ALOMAR

Mr. ABDULLAH ALOMAR


Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 January 2023 in Energies
Verified
Journal Article
Open access
PDF file
OAOmar Alolayan
Omar Alolayan
AAABDULLAH ALOMAR
ABDULLAH ALOMAR
JWJohn R. Williams
John R. Williams
Reformulating the history matching problem from a least-square mathematical optimization problem into a Markov Decision Process introduces a method in which reinforcement learning can be utilized to solve the problem. This method provides a mechanism where an artificial deep neural network agent can interact with the reservoir simulator and find multiple different solutions to the problem. Such a formulation allows for solving the problem in parallel by launching multiple concurrent environments enabling the agent to learn simultaneously from all the environments at once, achieving significant speed up.

4 November 2025
Verified
Conference Paper
Open access
ASAli Shirali
Ali Shirali
ANArash Nasr-Esfahany
Arash Nasr-Esfahany
AAABDULLAH ALOMAR
ABDULLAH ALOMAR
PMParsa Mirtaheri
Parsa Mirtaheri
RARediet Abebe
Rediet Abebe
APAriel D. Procaccia
Ariel D. Procaccia

13 May 2017
Verified
Book Chapter
Closed access
PDF file
AAABDULLAH ALOMAR
ABDULLAH ALOMAR
NANajat Alrashed
Najat Alrashed
IAIsra Alturaiki
Isra Alturaiki
HAHotham Altwaijry
Hotham Altwaijry

27 November 2023 in arXiv
Verified
Preprint
Open access
PDF file
AAABDULLAH ALOMAR
ABDULLAH ALOMAR
MDMunther Dahleh
Munther Dahleh
SMSean Mann
Sean Mann
DSDevavrat Shah
Devavrat Shah
The well-established practice of time series analysis involves estimating deterministic, non-stationary trend and seasonality components followed by learning the residual stochastic, stationary components. Recently, it has been shown that one can learn the deterministic non-stationary components accurately using multivariate Singular Spectrum Analysis (mSSA) in the absence of a correlated stationary component; meanwhile, in the absence of deterministic non-stationary components, the Autoregressive (AR) stationary component can also be learnt readily, e.g. via Ordinary Least Squares (OLS). However, a theoretical underpinning of multi-stage learning algorithms involving both deterministic and stationary components has been absent in the literature despite its pervasiveness. We resolve this open question by establishing desirable theoretical guarantees for a natural two-stage algorithm, where mSSA is first applied to estimate the non-stationary components despite the presence of a correlated stationary AR component, which is subsequently learned from the residual time series. We provide a finite-sample forecasting consistency bound for the proposed algorithm, SAMoSSA, which is data-driven and thus requires minimal parameter tuning. To establish theoretical guarantees, we overcome three hurdles: (i) we characterize the spectra of Page matrices of stable AR processes, thus extending the analysis of mSSA; (ii) we extend the analysis of AR process identification in the presence of arbitrary bounded perturbations; (iii) we characterize the out-of-sample or forecasting error, as opposed to solely considering model identification. Through representative empirical studies, we validate the superior performance of SAMoSSA compared to existing baselines. Notably, SAMoSSA's ability to account for AR noise structure yields improvements ranging from 5% to 37% across various benchmark datasets.

10 November 2021 in arXiv
Verified
Preprint
Open access
PDF file
AAAnish Agarwal
Anish Agarwal
AAABDULLAH ALOMAR
ABDULLAH ALOMAR
VAVarkey Alumootil
Varkey Alumootil
DSDevavrat Shah
Devavrat Shah
DSDennis Shen
Dennis Shen
CYCindy Yang
Cindy Yang
We consider offline reinforcement learning (RL) with heterogeneous agents under severe data scarcity, i.e., we only observe a single historical trajectory for every agent under an unknown, potentially sub-optimal policy. We find that the performance of state-of-the-art offline and model-based RL methods degrade significantly given such limited data availability, even for commonly perceived "solved" benchmark settings such as "MountainCar" and "CartPole". To address this challenge, we propose PerSim, a model-based offline RL approach which first learns a personalized simulator for each agent by collectively using the historical trajectories across all agents, prior to learning a policy. We do so by positing that the transition dynamics across agents can be represented as a latent function of latent factors associated with agents, states, and actions; subsequently, we theoretically establish that this function is well-approximated by a "low-rank" decomposition of separable agent, state, and action latent functions. This representation suggests a simple, regularized neural network architecture to effectively learn the transition dynamics per agent, even with scarce, offline data. We perform extensive experiments across several benchmark environments and RL methods. The consistent improvement of our approach, measured in terms of both state dynamics prediction and eventual reward, confirms the efficacy of our framework in leveraging limited historical data to simultaneously learn personalized policies across agents.

23 December 2022 in arXiv
Verified
Preprint
Open access
PDF file
OAOmar Alolayan
Omar Alolayan
AAABDULLAH ALOMAR
ABDULLAH ALOMAR
JWJohn R. Williams
John R. Williams
Reformulating the history matching problem from a least-square mathematical optimization problem into a Markov Decision Process introduces a method in which reinforcement learning can be utilized to solve the problem. This method provides a mechanism where an artificial deep neural network agent can interact with the reservoir simulator and find multiple different solutions to the problem. Such formulation allows for solving the problem in parallel by launching multiple concurrent environments enabling the agent to learn simultaneously from all the environments at once, achieving significant speed up.