Related papers: Legendre-Gauss-Lobatto grids and associated nested…
In this work we develop arbitrary-order Discontinuous Skeletal Gradient Discretisations (DSGD) on general polytopal meshes. Discontinuous Skeletal refers to the fact that the globally coupled unknowns are broken polynomial on the mesh…
Stochastic gradient-based descent (SGD), have long been central to training large language models (LLMs). However, their effectiveness is increasingly being questioned, particularly in large-scale applications where empirical evidence…
Much is known about when a locally optimal solution depends in a single-valued Lipschitz continuous way on the problem's parameters, including tilt perturbations. Much less is known, however, about when that solution and a uniquely…
One of the most widely used methods for solving large-scale stochastic optimization problems is distributed asynchronous stochastic gradient descent (DASGD), a family of algorithms that result from parallelizing stochastic gradient descent…
In this work, we consider the construction of efficient surrogates for the stochastic version of the Landau-Lifshitz-Gilbert (LLG) equation using model order reduction techniques, in particular, the Reduced Basis (RB) method. The Stochastic…
3D Gaussian splatting (3DGS) is a transformative technique with profound implications on novel view synthesis and real-time rendering. Given its importance, there have been many attempts to improve its performance. However, with the…
We introduce a model which integrates the complex Ginzburg-Landau (CGL) equation in two dimensions (2D) with the linear-cubic-quintic combination of loss and gain terms, self-defocusing nonlinearity, and a periodic potential. In this…
Recent efforts to accelerate LLM pretraining have focused on computationally-efficient approximations that exploit second-order structure. This raises a key question for large-scale training: how much performance is forfeited by these…
Well-posedness in $L_\infty$ of the nonlocal Gray-Scott model is studied for integrable kernels, along with the stability of the semi-trivial spatially homogeneous steady state. In addition, it is shown that the solutions to the nonlocal…
In this paper we develop inference for high dimensional linear models, with serially correlated errors. We examine Lasso under the assumption of strong mixing in the covariates and error process, allowing for fatter tails in their…
The Gauss-Newton (GN) matrix plays an important role in machine learning, most evident in its use as a preconditioning matrix for a wide family of popular adaptive methods to speed up optimization. Besides, it can also provide key insights…
Causal structure discovery from observations can be improved by integrating background knowledge provided by an expert to reduce the hypothesis space. Recently, Large Language Models (LLMs) have begun to be considered as sources of prior…
The need to smoothly cover a computational domain of interest generically requires the adoption of several grids. To solve the problem of interest under this grid-structure one must ensure the suitable transfer of information among the…
Real-world events exhibit a high degree of interdependence and connections, and hence data points generated also inherit the linkages. However, the majority of AI/ML techniques leave out the linkages among data points. The recent surge of…
Preconditioning techniques are crucial for enhancing the efficiency of solving large-scale linear equation systems that arise from partial differential equation (PDE) discretization. These techniques, such as Incomplete Cholesky…
We present local discriminative Gaussian (LDG) dimensionality reduction, a supervised dimensionality reduction technique for classification. The LDG objective function is an approximation to the leave-one-out training error of a local…
Diagonal preconditioners are computationally feasible approximate to second-order optimizers, which have shown significant promise in accelerating training of deep learning models. Two predominant approaches are based on Adam and…
This paper presents a new stochastic preconditioning approach. For symmetric diagonally-dominant M-matrices, we prove that an incomplete LDL factorization can be obtained from random walks, and used as a preconditioner for an iterative…
In this paper, we present a structured solver based on the preconditioned conjugate gradient method (PCGM) for solving the linear quadratic (LQ) optimal control problem for $K \times N$ sub-systems connected in a two-dimensional (2D) grid…
A powerful method for solving non-linear first-order ordinary differential equations, which is based on geometrical understanding of the corresponding dynamics of the so called Lie systems, is developed. This method allows us not only to…