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,742 papers · 148 categories

Trend · papers per month

121242362483 · Jun 202019922001200920172026
48 results for small orders

We derive a small-time expansion for out-of-the-money call options under an exponential Levy model, using the small-time expansion for the distribution function given in Figueroa-Lopez & Houdre (2009), combined with a change of numéraire via the Esscher transform. In particular, we quantify find that the effect of a no…

2011-05-16abs ↗pdf ↗

New method achieves small-loss regret bounds in random-order model.

problem Online learning with adversarial loss functions in random order.
method Extending batch-to-online transformation, using average sensitivity and stability.
result Small-loss regret bounds of order ildeO(φ(OPTT)) ilde O(\varphi^{\star}(\mathrm{OPT}_T)).

A small investor provides liquidity at the best bid and ask prices of a limit order market. For small spreads and frequent orders of other market participants, we explicitly determine the investor's optimal policy and welfare. In doing so, we allow for general dynamics of the mid price, the spread, and the order flow, …

2013-09-20abs ↗pdf ↗

Analyzes Willmore flow for graphs with boundary data, proving existence and convergence.

problem Willmore flow of graphs with boundary conditions over bounded domains.
method Developed low-regularity theory, reformulated graphical equation, used time-weighted parabolic Hölder spaces.
result Proved short-time and global existence for initial data in C1+α(Ω)C^{1+α}(\overlineΩ) and Lipschitz, with exponential convergence.

High-frequency traders can act as either small informed traders or round-trippers, affecting price discovery and liquidity.

problem Effects of high-frequency trading on price discovery and liquidity.
method Extended Kyle's model with interactions between large informed traders and high-frequency traders.
result High-frequency traders can act as Small-IT or Round-Tripper, impacting price discovery and liquidity.

Connectedness of small clusters in Riemannian and Finsler manifolds proven.

problem Understanding connectedness of small clusters in Riemannian and Finsler manifolds.
method Proved connectedness and small diameter properties for clusters of small volume in both manifolds.
result Clusters in Riemannian manifolds are connected and have small diameter; in Finsler manifolds, they are at most m connected components of small diameter.

Variance reduction techniques like SVRG provide simple and fast algorithms for optimizing a convex finite-sum objective. For nonconvex objectives, these techniques can also find a first-order stationary point (with small gradient). However, in nonconvex optimization it is often crucial to find a second-order stationary…

2019-05-01abs ↗pdf ↗

New bounds on diameters and generators for specific lattices and graphs.

problem Finding bounds on diameters and generators for arithmetic lattices and Ramanujan graphs.
method Analyzing arithmetic lattices from Eichler orders in quaternion algebras, applying techniques to definite quaternion algebras.
result Bounds on diameters and generators for arithmetic lattices and Ramanujan graphs.

ISAAC Newton uses input-based curvature for efficient training.

problem Efficient training in small-batch stochastic regimes.
method ISAAC Newton conditions gradients using selected second-order information based on input.
result Effective training even in small-batch stochastic regimes, competitive to first-order and second-order methods.

New method improves DAG learning by using large coefficients for higher-order terms.

problem Recovering DAG structures from observational data is challenging due to combinatorial optimization.
method Proposes truncated matrix power iteration to approximate DAG constraints efficiently.
result Empirically outperforms previous methods by a factor of 3 or more in structural Hamming distance.

An investor with constant absolute risk aversion trades a risky asset with general Itô-dynamics, in the presence of small proportional transaction costs. In this setting, we formally derive a leading-order optimal trading policy and the associated welfare, expressed in terms of the local dynamics of the frictionless op…

2012-09-12abs ↗pdf ↗

In a lens space X of order r a knot K representing an element of the fundamental group pi_1 X = Z/rZ of order s <= r contains a connected orientable surface S properly embedded in its exterior X-N(K) such that the boundary of S intersects the meridian of K minimally s times. Assume S has just one boundary component. Le…

2006-12-15abs ↗pdf ↗

Study finds conditions for operator fields to be in strictly upper triangular form in small dimensions.

problem Jordan-Chevalley decomposition for operator fields in small dimensions.
method Tensorial conditions and proof of conjecture for higher order brackets.
result Proves Tempesta-Tondo conjecture for higher order brackets.

Algorithm learns causal structures from low-order conditional independencies.

problem Estimating high-order conditional independencies from data is challenging.
method Proposes an algorithm to compute a faithful graphical representation from low-order conditional independencies.
result Algorithm successfully learns causal structures from zero- and first-order conditional independencies.

Quasi-alternating links of determinant 1, 2, 3, and 5 were previously classified by Greene and Teragaito, who showed that the only such links are two-bridge. In this paper, we extend this result by showing that all quasi-alternating links of determinant at most 7 are connected sums of two-bridge links, which is optimal…

2015-07-16abs ↗pdf ↗

We establish a canonical correspondence between connected quandles and certain configurations in transitive groups, called quandle envelopes. This correspondence allows us to efficiently enumerate connected quandles of small orders, and present new proofs concerning connected quandles of order p and 2p. We also present…

2014-09-08abs ↗pdf ↗

We extend the Heegaard Floer homological definition of spectral order for closed contact 3-manifolds due to Kutluhan, Matić, Van Horn-Morris, and Wand to contact 3-manifolds with convex boundary. We show that the order of a codimension zero contact submanifold bounds the order of the ambient manifold from above. As the…

2016-01-21abs ↗pdf ↗

Transfer learning improves chaotic dynamics predictions with less data.

problem Efficiently predicting chaotic dynamics with limited data.
method Transfer learning for nonlinear dynamics, optimizing transfer rate and leveraging small-scale turbulence universality.
result Significantly more accurate inference of chaotic dynamics achieved.

We use the Heegaard-Floer homology correction terms defined by Ozsváth--Szabó to formulate a new obstruction for a knot to be of finite order in the smooth concordance group. This obstruction bears a formal resemblance to that of Casson and Gordon but is sensitive to the difference between the smooth versus topological…

2006-11-01abs ↗pdf ↗

We show that wealth processes in the block-shaped order book model of Obizhaeva/Wang converge to their counterparts in the reduced-form model proposed by Almgren/Chriss, as the resilience of the order book tends to infinity. As an application of this limit theorem, we explain how to reduce portfolio choice in highly-re…

2014-09-25abs ↗pdf ↗

Early training of deep neural networks leads to small, directionally converging weights.

problem Training dynamics of deep homogeneous neural networks with small initializations.
method Gradient flow analysis and study of KKT points for neural correlation function.
result Weights converge in direction to KKT points during early training stages.

Method screens similar capsule endoscopic images, reducing doctor workload and improving accuracy.

problem Time-consuming and high error rate in manual inspection of large numbers of similar capsule endoscopic images.
method Structural similarity analysis of visually salient areas and hierarchical clustering.
result 76% reduction in similar images, 100% lesion recall, 18-minute average play time.