Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

105210314419 · Jun 202019922001200920172026
48 results for Root finding

In this paper, we find a condition under which a Finsler space with Kropina change of mth-root metric is projectively related to a mth-root metric and also we find a condition under which this Kropina transformed mth-root metric is locally dually flat. Moreover we find the condition for its Projective flatness.

2017-12-23abs ↗pdf ↗

In this paper, we characterize locally dually flat generalized m-th root Finsler metrics. Then we find a condition under which a generalized m-th root metric is projectively related to a m-th root metric. Finally, we prove that if a generalized m-th root metric is conformal to a m-th root metric, then both of them redu…

2013-02-11abs ↗pdf ↗

Many independent studies on stocks and futures contracts have established that market impact is proportional to the square-root of the executed volume. Is market impact quantitatively similar for option markets as well? In order to answer this question, we have analyzed the impact of a large proprietary data set of opt…

2016-02-09abs ↗pdf ↗

In this paper, we consider Kropina change of mm-th root Finsler metrics. We find necessary and sufficient condition under which the Kropina change of an mm-th root Finsler metric be locally dually flat. Then we prove that the Kropina change of an mm-th root Finsler metric is locally projectively flat if and only if …

2014-09-13abs ↗pdf ↗

In this paper, we prove that every m-th root metric with isotropic mean Berwald curvature reduces to a weakly Berwald metric. Then we show that an m-th root metric with isotropic mean Landsberg curvature is a weakly Landsberg metric. We find necessary and sufficient condition under which conformal ββ-change of an m-th…

2017-06-24abs ↗pdf ↗

Margalit and Schleimer constructed nontrivial roots of the Dehn twist about a nonseparating curve. We prove that the conjugacy classes of roots of the Dehn twist about a nonseparating curve correspond to the conjugacy classes of periodic maps with certain conditions. Futhermore, we give data set which determine the con…

2009-11-26abs ↗pdf ↗

Improved bounds for Black-Scholes volatility lead to faster root-finding.

problem Finding accurate implied volatility for Black-Scholes model.
method Systematic use of option delta to derive tighter bounds, proposing a Newton-Raphson algorithm.
result Proposed algorithm converges rapidly for all price ranges, especially useful for extreme option prices.

We consider numerical schemes for root finding of noisy responses through generalizing the Probabilistic Bisection Algorithm (PBA) to the more practical context where the sampling distribution is unknown and location-dependent. As in standard PBA, we rely on a knowledge state for the approximate posterior of the root l…

2017-11-02abs ↗pdf ↗

Enhanced ROOT-SGD optimizes stochastic optimization with diminishing stepsizes.

problem Improving statistical efficiency in stochastic optimization.
method Integrates a diminishing stepsize strategy into ROOT-SGD.
result Achieves optimal convergence rates with improved stability and precision.

Study finds price impact follows a 'double' square-root law, suggesting mechanical origin.

problem Understanding the origin of price impact in markets.
method Detailed dataset of Tokyo Stock Exchange orders, analyzing single and metaorders.
result Price impact follows a 'double' square-root law, indicating mechanical origin rather than information.

The notion of market impact is subtle and sometimes misinterpreted. Here we argue that impact should not be misconstrued as volatility. In particular, the so-called ``square-root impact law'', which states that impact grows as the square-root of traded volume, has nothing to do with price diffusion, i.e. that typical p…

2019-05-11abs ↗pdf ↗

The study of random positive 3-strand braids reveals patterns in the roots of their Alexander polynomials.

problem Investigating the roots of Alexander polynomials of random positive 3-strand braids.
method Experimental data analysis, conjectures refinement, and proof of results using tools like the signature function of links and Lyapunov exponent of the Burau representation.
result Generically, at least 69% of the roots of Alexander polynomials are on the unit circle, with a large root-free region near the origin.

Develops new algorithms for solving root-finding problems in large-scale settings.

problem Solving nonlinear equations in large-scale settings.
method Randomized block-coordinate optimistic gradient algorithms.
result Achieves convergence rates of O(1/k)\mathcal{O}(1/k) and O(1/k2)\mathcal{O}(1/k^2) for root-finding problems.

Optimizes AMM markets with a new framework reducing complex optimization to simpler root finding.

