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

180360539719 · Jun 202019922001200920172026
48 results for order analysis

Paper proposes a deep learning method to estimate fill probabilities of limit orders in LOBs.

problem Estimating the fill probabilities of limit orders in different levels of a limit order book.
method Survival analysis model using a convolutional-Transformer encoder and a monotonic neural network decoder.
result The proposed method significantly outperforms other approaches in survival analysis.

H-GAT improves stock selection by capturing complex higher-order stock relations and integrating both technical and fundamental analysis.

problem Stock selection difficulty and lack of comprehensive analysis.
method Higher-order Graph Attention Network (H-GAT) that incorporates both technical and fundamental analysis.
result H-GAT outperforms existing methods in stock selection metrics.

We present a novel factor analysis method that can be applied to the discovery of common factors shared among trajectories in multivariate time series data. These factors satisfy a precedence-ordering property: certain factors are recruited only after some other factors are activated. Precedence-ordering arise in appli…

2011-05-09abs ↗pdf ↗

The paper analyzes errors in mechanical systems with external forces.

problem Error analysis of mechanical systems with external forces.
method Analysis of variational integrators with contact order rr for discrete mechanical systems.
result The contact order of the integrator is the same as the contact order of the original systems.

The paper is mainly devoted to systematic developments and applications of geometric aspects of second-order variational analysis that are revolved around the concept of parabolic regularity of sets. This concept has been known in variational analysis for more than two decades while being largely underinvestigated. We …

2019-08-31abs ↗pdf ↗

Proves a higher-order positive energy theorem for stationary solutions in fourth-order gravity.

problem Proving a positive energy theorem for fourth-order gravitational theories.
method Analyzes geometric analysis intersections and links to QQ-curvature.
result Establishes a positive energy theorem for stationary solutions in fourth-order gravity, similar to the classical ADM theorem.

Predicts short-term futures contract direction using neural networks and order flow data.

problem Challenges in predicting short-term directional movement of futures contracts.
method Engineering features from technical analysis, order flow, and order-book data; training a Tabnet neural network.
result Achieved an accuracy of 0.601 in predicting directional change on the Silver Futures Contract.

Optimal algorithms for Riemannian optimization with reduced complexity.

problem Stochastic optimization on Riemannian manifolds with limited data.
method Zeroth-order Riemannian Averaging Stochastic Approximation algorithms using Riemannian moving-average estimators and novel geometric conditions.
result Achieves optimal sample complexities for generating approximate first-order stationary solutions.

Second-order optimizers retain residual information after data deletion, affecting machine unlearning.

problem Residual information in second-order optimizers after data deletion.
method Comparison of first-order and second-order learners, eigendecomposition analysis.
result Second-order optimizers retain residual information, not detectable by first-order analysis.

Unified approach to discrete and smooth isoperimetric inequalities of arbitrary order.

problem Finding higher order isoperimetric inequalities for both discrete and smooth curves.
method Unified approach via Fourier analysis of linear operators.
result Unified upper and lower bounds for isoperimetric deficit in smooth curves.

In this paper, we investigate the popular deep learning optimization routine, Adam, from the perspective of statistical moments. While Adam is an adaptive lower-order moment based (of the stochastic gradient) method, we propose an extension namely, HAdam, which uses higher order moments of the stochastic gradient. Our …

2019-10-15abs ↗pdf ↗

New approach approximates c-space geometry of multi-loop linkages.

problem Higher-order mobility analysis of multi-loop linkages.
method Higher-order Taylor series expansion of geometric constraint mapping using joint screws.
result Local approximation of c-space and configurations with certain rank.

Study spectral analysis on lens spaces, proving isospectral lens spaces with prime order fundamental groups.

problem Spectral analysis of the Kohn Laplacian on lens spaces.
method Analog of Weyl's law and isospectral lens spaces with prime order fundamental groups.
result Two 3D lens spaces with prime order fundamental groups are isospectral with respect to the Kohn Laplacian if and only if they are CR isometric.

The paper introduces a frequency-domain estimator for low-order systems from noisy data.

