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

295887116 · May 202619922001200920172026
48 results for trading floors

Algorithm speeds up search for stationary targets with guaranteed accuracy.

problem Minimize search time while ensuring high detection accuracy of stationary targets.
method Multi-fidelity Gaussian process model and EMTS algorithm.
result Guaranteed performance in target detection accuracy and search time.

SREC markets are a relatively novel market-based system to incentivize the production of energy from solar means. A regulator imposes a floor on the amount of energy each regulated firm must generate from solar power in a given period and provides them with certificates for each generated MWh. Firms offset these certif…

2019-04-12abs ↗pdf ↗

In this paper, we propose hybrid building/floor classification and floor-level two-dimensional location coordinates regression using a single-input and multi-output (SIMO) deep neural network (DNN) for large-scale indoor localization based on Wi-Fi fingerprinting. The proposed scheme exploits the different nature of th…

2018-10-13abs ↗pdf ↗

Develops a new framework for perpetual futures on binary prediction markets.

problem Lack of effective risk management in perpetual futures on binary prediction markets.
method PIRAP framework with six components: index estimator, margin sizing, leverage, funding rule, halt protocol, and eligibility framework.
result Mixed results from empirical evaluation, with some pre-registered floors passing and others failing.

We propose a novel methodology, forest floor, to visualize and interpret random forest (RF) models. RF is a popular and useful tool for non-linear multi-variate classification and regression, which yields a good trade-off between robustness (low variance) and adaptiveness (low bias). Direct interpretation of a RF model…

2016-05-30abs ↗pdf ↗

The art of systematic financial trading evolved with an array of approaches, ranging from simple strategies to complex algorithms all relying, primary, on aspects of time-series analysis. Recently, after visiting the trading floor of a leading financial institution, we noticed that traders always execute their trade or…

2019-07-23abs ↗pdf ↗

This paper analyzes the dynamic incentives for technology adoption under a transferable permits system, which allows for strategic trading on the permit market. Initially, firms can invest both in low-emitting production technologies and trade permits. In the model, technology adoption and allowance price are generated…

2011-03-15abs ↗pdf ↗

Improved analysis for fair federated learning reduces dependence on noise floor.

problem Asymptotic stationarity in group fair federated learning with reduced noise floor dependence.
method DS FedProxGrad framework with inexact local proximal solutions and fairness regularization.
result Algorithm converges asymptotically to stationarity without dependence on a noise floor.

Consider an agent who enters a financial market on day t = 0 with an initial capital amount x. He invests this amount on stocks and the money market, and by day t = T, has generated a wealth W . He is given a convex class of probability measures (called scenarios) and a real-valued function (or floors) corresponding to…

2006-01-25abs ↗pdf ↗

Optimal trading strategy using LQR framework with price mean-reversion.

problem Developing a dynamic trading strategy in a market with linear and quadratic costs.
method Model Predictive Control (MPC) approach to optimize trading curve with positivity constraints.
result Optimal trading curve reacts opportunistically to price changes while satisfying constraints.

The paper develops a theory for random forests, separating variance components and providing methods for estimating prediction intervals.

problem Understanding the variance and uncertainty in random forest predictions.
method Design-based theory, Monte Carlo averaging, PASR resampling.
result The floor of prediction uncertainty is positive and persists even without observation overlap, providing conservative prediction intervals.

We present novel empirical observations regarding how stochastic gradient descent (SGD) navigates the loss landscape of over-parametrized deep neural networks (DNNs). These observations expose the qualitatively different roles of learning rate and batch-size in DNN optimization and generalization. Specifically we study…

2018-02-24abs ↗pdf ↗

Near-interpolating models grow norms quickly, affecting generalization.

problem Understanding the trade-off between interpolation and generalization in near-interpolating models.
method Random matrix theory and eigendecay analysis of data covariance matrix.
result Near-interpolating models exhibit rapid norm growth and worse generalization trade-offs.

The study uses machine learning to analyze office floor plans and predict function based on geometry.

problem Lack of formalisms to describe spatial affordance in automated floor-plan generation tools.
method Supervised and unsupervised data mining techniques, including J48 algorithm, were used to analyze office floor plans.
result J48 algorithm can predict class performance on unseen examples up to 79.5% for office dataset.

Enhances ocean floor mapping with adaptive uncertainty estimates.

problem Inaccurate bathymetric data for precise ocean modeling.
method Block-based conformal prediction with VQ-VAE architecture.
result Significant improvements in reconstruction quality and uncertainty estimation reliability.

Study on price fluctuations in NFT market, showing heavy-tailed distributions and long-range memory.

problem Characterizing price fluctuations in NFT market.
method Analysis of capitalization, floor price, transactions, inter-transaction times, and volume value of NFTs.
result NFT market exhibits heavy-tailed probability distribution functions, well described by stretched exponentials, with long-range memory.

A training-free conformal interval is a mandatory baseline for probabilistic time-series forecasting.

problem Comparing probabilistic forecasters against weak or omitted baselines.
method A simple conformal interval with no parameters and no training.
result The ConformalNaive interval decisively beats several baselines.

The study bounds exceptional surgeries for hyperbolic knots.

problem Identifying the range of slopes for exceptional surgeries.
method Analyzing meridional and non-meridional surgeries, and investigating the relationship between boundary slopes and exceptional surgeries.
result There are boundary slopes b1<b2b_1 < b_2 such that all non-trivial exceptional surgeries occur in the interval [b1,b2][b_1, b_2]. The integers in $[\ceil{b_1}, \floor{b_2}]$ are all exceptional surgeries.

