English
Related papers

Related papers: Low-rank approximation of Rippa method for RBF int…

200 papers

Approximation of scattered data is often a task in many engineering problems. The Radial Basis Function (RBF) approximation is appropriate for large scattered (unordered) datasets in d-dimensional space. This approach is useful for a higher…

Numerical Analysis · Computer Science 2018-06-21 Zuzana Majdisova , Vaclav Skala

It is now well known that Markov random fields (MRFs) are particularly effective for modeling image priors in low-level vision. Recent years have seen the emergence of two main approaches for learning the parameters in MRFs: (1)…

Computer Vision and Pattern Recognition · Computer Science 2014-01-17 Yunjin Chen , Thomas Pock , René Ranftl , Horst Bischof

Approximation methods are widely used in many fields and many techniques have been published already. This comparative study presents a comparison of LOWESS (Locally weighted scatterplot smoothing) and RBF (Radial Basis Functions)…

Graphics · Computer Science 2018-01-03 Michal Smolik , Vaclav Skala , Ondrej Nedved

We present three new semi-Lagrangian methods based on radial basis function (RBF) interpolation for numerically simulating transport on a sphere. The methods are mesh-free and are formulated entirely in Cartesian coordinates, thus avoiding…

Numerical Analysis · Mathematics 2018-05-09 Varun Shankar , Grady Wright

Robust low-rank approximation under row-wise adversarial corruption can be achieved with a single pass, randomized procedure that detects and removes outlier rows by thresholding their projected norms. We propose a scalable, non-iterative…

Machine Learning · Computer Science 2025-04-04 Aidan Tiruvan

We present a new computational method by extending the Immersed Boundary (IB) method with a spectrally-accurate geometric model based on Radial Basis Function (RBF) interpolation of the Lagrangian structures. Our specific motivation is the…

Numerical Analysis · Mathematics 2015-05-27 Varun Shankar , Grady B. Wright , Robert M. Kirby , Aaron L. Fogelson

Magnetic resonance fingerprinting (MRF) enables fast and multiparametric MR imaging. Despite fast acquisition, the state-of-the-art reconstruction of MRF based on dictionary matching is slow and lacks scalability. To overcome these…

Image and Video Processing · Electrical Eng. & Systems 2021-03-11 Fabian Balsiger , Alain Jungo , Olivier Scheidegger , Benjamin Marty , Mauricio Reyes

We present and analyze an efficient implementation of an iteratively reweighted least squares algorithm for recovering a matrix from a small number of linear measurements. The algorithm is designed for the simultaneous promotion of both a…

Numerical Analysis · Mathematics 2011-07-19 Massimo Fornasier , Holger Rauhut , Rachel Ward

In this paper, a new reduction based interpolation algorithm for black-box multivariate polynomials over finite fields is given. The method is based on two main ingredients. A new Monte Carlo method is given to reduce black-box multivariate…

Symbolic Computation · Computer Science 2018-07-18 Qiao-Long Huang , Xiao-Shan Gao

A radial basis function (RBF) method based on matrix-valued kernels is presented and analyzed for computing two types of vector decompositions on bounded domains: one where the normal component of the divergence-free part of the field is…

Numerical Analysis · Mathematics 2015-03-06 Edward J. Fuselier , Grady B. Wright

Accurate interpolation and approximation techniques for functions with discontinuities are key tools in many applications as, for instance, medical imaging. In this paper, we study an RBF type method for scattered data interpolation that…

Numerical Analysis · Mathematics 2019-03-08 Stefano De Marchi , Wolfgang Erb , Francesco Marchetti , Emma Perracchione , Milvia Rossini

Optical diffraction tomography relies on solving an inverse scattering problem governed by the wave equation. Classical reconstruction algorithms are based on linear approximations of the forward model (Born or Rytov), which limits their…

Computational Engineering, Finance, and Science · Computer Science 2017-09-01 Emmanuel Soubies , Thanh-An Pham , Michael Unser

In this work, we propose a new randomized algorithm for computing a low-rank approximation to a given matrix. Taking an approach different from existing literature, our method first involves a specific biased sampling, with an element being…

Data Structures and Algorithms · Computer Science 2014-10-16 Srinadh Bhojanapalli , Prateek Jain , Sujay Sanghavi

This paper introduces an interpolation-based method, called the reconstruction approach, for nonparametric regression. Based on the fact that interpolation usually has negligible errors compared to statistical estimation, the reconstruction…

Machine Learning · Statistics 2019-11-28 Shifeng Xiong

During the last stage of RLHF, a large language model is aligned to human intents via PPO training, a process that generally requires large-scale computational resources. In this technical report, we empirically investigate an efficient…

Computation and Language · Computer Science 2023-09-19 Simeng Sun , Dhawal Gupta , Mohit Iyyer

The subdiffusion equations with a Caputo fractional derivative of order $\alpha \in (0,1)$ arise in a wide variety of practical problems, which is describing the transport processes, in the force-free limit, slower than Brownian diffusion.…

Numerical Analysis · Mathematics 2023-06-27 Jiankang Shi , Minghua Chen , Yubin Yan , Jianxiong Cao

Fast Field-Cycling Nuclear Magnetic Resonance relaxometry is a non-destructive technique to investigate molecular dynamics and structure of systems having a wide range of applications such as environment, biology, and food. Besides a…

Magnetic resonance fingerprinting (MRF) is a technique for quantitative estimation of spin-relaxation parameters from magnetic-resonance data. Most current MRF approaches assume that only one tissue is present in each voxel, which neglects…

Estimating camera geometry typically involves solving minimal problems formulated as systems of multivariate polynomial equations, which often pose computational challenges when using existing Gr\"obner-basis or resultant-based methods due…

Computer Vision and Pattern Recognition · Computer Science 2026-05-08 Haidong Wu , Snehal Bhayani , Janne Heikkilä

Fine-tuning Large Language Models (LLMs) and storing them for each downstream task or domain is impractical because of the massive model size (e.g., 350GB in GPT-3). Current literature, such as LoRA, showcases the potential of low-rank…

Computation and Language · Computer Science 2024-05-01 Soroush Abbasi Koohpayegani , KL Navaneet , Parsa Nooralinejad , Soheil Kolouri , Hamed Pirsiavash