arXiv research

Paper shows examples of almost Kähler manifolds satisfying Hard Lefschetz but not Betti-Hodge equality.

Paper introduces a differentiable regularizer for condition number to improve neural network stability.

The condition number predicts efficient information encoding in neural units, aiding model fine-tuning.

Study Bochner formula on metric measure spaces for vanishing Betti numbers.

Quantum algorithms improve high-frequency trading efficiency.

Smooth maps bound Betti numbers of zero sets.

The paper explores positivity conditions for $χ_y$-genus and their implications on Chern numbers and symplectic manifolds.

We analyze the condition number of random feature matrices and prove their well-conditioned nature.

This work analyzes Adam's preconditioning effect on quadratic functions and quantifies its impact on condition number.

The ratio of two probability densities can be used for solving various machine learning tasks such as covariate shift adaptation (importance sampling), outlier detection (likelihood-ratio test), and feature selection (mutual information). Recently, several methods of directly estimating the density ratio have been deve…

Smoothed analysis of complexity bounds and condition numbers has been done, so far, on a case by case basis. In this paper we consider a reasonably large class of condition numbers for problems over the complex numbers and we obtain smoothed analysis estimates for elements in this class depending only on geometric inva…

New algorithm reduces conditional independence tests needed for causal discovery.

In solving a system of $n$ linear equations in $d$ variables $Ax=b$, the condition number of the $n,d$ matrix $A$ measures how much errors in the data $b$ affect the solution $x$. Estimates of this type are important in many inverse problems. An example is machine learning where the key task is to estimate an underlyin…

Characterizes solutions to Z-critical equations on surfaces using effective conditions.

This paper optimizes diagonal preconditioning to improve matrix condition numbers.

New gradient methods solve multiscale optimization problems efficiently.

We give the first algorithm for Matrix Completion whose running time and sample complexity is polynomial in the rank of the unknown target matrix, linear in the dimension of the matrix, and logarithmic in the condition number of the matrix. To the best of our knowledge, all previous algorithms either incurred a quadrat…

For any two continuous maps $f,g$ between two solvmanifolds of same dimension satisfying the Mostow condition, we give a technique of computation of the Lefschetz coincidence number of $f,g$. This result is an extension of the result of Ha, Lee and Penninckx for completely solvable case.

A market with defaultable bonds where the bond dynamics is in a Heath-Jarrow-Morton setting and the forward rates are driven by an infinite number of Levy factors is considered. The setting includes rating migrations driven by a Markov chain. All basic types of recovery are investigated. We formulate necessary and suff…

We consider the following signal recovery problem: given a measurement matrix $Φ\in \mathbb{R}^{n\times p}$ and a noisy observation vector $c\in \mathbb{R}^{n}$ constructed from $c = Φθ^* + ε$ where $ε\in \mathbb{R}^{n}$ is the noise vector whose entries follow i.i.d. centered sub-Gaussian distribution, how to recover …

Investigates portfolio optimization with and without gearing constraints.

We address the question of detecting minimal virtual diagrams with respect to the number of virtual crossings. This problem is closely connected to the problem of detecting the minimal number of additional intersection points for a generic immersion of a singular link in $R^{2}$. We tackle this problem by the so-called…

We consider the numerical stability of the parameter recovery problem in Linear Structural Equation Model ($\LSEM$) of causal inference. A long line of work starting from Wright (1920) has focused on understanding which sub-classes of $\LSEM$ allow for efficient parameter recovery. Despite decades of study, this questi…

Conventional multiclass conditional probability estimation methods, such as Fisher's discriminate analysis and logistic regression, often require restrictive distributional model assumption. In this paper, a model-free estimation method is proposed to estimate multiclass conditional probability through a series of cond…

ScaledGD accelerates ill-conditioned low-rank estimation.

This paper improves linear system solving by optimizing matrix diagonal scaling.

Improved perturbation reduces matrix condition number to O(n) with minimal storage.

The study examines conditions for Haken 3-manifolds and their fundamental groups.

In this paper, we study large-scale convex optimization algorithms based on the Newton method applied to regularized generalized self-concordant losses, which include logistic regression and softmax regression. We first prove that our new simple scheme based on a sequence of problems with decreasing regularization para…

We present a rough classification of differential forms on a Riemannian manifold, we consider definitions and properties of conformal Killing forms on a compact Riemannian manifold and define Tachibana numbers as an analog of the well known Betti numbers. We state the conditions that characterize these numbers. In the …

Upper bounds found for Seiberg-Witten moduli spaces under specific conditions.

We present definitions and properties of conformal Killing, Killing and planarity forms on a Riemannian manifold and determine Tachibana, Killing and planarity numbers as an analog of the well known Betti numbers. We state some set of conditions to characterize these numbers. Moreover, we formulate the main results on …

The study shows infinitely many Reeb orbits on star-shaped hypersurfaces with growth rate like prime numbers.

It is proven here that if the connected sum of two tunnel number one knots in the 3-sphere is a tunnel number two knot, then at least one of the summand knots has a genus two Heegaard splitting with a meridian as a primitive element. Hence this is a necessary and sufficient condition for tunnel number one knots to have…

The problem of which Gauss diagram can be realized by knots is an old one and has been solved in several ways. In this paper, we present a direct approach to this problem. We show that the needed conditions for realizability of a Gauss diagram can be interpreted as follows "the number of exits = the number of entrances…

The tail of the distribution of a sum of a random number of independent and identically distributed nonnegative random variables depends on the tails of the number of terms and of the terms themselves. This situation is of interest in the collective risk model, where the total claim size in a portfolio is the sum of a …

We give a refined value group for the collection of triple linking numbers of links in the 3-sphere. Given two links with the same pairwise linking numbers we show that they have the same refined triple linking number collection if and only if the links admit homeomorphic surface systems. Moreover these two conditions …

We give lower bounds for the tunnel number of knots and handlebody-knots. We also give a lower bound for the cutting number, which is a "dual" notion to the tunnel number in the handlebody-knot theory. We provide necessary conditions for constituent handlebody-knots by using $G$-family of quandles colorings. The above …

Improved convergence for overparameterized low-rank matrix sensing.

We give bounds on the number of non-simple closed curves on a negatively curved surface, given upper bounds on both length and self-intersection number. In particular, it was previously known that the number of all closed curves of length at most $L$ grows exponentially in $L$. We get exponentially tighter bounds given…

Proves existence of maps with arbitrary ends and conditions for maxfaces.

Upper bounds on Betti numbers via curvature constraints.

Study Betti and Hodge numbers of solvmanifolds from integer polynomials.

Study pinched submanifolds, proving homology vanishing results.

Many modern statistical applications ask for the estimation of a covariance (or precision) matrix in settings where the number of variables is larger than the number of observations. There exists a broad class of ridge-type estimators that employs regularization to cope with the subsequent singularity of the sample cov…

HSNLD solves robust Hankel recovery efficiently and robustly.

The paper derives a formula for Lefschetz number of a geometric endomorphism.

The study explores generalized divergences and exponential families with a focus on sufficient conditions and laws of large numbers.