Ratna Khatri

Ratna Khatri

Auto-generated profile, based on publicly available information

Ratna Khatri

George Mason Univ, Dept Math Sci, Fairfax, VA 22030 USA

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
29 April 2020 in Inverse Problems
Verified
Journal Article
Closed access
PDF file
HAHarbir Antil
Harbir Antil
ZDZichao (Wendy) Di
Zichao (Wendy) Di
RKRatna Khatri
Ratna Khatri
In this work we consider a generalized bilevel optimization framework for solving inverse problems. We introduce fractional Laplacian as a regularizer to improve the reconstruction quality, and compare it with the total variation regularization. We emphasize that the key advantage of using fractional Laplacian as a regularizer is that it leads to a linear operator, as opposed to the total variation regularization which results in a nonlinear degenerate operator. Inspired by residual neural networks, to learn the optimal strength of regularization and the exponent of fractional Laplacian, we develop a dedicated bilevel optimization neural network with a variable depth for a general regularized inverse problem. We illustrate how to incorporate various regularizer choices into our proposed network. As an example, we consider tomographic reconstruction as a model problem and show an improvement in reconstruction quality, especially for limited data, via fractional Laplacian regularization. We successfully learn the regularization strength and the fractional exponent via our proposed bilevel optimization neural network. We observe that the fractional Laplacian regularization outperforms total variation regularization. This is specially encouraging, and important, in the case of limited and noisy data.

30 July 2019 in Inverse Problems
Verified
Journal Article
Closed access
PDF file
HAHarbir Antil
Harbir Antil
RKRatna Khatri
Ratna Khatri
Mahamadi WarmaMahamadi Warma
Mahamadi Warma
Very recently Warma (2019 SIAM J. Control Optim . to appear) has shown that for nonlocal PDEs associated with the fractional Laplacian, the classical notion of controllability from the boundary does not make sense and therefore it must be replaced by a control that is localized outside the open set where the PDE is solved. Having learned from the above mentioned result, in this paper we introduce a new class of source identification and optimal control problems where the source/control is located outside the observation domain where the PDE is satisfied. The classical diffusion models lack this flexibility as they assume that the source/control is located either inside or on the boundary. This is essentially due to the locality property of the underlying operators. We use the nonlocality of the fractional operator to create a framework that now allows placing a source/control outside the observation domain. We consider the Dirichlet, Robin and Neumann source identification or optimal control problems. These problems require dealing with the nonlocal normal derivative (that we shall call interaction operator). We create a functional analytic framework and show well-posedness and derive the first order optimality conditions for these problems. We introduce a new approach to approximate, with convergence rate, the Dirichlet problem with nonzero exterior condition. The numerical examples confirm our theoretical findings and illustrate the practicality of our approach.

1 December 2020 in Machine Learning: Science and Technology
Verified
Journal Article
Open access
HAHarbir Antil
Harbir Antil
RKRatna Khatri
Ratna Khatri
RLRainald Löhner
Rainald Löhner
DVDeepanshu Verma
Deepanshu Verma
This paper introduces a novel algorithmic framework for a deep neural network (DNN), which in a mathematically rigorous manner, allows us to incorporate history (or memory) into the network—it ensures all layers are connected to one another. This DNN, called Fractional-DNN, can be viewed as a time-discretization of a fractional in time non-linear ordinary differential equation (ODE). The learning problem then is a minimization problem subject to that fractional ODE as constraints. We emphasize that an analogy between the existing DNN and ODEs, with standard time derivative, is well-known by now. The focus of our work is the Fractional-DNN. Using the Lagrangian approach, we provide a derivation of the backward propagation and the design equations. We test our network on several datasets for classification problems. Fractional-DNN offers various advantages over the existing DNN. The key benefits are a significant improvement to the vanishing gradient issue due to the memory effect, and better handling of nonsmooth data due to the network’s ability to approximate non-smooth functions.

15 February 2022
Verified
Book Chapter
Closed access
HAHarbir Antil
Harbir Antil
TBThomas Brown
Thomas Brown
RKRatna Khatri
Ratna Khatri
AOAkwum Onwunta
Akwum Onwunta
DVDeepanshu Verma
Deepanshu Verma
MWMahamadi Warma
Mahamadi Warma

1 October 2017 in Physics Letters A
Verified
Journal Article
Closed access
MHMatt Holzer
Matt Holzer
RKRatna Khatri
Ratna Khatri

10 September 2025 in arXiv
Verified
Preprint
Open access
PDF file
RKRatna Khatri
Ratna Khatri
AKAnthony Kolshorn
Anthony Kolshorn
COColin Olson
Colin Olson
HAHarbir Antil
Harbir Antil
This paper presents a novel, mathematically rigorous framework for autoencoder-type deep neural networks that combines optimal control theory and low-rank tensor methods to yield memory-efficient training and automated architecture discovery. The learning task is formulated as an optimization problem constrained by differential equations representing the encoder and decoder components of the network and the corresponding optimality conditions are derived via a Lagrangian approach. Efficient memory compression is enabled by approximating differential equation solutions on low-rank tensor manifolds using an adaptive explicit integration scheme. These concepts are combined to form OCTANE (Optimal Control for Tensor-based Autoencoder Network Emergence) -- a unified training framework that yields compact autoencoder architectures, reduces memory usage, and enables effective learning, even with limited training data. The framework's utility is illustrated with application to image denoising and deblurring tasks and recommendations regarding governing hyperparameters are provided.