Related papers: Deriving Algorithms for Triangular Tridiagonalizat…
Image matting is a longstanding problem in computational photography. Although, it has been studied for more than two decades, yet there is a challenge of developing an automatic matting algorithm which does not require any human efforts.…
Inference-time compute has re-emerged as a practical way to improve LLM reasoning. Most test-time scaling (TTS) algorithms rely on autoregressive decoding, which is ill-suited to discrete diffusion language models (dLLMs) due to their…
In this paper, we present splitting methods that are based on iterative schemes and applied to plasma simulations. The motivation arose of solving the Coulomb collisions, which are modeled by nonlinear stochastic differential equations. We…
Deflation techniques are typically used to shift isolated clusters of small eigenvalues in order to obtain a tighter distribution and a smaller condition number. Such changes induce a positive effect in the convergence behavior of Krylov…
We present a method for constructing numerical schemes with up to 3rd strong convergence order for solution of a class of stochastic differential equations, including equations of the Langevin type. The construction proceeds in two stages.…
Tensor diagonalization means transforming a given tensor to an exactly or nearly diagonal form through multiplying the tensor by non-orthogonal invertible matrices along selected dimensions of the tensor. It is generalization of approximate…
We present a new numerical dissipation algorithm, which can be efficiently used in combination with centered finite-difference methods. We start from a formulation of centered finite-volume methods for Numerical Relativity, in which…
Simultaneous Localization and Mapping (SLAM) algorithms perform visual-inertial estimation via filtering or batch optimization methods. Empirical evidence suggests that filtering algorithms are computationally faster, while optimization…
We present a new probabilistic model to address semi-nonnegative matrix factorization (SNMF), called Skellam-SNMF. It is a hierarchical generative model consisting of prior components, Skellam-distributed hidden variables and observed data.…
Sparse Blind Source Separation (sparse BSS) is a key method to analyze multichannel data in fields ranging from medical imaging to astrophysics. However, since it relies on seeking the solution of a non-convex penalized matrix factorization…
Lie symmetry analysis is applied to study the nonlinear rotating shallow water equations. The 9-dimensional Lie algebra of point symmetries admitted by the model is found. It is shown that the rotating shallow water equations are related…
Sparse matrix factorization is a popular tool to obtain interpretable data decompositions, which are also effective to perform data completion or denoising. Its applicability to large datasets has been addressed with online and randomized…
In this note, we introduce a new finite difference approximation called the Black-Box Logarithmic Expansion Numerical Derivative (BLEND) algorithm, which is based on a formal logarithmic expansion of the differentiation operator. BLEND…
We compute the the Balmer spectra of compact objects of tensor triangulated categories whose objects are filtered or graded objects of (or sheaves valued in) another tensor triangulated category. Notable examples include the filtered…
The current state of the art of Simultaneous Localisation and Mapping, or SLAM, on low power embedded systems is about sparse localisation and mapping with low resolution results in the name of efficiency. Meanwhile, research in this field…
Simultaneous Localization and Mapping (SLAM) plays an important role in robot autonomy. Reliability and efficiency are the two most valued features for applying SLAM in robot applications. In this paper, we consider achieving a reliable…
In this paper, we describe a low-rank matrix completion method based on matrix decomposition. An incomplete matrix is decomposed into submatrices which are filled with a proposed trimming step and then are recombined to form a low-rank…
Autoregressive decoding of large language models (LLMs) is memory bandwidth bounded, resulting in high latency and significant wastes of the parallel processing power of modern accelerators. Existing methods for accelerating LLM decoding…
State-of-the-art algorithms in lattice gauge theory typically rely heavily on detailed balance, which is an instrumental tool to prove the correct convergence of the Markov Chain Monte Carlo Algorithm. In this work, we investigate an…
Tropical semiring has proven successful in several research areas, including optimal control, bioinformatics, discrete event systems, or solving a decision problem. In previous studies, a matrix two-factorization algorithm based on the…