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

181362542723 · Jun 202019922001200920172026
48 results for critical clearing time

Paper analyzes CCT sensitivity in constrained power systems, offering insights into system stability and parameter changes.

problem Identifying preventive control measures to avoid large generation losses during disturbances.
method Derived first-order CCT sensitivity for generic constrained power systems using trajectory sensitivity computation.
result Sensitivity of CCT to system parameters, providing insights into feasibility and stability.

Sequential processing biases asset allocation in artificial stock markets.

problem Systematic bias in asset allocation due to sequential processing of order books.
method Examined the impact of sequential versus parallel clearing mechanisms on multi-asset price dynamics.
result Sequential processing introduces a significant bias affecting the allocation of traders' capital.

Study of stock market dynamics using statistical physics, showing critical temperature and boosting effects.

problem Understanding price fluctuations and market clearing in stock markets.
method Statistical physics approach with agents modeled as spins, temperature parameter, and Monte Carlo simulations.
result Critical temperature TcT_c where market becomes disordered, and boosting effect depends on HH applied near TcT_c.

We study the optimal placement problem of a stock trader who wishes to clear his/her inventory by a predetermined time horizon t, by using a limit order or a market order. For a diffusive market, we characterize the optimal limit order placement policy and analyze its behavior under different market conditions. In part…

2017-08-14abs ↗pdf ↗

KineticSim: A lightweight, high-performance execution engine for real-time market simulators

problem Simulating financial markets at scale with multi-agent models
method Reusable parallel design pattern: persistent, state-carrying clearing for iterative multi-agent reductions
result Reduces per-step critical-path depth from Theta(L+A) to Theta(log L + ceil(A/L))

CLEAR calibrates both aleatoric and epistemic uncertainties for better predictive intervals.

problem Balanced uncertainty quantification for reliable predictive modeling.
method CLEAR uses two parameters, γ1 and γ2, to combine aleatoric and epistemic uncertainties.
result Clear achieves significant improvements in interval width and coverage.

KineticSim accelerates financial market simulations 3406x over CPU.

problem Simulating financial markets at scale with multi-agent models is bottlenecked by sequential processing and GPU kernel overhead.
method Formalized and implemented a reusable parallel design pattern for iterative multi-agent reductions in thread-block shared memory.
result Achieved a peak throughput of over 54.7 billion agent-events per second, delivering 3406x speedup over CPU.

Method reconstructs financial networks from aggregate data, revealing critical link density.

problem Reconstructing financial networks from aggregate data is challenging due to unreconstructability phases.
method Random graph generation with desired link density and replicated constraints.
result There is a critical link density below which networks become unreconstructable.

A new model calculates optimal clearing payments in dynamic financial networks.

problem Determining fair clearing payments in networks with potential defaults.
method Extends Eisenberg-Noe model to multiple time periods, solving linear programs for optimal payments.
result Proves the model satisfies the priority of debt claims requirement and finds unique optimal payments.

Single image dehazing is a critical stage in many modern-day autonomous vision applications. Early prior-based methods often involved a time-consuming minimization of a hand-crafted energy function. Recent learning-based approaches utilize the representational power of deep neural networks (DNNs) to learn the underlyin…

2018-12-06abs ↗pdf ↗

Blockchain markets with paid-priority trading can lead to biased prices and reduced liquidity.

problem Discrete clearing and paid-priority in blockchain markets lead to biased prices and reduced liquidity.
method Developed a model to evaluate the viability of blockchain markets under discrete clearing and paid-priority.
result Paid-priority ordering induces endogenous selection, leading to biased prices and reduced liquidity.

Paper finds efficient algorithms for computing fixed points in financial networks.

problem Computing fixed points in complex financial networks with potential defaults.
method Tarski's theorem and polynomial-time algorithms for minimal and maximal fixed points.
result Efficient algorithms for computing minimal and maximal fixed points in financial networks.

Study explores reinforcement learning in a complex game environment, analyzing rule inference and policy learning.

problem Learning optimal policies in environments with hidden rules.
method Investigated using the Game Of Hidden Rules (GOHR) environment, employing Feature-Centric and Object-Centric state representations with a Transformer-based A2C algorithm.
result Transformer-based A2C models outperform traditional methods in GOHR, demonstrating the effectiveness of representation strategies.

Deep learning solves complex PA mean field games with market-clearing conditions.

problem Optimizing Principal-Agent interactions in renewable energy markets with market-clearing conditions.
method Actor-critic approach, deep backward stochastic differential equations (BSDE), neural net approximation.
result Efficacy of the deep learning algorithm in solving complex PA mean field games.

Study on deep neural networks for reward modeling with pairwise comparison data.

problem Reward modeling with deep neural networks in non-parametric settings.
method Established a non-asymptotic regret bound for deep reward estimators, introduced a margin-type condition.
result Improved regret bound for deep reward estimators, highlighting the importance of clear human beliefs.

The call auction is a widely used trading mechanism, especially during the opening and closing periods of financial markets. In this paper, we study a standard call auction problem where orders are submitted according to Poisson processes, with random prices distributed according to a general distribution, and may be c…

2014-07-16abs ↗pdf ↗

We propose a model for the credit and liquidity risks faced by clearing members of Central Counterparty Clearing houses (CCPs). This model aims to capture the features of: gap risk; feedback between clearing member default, market volatility and margining requirements; the different risks faced by various types of mark…

2016-04-01abs ↗pdf ↗

Unified model for network risks, including bilateral and central clearing, with practical applications.