problem Estimating frequency responses of low-order systems from noisy measurements.
method Uses a quadratic data-fitting term regularized by the nuclear norm of a Loewner matrix, subject to a convex stability constraint.
result Proves a finite-sample error bound and extends it to all frequencies through rational interpolation.

Study analyzes stock order transitions during US-China trade war using Markov chains.

problem Understanding order dynamics during extreme macroeconomic events.
method First-order time-homogeneous discrete-time Markov chain model.
result Active participation by different traders during high volatility days, influencing market outcomes.

Geodesic convexity generalizes the notion of (vector space) convexity to nonlinear metric spaces. But unlike convex optimization, geodesically convex (g-convex) optimization is much less developed. In this paper we contribute to the understanding of g-convex optimization by developing iteration complexity analysis for …

2016-02-19abs ↗pdf ↗

Unified framework for analyzing batch updating methods with noisy gradients.

problem Analyzing convergence of batch updating methods with noisy gradients and approximations.
method Unified framework using convergence of stochastic processes.
result Establishes a general theorem for most known convergence results.

Different variants of MFDFA technique are applied in order to investigate various (artificial and real-world) time series. Our analysis shows that the calculated singularity spectra are very sensitive to the order of the detrending polynomial used within the MFDFA method. The relation between the width of the multifrac…

2012-12-03abs ↗pdf ↗

Mini-Hes improves LFA model performance on HDI tasks with missing data.

problem Effective representation of high-dimensional, incomplete data for user behavior understanding.
method Proposes Mini-Hes, a parallelizable second-order LFA model using mini-block diagonal Hessian-free optimization.
result Mini-Hes outperforms state-of-the-art models in missing data estimation tasks on recommender system datasets.

A limit order book provides information on available limit order prices and their volumes. Based on these quantities, we give an empirical result on the relationship between the bid-ask liquidity balance and trade sign and we show that liquidity balance on best bid/best ask is quite informative for predicting the futur…

2012-04-06abs ↗pdf ↗

We discuss replica analytic continuation using several simple models in order to prove mathematically the validity of replica analysis, which is used in a wide range of fields related to large scale complex systems. While replica analysis consists of two analytical techniques, the replica trick (or replica analytic con…

2016-06-23abs ↗pdf ↗

Networks are a fundamental model of complex systems throughout the sciences, and network datasets are typically analyzed through lower-order connectivity patterns described at the level of individual nodes and edges. However, higher-order connectivity patterns captured by small subgraphs, also called network motifs, de…

2018-02-19abs ↗pdf ↗

As application demands for zeroth-order (gradient-free) optimization accelerate, the need for variance reduced and faster converging approaches is also intensifying. This paper addresses these challenges by presenting: a) a comprehensive theoretical analysis of variance reduced zeroth-order (ZO) optimization, b) a nove…

2018-05-25abs ↗pdf ↗

We investigate the behavior of limit order books on the meso-scale motivated by order execution scheduling algorithms. To do so we carry out empirical analysis of the order flows from market and limit order submissions, aggregated from tick-by-tick data via volume-based bucketing, as well as various LOB depth and shape…

2017-08-09abs ↗pdf ↗

Paper proposes efficient methods for high-order clustering in tensor block models.

problem High-order clustering of multiway datasets in neuroimaging, genomics, etc.
method Tensor block model and computationally efficient algorithms (HLloyd, HSC)
result Achieves high-order exact clustering with statistical optimality and computational efficiency.

In this paper we determine a number of meaningful compositions of higher order of a set of functions, which is considered in Malesevic (1998), in implicit and explicit form. Results which are obtained are applied to the vector analysis in order to determine the number of meaningful differential operations of higher ord…

2004-09-16abs ↗pdf ↗

Through the analysis of a dataset of ultra high frequency order book updates, we introduce a model which accommodates the empirical properties of the full order book together with the stylized facts of lower frequency financial data. To do so, we split the time interval of interest into periods in which a well chosen r…

2013-12-02abs ↗pdf ↗

Study analyzes order transitions in high, medium, and low market cap stocks using Markov chains.

problem Understanding order transitions in stocks of different market caps.
method First-order discrete-time Markov chain model applied to NASDAQ100 stocks.
result Limit orders exhibit higher inertia during opening hours but decrease in subsequent hours, while market orders increase.