Zobrazeno 1 - 10
of 664
pro vyhledávání: '"WEBBER, P. J."'
The randomized Kaczmarz (RK) method is a well-known approach for solving linear least-squares problems with a large number of rows. RK accesses and processes just one row at a time, leading to exponentially fast convergence for consistent linear syst
Externí odkaz:
http://arxiv.org/abs/2411.19877
Randomly pivoted Cholesky (RPCholesky) is an algorithm for constructing a low-rank approximation of a positive-semidefinite matrix using a small number of columns. This paper develops an accelerated version of RPCholesky that employs block matrix com
Externí odkaz:
http://arxiv.org/abs/2410.03969
Privacy-preserving voice conversion aims to remove only the attributes of speech audio that convey identity information, keeping other speech characteristics intact. This paper presents a mechanism for privacy-preserving voice conversion that allows
Externí odkaz:
http://arxiv.org/abs/2409.14919
Markov state modeling has gained popularity in various scientific fields due to its ability to reduce complex time series data into transitions between a few states. Yet, current frameworks are limited by assuming a single Markov chain describes the
Externí odkaz:
http://arxiv.org/abs/2406.04653
In the study of stochastic systems, the committor function describes the probability that a system starting from an initial configuration $x$ will reach a set $B$ before a set $A$. This paper introduces an efficient and interpretable algorithm for ap
Externí odkaz:
http://arxiv.org/abs/2405.10410
Autor:
Abbot, Dorian S., Laurence-Chasen, J. D., Webber, Robert J., Hernandez, David M., Weare, Jonathan
Publikováno v:
Res. Notes AAS 8 3 (2024)
Rare event schemes require an approximation of the probability of the rare event as a function of system state. Finding an appropriate reaction coordinate is typically the most challenging aspect of applying a rare event scheme. Here we develop an ar
Externí odkaz:
http://arxiv.org/abs/2401.12180
Autor:
Weare, Jonathan, Webber, Robert J.
Recently, a class of algorithms combining classical fixed point iterations with repeated random sparsification of approximate solution vectors has been successfully applied to eigenproblems with matrices as large as $10^{108} \times 10^{108}$. So far
Externí odkaz:
http://arxiv.org/abs/2309.17270
Autor:
Tropp, Joel A., Webber, Robert J.
This survey explores modern approaches for computing low-rank approximations of high-dimensional matrices by means of the randomized SVD, randomized subspace iteration, and randomized block Krylov iteration. The paper compares the procedures via theo
Externí odkaz:
http://arxiv.org/abs/2306.12418
Mercury's orbit can destabilize, generally resulting in a collision with either Venus or the Sun. Chaotic evolution can cause g1 to decrease to the approximately constant value of g5 and create a resonance. Previous work has approximated the variatio
Externí odkaz:
http://arxiv.org/abs/2306.11870
This paper investigates two randomized preconditioning techniques for solving kernel ridge regression (KRR) problems with a medium to large number of data points ($10^4 \leq N \leq 10^7$), and it introduces two new methods with state-of-the-art perfo
Externí odkaz:
http://arxiv.org/abs/2304.12465