Zobrazeno 1 - 10
of 89 660
pro vyhledávání: '"Complexity analysis"'
There exist several approaches to infer runtime or resource bounds for integer programs automatically. In this paper, we study the subclass of periodic rational solvable loops (prs-loops), where questions regarding the runtime and the size of variabl
Externí odkaz:
http://arxiv.org/abs/2412.01832
Publikováno v:
Spatial Statistics, Volume 42, 100462 , 2021, ISSN 2211-6753
Information Theory provides a fundamental basis for analysis, and for a variety of subsequent methodological approaches, in relation to uncertainty quantification. The transversal character of concepts and derived results justifies its omnipresence i
Externí odkaz:
http://arxiv.org/abs/2411.16871
Autor:
Fersztand, David, Sun, Xu Andy
The proximal bundle algorithm (PBA) is a fundamental and computationally effective algorithm for solving optimization problems with nonsmooth components. We investigate its convergence rate, focusing on composite settings where one function is smooth
Externí odkaz:
http://arxiv.org/abs/2411.15926
Autor:
Mehta, Aaryen, Aryan, Gagan
The most common method to auto-grade a student's submission in a CS1 or a CS2 course is to run it against a pre-defined test suite and compare the results against reference results. However, this technique cannot be used if the correctness of the sol
Externí odkaz:
http://arxiv.org/abs/2410.15419
Autor:
Drineas, Petros, Ipsen, Ilse C. F.
Stochastic Rounding is a probabilistic rounding mode that is surprisingly effective in large-scale computations and low-precision arithmetic. Its random nature promotes error cancellation rather than error accumulation, resulting in slower growth of
Externí odkaz:
http://arxiv.org/abs/2410.10517
Autor:
Solla, Daniel García
The main purpose of percolation theory is to model phase transitions in a variety of random systems, which is highly valuable in fields related to materials physics, biology, or otherwise unrelated areas like oil extraction or even quantum computing.
Externí odkaz:
http://arxiv.org/abs/2410.11874
Autor:
Sobczyk, Aleksandros
In this work we revisit the arithmetic and bit complexity of Hermitian eigenproblems. We first provide an analysis for the divide-and-conquer tridiagonal eigensolver of Gu and Eisenstat [GE95] in the Real RAM model, when accelerated with the Fast Mul
Externí odkaz:
http://arxiv.org/abs/2410.21550
Autor:
Hocking, Toby Dylan
Binary segmentation is the classic greedy algorithm which recursively splits a sequential data set by optimizing some loss or likelihood function. Binary segmentation is widely used for changepoint detection in data sets measured over space or time,
Externí odkaz:
http://arxiv.org/abs/2410.08654
Autor:
Zurek, Matthew, Chen, Yudong
We study the sample complexity of the plug-in approach for learning $\varepsilon$-optimal policies in average-reward Markov decision processes (MDPs) with a generative model. The plug-in approach constructs a model estimate then computes an average-r
Externí odkaz:
http://arxiv.org/abs/2410.07616
In this work, we improved the analysis of the running time of SparseGPT [Frantar, Alistarh ICML 2023] from $O(d^{3})$ to $O(d^{\omega} + d^{2+a+o(1)} + d^{1+\omega(1,1,a)-a})$ for any $a \in [0, 1]$, where $\omega$ is the exponent of matrix multiplic
Externí odkaz:
http://arxiv.org/abs/2408.12151