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

25.0%50.0%75.0%100.0% · Jun 199319922001200920172026
48 results for valid ordering

This text is a survey on cross-validation. We define all classical cross-validation procedures, and we study their properties for two different goals: estimating the risk of a given estimator, and selecting the best estimator among a given family. For the risk estimation problem, we compute the bias (which can also be …

2017-03-09abs ↗pdf ↗

Optimizes hyperparameter tuning for models using approximate leave-one-out cross-validation.

problem Finding optimal hyperparameters for regularized models using approximate leave-one-out cross-validation.
method Derive efficient formulas for gradient and hessian of approximate leave-one-out cross-validation, apply second-order optimization.
result Demonstrates the effectiveness of the approach on real-world data sets.

Cryptocurrency patterns stable across market caps, validated by microstructure theory.

problem Stable patterns in cryptocurrency microstructure across different market caps.
method Unified CatBoost modeling pipeline with time-series cross validation, validated by backtests.
result Feature rankings and partial effects are stable across assets despite heterogeneous liquidity and volatility.

Flow models recover causal transformations from observational data and a valid ordering.

problem Causal inference with only observational data and a valid causal ordering.
method Flow models that can recover component-wise, invertible transformations of exogenous variables.
result Flow models outperform previous methods and deliver consistent performance across various structural causal models.

The study evaluates financial risk using copulas and statistical tests.

problem Validating bivariate forecasts in risk evaluation.
method Using copulas to characterize dependencies, applying statistical tests to validate forecasts, removing heteroskedasticity.
result A Student copula accurately describes financial time series dependencies.

Study validates Lillo-Mike-Farmer model predicting financial market long-range correlations.

problem Quantifying long-range correlations in financial markets.
method Analyzed nine years of market data to classify traders as order-splitting or random, measured metaorder-length distributions, and compared to LMF model predictions.
result Agreement between LMF model predictions and actual data, validating the model.

Paper discusses optimal CP for second-order predictions.

problem How to incorporate second-order predictions into conformal prediction.
method Introduces Bernoulli prediction sets (BPS) for second-order predictions and applies conformal risk control for compromised validity.
result BPS provides the smallest prediction sets with conditional coverage.

Convolutional Neural Networks (CNN) have been pivotal to the success of many state-of-the-art classification problems, in a wide variety of domains (for e.g. vision, speech, graphs and medical imaging). A commonality within those domains is the presence of hierarchical, spatially agglomerative local-to-global interacti…

2019-08-18abs ↗pdf ↗

Prediction of future observations is an important and challenging problem. The two mainstream approaches for quantifying prediction uncertainty use prediction regions and predictive distributions, respectively, with the latter believed to be more informative because it can perform other prediction-related tasks. The st…

2020-01-24abs ↗pdf ↗

The success of generative modeling in continuous domains has led to a surge of interest in generating discrete data such as molecules, source code, and graphs. However, construction histories for these discrete objects are typically not unique and so generative models must reason about intractably large spaces in order…

2019-07-18abs ↗pdf ↗

New algorithm helps escape saddle points in optimization problems.

problem Optimizing smooth non-convex functions to avoid saddle points.
method Perturbed Saddle-escape Descent (PSD) algorithm with explicit constants.
result PSD finds approximate second-order stationary points efficiently.

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 ↗

We propose a model for price formation in financial markets based on clearing of a standard call auction with random orders, and verify its validity for prediction of the daily closing price distribution statistically. The model considers random buy and sell orders, placed following demand- and supply-side valuation di…

2019-04-16abs ↗pdf ↗

This paper employs machine learning algorithms to forecast German electricity spot market prices. The forecasts utilize in particular bid and ask order book data from the spot market but also fundamental market data like renewable infeed and expected demand. Appropriate feature extraction for the order book data is dev…

2019-06-14abs ↗pdf ↗

This paper elaborates on the validation requirements for rating systems and probabilities of default (PDs) which were introduced with the New Capital Standards (Basel II). We start in Section 2 with some introductory remarks on the topics and approaches that will be discussed later on. Then we have a view on the develo…

2006-06-07abs ↗pdf ↗

We describe and extract time-ordered multibody interactions from complex systems.

problem Complex systems with temporal and multibody dependencies.
method Decompose multivariate Markov chains into time-ordered multibody interactions. Algorithm to extract interactions from data. Measure complexity of interaction ensembles.
result Robust and efficient algorithm to infer time-ordered multibody interactions from data.

MACC learns communication protocols by adapting counterfactual reasoning.

problem Credit assignment and non-stationarity in communication environments.
method Adapts counterfactual reasoning to overcome credit assignment and uses action policy and Q-function of other agents to handle non-stationarity.
result MACC outperforms state-of-the-art baselines in four scenarios.

Improved fourth-order compact scheme for option valuation with Robin boundary condition.

problem Lower convergence rates in numerical methods for American options.
method High-order compact scheme, Robin boundary condition, coupled nonlinear PDEs.
result Fourth-order convergence rate achieved without mesh refinement.

RGRR allocates between QQQ and DIA based on relative states, improving Sharpe and CAGR.

problem Optimizing ETF allocation between QQQ and DIA for better risk-adjusted returns.
method Screened relative and macro states, globally screened interactions, fixed position mapping, walk-forward validation.
result RGRR improves Sharpe and CAGR compared to 100% QQQ and 50/50 QQQ-DIA allocations.

Study solves inverse problems for equations with fractional nonlinearities.

problem Solving inverse problems for semilinear elliptic equations with fractional power nonlinearities.
method Higher order linearization method adapted for fractional order.
result Results of previous studies remain valid for general power nonlinearities.

We propose a method for detection and prediction of native and synthetic iceberg orders on Chicago Mercantile Exchange. Native (managed by the exchange) icebergs are detected using discrepancies between the resting volume of an order and the actual trade size as indicated by trade summary messages, as well as by tracki…

2019-09-20abs ↗pdf ↗

This paper is devoted to the important yet little explored subject of the market impact of limit orders. Our analysis is based on a proprietary database of metaorders - large orders that are split into smaller pieces before being sent to the market. We first address the case of aggressive limit orders and then, that of…

2018-02-23abs ↗pdf ↗

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.

In the modern era, abundant information is easily accessible from various sources, however only a few of these sources are reliable as they mostly contain unverified contents. We develop a system to validate the truthfulness of a given statement together with underlying evidence. The proposed system provides supporting…

2018-02-15abs ↗pdf ↗

MiLeNAS improves neural architecture search by reducing approximation errors and achieving better accuracy.

problem Improving efficiency and accuracy in neural architecture search (NAS).
method Mixed-level reformulation (MiLeNAS) to optimize efficiently and reliably.
result MiLeNAS achieves lower validation error and higher accuracy than bilevel optimization methods.

Develops anytime-valid stopping rules for SGD based on observed trajectory.

problem Stopping stochastic gradient descent (SGD) based on observed trajectory.
method Develops anytime-valid confidence sequences for stochastic gradient methods.
result Statistically valid, time-uniform stopping rules for SGD across convex and nonconvex settings.

FunCLBM clusters time series data for autonomous driving validation.

problem Validation of autonomous driving systems using large amounts of data.
method FunCLBM model for co-clustering high-dimensional time series data.
result FunCLBM provides structured partition and clustering views of datasets.

Paper addresses limitations of traditional hierarchical clustering methods.

problem Traditional hierarchical clustering methods face limitations in binary trees and ultrametrics.
method Introduces the notion of a valid hierarchy and a two-step algorithm to construct a binary tree and prune it to enforce validity.
result Proposes a method to recover the finest valid hierarchy, which is not constrained to binary structures.

The paper examines LpL^p gradient and Riesz transform estimates under Ricci lower bounds.

problem Investigating LpL^p estimates for solutions of the Poisson equation under Ricci lower bounds.
method Analyzes LpL^p estimates for gradient and Riesz transforms under Ricci lower bounds, providing counterexamples and bounds.
result Valid LpL^p estimates for gradient and Riesz transforms under Ricci lower bounds, with conditions on injectivity radius and curvature.

Paper proposes a new method to identify causal graphs with latent variables using higher-order cumulants.

problem Estimating causal directed acyclic graphs with latent confounders.
method Uses higher-order cumulants to identify causal structures among observed and latent variables.
result Validates the proposed algorithm through simulations and real-world data.

We introduce the concept of Calderón-Zygmund inequalities on Riemannian manifolds. For 1<p<1<p<\infty, these are inequalities of the form Hess(u)LpC1uLp+C2ΔuLp, \left\Vert \mathrm{Hess}\left( u\right) \right\Vert _{L^p}\leq C_{1}\left\Vert u\right\Vert _{L^p}+C_{2}\left\Vert Δu\right\Vert _{L^p}, valid a priori for all smooth functions $…

2014-06-03abs ↗pdf ↗