problem Managing risks in financial networks with multiple trading types.
method Developed a one-period XVA model with explicit formulas for various quantities.
result Illustrated practical uses for stress testing and portfolio optimization.

We propose a simple model of inter-bank borrowing and lending where the evolution of the log-monetary reserves of NN banks is described by a system of diffusion processes coupled through their drifts in such a way that stability of the system depends on the rate of inter-bank borrowing and lending. Systemic risk is ch…

2013-08-09abs ↗pdf ↗

The paper analyzes optimal timing for converting wealth into annuities in the presence of a mortality shock.

problem Optimal timing for converting retirement wealth into annuities under a mortality risk.
method Derives explicit closed-form solutions for value function and optimal stopping boundaries.
result The optimal strategy depends on the interplay between annuity attractiveness, investment returns, and bequest motives.

We introduce a dynamic model of the default waterfall of derivatives CCPs and propose a risk sensitive method for sizing the initial margin (IM), and the default fund (DF) and its allocation among clearing members. Using a Markovian structure model of joint credit migrations, our evaluation of DF takes into account the…

2018-03-06abs ↗pdf ↗

Paper introduces Cycles Protocol to integrate trade credit into market clearing.

problem Liquidity embedded in trade credit outside formal settlement infrastructures.
method Distributed, multilateral clearing mechanism based on double-entry accounting.
result Cycles Protocol maximizes balance sheet compression without redistributing counterparty risk.

AI-Trader benchmarks LLMs in live financial markets, revealing poor trading performance.

problem Challenges in real-time financial decision-making by autonomous agents.
method Fully automated, live evaluation benchmark with minimal human intervention.
result General intelligence does not translate to effective trading, highlighting limitations.

FCPCA fuzzy clusters high-dimensional time series data efficiently.

problem Ambiguous clustering of multivariate time series data with overlapping distributions.
method FCPCA based on common principal component analysis.
result FCPCA outperforms existing methods in fuzzy clustering of multivariate time series.

A new method for clearing liability networks using sheaves on directed hypergraphs.

problem Clearing in liability networks using a novel mathematical approach.
method Associate a liability sheaf on a directed hypergraph to a liability network, identifying clearing configurations as global sections of this sheaf.
result Clearing configurations are precisely the global sections of the sheaf, and the sheaf construction is functorial under change of coefficient category.

We consider an auction market in which market makers fill the order book during a given time period while some other investors send market orders. We define the clearing price of the auction as the price maximizing the exchanged volume at the clearing time according to the supply and demand of each market participants.…

2019-06-04abs ↗pdf ↗

Much work has been done in understanding human creativity and defining measures to evaluate creativity. This is necessary mainly for the reason of having an objective and automatic way of quantifying creative artifacts. In this work, we propose a regression-based learning framework which takes into account quantitative…

2017-07-18abs ↗pdf ↗

The problem of market clearing is to set a price for an item such that quantity demanded equals quantity supplied. In this work, we cast the problem of predicting clearing prices into a learning framework and use the resulting models to perform revenue optimization in auctions and markets with contextual information. T…

2019-06-04abs ↗pdf ↗

The paper examines clearing payments in financial networks to prevent cascaded defaults.

problem Cascaded defaults in financial networks under the proportionality rule.
method Analysis of clearing model under pro-rated payments, derivation of necessary and sufficient conditions for clearing payments, convex optimization problems for computation.
result Clearing payments can be computed by solving convex optimization problems, reducing overall system loss by lifting the proportionality rule.

Word meaning changes over time, depending on linguistic and extra-linguistic factors. Associating a word's correct meaning in its historical context is a central challenge in diachronic research, and is relevant to a range of NLP tasks, including information retrieval and semantic search in historical texts. Bayesian m…

2019-03-13abs ↗pdf ↗

Study prenatal PM2.5 exposure and 4th grade reading scores, identifying critical windows of susceptibility.

problem Understanding the impact of prenatal PM2.5 exposure on educational outcomes.
method Developed a locally adaptive Bayesian regression model with B-spline basis expansion and dynamic shrinkage priors.
result Prenatal PM2.5 exposure during early and late pregnancy is most adverse for 4th grade reading scores.

Paper proposes a decentralized payment clearing system using blockchain and optimal bidding strategies.

problem Default contagion in a network of smart contracts cleared through blockchain.
method Constructs a decentralized clearing mechanism using blockchain and optimal bidding strategies.
result Proves existence and uniqueness of equilibrium clearing condition for terminal net worths.

Pari-mutuel markets are trading platforms through which the common market maker simultaneously clears multiple contingent claims markets. This market has several distinctive properties that began attracting the attention of the financial industry in the 2000s. For example, the platform aggregates liquidity from the ind…

2015-09-23abs ↗pdf ↗

Novel method improves load estimation in power grids using anomaly and change point detection.

problem Improving load estimation in power grid systems.
method Combining unsupervised anomaly and change point detection methods for automatic filtering.
result Automatic load estimation is accurate with 90% estimates within a 10% error margin.

Study confirms financial bubbles' common patterns in isolated markets.

problem Testing universal dynamics of financial bubbles in isolated markets.
method Log-Periodic Power Law Singularity (LPPLS) model analysis of two major bubble episodes.
result Tehran Stock Exchange shows clear LPPLS hallmarks, supporting bubble universality.

This paper develops an XVA (costs) analysis of centrally cleared trading, parallel to the one that has been developed in the last years for bilateral transactions. We introduce a dynamic framework that incorporates the sequence of cash-flows involved in the waterfall of resources of a clearing house. The total cost of …

2015-06-29abs ↗pdf ↗