Related papers: Simplified equations for the semi-localized transi…
Stochastic partial differential equations (SPDEs) have become a key modelling tool in applications. Yet, there are many classes of SPDEs, where the existence and regularity theory for solutions is not completely developed. Here we…
This paper presents a novel multi-scale method for elliptic partial differential equations with arbitrarily rough coefficients. In the spirit of numerical homogenization, the method constructs problem-adapted ansatz spaces with uniform…
We propose an approach to Multitask Learning (MTL) to make deep learning models faster and lighter for applications in which multiple tasks need to be solved simultaneously, which is particularly useful in embedded, real-time systems. We…
This paper explores transfer learning in heterogeneous multi-source environments with distributional divergence between target and auxiliary domains. To address challenges in statistical bias and computational efficiency, we propose a…
This paper provides a Central Limit Theorem (CLT) for a process $\{\theta_n, n\geq 0\}$ satisfying a stochastic approximation (SA) equation of the form $\theta_{n+1} = \theta_n + \gamma_{n+1} H(\theta_n,X_{n+1})$; a CLT for the associated…
Low-bit post-training quantization (PTQ) is a practical route to deploy reasoning-capable LLMs under tight memory and latency budgets, yet it can markedly impair mathematical reasoning (drops up to 69.81% in our harder settings). We address…
Quadratically constrained quadratic programs (QCQPs) are ubiquitous in optimization: Such problems arise in applications from operations research, power systems, signal processing, chemical engineering, and portfolio theory, among others.…
Recently, large language models (LLMs) have shown surprising performance in task-specific workloads as well as general tasks with the given prompts. However, to achieve unprecedented performance, recent LLMs use billions to trillions of…
An approximate solution to the time-dependent density functional theory (TDDFT) response equations for finite systems is developed, yielding corrections to the single-pole approximation. These explain why allowed Kohn-Sham transition…
In this work we present a quadratic programming approximation of the Semi-Supervised Support Vector Machine (S3VM) problem, namely approximate QP-S3VM, that can be efficiently solved using off the shelf optimization packages. We prove that…
In the paper an efficient semi-analytical approach based on the method of steps and differential transformation is proposed for numerical approximation of solutions of retarded logistic models of delayed and neutral type, including models…
Rough volatility models have recently been empirically shown to provide a good fit to historical volatility time series and implied volatility smiles of SPX options. They are continuous-time stochastic volatility models, whose volatility…
Stochastic properties of loading and loss mechanism in a few atom trap are analyzed. An approximate formula is derived for the atom-number correlation function for the trapped atoms in the limit of reasonably small two-atom loss rate.…
A method for approximate solution of spectral problems for Sturm-Liouville equations based on the construction of the Delsarte transmutation operators is presented. In fact the problem of numerical approximation of solutions and eigenvalues…
The field of simulation optimization (SO) encompasses various methods developed to optimize complex, expensive-to-sample stochastic systems. Established methods include, but are not limited to, ranking-and-selection for finite alternatives…
In this work, we propose an architecture of LLM Modules that enables the transfer of knowledge from a large pre-trained model to a smaller model using an Enhanced Cross-Attention mechanism. In the proposed scheme, the Qwen2-1.5B model is…
(Partial) differential equations (PDEs) are fundamental tools for describing natural phenomena, making their solution crucial in science and engineering. While traditional methods, such as the finite element method, provide reliable…
We give a fast algorithm for sampling uniform solutions of general constraint satisfaction problems (CSPs) in a local lemma regime. Suppose that the CSP has $n$ variables with domain size at most q, each constraint contains at most k…
In this paper, we study a class of approximation problems, appearing in data approximation and signal processing. The approximations are constructed as combinations of polynomial splines (piecewise polynomials), whose parameters are subject…
In this paper, we propose a general approach for approximate simulation and analysis of delay differential equations (DDEs) with distributed time delays based on methods for ordinary differential equations (ODEs). The key innovation is that…