Develops a novel SABR DNN for accurate volatility surface calibration.

problem Inaccurate SABR model approximation for high volatility, long maturities, and out-of-the-money options.
method A specialized Artificial Deep Neural Network (DNN) architecture trained on a large dataset of interest rate volatility surfaces.
result Arbitrage-free calibration of real market volatility surfaces and Cap/Floor prices for any maturity and strike.

The relationships between braid ordering and the geometry of its closure is studied. We prove that if an essential closed surface FF in the complements of closed braid has relatively small genus with respect to the Dehornoy floor of the braid, FF is circular-foliated in a sense of Birman-Menasco's Braid foliation the…

2008-05-10abs ↗pdf ↗

Efficient dispatching rule in manufacturing industry is key to ensure product on-time delivery and minimum past-due and inventory cost. Manufacturing, especially in the developed world, is moving towards on-demand manufacturing meaning a high mix, low volume product mix. This requires efficient dispatching that can wor…

2019-10-04abs ↗pdf ↗

Three-hidden-layer neural networks can approximate Hölder continuous functions uniformly with exponential rate.

problem Approximating Hölder continuous functions with neural networks.
method Introduced Floor-Exponential-Step (FLES) networks with three hidden layers.
result Uniform approximation of Hölder continuous functions with an exponential rate.

Language models allocate information storage, not collapsing into uniform representations.

problem Incomplete neural collapse in language model representations.
method Analyzing variance and information sharing across 14 models, proving an information floor.
result Within-class variance is allocated information storage, not collapsed into uniform representations.

The volatility characterizes the amplitude of price return fluctuations. It is a central magnitude in finance closely related to the risk of holding a certain asset. Despite its popularity on trading floors, the volatility is unobservable and only the price is known. Diffusion theory has many common points with the res…

2006-12-11abs ↗pdf ↗

New model estimates indoor radon distribution with higher spatial resolution.

problem Accurate estimation of indoor radon concentration for health assessment.
method Quantile regression forest and probabilistic Monte Carlo sampling.
result Approximate lognormal distribution of indoor radon in Germany with specific exceedance probabilities.

Newly available data on the spatial distribution of retail activities in cities makes it possible to build models formalized at the level of the single retailer. Current models tackle consumer location choices at an aggregate level and the opportunity new data offers for modeling at the retail unit level lacks a theore…

2016-12-16abs ↗pdf ↗

KATA improves associative recall by optimizing feature maps derived from nonnegative attention weights.

problem Linear attention's poor performance on associative recall tasks.
method Formulates attention recall as a spherical-packing problem and introduces Kernelized Linear Attention Activations (KATA).
result KATA features offer a favorable capacity-interference tradeoff, enabling efficient associative recall.

The genus of knots is a one of the fundamental invariant and can be seen as a complexity of knots. In this paper, we give a lower bound of genus using Dehornoy floor, which is a measure of complexity of braids in terms of braid ordering.

2008-05-14abs ↗pdf ↗

Study variance-optimal hedging of forward curve derivatives under stochastic volatility.

problem Variance-optimal hedging of forward curve derivatives with stochastic volatility.
method Assumes HJM-Musiela dynamics modulated by stochastic covariance, uses Galtchouk-Kunita-Watanabe projection.
result Density of finite-maturity strategies, convergence of finite-rank projections, decomposition of hedging error.

A framework uses deep reinforcement learning to optimize energy storage in intraday markets.

problem Optimizing energy storage in intraday markets for renewable energy integration.
method Markov Decision Process, asynchronous distributed fitted Q iteration algorithm, artificial trajectories.
result The agent converges to a policy that achieves higher total revenues than the benchmark strategy.

AdaQuantFL reduces communication in federated learning by adaptively quantizing model updates.

problem Efficient communication of model updates in federated learning with high-dimensional models and limited bandwidth.
method AdaQuantFL uses adaptive quantization to reduce the number of bits for model updates while maintaining low error floor.
result AdaQuantFL converges in fewer communicated bits compared to fixed quantization levels, with minimal impact on accuracy.

Study proposes explainable analytics for manufacturing process planning.

problem Improving data-driven decision-making in manufacturing.
method Combines process mining, machine learning, and XAI. Uses deep learning for prediction and Shapley values/ICE plots for explanations.
result Enhanced decision-making capabilities through local post-hoc explanations.

Language models fail to process hallucinated responses, and this study diagnoses the failure.

problem Language models fail to process hallucinated responses, leading to over-concentration or diffuse attention.
method The study uses forced scoring of benchmark-labeled responses to compute attention shapes and analyze the symmetric component of the degree-normalized attention operator.
result The study proves that every transpose-invariant spectral diagnostic of the attention operator is orientation-blind and bounds the sensitivity of any Lipschitz diagnostic by the asymmetry coefficient \(G\).

New method recalibrates VaR for option books, reducing forecast errors.

problem Inaccurate VaR forecasts due to missing operational choices.
method Marking-aware sequential VaR recalibration targeting normalized book-level loss.
result Sequential VaR recalibration improves VaR performance across different markets and options.

SAEs struggle with curved activation manifolds, revealing layer-dependent scaling laws.

problem Sparse autoencoders' reconstruction error varies across layers, not fitting existing scaling laws.
method Cross-layer study of 844 SAE checkpoints, fitting and regressing on manifold geometry.
result Manifold geometry predicts layer-dependent width exponents in SAEs, with transferable coefficients.