Results 41 to 50 of about 2,824,860 (307)
Efficient Asynchronous Semi-Stochastic Block Coordinate Descent Methods for Large-Scale SVD
IEEE Access, 2021 Eigenvector computation such as Singular Value Decomposition (SVD) is one of the most fundamental problems in machine learning, optimization and numerical linear algebra.
Fanhua Shang +4 more
doaj +1 more source
COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS [PDF]
The Journal of Symbolic Logic, 2016 AbstractA coarse description of a set A ⊆ ω is a set D ⊆ ω such that the symmetric difference of A and D has asymptotic density 0. We study the extent to which noncomputable information can be effectively recovered from all coarse descriptions of a given set A, especially when A is effectively random in some sense.
Denis R. Hirschfeldt +3 more
openaire +2 more sources
Algorithmic Randomness and Fourier Analysis [PDF]
Theory of Computing Systems, 2018 Suppose $1 < p < \infty$. Carleson's Theorem states that the Fourier series of any function in $L^p[-π, π]$ converges almost everywhere. We show that the Schnorr random points are precisely those that satisfy this theorem for every $f \in L^p[-π, π]$ given natural computability conditions on $f$ and $p$.
Johanna N. Y. Franklin +2 more
openaire +3 more sources
Which Local Search Operator Works Best for the Open-Loop TSP?
Applied Sciences, 2019 The traveling salesman problem (TSP) has been widely studied for the classical closed-loop variant. However, very little attention has been paid to the open-loop variant.
Lahari Sengupta +2 more
doaj +1 more source
International Journal of Applied Mathematics and Computer Science, 2012 It was conjectured by Fan and Raspaud (1994) that every bridgeless cubic graph contains three perfect matchings such that every edge belongs to at most two of them.
Formanowicz Piotr, Tanaś Krzysztof
doaj +1 more source
Randomized Average Kaczmarz Algorithm for Tensor Linear Systems
Mathematics, 2022 For solving tensor linear systems under the tensor–tensor t-product, we propose the randomized average Kaczmarz (TRAK) algorithm, the randomized average Kaczmarz algorithm with random sampling (TRAKS), and their Fourier version, which can be effectively ...
Wendi Bao +4 more
doaj +1 more source
Regularization Total Least Squares and Randomized Algorithms
MathematicsIn order to achieve an effective approximation solution for solving discrete ill-conditioned problems, Golub, Hansen, and O’Leary used Tikhonov regularization and the total least squares (TRTLS) method, where the bidiagonal technique is considered to ...
Zhanshan Yang, Xilan Liu, Tiexiang Li
doaj +1 more source
Selection Via the Bogo-Method - More on the Analysis of Perversely Awful Randomized Algorithms [PDF]
, 2018 We continue our research on perversely awful randomized algorithms, which started nearly a decade ago. Based on the bogo-method we design a bogo-selection algorithm and variants thereof and analyse them with elementary methods.
Maurer, Jan-Tobias, Holzer, Markus
core +1 more source
Improved approximation algorithms for optimization problems in graphs with superlogarithmic treewidth [PDF]
, 2003 In this paper we present two novel generic schemes for approximation algorithms for optimization to partial k-trees. Our first scheme yields deterministic polynomialtime algorithms achieving typically an approximation factor of k/ log n, where k
Chlebikova, Janka +14 more
core +1 more source
PAC–Bayes Guarantees for Data-Adaptive Pairwise Learning
EntropyWe study the generalization properties of stochastic optimization methods under adaptive data sampling schemes, focusing on the setting of pairwise learning, which is central to tasks like ranking, metric learning, and AUC maximization.
Sijia Zhou, Yunwen Lei, Ata Kabán
doaj +1 more source