相关论文: Smoothed Analysis of Interior-Point Algorithms: Co…
Maintaining numerical stability in machine learning models is crucial for their reliability and performance. One approach to maintain stability of a network layer is to integrate the condition number of the weight matrix as a regularizing…
The computational complexity of the solutions $h$ to the ordinary differential equation $h(0)=0$, $h'(t) = g(t, h(t))$ under various assumptions on the function $g$ has been investigated. Kawamura showed in 2010 that the solution $h$ can be…
For a surface $S$ with $n$ marked points and fixed genus $g\geq2$, we prove that the logarithm of the minimal dilatation of a pseudo-Anosov homeomorphism of $S$ is on the order of $(\log n)/n$. This is in contrast with the cases of genus…
We present an $O(n\sqrt{\log n})$ time and linear space algorithm for sorting real numbers. This breaks the long time illusion that real numbers have to be sorted by comparison sorting and take $\Omega (n\log n)$ time to be sorted.
We present three algorithms to compute the complexity $\Vert n\Vert$ of all natural numbers $ n\le N$. The first of them is a brute force algorithm, computing all these complexities in time $O(N^2)$ and space $O(N\log^2 N)$. The main…
We describe an algorithm based on a logarithmic barrier function, Newton's method, and linear conjugate gradients that obtains an approximate minimizer of a smooth function over the nonnegative orthant. We develop a bound on the complexity…
Let $\|n\|$ stand for the integer complexity of the number $n$, i.e. for the least number of $1$'s needed to write $n$ using arbitrary many additions, multiplications, and parentheses. The two-sided inequality $3\log_3 n\leq\|n\|\leq…
This note considers the computation of the logarithm of symmetric positive definite matrices using the Gauss--Legendre (GL) quadrature. The GL quadrature becomes slow when the condition number of the given matrix is large. In this note, we…
We discuss the new integrable boundary conditions for the O(N) nonlinear $\sigma$ model and related solutions of the boundary Yang-Baxter equation, which were presented in our previous paper hep-th/0108039.
We give a lower bound on the iteration complexity of a natural class of Lagrangean-relaxation algorithms for approximately solving packing/covering linear programs. We show that, given an input with $m$ random 0/1-constraints on $n$…
We generalize Cartan's logarithmic derivative of a smooth map from a manifold into a Lie group $G$ to smooth maps into a homogeneous space $M=G/H$, and determine the global monodromy obstruction to reconstructing such maps from…
A version of the Law of the Iterated Logarithm for smooth functions in the upper-half space is proved. As a consequence, we show that certain size conditions on the gradient and the gradient of the laplacian of a smooth function, lead to…
We consider the two-dimensional sorted range reporting problem. Our data structure requires O(n lglg n) words of space and O(lglg n + k lglg n) query time, where k is the number of points in the query range. This data structure improves a…
We analyze an algorithm for computing a skew-Hermitian logarithm of a unitary matrix. This algorithm is very easy to implement using standard software and it works well even for unitary matrices with no spectral conditions assumed. Certain…
We present a new algorithm to compute the integral closure of a reduced Noetherian ring in its total ring of fractions. A modification, applicable in positive characteristic, where actually all computations are over the original ring, is…
A regularization procedure developed in [1] for the integral curvature invariants on manifolds with conical singularities is generalized to the case of squashed cones. In general, the squashed conical singularities do not have rotational…
An adaptive regularization algorithm using inexact function and derivatives evaluations is proposed for the solution of composite nonsmooth nonconvex optimization. It is shown that this algorithm needs at most…
Traditional algorithms for stochastic optimization require projecting the solution at each iteration into a given domain to ensure its feasibility. When facing complex domains, such as positive semi-definite cones, the projection operation…
We study generalized log-sine integrals at special values. At $\pi$ and multiples thereof explicit evaluations are obtained in terms of Nielsen polylogarithms at $\pm1$. For general arguments we present algorithmic evaluations involving…
We study the perturbative structure of threshold enhanced logarithms in the coefficient functions of deep inelastic scattering (DIS) and semi-inclusive $e^+e^-$ annihilation (SIA) processes and setup a framework to sum them up to all orders…