Related papers: Sharp error analysis for averaging Crank-Nicolson …
The paper considers an Euler discretization based numerical scheme for approximating functionals of invariant distribution of an ergodic diffusion. Convergence of the numerical scheme is shown for suitably chosen discretization step, and a…
Denoising diffusion models have been a mainstream approach for image generation, however, training these models often suffers from slow convergence. In this paper, we discovered that the slow convergence is partly due to conflicting…
An adaptive BDF2 implicit time-stepping method is analyzed for the phase field crystal model. The suggested method is proved to preserve a modified energy dissipation law at the discrete levels if the time-step ratios…
Recent advances in nonlinear dynamical systems theory provide a new insight into numerical properties of discrete algorithms developed to solve nonlinear initial value problems. Basic features like accuracy and stability are well pointed…
In this paper, we have evaluated various methods of time-frequency-selective fading channels estimation in OFDM system and some of them improved under time varying conditions. So, these different techniques will be studied through different…
We present a general framework for the rigorous numerical analysis of time-fractional nonlinear parabolic partial differential equations, with a fractional derivative of order $\alpha\in(0,1)$ in time. The framework relies on three…
Practical diffusion sampling is a numerical approximation problem: under a fixed inference budget, one must simulate a reverse-time ODE or SDE using only a limited number of denoising steps, so discretization error is often the dominant…
Sharpness is an almost generic assumption in continuous optimization that bounds the distance from minima by objective function suboptimality. It facilitates the acceleration of first-order methods through restarts. However, sharpness…
The iterated Crank-Nicolson (ICN) method is a successful numerical algorithm in numerical relativity for solving partial differential equations. The $\theta$-ICN method is the extension of the original ICN method where $\theta$ is the…
In this article, we extend a Milstein finite difference scheme introduced in [Giles & Reisinger(2011)] for a certain linear stochastic partial differential equation (SPDE), to semi- and fully implicit timestepping as introduced by…
In order to quantitatively study the accuracy of the unconditionally stable coarsening algorithms, we calculate the Fourier space multi step error on the order parameter field by explicitly distinguishing the analytic time $\tau$ and the…
The paper is concerned with the error analysis of a numerical scheme for the approximation of parametric mean curvature flow. The scheme we study is based on a reparametrization using the DeTurck trick and was proposed by Elliott and Fritz…
Stochastic non-smooth convex optimization constitutes a class of problems in machine learning and operations research. This paper considers minimization of a non-smooth function based on stochastic subgradients. When the function has a…
Clustering is an important task with applications in many fields of computer science. We study the fully dynamic setting in which we want to maintain good clusters efficiently when input points (from a metric space) can be inserted and…
We study the problem of list-decodable mean estimation, where an adversary can corrupt a majority of the dataset. Specifically, we are given a set $T$ of $n$ points in $\mathbb{R}^d$ and a parameter $0< \alpha <\frac 1 2$ such that an…
Sparse grids are tailored to the approximation of smooth high-dimensional functions. On a $d$-dimensional tensor product space, the number of grid points is $N = \mathcal O(h^{-1} |\log h|^{d-1})$, where $h$ is a mesh parameter. The…
In this work, we study the trade-off between the running time of approximation algorithms and their approximation guarantees. By leveraging a structure of the `hard' instances of the Arora-Rao-Vazirani lemma [JACM'09], we show that the…
The challenges of graph stream algorithms are twofold. First, each edge needs to be processed only once, and second, it needs to work on highly constrained memory. Diffusion degree is a measure of node centrality that can be calculated (for…
We resolve a long-standing open question, about the existence of a constant-factor approximation algorithm for the average-case \textsc{Decision Tree} problem with uniform probability distribution over the hypotheses. We answer the question…
We revisit the classical problem of estimating an unknown distribution from its samples by fitting a mixture model that minimizes cross-entropy loss. Framing the task as a stochastic convex optimization problem over the space of $ M…