problem Optimizing routing and arbitrage in AMM markets.
method Restricts search to boundary of optimal space using marginal prices, reducing high-dimensional optimization to lower-dimensional root finding.
result Significantly faster and more robust performance compared to the original convex optimization method.

Probabilistic Bisection Algorithm performs root finding based on knowledge acquired from noisy oracle responses. We consider the generalized PBA setting (G-PBA) where the statistical distribution of the oracle is unknown and location-dependent, so that model inference and Bayesian knowledge updating must be performed s…

2018-06-30abs ↗pdf ↗

We study kk-GenEV, the problem of finding the top kk generalized eigenvectors, and kk-CCA, the problem of finding the top kk vectors in canonical-correlation analysis. We propose algorithms LazyEV\mathtt{LazyEV} and LazyCCA\mathtt{LazyCCA} to solve the two problems with running times linearly dependent on the input size and…

2016-07-20abs ↗pdf ↗

We find two different families of Sp(2,R)Sp(2,R) symmetric G2G_2 structures in seven dimensions. These are G2G_2 structures with G2G_2 being the split real form of the simple exceptional complex Lie group G2G_2. The first family has τ20τ_2\equiv 0, while the second family has τ1τ20τ_1\equivτ_2\equiv 0. The families are differen…

2019-08-13abs ↗pdf ↗

Study finds Deep Taylor Decomposition is unreliable for explaining neural networks.

problem Reliability of Deep Taylor Decomposition for explaining neural networks.
method Investigated the theoretical foundations of Deep Taylor Decomposition (DTD) and found it under-constrained.
result DTD is unreliable because its theoretical foundations are under-constrained and roots do not align with input.

Deep neural networks (DNNs) are shown to be promising solutions in many challenging artificial intelligence tasks. However, it is very hard to figure out whether the low precision of a DNN model is an inevitable result, or caused by defects. This paper aims at addressing this challenging problem. We find that the inter…

2019-09-05abs ↗pdf ↗

We find explicit bases for naturally defined lattices over a ring of algebraic integers in the SO(3) TQFT-modules of surfaces at roots of unity of odd prime order. Some applications relating quantum invariants to classical 3-manifold topology are given.

2004-11-01abs ↗pdf ↗

Study tail risk in high-frequency finance using L1L_1-regularized regression.

problem Measuring tail risk dynamics in high-frequency financial markets.
method Dynamic extreme value regression model with L1L_1-regularized maximum likelihood estimator.
result Severity of extreme losses well predicted by low price impact in high volatility periods.

Consider a process, stochastic or deterministic, obtained by using a numerical integration scheme, or from Monte-Carlo methods involving an approximation to an integral, or a Newton-Raphson iteration to approximate the root of an equation. We will assume that we can sample from the distribution of the process from time…

2010-05-12abs ↗pdf ↗

New findings show the Gilmer-Masbaum map isn't always one-to-one.

problem Determining the injectivity of the Gilmer-Masbaum map on Kauffman bracket skein modules.
method Computed the image of the evaluation map for specific cases of mapping tori and analyzed homology classes.
result The restriction of the Gilmer-Masbaum map to certain homology classes is not injective.

We confirm the square-root law of market impact on Apple Inc. using a large dataset.

problem Testing the square-root law of market impact on a single U.S. large-cap equity.
method Using a full market-by-order feed, we reconstruct metaorders and calibrate impact using the square-root formula.
result The square-root law is confirmed with a prefactor of 0.34, consistent with worldwide data.

The Apollonius theorem is generalized for m-simplices, with applications in geometry and optimization.

problem Generalizing the Apollonius theorem for m-simplices.
method Direct generalization of the theorem to m-simplices in n-dimensional space.
result Applications in geometry and optimization, including minimal surface enclosures, simplex thickness, and root-finding methods.

New definition of patient-specific root causes of disease using counterfactuals.

problem Lack of rigorous mathematical formulation for automatic detection of root causes.
method Proposes a counterfactual definition matching clinical intuition and uses Shapley values for causal contribution scores.
result Adapts to disease prevalence, accounts for noisy labels, and admits fast computation.

A new line search rule improves support recovery in high-dimensional data.

problem Support recovery in high-dimensional data analysis with 0\ell_0 penalty.
method Data-driven line search rule for adaptive step size determination.
result Proves 2\ell_2 error bound without restrictions on cost functional.